Lecture 8 - CPU Scheduling
#
Scope
#
- Basic concepts - CPU-I/O burst cycles, statistics of burst cycles and scheduling.
- Short-term scheduler, preemptive vs non-preemptive scheduling, dispatch latency.
- Scheduling criteria.
- Basic scheduling algorithms: FCFS, SJF/SRTF, priority, round-robin (RR).
- Exponential average for next burst cycle time prediction.
- Gantt Diagram. Average and maximum waiting times. Turn-around time.
- Multilevel queues. Multilevel queues with feedback.
- Basics of Linux and MS Windows scheduling.
Reference
#
- Textbook: chapter “Process scheduling” - nr 5 in 8th and 10th ed., nr 6 in 9th ed.
- Lecture presentation
- Lecture code samples
- Old Slides: CPU_scheduling.pdf