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

C++, find the minimum total number of shelves including the loading process...

find the minimum total number of shelves including the loading process

Explain the advantages of computer, Explain the advantages of computer ...

Explain the advantages of computer Computer is one of the main components of an Information Technology network and getting increasing popularity. Nowadays, computer technology

Conversion of decimal number to binary number, Conversion of Decimal Number...

Conversion of Decimal Number to Binary Number: For converting a decimal number to binary integer part and fractional part are handled separately. Let's describe it with help of

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

What is read-only-memory, Q. What is Read-only-Memory? Read only memory...

Q. What is Read-only-Memory? Read only memory is an illustration of a Programmable Logic Device (PLD) it implies that binary information which is stored within a PLD is specifi

Usability test of website, For this part of your assessment you are require...

For this part of your assessment you are required to prepare and conduct a usability test of the website that you have chosen to review from Part A . You must design the script,c

What is meant by latch, Latch is a D- type flip-flop used as a temporary st...

Latch is a D- type flip-flop used as a temporary storage device controlled by a timing signal, which can kept 0 or 1. The primary function of a Latch is data storage. It is used in

Define the fundamentals of computer system, Define the Fundamentals of comp...

Define the Fundamentals of computer system A computer processes digital information. In order to do that it runs (executes) a machine language program. As an illustration, when

Instruction queue in bus interface unit, Q. Instruction Queue in Bus Interf...

Q. Instruction Queue in Bus Interface Unit? Instruction queue is employed to store the instruction ‘bytes' fetched. Please conceren two points here: that it's (1) A Byte (2) Qu

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