CPU SCHEDULING

Dr. M. Premalatha
Scheduling
 Pre-emptive
 Non Pre-emptive
Scheduling Algorithms
 First In First Out Scheduling (FIFO) – NP
 Shortest Job First Scheduling (SJF) – NP or P
 Priority Scheduling – NP or P
 Round Robin Scheduling (RR) - P
FIFO - Non Pre-emptive
TAT WT
Process BT CT
[CT-AT] [TAT-BT]
P1 2
P2 1
P3 4
P4 8
P5 4
P6 6

AWT
ATAT
SJF - Non Pre-emptive
TAT WT
Process BT CT
[CT-AT] [TAT-BT]
P1 2
P2 1
P3 4
P4 8
P5 4
P6 6

AWT
ATAT
FIFO – Non Pre-emptive
TAT WT
Process AT BT CT
[CT-AT] [TAT-BT]
P1 4 2
P2 0 1
P3 1 4
P4 11 8
P5 7 4
P6 9 6

AWT
ATAT
SJF – Non Pre-emptive
TAT WT
Process AT BT CT
[CT-AT] [TAT-BT]
P1 4 2
P2 0 1
P3 1 4
P4 11 8
P5 7 4
P6 9 6

AWT
ATAT
Exercise
TAT WT
Process AT BT CT
[CT-AT] [TAT-BT]
P3 0 7
P2 1 2
P1 5 3
P4 6 1

AWT
ATAT