First-Come-First-Served Scheduler
- Tags
- comp-arch
Is a scheduling algorithm where processes are schedule in the order of arrival.
In this case the ready-queue is a simple FIFO stack.
| Advantages | Disadvantages |
|---|---|
| Simple algorithm and implementation | The convoy effect |
| Context switches infrequent for long running processes | |
| No starvation if all processes are guaranteed to terminate |