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

What is the working of domain expert, Q. What is the working of domain expe...

Q. What is the working of domain expert? ANSWER: The domain expert is the person who gives the domain expertise in the form of problem-solving strategies.

Rule in a single direction - equivalences rules, Rule in a single direction...

Rule in a single direction - equivalences rules: Hence there the power to replace  sub expressions always allows use to prove theorems with equivalences: as given in the above

How to use messages in lists, How to use messages in lists? ABAP/4  pe...

How to use messages in lists? ABAP/4  permits you to react to incorrect or doubtful user input by displaying messages that influence the program flow depending on how serious

Task of the computer systems consultant, You are required to carry out the ...

You are required to carry out the task of the Computer Systems Consultant mentioned above. Your quotation/recommendations, which must be justified, should include information wi

Temporary registers w and z, Why the temporary registers W and Z are named ...

Why the temporary registers W and Z are named so I mean we start from A,B,C,D,E then H and L coz H stands for higher bit nd L for lower bit of the address pointed by memory pointer

Observed speedup and parallel overhead, Observed Speedup Observed speed...

Observed Speedup Observed speedup of a system which has been parallelized, is defined as:                             Granularity is one of the easiest and most extensi

Define device interface, Define device interface. The buffer registers ...

Define device interface. The buffer registers DATAIN and DATAOUT and the status flags SIN and SOUT are part of circuitry commonly called as a device interface.

Show the features of collaboration systems, Q. What are basic features that...

Q. What are basic features that collaboration systems might have? ANSWER: Three basic features of collaboration systems are Web-conferencing, project management,

Mathematical simulation and modelling applications, Mathematical Simulation...

Mathematical Simulation and Modelling Applications The tasks include mathematical simulation and modelling need lots of parallel processing. Three fundamental formalisms in mat

Explain the following the address instruction, Explain the following the ad...

Explain the following the address instruction?  Three-address instruction-it can be represented as add a,b,c Two-address instruction-it can be shown as Add a,b

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