Scribd
Upload
7 views12 pages

ch5 Part1

This document outlines key concepts in CPU scheduling. It discusses the CPU-I/O burst cycle where processes alternate between CPU and I/O usage. It also describes the role of the CPU scheduler in selecting processes from ready queues and dispatching them, as well as important criteria for evaluating scheduling algorithms like CPU utilization, throughput, turnaround time and waiting time. Finally, it previews different scheduling algorithms that will be covered.

Uploaded by

Kaushal Viraj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
7 views12 pages

ch5 Part1

This document outlines key concepts in CPU scheduling. It discusses the CPU-I/O burst cycle where processes alternate between CPU and I/O usage. It also describes the role of the CPU scheduler in selecting processes from ready queues and dispatching them, as well as important criteria for evaluating scheduling algorithms like CPU utilization, throughput, turnaround time and waiting time. Finally, it previews different scheduling algorithms that will be covered.

Uploaded by

Kaushal Viraj
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

Chapter 5: CPU Scheduling

Operating System Concepts – 10th Edition Silberschatz, Galvin and Gagne ©2018
Outline
§ Basic Concepts
§ Scheduling Criteria
§ Scheduling Algorithms
§ Thread Scheduling
§ Multi-Processor Scheduling
§ Real-Time CPU Scheduling
§ Operating Systems Examples
§ Algorithm Evaluation

Operating System Concepts – 10th Edition 5.3 Silberschatz, Galvin and Gagne ©2018
Objectives

§ Describe various CPU scheduling algorithms


§ Assess CPU scheduling algorithms based on scheduling criteria
§ Explain the issues related to multiprocessor and multicore scheduling
§ Describe various real-time scheduling algorithms
§ Describe the scheduling algorithms used in the Windows, Linux, and
Solaris operating systems
§ Apply modeling and simulations to evaluate CPU scheduling
algorithms

Operating System Concepts – 10th Edition 5.4 Silberschatz, Galvin and Gagne ©2018
Basic Concepts

§ Maximum CPU utilization


obtained with multiprogramming
§ CPU–I/O Burst Cycle – Process
execution consists of a cycle of
CPU execution and I/O wait
§ CPU burst followed by I/O burst
§ CPU burst distribution is of main
concern

Operating System Concepts – 10th Edition 5.5 Silberschatz, Galvin and Gagne ©2018
Histogram of CPU-burst Times

Large number of short bursts

Small number of longer bursts

Operating System Concepts – 10th Edition 5.6 Silberschatz, Galvin and Gagne ©2018
CPU Scheduler
§ The CPU scheduler selects from among the processes in ready
queue, and allocates a CPU core to one of them
• Queue may be ordered in various ways
§ CPU scheduling decisions may take place when a process:
1. Switches from running to waiting state
2. Switches from running to ready state
3. Switches from waiting to ready
4. Terminates
§ For situations 1 and 4, there is no choice in terms of scheduling. A
new process (if one exists in the ready queue) must be selected
for execution.
§ For situations 2 and 3, however, there is a choice.

Operating System Concepts – 10th Edition 5.7 Silberschatz, Galvin and Gagne ©2018
Preemptive and Nonpreemptive Scheduling

§ When scheduling takes place only under circumstances 1 and


4, the scheduling scheme is nonpreemptive.
§ Otherwise, it is preemptive.
§ Under Nonpreemptive scheduling, once the CPU has been
allocated to a process, the process keeps the CPU until it
releases it either by terminating or by switching to the waiting
state.
§ Virtually all modern operating systems including Windows,
MacOS, Linux, and UNIX use preemptive scheduling
algorithms.

Operating System Concepts – 10th Edition 5.8 Silberschatz, Galvin and Gagne ©2018
Preemptive Scheduling and Race Conditions

§ Preemptive scheduling can result in race conditions


when data are shared among several processes.
§ Consider the case of two processes that share data.
While one process is updating the data, it is preempted
so that the second process can run. The second process
then tries to read the data, which are in an inconsistent
state.
§ This issue will be explored in detail in Chapter 6.

Operating System Concepts – 10th Edition 5.9 Silberschatz, Galvin and Gagne ©2018
Dispatcher
§ Dispatcher module gives control of the
CPU to the process selected by the CPU
scheduler; this involves:
• Switching context
• Switching to user mode
• Jumping to the proper location in the
user program to restart that program
§ Dispatch latency – time it takes for the
dispatcher to stop one process and start
another running

Operating System Concepts – 10th Edition 5.10 Silberschatz, Galvin and Gagne ©2018
Scheduling Criteria

§ CPU utilization – keep the CPU as busy as possible


§ Throughput – # of processes that complete their execution
per time unit
§ Turnaround time – amount of time to execute a particular
process
§ Waiting time – amount of time a process has been waiting
in the ready queue
§ Response time – amount of time it takes from when a
request was submitted until the first response is produced.

Operating System Concepts – 10th Edition 5.11 Silberschatz, Galvin and Gagne ©2018
Scheduling Algorithm Optimization Criteria

§ Max CPU utilization


§ Max throughput
§ Min turnaround time
§ Min waiting time
§ Min response time

Operating System Concepts – 10th Edition 5.12 Silberschatz, Galvin and Gagne ©2018
NEXT :
SCHEDULING ALGORITHMS

Operating System Concepts – 10th Edition 5.13 Silberschatz, Galvin and Gagne ©2018

You might also like