Scheduling Algorithms
First Come First Served (FCFS)
- Scheduler selects the process at the head of the ready queue; typically non-preemptive
- Example: 3 processes arrive at the ready queue in the following order:
P1 ( CPU burst = 24 ms)
P2 ( CPU burst = 3 ms)
P3 ( CPU burst = 3 ms)