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

Instruction issue degree in superscalar processing, Q. Instruction Issue de...

Q. Instruction Issue degree in superscalar processing? The major concept in superscalar processing is how many instructions we are able to issue per cycle. If we are able to is

State about the machine language programs, State about the machine language...

State about the machine language programs The computer can run only machine language programs, one needs to translate above programs to machine language programs. To translate

What do you understand by hit ratio, What do you understand by Hit ratio? ...

What do you understand by Hit ratio? When a processor refers a data item from a cache, if the referenced item is in the cache, then such a reference is called hit. If the refer

Impact of information systems, What are the primary impacts of information ...

What are the primary impacts of information systems on an organization (employer, club, school, religious, etc..) for which you are familiar? What are the primary ways in which

Demostrate the example of spreadsheet, Now consider the following spreadshe...

Now consider the following spreadsheet: Formula in cell D2 is = (B2/C2) Replicating this formula (by highlighting then drag down to D7) gives all the formulas needed in cell

Definitions of the procedures cons, Show that we can represent pairs of non...

Show that we can represent pairs of nonnegative integers using only numbers and arithmetic operations if we represent the pair a and b as the integer that is the product 2a3b. Give

Define rules for reducing karnaugh maps, Define Rules for Reducing Karnaugh...

Define Rules for Reducing Karnaugh Maps? The rules for reducing Karnaugh Maps (k- maps) are as follows: All of the 1's in the Karnaugh Map are called as minterms. The

What are user threads, What are User threads   User threads are support...

What are User threads   User threads are supported above the kernel and are executed by a thread library at the user level. Thread creation & scheduling are done in the user sp

Explain the term recursion, Explain the term recursion A recursive functi...

Explain the term recursion A recursive function is one which calls itself. Recursive functions are useful in evaluating certain types of mathematical function. Here is a recursiv

IEEE802, 1. (a) Given a baseband bus with station 1 located at 10m, station...

1. (a) Given a baseband bus with station 1 located at 10m, station 2 located at 1000m, and station 3 located at 1010 meters (see diagram above). If the data rate of the bus is 10 M

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