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

Write a class driver , Create a class called  performance that records the ...

Create a class called  performance that records the information of a performance. The class should include at least five data items:  id,  title,  basePrice, startDate, endDate. Yo

Show the simple arithmetic application, Q. Show the Simple Arithmetic Appli...

Q. Show the Simple Arithmetic Application? The question is why can't we simply employ XCHG instruction with 2 memory variables as operand? To answer the question let's look int

Show the two ways in which warnings can be suppressed in php, Show the two ...

Show the two ways in which Warnings can be suppressed in PHP? 1) Stop an individual function call from producing an error message put the @ warning suppression Operator front o

Explain about multiple program multiple data, Q. Explain about Multiple Pro...

Q. Explain about Multiple Program Multiple Data? Like SPMD, MPMD is in fact a 'high level' programming model that can be built on any combination of previously described parall

What is a formal description for a programming language, A grammar for a pr...

A grammar for a programming language is a formal description of ? Structure is a formal description for a programming language.

Find the average of two values, Q. Find the average of two values? Find...

Q. Find the average of two values? Find the average of two values which are stored in  ; Memory locations named FIRST and SECOND  ; And puts result in memory location AVG

Memory, #all type of memory

#all type of memory

Difference between depth first and breadth first traversing, Explain the di...

Explain the difference between depth first and breadth first traversing techniques of a graph.   Depth-first search is dissimilar from Breadth-first search in the following way

Pipe, Your shell should accept and execute the pipe "|"  operator. This wil...

Your shell should accept and execute the pipe "|"  operator. This will look like the following: | The functionality of this operator is to execute command1 and send i

Embedded software, Embedded Software Intelligent products have becom...

Embedded Software Intelligent products have become commonplace for all consumer and industrial market. Embedded software stays in read only memory and is utilised to control

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