Q. Define the difference among pre-emptive and non pre-emptive scheduling.

Answer: Pre-emptive scheduling permits a process to be interrupted in the midst of its execution taking the CPU away and allocating it to another process. Non pre-emptive scheduling makes sure that a process relinquishes control of the CPU only when it finishes with its current CPU burst.

Posted Date: 7/27/2013 2:39:01 AM | Location : United States

Ask an Expert

Related Discussions:- Difference among pre-emptive and non pre-emptive scheduling, Assignment Help, Ask Question on Difference among pre-emptive and non pre-emptive scheduling, Get Answer, Expert's Help, Difference among pre-emptive and non pre-emptive scheduling Discussions

Write discussion on Difference among pre-emptive and non pre-emptive scheduling
Your posts are moderated

Write your message here..

Related Questions

Define approaches that require knowledge of the system state, Define approa... Define approaches that require knowledge of the system state?  Answer: Deadlock detection, Deadlock prevention, Deadlock Avoidance.

Compare user threads and kernel threads, Compare user threads and kernel th... Compare user threads and kernel threads. User threads:- User threads are supported above the kernel and are executed by a thread library at the user level. Thread creation

Define projected allocation state is safe - banker algorithm, A system cons... A system consists of 10 units of resource class Ru. The resource needs of three user processes P1, P2 and P3 are like this                     Using Banker's algorithm, de

Operations research, limitations limitations

Estimate the balking rate, People arrive at a barber shop at the rate of on... People arrive at a barber shop at the rate of one every 4.5 minutes. If the shop is full (it can hold five people altogether), 30% of the potential customers leave and come back i

Memory management, what is segmentation as it refers to operating system what is segmentation as it refers to operating system

Deadlock-avoidance algorithm, Regard as a computer system that runs 5000 jo... Regard as a computer system that runs 5000 jobs per month with no deadlock-prevention or deadlock-avoidance scheme. Deadlocks take place about twice per month and the operator must

search tree generated by hill-climbing search, Show the search tree genera... Show the search tree generated by Hill-Climbing search (text figure 4.2, page 122; or Local Search lecture, slide 6) for each of the two heuristics (a) and (b) applied to the follo

Sector sparing, What is sector sparing is proper definition What is sector sparing is proper definition

Necessary conditions for deadlock, Here are the conditions necessary for a ... Here are the conditions necessary for a deadlock to occur; note that all of them are necessary, and none is suf?cient: 1. ?nite resources: the resources are held in a mutually-e