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

Calculate max distance so subscriber get speech reproduction, In a subscrib...

In a subscriber loop that contains a series resistance of 300 ohms to protect the batteries in the exchange, a normalized telephone draws 10 mA and its standard input d.c. resistan

Define the most common biometrics, What is most common biometrics? Explain ...

What is most common biometrics? Explain in brief. The most common biometrics is as given below: Face geometry (Photo): The computer captures the picture of your face and m

Optimality - heuristic search strategies, Optimality - Heuristic search str...

Optimality - Heuristic search strategies: The path cost of a solution is considered as the sum of the costs of the actions that led to which solution is given. This is only on

Define relocation bits utilized by relocating loader, Relocation bits used ...

Relocation bits used by relocating loader are specified by? Ans. Relocation bits utilized by relocating loader are identified by Assembler or Translator.

Define about abstraction- object oriented systems, Define about Abstractio...

Define about Abstraction-  object oriented systems Abstraction is one of the most important ideas of object oriented systems Abstraction focus on the necessary, inherent aspec

Basic characteristics of an experts system, An experts systems must perform...

An experts systems must perform well that is achieve the same levels of performance in the domain of interest that human experts can achieve. But simply producing good so

What is common control switching system, What is common control switching s...

What is common control switching system? Explain. Common Control Switching System: It is a functional block diagram of a common control switching system is demonstrated in figu

Difference in natural frequency and resonant frequency, (a)  Explain in a f...

(a)  Explain in a few sentences the difference between a natural frequency and a resonant frequency.  Also clarify why for a specific system or component these frequencies may diff

Build a program to maintain his personal account, Aim: Build a program or a...

Aim: Build a program or application which gives an interface to the user to maintain his personal account for E-mails & should be able to work on the following applications. Des

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