Why process scheduling algorithm favour i/o bound processes, Computer Engineering

Assignment Help:

Suppose that a process scheduling algorithm favors those processes that have used the least processor time in the recent past. Why will this algorithm favour I/O- bound processes, but not starve CPU-bound processes?

Ans: This will favor the I/O-bound programs due to the relatively short CPU burst request through them; though, the CPU-bound programs will not starve since I/O- bound programs will relinquish the CPU relatively frequently to do their I/O.


Related Discussions:- Why process scheduling algorithm favour i/o bound processes

cellfun function, There is a built-in function function known as cellfun t...

There is a built-in function function known as cellfun that evaluates a function for each element of a cell array.  Make a cell array, then call the cellfun function, passing the h

Explain chomsky classification of languages, Explain chomsky classification...

Explain chomsky classification of languages with suitable examples Ans: Any language is appropriate for communication provided the syntax & semantic of the language is termed t

What is artificial intelligence fuzzy logic, Fuzzy logic is a form of vario...

Fuzzy logic is a form of various-valued logic; it deals with reasoning that is approximate rather than fixed & exact. In contrast with traditional logic theory, where binary sets h

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

Implementation using 8 to 1 multiplexer, Implement the following function u...

Implement the following function using 8 to 1 multiplexer Y(A, B, C, D) = ∑(0,1,2,5,9,11,13,15) Ans. We will obtain three variables B,C and D at selection lines and also A as i

Parallel computing, explain different types of parallel processing mechani...

explain different types of parallel processing mechanism

Define realization of one flip flop using other flip flops, Define Realizat...

Define Realization of one flip flop using other flip flops? It is probable to implement a flip flop circuit using any other circuit. Universal block diagram is shown below.

What is cursor, The illustration of the mouse on-screen. Depending on your ...

The illustration of the mouse on-screen. Depending on your settings, the cursor can be many dissimilar things.

Explain the types of computer architecture, Explain the types of computer a...

Explain the types of computer architecture Computer architecture can be divided into three main categories: Instruction Set Architecture, or ISA, is the image of a computing

Associativity of connectives - artificial intelligence, Associativity of Co...

Associativity of Connectives: In order to tell us brackets are useful when to perform calculations in arithmetic and when to evaluate the truth of sentences in logic. Imagine w

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