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

Comparison between risc and cisc - computer architecture, Comparison betwee...

Comparison between risc and cisc - computer architecture: CISC  Emphasis on hardware  Includes multi-clock complex instructions  Memory-to-memory

The alignment of a type ''c'' field in a report, The alignment of a type 'c...

The alignment of a type 'c' field in a report is? ? Left Aligned.

Subtract the numbers using 1's complements, Subtraction 11001-10110 using 1...

Subtraction 11001-10110 using 1's complement Ans. 11001 - 10110 01001 is 1' s Compliment of 10110, so     1 1 0 0 1 +  0 1 0 0 1 ------------------    1 0 0 0 1 0    Add 1

What are parity generator and checker, What are parity generator and checke...

What are parity generator and checker? Ans: While a digital signal is transmitted, this may not be received correctly through the receiver. At the receiving end this may o

Analyse the website design, Briefly analyse and compare the two website des...

Briefly analyse and compare the two website designs, applying in turn each of the six design principles. This will result in six brief paragraphs. As part of each analysis, expl

Complexity of sequential search, Specified the average case complexity of s...

Specified the average case complexity of sequential search in an array of unsorted elements of size n if the following conditions hold: a)  Probability of the key to be in the a

Examples of artificial neural networks, Examples of artificial neural netwo...

Examples of artificial neural networks: Now here as an example consider a ANN that has been trained to learn the following rule categorising the brightness of 2x2 black and wh

Health care professional, Overall, Mr. X is an intelligent and high-functio...

Overall, Mr. X is an intelligent and high-functioning man with good psychological, social, and occupational functioning. The test battery did not reveal any difficulties that warra

What is linear bounded automation, What is linear bounded automation?  ...

What is linear bounded automation?   A linear bounded automation is restricted type of Turing machine where in the tape head isn't permitted to move off the portion of the tape

Ruby, Discuss about variables and assignmesnt statements

Discuss about variables and assignmesnt statements

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