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

Structural hazards - computer architecture, Structural hazards - computer a...

Structural hazards - computer architecture: A structural hazard takes place when a part of the processor's hardware is required by 2 or more than two instructions at the same

What is memory interleaving, Q. What is Memory Interleaving? In this sc...

Q. What is Memory Interleaving? In this scheme main memory is splitted in 'n' equal-size modules and CPU has separate Memory Base register and Memory Address Register for every

Virtual manufacturing system, Virtual Manufacturing System Virtual manu...

Virtual Manufacturing System Virtual manufacturing system or VMS is a synthetic, integrated manufacturing environment, developed by using information technology tools, exercise

File structures, Write in brief about UNIX process structure.

Write in brief about UNIX process structure.

Which term is associated with snmp, Which term is associated with SNMP? ...

Which term is associated with SNMP? MIB is related with SNMP.

Double negation, Double Negation : All parents are forever correcting ...

Double Negation : All parents are forever correcting their children for the find of double negatives,  there we have to be very alert with them in natural language like: "He d

Network for digital methods in the arts and humanities, Network for Digital...

Network for Digital Methods in the Arts and Humanities: Europe has seen a signifi cant investment in the digitisation of its cultural heritage as part of the worldwide establi

Computer Architecture, As an advocate of CISC architecture to RISC architec...

As an advocate of CISC architecture to RISC architecture, what are the merits and demerits of CISC to RISC architecture

Diffrentiate between non-relocatable & relocatable programs, How non-reloca...

How non-relocatable programs are different from relocatable programs? Non relocatable program: It is one that cannot be made to execute in any type of area of storage other t

Define various system, Define various system? Single job system: Only...

Define various system? Single job system: Only one program may be run at a time, and therefore only one person might be work on a machine at one time.  Multi job system:

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