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

Shm, composition of two shm in right angles to each other to havingg time p...

composition of two shm in right angles to each other to havingg time period in the ratio 1:2

Explain difference between dynamic and static binding, Explain difference b...

Explain difference between Dynamic and static binding. Dynamic and static binding: Dynamic binding is a binding performed after the execution of a program has immediately beg

Define the time when a block of data is ready to be read, The total time to...

The total time to prepare a disk drive mechanism for a block of data to be read from is its ? Ans. latency plus seek time is the total time to prepare a disk drive mechanism fo

Can link and association applied interchangeably, No, You cannot apply the ...

No, You cannot apply the link and Association interchangeably. Since link is used show the relationship among the two objects. But Association is used signify the relationship

Components of magnetic disk, Q. Components of magnetic disk? Disk itsel...

Q. Components of magnetic disk? Disk itself is mounted in a disk drive that comprises arm which is a shaft that rotates disk and the electronics required for input and output b

Explain SR latch using nor gates, Q. Explain SR Latch using NOR gates? ...

Q. Explain SR Latch using NOR gates? Let's inspect the latch more closely.   i. Suppose initially 1 is applied to S leaving R to 0 at this instance. The instant S=1 output o

Explain what is high debugging?, It is helped to recure the bugs. A program...

It is helped to recure the bugs. A program has problem that time this debugging is helped to solve the bugs is simply, this is the method of the recure bugs in the programming lang

How do you debug a loadrunner script, VuGen have two options to help debug ...

VuGen have two options to help debug Vuser scripts-the Run Step by Step command and breakpoints. The Debug settings in the Options dialog box permit us to verify the extent of the

Functions in first-order logic sentences, Functions in first-order logic se...

Functions in first-order logic sentences - artificial intelligence: Functions may be thought of as special predicates, where we think of all but 1 of the arguments as input and

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