Explain non-pre-emptive algorithms, Computer Engineering

Assignment Help:

Explain non-pre-emptive algorithms?  

Non preemptive algorithms: In this algorithm a job is provided to CPU for execution as long as the job is non-completed the CPU cannot be provided to other processes.

There are three kinds of non preemptive algorithms.

(i) First-come-first-serve (FCFS): This is simplest CPU scheduling algorithm. Along with this scheme, the process which requests the CPU at first is provided to the CPU at first. The implementation of First Come First Serve is easily managed through with a FIFO queue.

(ii) Shortest-job-first (SJF): It is also termed as SPN (shortest process next). In this algorithm the burst times of all the jobs that are waiting in the queue are compared. The job that is containing the least CPU execution time will be provided to the processor at first. In such turnaround time and waiting times are least. It also suffers along with starvation. Indefinite waiting time is termed as starvation. This is complex than FCFS.

(iii) Priority: In this method every job is related with CPU execution time, arrival time and the priority. Here the job that is containing the higher priority will be specified to the execution at first. It also suffers with starvation. And through using aging technique starvation effect may be decreased.


Related Discussions:- Explain non-pre-emptive algorithms

I have a user defined function that does not recalculate, Contain all the c...

Contain all the cells that your UDF depends on in the argument list. Or enter this as the first statement in your Function: Application.Volatile This will cause the functi

In 8085 which is called as high order / low order register, Flag is known a...

Flag is known as Low order register & Accumulator is known as High order Register.

Main problems with evaluation functions, Main problems with evaluation func...

Main problems with evaluation functions: Superlatively, evaluation functions should be quick calculates. Wherever is chance they take a long time to estimate, so after then le

Explain parsing, What is parsing? The target of parsing is to find out...

What is parsing? The target of parsing is to find out the syntactic validity of a source string. A tree is built for use through subsequent phase of compiler, if the string is

Define the products of dynamic mode, Define the Products of Dynamic mode ...

Define the Products of Dynamic mode Dynamic model: A model of dynamic behaviour of user object.  It defines important states of user object, the way that actions depend on

Register organisation, The number and nature of registers is a major factor...

The number and nature of registers is a major factor which distinguishes among computers. For illustration, Intel Pentium has about 32 registers. A number of these registers are sp

What is soap and how does it relate to xml, The Simple Object Access Protoc...

The Simple Object Access Protocol (SOAP) uses XML to describe a protocol for the exchange of information in distributed computing environments. SOAP having of three components: an

Diffrentiate between non-relocatable & relocatable programs, How non-reloca...

How non-relocatable programs are different from relocatable programs? Non relocatable program: It is one that cannot be made to execute in any type of area of storage other t

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