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

Is strategy - information system, IS strategy - Information System As ...

IS strategy - Information System As an operations manager when attempting to navigate your organisation through the information landscape and make best use of the available sy

Resolution method - artificial intelligence, Resolution Method - Artificial...

Resolution Method - Artificial intelligence: A minor miracle happened in 1965 when Alan Robinson published his resolution function. This function uses a generalized format of t

Cg, 1. How can you divide the screen into quadrants? Is the process called ...

1. How can you divide the screen into quadrants? Is the process called as ‘viewing transformations’?

Illustrate the examples of simulations, Illustrate the Examples of simulati...

Illustrate the Examples of simulations -  Training (for example pilots, drivers, etc.) -  Running/testing nuclear plants and chemical plants -  trying out equipment to be

What is dynamic random access memory, What is dynamic random access memory ...

What is dynamic random access memory Computer memory today comprises mainly of dynamic random access memory (DRAM) chips which have been built into multi-chip modules that are

Define radix base, Define Radix (or)Base. A number system of base or ra...

Define Radix (or)Base. A number system of base or radix is a system that uses different symbols for r digits. Numbers are shown by a string of digit symbols. To verify the quan

What is the system call available to change the personality, What is the sy...

What is the system call available to change the personality? The system call personality prefers to a method to modify its implementation domain in order that Linux can emulate

What is cursor, The illustration of the mouse on-screen. Depending on your ...

The illustration of the mouse on-screen. Depending on your settings, the cursor can be many dissimilar things.

Determine the equivalent in octal of decimal number, Convert decimal 153 to...

Convert decimal 153 to octal. Equivalent in octal will be ? Ans. (153) 10 = (231) 8

Embedded software, Embedded Software Intelligent products have becom...

Embedded Software Intelligent products have become commonplace for all consumer and industrial market. Embedded software stays in read only memory and is utilised to control

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