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

Input-output techniques, After going through details of device interfaces n...

After going through details of device interfaces next point to be discussed is how the interface can be used to support I/O from devices. Binary information received from an extern

What is arithmetic and logic unit, What is Arithmetic and Logic Unit Ar...

What is Arithmetic and Logic Unit Arithmetic and Logic Unit: The ALU is the 'core' of any processor. It implements all arithmetic operations (addition, multiplication, subtract

The major underlying concepts of object orientation, Objects, messages, cla...

Objects, messages, class, inheritance and polymorphism are the major concepts of object orientation.

Write the factors considered in designing an i/o subsystem, Write the facto...

Write the factors considered in designing an I/O subsystem? 1. Data Location: Device selection, address of data within device ( track, sector etc) 2. Data transfer: Amount

A digital signature, A digital signature is encrypting information

A digital signature is encrypting information

Advantages and drawbacks of mealy and moore machine, What are the advantage...

What are the advantages and drawbacks of mealy and moore machine? Advantages and drawbacks: Into Mealy as the output variable is a function both state and input, changes o

#title.un ba lance out put differential amplitude, #questi on.. How it wor...

#questi on.. How it works explain

Describe about address space and memory space, Q. Describe about Address Sp...

Q. Describe about Address Space and Memory Space? An address used by a programmer will be termed as a virtual address and set of such addresses the address space. An address in

Illustrate high performance fortran, In 1993 High Performance FORTRAN Forum...

In 1993 High Performance FORTRAN Forum which is a group of academicians and many leading software and hardware vendors in field of parallel processing established an informal langu

What is computer to computer communication, Computer to computer communicat...

Computer to computer communication is: (A) Simplex (B) Duplex (C) Half Duplex (D) Both Duplex and Half D

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages