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

Determine 8-input multiplexer IC in the TTL family, The commercially availa...

The commercially available 8-input multiplexer integrated circuit in the TTL family is ? Ans. In TTL, MUX integrated circuit is 74153.

Explain network security, Explain network security. Network security me...

Explain network security. Network security means the security of networks and their services from unauthorized access, changes, destruction or disclosure. It gives for assuranc

Describe the architecture of electronic data exchange, Describe the Electro...

Describe the Electronic Data Exchange (EDI) architecture in brief. Electronic Data Interchange (EDI) may be generally easy to understand as the replacement of paper-based purch

Simple assembly programs, Data Transfer Two most fundamental data trans...

Data Transfer Two most fundamental data transfer instructions in 8086 microprocessor are XCHG and MOV. Let's give illustrations of the use of these instructions. Program 1:

Develop a program octal to hexadecimal, Q. Develop a Menu driven program w...

Q. Develop a Menu driven program with following menu: 1. Octal to Decimal 2. Octal to Hexadecimal 3. Octal to Binary

Determine the object oriented features, Object Oriented Analysis T h...

Object Oriented Analysis T he basics of object oriented analysis with the help of object oriented features. Analysis Analysis is not a solution of the problem. We w

Data structure in which an element is added, A data structure in which an e...

A data structure in which an element is added and detached only from one end, is known as Stack

Networking, compare 2g , 3g , and 4g also with advantage of 3g and 4g.

compare 2g , 3g , and 4g also with advantage of 3g and 4g.

Do you provide storage and destruction services, Do you provide storage and...

Do you provide storage and destruction services? We will assess your storage and destruction needs as part of our evaluation process. Our destruction services can be performed

Software enginnering, prepare FTR

prepare FTR

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages