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

Give difference between top down and bottom up parsing, Give difference bet...

Give difference between top down parsing and bottom up parsing. Top down parsing: Specified an input string, top down parsing tries to derive a string identical to this by s

What is mini frame size where propagation speed is 200 m µs, A CSMA/CD bus ...

A CSMA/CD bus spans a distance of 1.5 Km. If data is 5 Mbps, What is minimum frame size where propagation speed in LAN cable is 200 m µs. Usual propagation speed in LAN cables

Arithmetic pipeline, Arithmetic Pipeline The complex arithmetic operati...

Arithmetic Pipeline The complex arithmetic operations like floating point and multiplication operations use a lot of the time of the ALU. These operations can also be pipelined

Big – endian and little- endian representations, Explain Big - Endian and L...

Explain Big - Endian and Little- Endian representations Ans: The Big- endian is used where lower byte addresses are used for the more significant bytes (leftmost bytes) of the

Number of addresses in an instruction, Generally the Instruction Set Archit...

Generally the Instruction Set Architecture (ISA) of a processor can be distinguished using five categories: Operand Storage in the CPU - Where are the operands kept other t

Define syntax of mpi_scatter function, Q. Define syntax of MPI_Scatter func...

Q. Define syntax of MPI_Scatter function? MPI_Scatter(Sendaddr, Scount, Sdatatype, Receiveaddr, Rcount, Rdatatype, Rank, Comm): 'Using this function process with rank' ran

Explain asynchronous decade counter, Draw the circuit diagram of Asynchrono...

Draw the circuit diagram of Asynchronous decade counter and explain its working. Ans: To design a circuit diagram of decade asynchronous counter initially we dr

Define macros, Define macros. A macro is a pre-processor directive wh...

Define macros. A macro is a pre-processor directive which is a program that processes the source code before it passes by the compiler. These are placed in the source program

A subroutine can be terminated unconditionally using exit, A subroutine can...

A subroutine can be terminated unconditionally using EXIT. True.

Operation research, iconic model problem

iconic model problem

Write Your Message!

Name

Email id

Message

Verfication Code

User Account

All Pages