Preemptive Scheduling | Non-Preemptive Scheduling |
Processor can be preempted to execute a different process in the middle of execution of any current process. | Once Processor starts to execute a process it must finish it before executing the other. It cannot be paused in middle. |
CPU utilization is more compared to Non-Preemptive Scheduling. | CPU utilization is less compared to Preemptive Scheduling. |
Waiting time and Response time is less. | Waiting time and Response time is more. |
The preemptive scheduling is prioritized. The highest priority process should always be the process that is currently utilized. | When a process enters the state of running, the state of that process is not deleted from the scheduler until it finishes its service time. |
If a high priority process frequently arrives in the ready queue, low priority process may starve. | If a process with long burst time is running CPU, then another process with less CPU burst time may starve. |
Preemptive scheduling is flexible. | Non-preemptive scheduling is rigid. |
Friday, 22 June 2018
Preemptive and Non-Preemptive Scheduling
Subscribe to:
Post Comments (Atom)
No comments:
Post a Comment