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

Name the widely used language processor development tool, Name the widely u...

Name the widely used Language Processor Development Tools ( LPDTs). Widely used Language processor development tools are: Lex - A Lexical Analyzer Generator Lex assi

Software engineering, how to find the type of cohesion in a module

how to find the type of cohesion in a module

What do you mean by daisy chain, Q. What do you mean by Daisy chain? Th...

Q. What do you mean by Daisy chain? This scheme provides a hardware poll. With this scheme, an interrupt acknowledge line is chain by different interrupt devices. All I/O inter

Peer to peer system, Ask question #Minimum 1000 words accepted#

Ask question #Minimum 1000 words accepted#

What is the scope of public members in all classes, What is the Scope of pu...

What is the Scope of public/private/friend/protected/protected friend? Scope of public/private/friend/protected/protected friend. Visual Basic/Visual C# Public/pub

Asembly language programming, Ask question #Minimum Write a program to mask...

Ask question #Minimum Write a program to mask bits D3D2D1D0 and to set bits D5D4 and to invert bits D7D6 of the AX register. 100 words accepted#

Genetic algorithms - artificial intelligence, Genetic Algorithms: In s...

Genetic Algorithms: In such a scenario the evolutionary approach to "Artificial Intelligence" is one of the neatest ideas of all. Whether we have tried to mimic the functionin

Explain about 4-bit adder-subtractor circuit, Q. Explain about 4-bit adder-...

Q. Explain about 4-bit adder-subtractor circuit? Subtraction operation on binary numbers can be obtained by succession of addition operations only it implies that to achieve su

Diffrentiate between non-relocatable & relocatable programs, How non-reloca...

How non-relocatable programs are different from relocatable programs? Non relocatable program: It is one that cannot be made to execute in any type of area of storage other t

Explain the basic syntactic constructs through reductions, Recognition of b...

Recognition of basic syntactic constructs through reductions, this task is performed by? By Syntax analysis, recognition of fundamental syntactic constructs through reductions

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages