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

What is information technology, Information Technology is nothing but the s...

Information Technology is nothing but the study, design, development, execution, support and management of computer based information systems mainly the applications software & har

How is basic authentication worked, How is basic authentication worked? ...

How is basic authentication worked? When an exact resource has been protected using fundamental authentication, Apache sends a 401 Authentication needed header along with the r

Design an or to and gates combinational network, Design an OR to AND gates ...

Design an OR to AND gates combinational network and NAND only n/w for the following Boolean expression: A'BC'D + ABC'D' + A'B'CD' + A'BCD'

Define busy waiting and spinlock, Define busy waiting and spinlock.  Wh...

Define busy waiting and spinlock.  When a process is in its critical section, any other process that tries to enter its critical section must loop continuously in the entry cod

Target_parent, TARGET = "_parent" "_parent" is used in a situation whe...

TARGET = "_parent" "_parent" is used in a situation where a frameset file is nested inside another frameset file. A link in one of the inner frameset documents that uses "_par

What is the use of cache memory, What is the use of cache memory? The u...

What is the use of cache memory? The use of the cache memories solves the memory access problem. In certain, when a cache is included on the same chip as the processor, access

Organisational inertia - obstacle to information system, Organisational Ine...

Organisational Inertia - Obstacle To Information System This is most easily understood as problems of change and culture. Like any change process technology led change will be

Version control systems, The next major set of tasks to tackle are delete a...

The next major set of tasks to tackle are delete and update. Version control systems typically version updates to a ?le and only store the differences between the ?les. Two system

Data analysis and results in e-commerce, There were 50 respondents to our s...

There were 50 respondents to our survey. The first component of the data examined here focuses on student's preference (ecommerce or traditional commerce). The Second compone

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