Chapter 5 Scheduling
CPU burst, I/O burst, CPU-I/O Burst Cycle
Short-term scheduler
Preemptive vs. non-preemptive
Criteria for evaluating scheduling algorithms
Countermeasures
Gantt charts
Be able to apply the following algorithms to sample data & know issues with each:
First-come, first-served
Shortest-job-first - (for class, assume non-preemptive) Provably optimal (min avg wait time)
Shortest-remaing-time-first - preemptive SJF
Priority scheduling - indefinite blocking or starvation, aging
Round-robin - quantum selection
Multilevel queue scheduling & Multilevel feedback-queue scheduling
Multiple-processor scheduling: asymmetric vs symmetric multiprocessing (SMP)
Processor affinity & load balancing
Algorithm Evaluation
Deterministic Modeling
Queuing Models
Simulations
Little's formula