CPU Scheduling Algorithms and Message Passing Mechanisms
Classified in Computers
Written on in
with a size of 3.21 KB
Guaranteed Scheduling
Guaranteed scheduling algorithms aim to ensure that each process receives its fair share of CPU time. These systems penalize processes that have consumed a large amount of CPU time, though this penalty fades over time. This approach is utilized in most versions of UNIX, Windows NT, and subsequent Linux distributions.
BSD Scheduler
Unlike legacy UNIX schedulers, the BSD scheduler accounts for system load by monitoring the length of the ready queue, known as the "Load average." Additionally, it forgives old CPU usage more slowly when the system load is high.
Linux 2.4 Scheduler
Epoch-Based Allocation
The Linux 2.4 scheduler partitions CPU time into epochs. At the start of each epoch, every process is assigned a time quantum, which... Continue reading "CPU Scheduling Algorithms and Message Passing Mechanisms" »