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

What is common type system, What is "Common Type System" (CTS)? CTS e...

What is "Common Type System" (CTS)? CTS explain all of the basic types that can be used in the .NET Framework and the operations performed on those type. All this time we hav

Using binary search, A sorted file having 16 items. Using binary search, th...

A sorted file having 16 items. Using binary search, the maximum number of comparisons to find for an item in this file is The maximum number of comparison is 4

Explain fundamental models of inter process communication, Explain the two ...

Explain the two fundamental models of inter process communication. Two kinds of message passing system are given as: (a) Direct Communication : Along with direct communicat

Explain the term granularity, Granularity Granularity refers to the qua...

Granularity Granularity refers to the quantity of computation done in concurrent relative to the size of whole program. In concurrent computing, granularity is a qualitative me

Console application with a class, Make a console application with a class '...

Make a console application with a class 'Account' having variables as id(int) and name (String).Add property 'account-no' which can be set andget. Add a 'ReadOnly' property 'IntRat

C code for inverted index implementation, c code for inverted index impleme...

c code for inverted index implementation

What is algorithm design technique, What is Algorithm Design Technique? ...

What is Algorithm Design Technique? An algorithm design method is a general approach to solving problems algorithmically that is applicable to a variety of proble

Describe critical directive in fortan, Q. Describe Critical Directive in FO...

Q. Describe Critical Directive in FORTAN? The critical directive permits one thread executes associated structured block. When one or more threads attain critical directive the

Convert, haw to convert context free grammar to regular grammar

haw to convert context free grammar to regular grammar

Specifying constraint problems, Specifying Constraint Problems: Howeve...

Specifying Constraint Problems: However as with most successful "AI" techniques there constraint solving is all about solving problems as: somehow phrase the intelligent task

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages