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

How to clear computer motherboard cmos password, As CMOS is a special chip ...

As CMOS is a special chip with its own battery, the best way to clear out a CMOS chip is to cut off it from its power supply. To clear the CMOS password you just take away the

How video effects alters a video, Question : (a) What are the main aspe...

Question : (a) What are the main aspects that should be considered when dealing with green screen? (b) Explain clearly how these video effects alters a video using an illust

Internrt application, what is the significance of telecommunications deregu...

what is the significance of telecommunications deregulation for managers and organization

And-introduction rule, And-Introduction: In generally English says tha...

And-Introduction: In generally English says that "if we know that a lot of things are true, so we know that the conjunction of all of them is true", then we can introduce conj

Determine the primary memory of the server, Determine the primary memory of...

Determine the primary memory of the server The keys used for accessing the server are held at a secret location in the primary memory of the server. This area or location is hi

Pooja, wait for graph

wait for graph

Explain bottom up parsing, Explain Bottom up parsing. Bottom up pars...

Explain Bottom up parsing. Bottom up parsing: This parse attempts to increase syntax tree for an input string by a sequence of reduction. If the input string can be decreas

Give a simple example of dynamic modelling, Give a simple example of dynami...

Give a simple example of dynamic modelling using these notation A simple example using these notation is shown below in Figure:

Explain complete binary tree, Complete Binary tree A complete binary tr...

Complete Binary tree A complete binary tree can be described as a binary tree whose non leaf nodes have nonempty left and right sub tree and all leaves are at the similar level

Define point-to-point communication, Q. Define Point-to-point Communication...

Q. Define Point-to-point Communication? The simplest form of message is a point to point communication. A message is sent from the transmitting processor to a receiving process

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages