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

Unix for multiprocessor system, The UNIX operating system for a multiproces...

The UNIX operating system for a multiprocessor system has a number of extra features as compared to normal UNIX operating system. Let's first consider the design objectives of mul

Difference between next and continue clause, The difference among the next ...

The difference among the next and continue verb is that in the continue verb it is used for a situation where there is no EOF condition that is the records are to be accessed again

Convert the following into sop form, Convert the following into SOP form ...

Convert the following into SOP form 1. (A+B) (B'+C) (A'+ C) 2. (A'+C) (A'+B'+C') (A+B') 3. (A+C) (AB'+AC) (A'C'+B)

Computer graphics, what is depth buffer algorithm?

what is depth buffer algorithm?

What are the features common in most of the websites, What are the features...

What are the features common in most of the websites Following general features must be found on most web sites in one form or another (this list is by no means exhaustive):

Which work process triggers database changes, Which work process triggers d...

Which work process triggers database changes? Update work process

Minimum total number of shelv, Write a program that finds the minimum total...

Write a program that finds the minimum total number of shelv, C/C++ Programming

Tightly coupled system- shared memory system, Tightly Coupled System- Share...

Tightly Coupled System- Shared Memory System Shared memory multiprocessorshas has following description: Every processor commune through a shared global memory. For

Recordable cds and dvds, Optical disk becomes an attractive alternative for...

Optical disk becomes an attractive alternative for backing up information from hard disk drives and employs large text, audio and video data. Advent of CD-ROM-R and DVD-ROM-R has b

Xml can play when dynamically generating html pages , Explain the role that...

Explain the role that XML can play when dynamically generating HTML pages from a relational database? Ans) Even if student has never participated in a project involving this typ

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages