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

What is co-operative process, What is co-operative process? A process i... What is co-operative process? A process is co-operating if it can influence or be affected by the other processes implementing in the system. Any process that share data with o

Evaluate the physical address, Compare between the one and two-dimensional ... Compare between the one and two-dimensional memory organizations in terms of the  memory structure,  advantages, and disadvantages.  Which approach would better support the needs o

Operating system.., What is the use of FIFOs in client-server applications What is the use of FIFOs in client-server applications

What do you mean by semaphore?, What do you mean by semaphore?  Semap... What do you mean by semaphore?  Semaphore : A synchronization variable that acquires on positive integer values. Invented by the Dijkstra P (semaphore): an atomic proce

Operating system structure, Problem: (a) Modern operating systems are i... Problem: (a) Modern operating systems are interrupt driven. If there are no processes to execute, no I/O devices to service, and no users to whom to respond, an operating syste

Explain worst fit algorithm, Worst Fit Algorithm Here we obtain the la... Worst Fit Algorithm Here we obtain the largest space available for the smallest. Therefore after that process entered there will be much more space remaining. In this space we

Paging, Paging full question Paging full question

Networking protocols, Modern networks are not implemented as a single piece... Modern networks are not implemented as a single piece of software; that would render the task of dealing with multiple technologies and manufacturers virtually impossible. The solu

Explain the performance of demand paging, Performance of demand paging ... Performance of demand paging Demand paging can have an important effect on the performance of a computer system. As long as there are no page faults, the effective access time

Write a short note about process, Write a short note about process. Unc... Write a short note about process. Unceremoniously, a process is a program in implementation. A process is too much than the program code, which is occasionally known as the tex