August 2024
Beginner
188 pages
4h 25m
English
Non pre-emptive scheduling is one in which a process holds the CPU until it is terminated or reaches a wait state and cannot be interrupted.
The advantage is, this type of algorithm is simpler and easier to implement. The problem is short processes have to wait for the long process at the front to finish, making this algorithm less efficient.
Examples of non pre-emptive scheduling algorithms include first come first served scheduling.
Read now
Unlock full access