August 2024
Beginner
188 pages
4h 25m
English
Pre-emptive scheduling is one in which a process is allocated to the CPU for the limited amount of time before being interrupted.
The advantage is scheduling is more robust, all running processes make use of the CPU equally. However low priority processes are susceptible to starvation and long wait times.
Examples of pre-emptive scheduling algorithms include round robin scheduling and priority based scheduling.
Read now
Unlock full access