First-come, First-Served (cont.)

• Another example:

  Same processes, different order.
  
  Process: p1 p2 p3 p4
  Burst time: 4 3 6 10

• Schedule:

23

P1

4

7

13

P2

P3

P4

Question: What is the best arrangement for these
processes (minimizing average waiting time?)

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

Previous slide

Next slide

Back to first slide

View graphic version