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 do you meant by dreamweaver, A Web site is a set of linked documents w...

A Web site is a set of linked documents with shared attributes, like related topics, a similar design or a shared purpose. Macromedia Dreamweaver is a site creation and management

Explain about truth table and logic diagram, Q. Explain about truth table a...

Q. Explain about truth table and logic diagram? A Boolean function can be realized in a logic circuit employing the basic gates: - AND, OR & NOT. Concern here for illustration

Advantages & disadvantages of public-key cryptography, Advantages & Disadva...

Advantages & Disadvantages Enhanced security and convenience: private keys never require be transmitting or revealing to anyone.  They can givce a method for digital signatu

What is verification method, The verification method states how Robot compa...

The verification method states how Robot compares the baseline data captured while recording with the data captured during playback.

Elucidate basic time division time switching method, With the help of block...

With the help of block diagram Elucidate basic time division time switching method. Basic Time Division Switching: Functional blocks of a memory based time division switching

Design combinational-sequential electronic logic gate, Combinational/Sequen...

Combinational/Sequential Logic design with Integrated Circuits (Dual in line package) Car wash concept with the following steps in a Combinational Logic Diagram: 1.    Start

Explain the client-server interaction using messages, Explain the Client-Se...

Explain the Client-Server Interaction Using Messages As we have learned, client- server interaction may be managed in many ways. A message- based interaction is perhaps the bes

What are the features of cisc processors, What are the Features of CISC Pro...

What are the Features of CISC Processors The standard features of CISC processors are listed below:  CISC chips have a large amount of dissimilar and complex instructions.

Karnaugh maps, Minimisation using Boolean algebra is not always straight fo...

Minimisation using Boolean algebra is not always straight forward and sometimes it is not obvious if a further manipulation would give a simpler circuit. Karnaugh maps are a muc

Why erlang is used, Erlang is used to (A) Measure busy period         ...

Erlang is used to (A) Measure busy period                (B) Give total busy period in minutes (C)  Measure average call rate       (D) Indicate total call period Ans

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