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

Data structure, How does dynamic memory allocation help in managing data

How does dynamic memory allocation help in managing data

What are spa/gpa parameters (sap memory), What are SPA/GPA parameters (SAP ...

What are SPA/GPA parameters (SAP memory) SPA/GPA parameters are field values saved globally in memory.  There are two ways to use SPA/GPA parmeters: By setting field attrib

Define syntax of mpi_bcast function, Q. Define syntax of MPI_Bcast function...

Q. Define syntax of MPI_Bcast function? MPI_Bcast(msgaddr, count, datatype, rank, comm):   This function is used by a process ranked rank in group comm to transmit messag

What is bus arbitration, Q. What is Bus arbitration? In this technique,...

Q. What is Bus arbitration? In this technique, I/O interface first needs to control bus and only after that it can request for an interrupt. In this technique because only one

Explain passing parameters in general memory, Q. Explain Passing Parameters...

Q. Explain Passing Parameters in General Memory? The parameters can be passed in the memory too. In such a technique name of the memory location is used as a parameter. The res

What is compact disk recordable, Q. What is Compact Disk Recordable? To...

Q. What is Compact Disk Recordable? To accommodate applications in which just one or a small number of copies of a set data is required write-once read-many CD called as CD Rec

Why we use addressing schemes, Q Why we use addressing schemes? An ope...

Q Why we use addressing schemes? An operation code of an instruction tells the operation to be performed. This operation is executed on some data stored in memory or register.

Programming, DADA Electronics makes CD players in 3 processes: programming,...

DADA Electronics makes CD players in 3 processes: programming, and packaging. Direct materials are added at the starting of the assembly process. Conversion costs are incurred even

Network properties, Network Properties There are many properties are as...

Network Properties There are many properties are associated with interconnection networks:- 1) Topology: It signify how the nodes a network are organised. A variety of top

What is a good resolution, Q. What is a good resolution? In fact it rel...

Q. What is a good resolution? In fact it relies on your hardware. Hence it's the maximum your hardware can allow you.  But one odd-looking resolution that has become popular is

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