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

Diffrentiate b/w shared memory and distributed memory, Shared Memory  ...

Shared Memory  Shared Memory refers to memory component of a computer system in which the memory can accessed directly by any of the processors in the system. Distributed

How to format expressions by using vba, Format functions can be used to for...

Format functions can be used to format lot of the expressions such as money, time, date, percentages and numbers. These functions are much easier to use in VBA. User defined date,

Register data type as sequential element, Reg data type as Sequential eleme...

Reg data type as Sequential element module reg_seq_example( clk, reset, d, q); input clk, reset, d; output q; reg q; wire clk, reset, d; always @ (posedge clk or

What is the application of e-commerce in home shopping, What is the applica...

What is the application of E-Commerce in Home Shopping? Application of E-Commerce in Home Shopping: Television broadcast of goods for purchase sent it directly to a viewe

Which job is admitted to the system for processing, Jobs which are admitted...

Jobs which are admitted to the system for processing is called ? Ans. Long-term scheduling is admitted to the system for processing.

Explain priority interrupt, What is priority interrupt? A priority inte...

What is priority interrupt? A priority interrupt is an interrupt that establishes a priority over the various sources to verify which condition is to be serviced first when two

Subsequent statements set every element of matrix, Q. Subsequent statements...

Q. Subsequent statements set every element of matrix? Let a= [2,4,6,8,10], b=[1,3,5,7,9], c=[0,0,0,0,0] Consider the subsequent program section FORALL (i = 2:4)   a(i)

Bit manipulation techniques, We can also use the logical operators to numbe...

We can also use the logical operators to numbers directly and  perform simple bit manipulation . The operators are     &  Bitwise AND     |  Bitwise OR     ^  Bitwise exclusiv

Illustrate the system architecture, Question: a) Explain why pervasive...

Question: a) Explain why pervasive computing can be termed as a "technology that disappears". b) List and describe four main components of a MOTE used in Wireless Sensor N

Explain types of assembly programs, Q. Explain types of assembly programs? ...

Q. Explain types of assembly programs? Assembly language programs can be written in two manners: COM Program: Having all segments as part of one segment EXE Program: that hav

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd