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

What is interrupt vector table, Interrupt vector table is always created in...

Interrupt vector table is always created in first 1K area of the memory. Explain why? When CPU receives an interrupt type number from PIC, it uses this number to look up corres

How to use http and world wide web, Q. How to use Http and World Wide Web? ...

Q. How to use Http and World Wide Web? Http and World Wide Web One of the most frequently used services on the Internet is the World Wide Web (WWW). The application proto

Explain a schematic diagram of thousand line exchanges, Using a combination...

Using a combination of uniselectors and two motion selectors draw a schematic of thousand line exchanges. The schematic diagram for such an exchange is demonstrated in Fig. All

Explain the potential role of information technology, Question 1: Descr...

Question 1: Describe the five maturity levels of KM that an organization faces when adopting the Frid's KM framework. Question 2: (a) Describe three major issues that

The advantages of specifying parameters during instantiation, The advantage...

The advantages of specifying parameters during instantiation method are: -  All values to all the parameters do not need to be specified. Only those parameters that are assigne

Digital Design, Design a serial 2’s complementer with a shift register and ...

Design a serial 2’s complementer with a shift register and a flip-flop

Explain about flip-flops, Explain about Flip-Flops  Flip-Flops are also...

Explain about Flip-Flops  Flip-Flops are also called bistable multivibrator.  A flip-flop is capable of storing 1 bit of binary data.  It has two stable states- 'one' and 'zero

What is sap locking, What is SAP locking? It is a mechanism for describ...

What is SAP locking? It is a mechanism for describing and applying logical locks to database objects.

What is the pcm pulse or symbol transmission rate, An analog information si...

An analog information signal, whose maximum frequency is 6000Hz, is to be transmitted using a PCM system. The quantization error must not exceed the ±1 % of the peak-topeak analog

Show a string in assembly language, Q. Show a string in assembly language? ...

Q. Show a string in assembly language? MOV AH, 09H MOV DX, OFFSET   BUFF INT    21H Here data in input buffer stored in data segment is intended to be displayed on mo

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