Operating Systems that implement a simple round robin scheduler are inherently inefficient. In this environment tasks that have consumed or consume more CPU than their peers get equal scheduling priority on the CPU. By implementing a priority queue on the scheduler you can easily improve performance of processes that require short bursts of CPU while continuing to service the processes with higher usage demands. The example used is based on the Minix operating system. However, this scheduling algorithm can be applied for any operating system that implements a round robin scheduler.
展开▼
