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

Ldb need not be defined in the abap/4 dictionary, All nodes in the structur...

All nodes in the structure of LDB need not be defined in the ABAP/4 Dictionary False. One has to describe all nodes in the Dictionary or single has to select all nodes that a

How do active web pages work, How do active web pages work? Describe with a...

How do active web pages work? Describe with a small example. Active Web Pages: An active document is not completely specified through the server. Instead an active documen

Example of assembly program, Sample Program In this program we only dis...

Sample Program In this program we only display: Line Offset Numbers -----------------Source Code-----------------

Address translation with dynamic partition, Address translation with dynami...

Address translation with dynamic partition : Given figure shows the address translation process with dynamic partitioning, where the processor provides hardware support for

C++, Byteland county is very famous for luminous jewels. Luminous jewels ar...

Byteland county is very famous for luminous jewels. Luminous jewels are used in making beautiful necklaces. A necklace consists of various luminous jewels of particular colour. Nec

Why eprom chips are mounted in packages, Why EPROM chips are mounted in pac...

Why EPROM chips are mounted in packages that have transparent window? Since the erasure needs dissipating the charges trapped in the transistors of memory cells. This can be co

Explain the low level language - computer programming, Explain the Low Leve...

Explain the Low Level Language - Computer Programming? An assembly language or a machine language is known as Low-level language which are closer to the hardware than are high-

Chains of inference, Chains of Inference: Now we have to look at how t...

Chains of Inference: Now we have to look at how to get an agent to prove a given theorem using various search strategies? Thus we have noted in previous lectures that, there i

Where virtual memory is used, Where Virtual memory is used ? Ans. Virtu...

Where Virtual memory is used ? Ans. Virtual memory is utilized in all main commercial operating systems.

Recent parallel programming models, A model for parallel programming is an ...

A model for parallel programming is an abstraction and is machine architecture independent. A model can be executed on several hardware and memory architectures. There are various

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages