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

How to use http and world wide web, Q. How to use Http and World Wide Web? ...

Q. How to use Http and World Wide Web? Http and World Wide Web One of the most frequently used services on the Internet is the World Wide Web (WWW). The application proto

Develop inventory management system and time-tabling systems, Problem: ...

Problem: Develop three sub-systems namely Staff Profiling System, Inventory Management System and Time-tabling systems. (a) Show about any three design patterns you have us

Bus arbitration - computer architecture, Bus arbitration: In single bu...

Bus arbitration: In single bus architecture when more than 1 device requests the bus, a controller known as bus arbiter decides who gets the bus; this is known as the bus arbi

Which header file is used for screen handling function, Which header file i...

Which header file is used for screen handling function:- The header files stdio.h having definitions of constants, macros and types, along with function declarations for stan

Data structure, Process: pid start time end time priority t...

Process: pid start time end time priority timeslice list of CPU bursts list of IO bursts (the number of IO burst will always be 1 less than the number of CPU

C program, program to find minimum total number of shelfs

program to find minimum total number of shelfs

Abap/4 module can "branch to " or "call" the next screen, The commands thro...

The commands through Which an ABAP/4 Module can "branch to " or "call" the next screen are Set screen Call screen , Leave screen, Leave to screen

Explain about ALU organisation, ALU ORGANISATION An ALU performs simple...

ALU ORGANISATION An ALU performs simple arithmetic and logic operation as well as shift operations. Complexity of an ALU relies on the type of instruction set for that it has b

State any three properties of the neutrons, Q. State any three properties o...

Q. State any three properties of the neutrons. (i) A Neutrons are the constituent particles of all nuclei except hydrogen. (ii) As they are neutral particles they aren't de

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