First-Come, First-Served: Start Times, Idle Gaps, a Timeline and the Convoy Effect
This lesson is part of the course
In this lesson
You schedule five jobs in arrival order, find start and completion times including an idle gap, calculate each job's waiting time and build a timeline that shows which job runs at every time unit.
Buy the course once for $9.99 to unlock every lesson and lab, the final exam and the certificate – lifetime access, no subscription.
Lessons in this course
- Processes & Metrics: Arrival, Burst, Turnaround, Waiting and CPU Utilisation Locked
- First-Come, First-Served: Start Times, Idle Gaps, a Timeline and the Convoy Effect Locked
- Shortest Job First: Ranking Bursts, Breaking Ties and Beating FCFS on Waiting Time Locked
- Priority Scheduling: Start Times with SUMIF, Starvation and a Simple Ageing Rule Locked
- Round Robin: Time Quantum, Remaining Burst per Round, Context Switches and Quantum Size Locked
- Page Replacement with FIFO: Reference Strings, Frames, Hits, Faults and the Fault Rate Locked
- LRU and Optimal Replacement: Last Use, Next Use, Victims and Belady's Anomaly Locked
- Disk Scheduling: FCFS, Shortest Seek First and the Elevator Order with Total Head Movement Locked