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

Illustrate about packet switching, Q. Illustrate about Packet switching? ...

Q. Illustrate about Packet switching? Packet switching is used to avoid long delays in transmitting data over the network. Packet switching is a technique that limits the amoun

DBMS, what is dbms goal?

what is dbms goal?

What is problem statement, What is problem statement The problem state...

What is problem statement The problem statement is crucial for any analysis. Problem statement is general description of the user's desires, and difficulties. The motive of pr

Select statements linked to a logical database, One cannot use SELECT state...

One cannot use SELECT statements in a report program linked to a Logical Database   False. You can use th SELECT statements.

Define process control block, Define Process Control Block (PCB). Pr...

Define Process Control Block (PCB). Process Control Block (PCB): Information related with each process is stored into Process control Block. a)      Process state b)

Importance of using module-instance parameter, Using Module-Instance Parame...

Using Module-Instance Parameter: Parameter values can be overridden while a module is instantiated. New parameter values are passed at the time of module instantiation. Top-

Handling interrupts - computer architecture, Handling Interrupts: Pre...

Handling Interrupts: Precise interrupts (sequential semantics) Complete instructions before the offending instructions o   Force trap instruction into IF o

Fixed arithmetic pipelines, Fixed Arithmetic pipelines  We obtain the e...

Fixed Arithmetic pipelines  We obtain the example of multiplication of fixed numbers. The Two fixed-point numbers are added by the ALU using shift and add operations. This sequ

What are advantages and drawbacks of flip-flop, What are advantages and dra...

What are advantages and drawbacks of flip-flop? Usually area of a Flip-flop for features in more than a latch. Power consumption is normally higher, because of the area and

What is an on"*-input filed" statement, What is an on"*-input filed" statem...

What is an on"*-input filed" statement? ON *-INPUT The ABAP/4 module is known as if the user has entered the "*" in the first character of the field, and the field has th

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