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

DFD, Draw the Context level DFD for the Safe home Software.

Draw the Context level DFD for the Safe home Software.

Determine less propagation delay in synchronous-ripple ckt, You have two co...

You have two counters counting up to 16, built through negedge DFF, First circuit is synchronous and second is "ripple" as cascading, which circuit has a less propagation delay? Wh

Secondary memory and characteristics, It is desirable that operating speed ...

It is desirable that operating speed of primary storage of a computer system be as fast as possible since most of the data transfer to and from processing unit is via main memory.

Convention used to represent micro-operations, Q. Convention used to repres...

Q. Convention used to represent micro-operations? The convention used to represent micro-operations is: 1.  Computer register names are designated by capital letters (someti

Why is green screen more popular for compositing, Question: (a) Explain...

Question: (a) Explain clearly, from pre-production to post production how you would carry out the scene with multi-camera. (b) What are the there main aspects that should be

Name the languages introduced in second generation, Name the languages intr...

Name the languages introduced in second  generation During  the time of  second  generation  many  high  level  programming  languages  were introduced, such as FORTRAN (1956),

Discuss the 5-level switching hierarchy recommended by ccitt, Discuss the 5...

Discuss the 5-level switching hierarchy recommended by CCITT. Hierarchical networks are able of handling heavy traffic where needed, and at similar time use minimal number of t

Explain half-adder with truth-table and logic diagram, What is a half-adder...

What is a half-adder? Explain a half-adder with the help of truth-table and logic diagram. Ans. Half Adder: It is a logic circuit for the addition of two 1-bit numbers is term

The color and plot style, Write a script that will make x and y vectors.  T...

Write a script that will make x and y vectors.  Then, it will ask the user for a color ('red', 'blue', or 'green') and for a plot style ('o', '*').  It will then make a string "pst

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