Disk Scheduling: FCFS, Shortest Seek First and the Elevator Order with Total Head Movement
This lesson is part of the course
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 Pro
- First-Come, First-Served: Start Times, Idle Gaps, a Timeline and the Convoy Effect Pro
- Shortest Job First: Ranking Bursts, Breaking Ties and Beating FCFS on Waiting Time Pro
- Priority Scheduling: Start Times with SUMIF, Starvation and a Simple Ageing Rule Pro
- Round Robin: Time Quantum, Remaining Burst per Round, Context Switches and Quantum Size Pro
- Page Replacement with FIFO: Reference Strings, Frames, Hits, Faults and the Fault Rate Pro
- LRU and Optimal Replacement: Last Use, Next Use, Victims and Belady's Anomaly Pro
- Disk Scheduling: FCFS, Shortest Seek First and the Elevator Order with Total Head Movement Pro