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 decimal equivalent of hexadecimal number, The hexadecimal num...

The hexadecimal number for (95.5) 10 is ? Ans. (95.5) 10 = (5F.8) 16 Integer part Fractional part 0.5x16=8.0

Name the variable types of c, C provides a wide range of variable types. ...

C provides a wide range of variable types. Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

Internrt application, what is the significance of telecommunications deregu...

what is the significance of telecommunications deregulation for managers and organization

Loop used to show properties, Normal 0 false false false ...

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4 A loop invariant is

What is reification and behaviour, What is reification and behaviour? R...

What is reification and behaviour? Reification is the promotion of something that is not an object into an object. Behavior usually requires this description. It isn't usually

Virtual memory and organization of a cache memory, Described virtual memory...

Described virtual memory Ans: Data is to be stored in physical memory locations that have addresses different from those that specified by the program. The memory control circu

Events by which we can program "help texts", What are the events by which w...

What are the events by which we can program "help texts" and display "possible value lists"? -PROCESS ON HELP-REQUEST (POH). -PROCESS ON VALUE-REQUEST (POV).

Explain sequential logic circuit, Explain Sequential logic circuit An...

Explain Sequential logic circuit Ans. Sequential logic circuit:- (i) Output not only depends upon the recent state of the input but also depend upon the earlier state

State and prove demorgan's second theorem, State and prove Demorgan's secon...

State and prove Demorgan's second theorem Proof: Demorgan's second theorem = A‾ + B‾ The two sides of the equation here = A‾ + B‾ is represented through the logic d

Data types done between abap/4 & external level, How is conversion of data ...

How is conversion of data types done between ABAP/4 & external level? Conversion among the external layer and the ABAP/4 layer is completed in the SAP dialog manager DYNP.

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages