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

Economic argument for good design, One way of demonstrating the importance ...

One way of demonstrating the importance of good ID is by showing tangible benefits that can be talked about in cash terms. Within a business, good ID can lead to benefits such as h

C program, #how to write c program for all types of beam reactions

#how to write c program for all types of beam reactions

Discuss the customer-to-customer transactions, Discuss the customer-to-cust...

Discuss the customer-to-customer transactions. C2C (customer-to-customer): Person-to-person transactions are the oldest type of e-business. They have been there since the

Explain the raster scan monitors, Explain the raster scan monitors The ...

Explain the raster scan monitors The refresh process must also be performed for raster scan monitors. Most television monitors are raster scan display devices : one scan-line a

Differentiate between transport & session layer of osi model, Differentiate...

Differentiate between Transport and Session layers of OSI model. OSI Model Transport Layer The transport layer utilizes the services provided through the network layer, as

How numbering plan is achieved in modern telephony, How numbering plan is a...

How numbering plan is achieved in modern telephony? Give the structure with example. The objective of numbering plan is to uniquely identify every subscriber connected to a tel

Split bus operation - universal serial bus , Split Bus Operation - universa...

Split Bus Operation - universal serial bus : USB 2.0 devices utilize a special protocol in the reset time that is called "chirping", to negotiate the high speed mode

Explain deadlock detection algorithm for single instance, Explain deadlock ...

Explain deadlock detection algorithm for single instance of each resource type. For single instance of each resource type the deadlock detection algorithm: (i) Maintain a wa

What methods can be overridden in java, In C++ terminology, all public meth...

In C++ terminology, all public methods in Java are virtual. Thus, all Java methods can be overwritten in subclasses except those that are declared final, private and static.

Explain multiple instruction and single data stream (misd), Multiple Instru...

Multiple Instruction and Single Data stream (MISD): In this type of organization multiple processing elements are ordered under the control of multiple control units. Every contro

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages