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

What are the two aspects of locality of reference, What are the two aspects...

What are the two aspects of locality of reference? Define them. Two aspects of locality of reference are temporal aspects and spatial aspect. Temporal aspect is that a r

About algorithm , train booking algorithm for seat reservation

train booking algorithm for seat reservation

Describe the operation of parallel in parallel out, Describe the operation ...

Describe the operation of parallel in parallel out (PIPO) shift register. Ans:  Parallel In Parallel Out: By the name suggests, in parallel in parallel out that is a

How to input to circuit, Q. How to input to circuit? Register A bit...

Q. How to input to circuit? Register A bits as a0, a1, a2 and a3 in the corresponding X bits of the Full Adder (FA). Register B bits as given in the Figure above as in

Explain about semiconductor memories, Q. Explain about Semiconductor Memori...

Q. Explain about Semiconductor Memories? Originally IC technology was used for constructing processor however soon it was realized that same technology can be used for construc

Quantitative analysis, solve the primal problem using duality and determine...

solve the primal problem using duality and determine the primal and dual solution P= 300x1 + 300x2 S.T. 2x1 + 3x2 => 13 3x1 = 2x2 => 15 x1,x2 => 0

Call the user methods by creating the object, Make a class library and desc...

Make a class library and describe class 'User'. In User class describe the public, protected and Friend functions. Make a console application andadd a reference to this library and

Explain the main tags of wireless markup language, Discuss the main tags of...

Discuss the main tags of WML. Tag Definition of Wireless Markup Language: This defines the starting and the ending of the page, as .   this explains

First-order logic - artificial intelligence, First-Order Logic We, as h...

First-Order Logic We, as humans, have always prided ourselves on our ability to think things through for this reason things are out and come to the only conclusion possible in

What is closed system, Closed System: It's isolated from environment influ...

Closed System: It's isolated from environment influences. It operates on factors within System itself. It is also described as a System which involves a feedback loop, a control e

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