Scribd
Upload
11 views

Lesson 4 SJF SJRT CPU Scheduling 2

Uploaded by

spnpart1
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
11 views

Lesson 4 SJF SJRT CPU Scheduling 2

Uploaded by

spnpart1
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 12

Taguig City University

COLLEGE OF INFORMATION AND COMMUNICATION TECHNOLOGY

OS101 – OPERATING SYSTEM

LESSON 4: SHORTEST JOB FIRST (SJF) and SHORTEST


REAMINING TIME FIRST (SRTF)CPU SCHEDULING
Taguig City University
COLLEGE OF INFORMATION AND COMMUNICATION TECHNOLOGY

OS101 – OPERATING SYSTEM

LESSON 4: Shortest Job First CPU Scheduling

❑Shortest-Job-First (SJF) Scheduling Algorithm


• This algorithm is very much in particular with the length of CPU burst
a particular process maintains.
• When the CPU is available, it is assigned to the process that has the
smallest burst.
• If two processes have the same length of CPU burst, FCFS scheduling
is used to break the tie by considering which job arrived first.
Taguig City University
COLLEGE OF INFORMATION AND COMMUNICATION TECHNOLOGY

OS101 – OPERATING SYSTEM

LESSON 4: Shortest Job First CPU Scheduling

❑Shortest-Job-First (SJF) Scheduling Algorithm


Example 1:
Consider the following set of processes that arrive at time 0, with the
length of the CPU burst given in milliseconds:
Process Burst CT/ET TT WT
Time
P1 6 9 9 3
P2 8 24 24 16
P3 7 16 16 9
P4 3 3 3 0
Taguig City University
COLLEGE OF INFORMATION AND COMMUNICATION TECHNOLOGY

OS101 – OPERATING SYSTEM

LESSON 4: Shortest Job First CPU Scheduling


❑Shortest-Job-First (SJF) Scheduling Algorithm
• Using SJF, the system would schedule these processes according to
the following Gantt chart:

P4 P1 P3 P2
0 3 9 16 24

Average waiting Time = ( 0 + 3 + 9 + 16) / 4 = 7.00 msec


Taguig City University
COLLEGE OF INFORMATION AND COMMUNICATION TECHNOLOGY

OS101 – OPERATING SYSTEM

LESSON 4: Shortest Job First CPU Scheduling

❑Shortest-Job-First (SJF) Scheduling Algorithm


• Example 1 - Solution:
• The turnaround time for each process would be:
TT for P1 = 9 – 0 = 9
TT for P2 = 24 – 0 = 24
TT for P3 = 16 – 0 = 16
TT for P4 = 3 – 0 = 3
Average turnaround time = ( 9 + 24 + 16 + 3 ) / 4
= 13.00 ms
Taguig City University
COLLEGE OF INFORMATION AND COMMUNICATION TECHNOLOGY

OS101 – OPERATING SYSTEM

LESSON 4: Shortest Job First CPU Scheduling

❑Shortest-Job-First (SJF) Scheduling Algorithm


• Example 1 - Solution:
• The waiting time for each process is:
WT for P1 = 3 – 0 = 3
WT for P2 = 16 – 0 = 16
WT for P3 = 9 – 0 = 9
WT for P4 = 3 – 3 = 0
Average waiting time = ( 3 + 16 + 9 + 0 ) / 4
= 7.00 ms
Taguig City University
COLLEGE OF INFORMATION AND COMMUNICATION TECHNOLOGY

OS101 – OPERATING SYSTEM

LESSON 4: Shortest Job First CPU Scheduling


❑Shortest Job First (SJF)) Scheduling Algorithm
Example 2: Solve using SJF Algorithm.
Job AT BT ET/CT TT WT

J1 3 4
J2 5 9
J3 8 4
J4 0 7
J5 12 6
Taguig City University
COLLEGE OF INFORMATION AND COMMUNICATION TECHNOLOGY

OS101 – OPERATING SYSTEM

LESSON 4: Shortest Job First CPU Scheduling


❑Shortest Job First (SJF)) Scheduling Algorithm
Example 3: Solve using SJF Algorithm with Idle
Job AT BT ET/CT TT WT

J1 10 5
J2 8 4
J3 12 4
J4 3 3
J5 15 5
Taguig City University
COLLEGE OF INFORMATION AND COMMUNICATION TECHNOLOGY

OS101 – OPERATING SYSTEM

LESSON 4: Shortest Remaining Time First CPU Scheduling

❑Shortest Remaining Time First (SRTF) Algorithm


• The SJF algorithm has a preemptive version commonly referred to as
shortest-remaining-time-first.
• A new process arriving may have a shortest next CPU burst than what
is left of the currently executing process.
• A preemptive SJF or SRTF algorithm will preempt the currently
executing process.
Taguig City University
COLLEGE OF INFORMATION AND COMMUNICATION TECHNOLOGY

OS101 – OPERATING SYSTEM

LESSON 4: Shortest Remaining Time First CPU Scheduling

❑Shortest Remaining Time First (SRTF) Scheduling Algorithm


Example 1:

Process Arrival Time Burst Time


P1 0 8
P2 1 4
P3 2 1
P4 3 5
Taguig City University
COLLEGE OF INFORMATION AND COMMUNICATION TECHNOLOGY

OS101 – OPERATING SYSTEM

LESSON 4: Shortest Remaining Time First CPU Scheduling

❑Shortest Remaining Time First (SRTF) Algorithm


Example 1:
Process Arrival Time Burst Time
P1 3 4
P2 5 9
P3 8 4
P4 0 7
P5 12 6
Taguig City University
COLLEGE OF INFORMATION AND COMMUNICATION TECHNOLOGY

OS101 – OPERATING SYSTEM

LESSON 4: Shortest Remaining Time First CPU Scheduling

❑Shortest Remaining Time First (SRTF) Algorithm with Idle


Example 2:
Process Arrival Time Burst Time
P1 10 5
P2 8 4
P3 12 4
P4 3 3
P5 15 5

You might also like