Differentiate Preemptive and Nonpreemptive Scheduling?, Basic Computer Science

Assignment Help:
The Scheduling algorithms can be divided into two parts with respect to how they deal with clock interrupts.
1) Nonpreemptive Scheduling:
A scheduling discipline is no preemptive if, once a process has been given the CPU, the CPU cannot be taken away from that process.
Following are some characteristics of nonpreemptive scheduling

a) In nonpreemptive system, short jobs are produced to wait by longer jobs but the complete treatment of all processes is fair.
b) In nonpreemptive system, response times are more expected because incoming high priority jobs cannot relocate waiting jobs.
c) In nonpreemptive scheduling, a scheduler executes jobs in the following two conditions.
o When a process switches from running condition to the waiting state.
o When a process come to an end.

2) Preemptive Scheduling:
A scheduling regulation is preemptive if, one time a process has been given the CPU can taken away.

The policy of allowing processes that are logically run able to be for now suspended is called Preemptive Scheduling and it is contrast to the "run to completion" technique.

Related Discussions:- Differentiate Preemptive and Nonpreemptive Scheduling?

Define CISC and RISC ?, Two competing architectures were developed for impr...

Two competing architectures were developed for improving the architecture of the central processing unit, and different processors are conventional to each one. Both had their powe

Write a schema for the operation of ending a game, QUESTION 1 We need ...

QUESTION 1 We need to write Z specifications to record the information about passengers on board an aircraft. Here you are required to produce the specifications using appropr

What is Kernel-Level Thread in operating system?, In this technique, the ...

In this technique, the kernel knows about and handles the threads. No runtime system is required in this case. In place of thread table in each process, the kernel has a thread tab

Cryptography, Consider the one-time pad encryption scheme to encrypt a 1-bi...

Consider the one-time pad encryption scheme to encrypt a 1-bit message m, and assume m is chosen with uniform distribution from message space M={0,1}. Let E1 be the event "message

Computer, what is the computer science

what is the computer science

Concept in programming language, CONCEPT IN PROGRAMMING LANGUAGE: A Pr...

CONCEPT IN PROGRAMMING LANGUAGE: A Programming Language is used to design and describe a set of instructions and computations to be executed by a computer. To do programming,

Define Program formation process, For the formation of a program it is nece...

For the formation of a program it is necessary to follow five steps: Design of the algorithm, stage the problem to be solved is reputable and the best solution is proposed, creatin

Data communication & net centric computing, Suppose there are exactly five ...

Suppose there are exactly five packet switches (Figure 4) between a sending host and a receiving host connected by a virtual circuit line (shown as dotted line in figure 4). The tr

Sequential writing in fcb files, Previous to we can perform writing to the...

Previous to we can perform writing to the disk it is essential to define the data transfer region using for this end the 1AH function of the 21H interruption. The 1AH function does

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd