Non-preemptive Shortest Job First

• Example:

  Process: p1 p2 p3 p4
  
  Arrival time: 0 2 4 5
  Burst time: 7 4 1 4

• Schedule:

16

P1

8

7

12

P2

P3

P4

Waiting time: 0 6 3 7
Average waiting time: 4.

Previous slide

Next slide

Back to first slide

View graphic version