Multiple-Processor Scheduling

CPU scheduling more complex when multiple CPUs are available.

Homogeneous processors within a multiprocessor.

Load sharing

Asymmetric multiprocessing – only one processor accesses the system data structures, alleviating the need for data sharing.

Real-Time Scheduling

Hard real-time systems – required to complete a critical task within a guaranteed amount of time.

Soft real-time computing – requires that critical processes receive priority over less fortunate ones.

Algorithm Evaluation

Deterministic modeling – takes a particular predetermined workload and defines the performance

of each algorithm for that workload.

Queuing models

Implementation

Evaluation of CPU Schedulers by Simulation