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

Customer credit-rating software , Gordon Grant, majority shareholder and Ch...

Gordon Grant, majority shareholder and Chief Executive Officer of Finance-IT Ltd, is determined to be one of the entrepreneurs making money out of the recession. He started the fir

Give a technical description of e-mail, E-mail system is mostly used for se...

E-mail system is mostly used for sending message electronically to group or individuals of individuals in inter and intra office environment. It needs networks to connect them. In

What is uml architecture, Takes care structural and behavioural aspect of a...

Takes care structural and behavioural aspect of a software system. Contains software usage, functionality, performance, economic, reuse, and technology constraints.

Define congestion and grade of service, Define congestion and grade of serv...

Define congestion and grade of service. Congestion : This is uneconomic to give sufficient equipment to carry all the traffic which could possibly be offered to a telec

Two parallel fetch-implement, Take a CPU that shows two parallel fetch-impl...

Take a CPU that shows two parallel fetch-implement pipelines for superscalar processing. Determine the performance improvement over scalar pipeline processing and no-pipeline proce

How to information transfer from one register to another, Q. How to Informa...

Q. How to Information transfer from one register to another? Information transfer from one register to another is designated in symbolic notation by a replacement operator. For

List-processing without using suppress-dialog, What happens if we use Leave...

What happens if we use Leave to list-processing without using Suppress-Dialog? If we don't use Suppress-Dialog to next screen will be viewed but as empty, when the user presse

C++.., how to swap to nunbers

how to swap to nunbers

Computer engineering designing, How the production of metal contributes to ...

How the production of metal contributes to computer engineering designing?

Logical user-centered interactive design methodology, Question: Logical...

Question: Logical User-Centered Interactive Design Methodology is a methodology that identifies six clear stages to help in software development while keeping the user in mind.

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages