0

2.4kviews

Compare preemptive and non preemptive scheduling

written 6.9 years ago by devikaraniroy • 640

•   modified 6.7 years ago

Subject: Operating System

Topic: PROCESS MANAGEMENT

Difficulty: Medium

operating systems

ADD COMMENT FOLLOW SHARE EDIT

1 Answer

0

18views

written 6.7 years ago by devikaraniroy • 640

Sr,No	Pre-emptive Scheduling	Non Pre-emptive Scheduling
1	A scheduling discipline is preemptive if, once a process has been given the CPU can take away.	A scheduling discipline is non-preemptive if, once a process has been given the CPU, the CPU cannot be taken away from that process.
2	Preemptive,algorithms are driven by the notion of prioritized computation. The process, with the highest priority should always be the one currently using the,processor. If a process is currently using the processor and a new process,with a higher priority enters, the ready list, the process on the processor, should be removed and returned to the ready list until it is once again the,highest-priority process in the system	Non-preemptive algorithms are designed so that once a process enters the running state (is allowed a process),it is not removed from the processor until it has completed its service time
3	Preemptive,system provide for more predictable response times because a high-priority,event is served immediately.	A non-preemptive system depends on all tasks being good citize by voluntarily giving up the processor to be sure all tasks get a chance.
4	In preemptive case, systems are subject to resource conflict problems that must be carefully considered.	In non-preemptive case there is no guarantee how long it will be before the currently running task gives up the process

ADD COMMENT SHARE EDIT