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

Define external variable declaration, Summarize the distinction between an ...

Summarize the distinction between an external variable definition and an external variable declaration. When we have ''declared'' a variable, we have meant that we have told th

Exit command, Your shell must accept the exit command. This command will ...

Your shell must accept the exit command. This command will be in the form: e x i t When you encounter this command, your shell should terminate. Please note that when you

What is redundant array of independent disks, What is Redundant Array of In...

What is Redundant Array of Independent Disks? Researchers are constantly trying to improve secondary storage media by raising their, performance, capacity as well as reliabilit

Adder substractor, how can we bimpliment half substractor using nand gate

how can we bimpliment half substractor using nand gate

Give an account of issue pertaining in c language, Give an account of the i...

Give an account of the issue pertaining to compilation of if statement in C language Control structures as if cause significant gap in between the PL domain and the execution d

Major characteristics of a computer family, Q. Major characteristics of a c...

Q. Major characteristics of a computer family? Let us summarise the major characteristics of a computer family. These are as below: Figure: Characteristics of computer

Diffrentiate b/w shared memory and distributed memory, Shared Memory  ...

Shared Memory  Shared Memory refers to memory component of a computer system in which the memory can accessed directly by any of the processors in the system. Distributed

What is an assembler, An assembler is? Ans. An assembler is Machine dep...

An assembler is? Ans. An assembler is Machine dependant.

How the canvas class and the graphics class are linked, A Canvas object giv...

A Canvas object gives access to a Graphics object by its paint() method.

Elucidate basic time division time switching method, With the help of block...

With the help of block diagram Elucidate basic time division time switching method. Basic Time Division Switching: Functional blocks of a memory based time division switching

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