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

Terms in propositional model, Terms in Propositional model: There in f...

Terms in Propositional model: There in first-order logic allows us to talking about properties of objects that the first job for our model (Δ, Θ) is to assign a meaning to the

Universal serial bus - computer architecture, Universal Serial Bus - comput...

Universal Serial Bus - computer architecture: USB Universal Serial Bus Speed Low-speed(1.5 Mb/s) High-speed(480 Mb/s) Full-speed(12 Mb/s) De

Execution error and compilation error, Execution error and compilation erro...

Execution error and compilation error: Errors like as mismatch of data types or array out of bound error are called as execution errors or runtime errors. These errors are us

Explain traffic handling capacity, Traffic Handling Capacity is given by ...

Traffic Handling Capacity is given by (A) Switching capacity × Theoretical maximum load (B) Switching capacity / Theoretical maximum load (C) Theoretical maximu

Computer graphics, list out of merit and de-merit plasma display

list out of merit and de-merit plasma display

SERVER, How to configure TSM server

How to configure TSM server

Is it possible to create graph form spreadsheets, Is it possible to create ...

Is it possible to create graph form spreadsheets For example IF G5 > 100 THEN "Y" ELSE "N" - It's also possible to create graphs and charts from spreadsheets (such as using

Average number of instructions, Consider a processor with a 4-stage pipelin...

Consider a processor with a 4-stage pipeline. Each time a conditional branch is encountered, the pipeline must be flushed (3 partially completed instructions are lost). Determine

Write a c program to sort in ascending order of n numbers, Write a C progra...

Write a C program to sort in ascending order of n numbers. # include # include void main() { int a[25],no,i,j,m,t; clrscr(); printf("\nEnter Total number

Abap/4 module can "branch to " or "call" the next screen, The commands thro...

The commands through Which an ABAP/4 Module can "branch to " or "call" the next screen are Set screen Call screen , Leave screen, Leave to screen

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages