Scribd
Upload
6 views17 pages

CPUSch

Chapter 4 discusses CPU scheduling, which is essential for multiprogrammed operating systems to enhance productivity by allocating CPU time among processes. It covers various scheduling algorithms including First-Come, First-Served, Shortest-Job-First, Priority Scheduling, and Round Robin, each with its own advantages and disadvantages. Key metrics for evaluating scheduling performance include CPU utilization, throughput, turnaround time, waiting time, and response time.

Uploaded by

Mulugeta Tesfaye Alula
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
6 views17 pages

CPUSch

Chapter 4 discusses CPU scheduling, which is essential for multiprogrammed operating systems to enhance productivity by allocating CPU time among processes. It covers various scheduling algorithms including First-Come, First-Served, Shortest-Job-First, Priority Scheduling, and Round Robin, each with its own advantages and disadvantages. Key metrics for evaluating scheduling performance include CPU utilization, throughput, turnaround time, waiting time, and response time.

Uploaded by

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

Chapter 4: CPU

Scheduling
Introduction

• CPU scheduling is the basis of multiprogrammed


OS. By switching the CPU among processes, the OS
can make the computer more productive.
CPU Scheduler

• Selects from among the processes in memory that are ready to


execute, and allocates the CPU to one of them.
• This is by short term scheduler.
• How do you think this scheduling be done?
• 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
• Scheduling under 1 and 4 is nonpreemptive (no choice since new
process)
• The process keeps the CPU until it finishes.
• All other scheduling is preemptive
Dispatcher
• Dispatcher module gives control of the CPU to the process
selected by the short-term 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
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, not output (for time-sharing environment)
Optimization Criteria
• Max CPU utilization
• Max throughput
• Min turnaround time
• Min waiting time
• Min response time
First-Come, First-Served (FCFS) Scheduling

Process Burst Time


P1 24
P2 3
P3 3
• Suppose that the processes arrive in the order: P1 , P2 , P3
The Gantt Chart for the schedule is:
P1 P2 P3

0 24 27 30
• Waiting time for P1 = 0; P2 = 24; P3 = 27
• Average waiting time: (0 + 24 + 27)/3 = 17
FCFS Scheduling (Cont.)

Suppose that the processes arrive in the order


P2 , P3 , P1
• The Gantt chart
P2 for thePschedule
3
is: P1

0 3 6 30

• Waiting time for P1 = 6; P2 = 0; P3 = 3


• Average waiting time: (6 + 0 + 3)/3 = 3
• Much better than previous case
• Convoy effect short process behind long process
Shortest-Job-First (SJF) Scheduling

• Associate with each process the length of its next CPU burst. Use
these lengths to schedule the process with the shortest time
• Two schemes:
• nonpreemptive – once CPU given to the process it cannot be preempted
until completes its CPU burst
• preemptive – if a new process arrives with CPU burst length less than
remaining time of current executing process, preempt. This scheme is know
as the
Shortest-Remaining-Time-First (SRTF)
• SJF is optimal – gives minimum average waiting time for a given set
of processes
Example of Non-Preemptive SJF

Process Arrival Time Burst Time


P1 0.0 7
P2 2.0 4
P3 4.0 1
P4 5.0 4
• SJF (non-preemptive) P1 P3 P2 P4

0 3 7 8 12 16

• Average waiting time = (0 + 6 + 3 + 7)/4 = 4


Example of Preemptive SJF

Process Arrival Time Burst Time


P1 0.0 7
P2 2.0 4
P3 4.0 1
P4 5.0 4
• SJF (preemptive) P1 P2 P3 P2 P4 P1

0 2 4 5 7 11 16

• Average waiting time = (9 + 1 + 0 +2)/4 = 3


Priority Scheduling

• A priority number (integer) is associated with each process


• The CPU is allocated to the process with the highest priority (smallest
integer  highest priority)
• Preemptive
• nonpreemptive
• SJF is a priority scheduling where priority is the predicted next CPU
burst time (a special case of general priority algorithm)
• Problem  Starvation – low priority processes may never execute
• Solution  Aging – as time progresses increase the priority of the
process
Cont…

• The priority is defined either internally(memory


req., time limit, ratio of av. I/O to CPU burst time)
or externally(importance of process, department
sponsoring the work, others like political factors).
Cont…
Round Robin (RR)
• Similar to FCFS except for the preemption.
• Each process gets a small unit of CPU time
(time quantum), usually 10-100 milliseconds.
After this time has elapsed, the process is
preempted and added to the end of the ready
queue.
• CPU burst< time quantum -> the process
releases by itself or interrupt occur.
• Avg. waiting often longer
Cont…

• If there are n processes in the ready queue and the


time quantum is q, then each process gets 1/n of
the CPU time in chunks of at most q time units at
once.
• No process waits more than (n-1)q time units.
• If time quantum extremely large same as FCFS and
if extremely small processor sharing(in theory)
• 80% cpu burst should be shorter than time
quantum.
Example of RR with Time Quantum =
20

Process Burst Time


P1 53
P2 17
P3 68
P4 24
• The Gantt chart is:

P1 P2 P3 P4 P1 P3 P4 P1 P3 P3

0 20 37 57 77 97 117 121 134 154 162

• Typically, higher average turnaround than SJF, but better


response

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy