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 friend function in c++, As the name suggests, the function acts as ...

As the name suggests, the function acts as a friend to a class. As a friend of a class, it can access its private & protected members. A friend function is not a member of the clas

Not dragged and dropped onto the form, I have to make a quiz machine progra...

I have to make a quiz machine program in in Visual Basic with the following: A menu strip that must be formed programmatically (ie NOT dragged and dropped onto the form). There

Luminous Jewels - The Polishing Game, Byteland county is very famous for lu...

Byteland county is very famous for luminous jewels. Luminous jewels are used in making beautiful necklaces. A necklace consists of various luminous jewels of particular colour. Nec

Illustrate high performance fortran, In 1993 High Performance FORTRAN Forum...

In 1993 High Performance FORTRAN Forum which is a group of academicians and many leading software and hardware vendors in field of parallel processing established an informal langu

Differences between a uri, Question: (a) Describe the differences betwe...

Question: (a) Describe the differences between a URI, a URN and a URL. (b) What are the five basic syntax rules for a well-formed XML document? (c) Provide four uses of

What is cache memory, Q. What is Cache Memory? Cache memory is a very f...

Q. What is Cache Memory? Cache memory is a very fast and small memory between CPU and main memory whose access time is closer to processing speed of CPU. It behaves as a high-s

Define the key features of hop field neural networks, a. Define the Key fea...

a. Define the Key features of Hop field Neural Networks. b. Compare and contrast among Neural Networks and Expert systems in terms of knowledge representation, acquisition and e

What is direct addressing mode, Computer Organization and Architecture ...

Computer Organization and Architecture 1. Draw the block diagram of von Neumann Architecture and describe about its parts in brief. 2. Draw block diagram of Intel 8085 CPU o

Differentiate between linear and matrix addressing modes, Differentiate bet...

Differentiate between linear addressing and matrix addressing modes with examples. Ans: Linear Addressing: Addressing is the procedure of selecting one of the cells in a

Show error detection mechanism, Q. Show Error detection mechanism? Erro...

Q. Show Error detection mechanism? Error detection mechanism can be described as below: Figure: Error detection and correction

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