First-come, First-Served (FCFS)

• Schedule the processes according to their arrival order (to the ready queue)

  • Also called FIFO (first in, first out).

• Example:

  Process: p1 p2 p3 p4
  
  Burst time: 10 4 6 3

• Schedule:

10

14

20

23

P1

P2

P3

P4

Waiting time: 0 10 14 20
Average waiting time: 11 (assuming they all came almost together)

Previous slide

Next slide

Back to first slide

View graphic version