answersLogoWhite

0

in pre emptive scheduling. a limited time period is fixed for every process in the CPU. no matter whether the process is completed or not ... the resource assinged to it will be taken back back abd will be given to the next process in the queue.

while in non preemptive the resorces are with a process untill it finishes completely others wait for their turn till then. this kind of scheduling has a high probability of going into a deadlock.

User Avatar

Wiki User

12y ago

What else can I help you with?

Related Questions

Is windows xp preemptive or non preemptive?

It uses pre-emptive scheduling. It has what is called a pre-emptive multi-tasking kernel.


Is it pre-emptive or pre emptive or preemptive?

preemptive or pre-emptive.


What scheduling algo is used for real time OS?

Cooperative schedulingPreemptive scheduling Rate-monotonic schedulingRound-robin schedulingFixed priority pre-emptive scheduling, an implementation of preemptive time slicingFixed-Priority Scheduling with Deferred PreemptionFixed-Priority Non-preemptive SchedulingCritical section preemptive schedulingStatic time schedulingEarliest Deadline First approachStochastic digraphs with multi-threaded graph traversal


What is pre-emptive multitasking?

In preemptive multitasking scheduling processes , scheduler can interrupt one running process and and allocate CUP to another process without letting the complete the task of first process. Window 95 introduced preemptive scheduling and Mac also uses this scheduling process. Bharat Rawal


What is preemptive reforms?

What is pre-emptive groups


Is the Linux kernel pre-emptive or non-premptive?

It is preemptive, as of the 2.6 series. 2.4 and prior were non-preemptive.


What do you mean by non-preemptive shortest job first scheduling explain with an example?

Non pre-emptive means once CPU starts executing one process, it will not be taken out of the CPU until it is terminated or it has to wait for some event. In preemptive SJF scheduling, current running process is moved to the ready queue when a new process with a shorter CPU burst joins the ready queue.


Which is one of pre-emptive scheduling algorithm?

Priority based algorithm


What is Preemptive tasking?

Pre-emptive tasking is a process whereby a task is temporarily interrupted in a computer system. This will determine how long it takes for a task to be completed.


When was Pre-Emptive False Rapture created?

Pre-Emptive False Rapture was created on 2007-07-23.


Definition of preemptive scheduling?

Pre-emptive scheduling refers to schemes such as SRTF (Shortest remaining time first), In which a process can be "pre-empted" (having the CPU time taken off it) in the middle of a burst. For example under SRTF: Process | Arrival Time(nanoseconds) | Burst Time(nanoseconds) P1 0 30 P2 10 5 For the first 10ns P1 will be running, but at 10s, P2 arrives, because it only has 5 nanoseconds of CPU time remaining till the completion of the burst as opposed to 20 for P1, P1 will be pre-empted, and P2 will run instead. P1 will then start running again at 15ns. |< (P1 is pre-empted) | P1 | P2 | P1 | 0ns 10ns 15ns


What is the Go-it-Alone foreign policy?

Pr-emptive