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

Microprocessor MIPS Full Adder and Divider with overflow, I need to write a...

I need to write a 32 bit adder in MIPS without using the Add command and a divider as well.

What is jsf, what is jsf

what is jsf

Briefly explain register-to-register architecture, Register-to-Register Arc...

Register-to-Register Architecture In this organization results and operands are not accessed straight from main memory by scalar or vector registers. The vectors that are neede

Different ways in which a thread can be cancelled, What are the different w...

What are the different ways in which a thread can be cancelled? Cancellation of a target thread may occur in two different scenarios: Asynchronous cancellation: One thre

Explain folded network, Explain Folded network. Folded network: While...

Explain Folded network. Folded network: While all the inlets/outlets are connected to the subscriber lines, the logical connection shows as demonstrated in figure. When, the

Determine the values of the output of the logic gates, Write the values of ...

Write the values of the C output for the following gates: For a(n) ________ gate, the output is zero if any of the inputs are equal to one. For a(n) ________ gate ,the

Assignment, what is an interface and perpheral device

what is an interface and perpheral device

Update -task updates, Update -task updates are Asynchronous updates.

Update -task updates are Asynchronous updates.

What is the linkage section, The linkage section is part of a known as prog...

The linkage section is part of a known as program that 'links' or maps to data items in the calling program are working storage. It is the part of the called program where these sh

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

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!

Submit Assignment

User Account

All Pages