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

Micro-operation concepts, We have determined the general architecture and r...

We have determined the general architecture and register set of MIPS microprocessor. Our subsequent task is to look at functionality of ALU, the CU and how an instruction is execut

Can you tell me some of system tasks and their purpose, Can you tell me som...

Can you tell me some of system tasks and their purpose? $display, $displayb, $displayh, $displayo, $write, $writeb, $writeh, $writeo. The most useful of these is $display. T

Design new registration system, WestEast College hires you as a systems ana...

WestEast College hires you as a systems analyst to design its new admission/registration system. WestEast College is one of the top ranked schools in the United States. It is a

Cardinality ratio.., what is cardinality ratio?

what is cardinality ratio?

What is null pointer, What is NULL POINTER Inside main, a FILE * called...

What is NULL POINTER Inside main, a FILE * called file. Afterwards, the fopen function, passing it the path to data file, as well as "r", only intending to read from the file.

Discuss functioning of different network access equipments, Discuss the fun...

Discuss the functioning of different network access equipments. The E1 multiplexers MX2000 and MX2411 and E1/T1 MX200 are giving multi interface user access to network PDH or S

How can you have an accession number, Accession number (bioinformatics), a ...

Accession number (bioinformatics), a unique identifier given to a biological polymer sequence (DNA, protein) when it is given to a sequence database.

Principle of locality, Principle of locality: Temporal base locali...

Principle of locality: Temporal base locality (locality in time):- If an item is referenced then it will tend to be referenced again soon. Spatial locality (local

Example of frames format with ethernet, Compute the number of Ethernet fram...

Compute the number of Ethernet frames formed for a data of 64 KB IP packet. Following figure demonstrates the format of the Ethernet frame. Here maximum data into a frame is 15

Rational performance of an agent - artificial intelligence, Rational perfor...

Rational performance of an agent - artificial intelligence: To summarize, an agent takes input from its violence and affects that environment. The rational performance of an a

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages