answersLogoWhite

0


Best Answer

Preemptive scheduler reruns scheduling decision when process becomes ready. If the new process has priority over running process, the CPU preempts the running process and executes the new process. Non-preemptive scheduler only does scheduling decision when running process voluntarily gives up CPU. In effect, it allows every running process to finish its CPU burst.

User Avatar

Wiki User

11y ago
This answer is:
User Avatar

Add your answer:

Earn +20 pts
Q: What is a preemptive and non preemptive algorithm and explain with example?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Performing Arts

What is the Limitations of implementing non-preemptive SJF algorithm?

i like moldy chess. cheese....shests


Does Windows 7 use preemptive scheduling or non-preemptive?

well sometime it does its just with the syames your useing.


What is the difference between preemptive and non preemptive scheduling?

1.) in preemptive scheduling we prempt the currently executing process, in non preemptive scheduling we allow the current process to finish its CPU burst time... 2.) in preemptive scheduling the process is forcibly sent to waiting state when a process with higher priority comes to CPU, in non preeemptive scheduling the process at running state can not be forced to leave the CPU until it completes........


Difference between preemptive and non preemptive?

if block Ki of size Ni is to be transferred to memory M1 & the blocks occupying the space in M1 can't be preempted by block Ki then it is necessaray to find or create a space of Ni words inM1 . this process is called non preemptive allocation....non preemptive allocation can't make efficient use of memory allocation.whenever preemptive allocation is used for efficient use of the available memory space and rellocation can be done.


What is the main difference between a preemptive scheduler and a non-preemptive scheduler?

Non-preemptive scheduler gives a process control of computer until it gives it up. Preemptive scheduler ensures that all processes are given equal(or different) priority, so they run only for a short amount of time, before control is given to another process. Which means that preemptive system is capable of running many processes 'at once', without crashing when one process refuses to give up CPU control If a bug like infinite loop, or a process refusing to give up control(a virus for example) is encountered, only thing left to do is to reset the system.

Related questions

What is the Limitations of implementing non-preemptive SJF algorithm?

i like moldy chess. cheese....shests


How do you create a non preemptive process?

There is no such concept of a "Preemptive Process"


Is windows xp preemptive or non preemptive?

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


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.


Difference between preemptive and non preemptive system.with example?

Preemptive scheduling allows a process to be interrupted in the midst of its execution, taking the CPU away and allocating it to another process.Non-preemptive scheduling ensures that a process relinquishes control of the CPU only when it finishes with its current CPU burst.


What is Dispatch latency?

The time between when a thread is scheduled and when it begins to execute. Theoretically, in a preemptive OS the dispatch latency for a high-priority thread should be very low. However, in practice preemptive OSs are non-preemptive at times; for example, while running an interrupt handler. The duration of the longest possible non-preemptive interval is said to be the worst-case dispatch latency of an OS.


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.


What are non preemptive scheduling algorithms?

Strictly speaking, nonpreemptive scheduling is when the scheduler does not stop the process from running in order to switch it with a different process, but instead, it lets the process to complete and then schedules a different process depending on the a scheduling algorithm is uses.


Does Windows 7 use preemptive scheduling or non-preemptive?

well sometime it does its just with the syames your useing.


What is the difference between preemptive and non preemptive scheduling?

1.) in preemptive scheduling we prempt the currently executing process, in non preemptive scheduling we allow the current process to finish its CPU burst time... 2.) in preemptive scheduling the process is forcibly sent to waiting state when a process with higher priority comes to CPU, in non preeemptive scheduling the process at running state can not be forced to leave the CPU until it completes........


What is latence?

The time between when a thread is scheduled and when it begins to execute. Theoretically, in a preemptive OS the dispatch latency for a high-priority thread should be very low. However, in practice preemptive OSs are non-preemptive at times; for example, while running an interrupt handler. The duration of the longest possible non-preemptive interval is said to be the worst-case dispatch latency of an OS.


Difference between preemptive and non preemptive?

if block Ki of size Ni is to be transferred to memory M1 & the blocks occupying the space in M1 can't be preempted by block Ki then it is necessaray to find or create a space of Ni words inM1 . this process is called non preemptive allocation....non preemptive allocation can't make efficient use of memory allocation.whenever preemptive allocation is used for efficient use of the available memory space and rellocation can be done.