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

Determine the applications of recursion theorem, Applications of recursion ...

Applications of recursion theorem? 1. ATM is undecidble. 2. Fixed point theorem. 3. MINTM is not Turing recognisable

What is post in terms of bios, For the one who still has no idea about the ...

For the one who still has no idea about the BIOS on your PC, notice when you first turn on your PC or laptop a few screens pop up. It may be a logo such as DELL or HP or ASUS, Tyan

Queue, A Queue is a FIFO (rst in, rst out) data structure. Given the foll...

A Queue is a FIFO (rst in, rst out) data structure. Given the following queue interface: public interface Queue { int size(); // current queue size boolean isEmpty(); //

Explain dead code elimination, Explain briefly Dead code Elimination of the...

Explain briefly Dead code Elimination of the commonly used code optimization techniques Dead code Elimination: Code which is unreachable or which does not influence the pr

Explain in detail companding, Explain in detail companding. Companding...

Explain in detail companding. Companding: It is the process of compressing and expanding. This includes compressing the signal at the transmitter and expanding this at the re

Connectives in first-order logic sentences, Connectives in first-order logi...

Connectives in first-order logic sentences - Artificial intelligence We may string predicates together into a sentence in the same way by utilising connectives that we did for

Convert integer into numerical equivalents, Convert the following integers ...

Convert the following integers into their numerical equivalents in the indicated bases. Be sure to use the correct number of significant figures for each case and show how the corr

What is read-only-memory, Q. What is Read-only-Memory? Read only memory...

Q. What is Read-only-Memory? Read only memory is an illustration of a Programmable Logic Device (PLD) it implies that binary information which is stored within a PLD is specifi

Name the 7400 series TTL chip, Name the 7400 series TTL chip which is a pri...

Name the 7400 series TTL chip which is a priority encoder. Write its truth table. Ans. Available IC in 74 series is 74147 that is a priority encoder. Such I

First order logic, "George has a dog called Ernie, which is a trained Labra...

"George has a dog called Ernie, which is a trained Labrador. Trained Labradors and poodles are obedient, and all obedient dogs are good dogs. All good dogs that have a master will

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages