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

Which processing is not a part of synthesis phase, Which processing is no...

Which processing is not a part of Synthesis phase? Ans. Perform LC processing is not a part of Synthesis phase.

Explain the relationship b/w translated & load time address, Explain the re...

Explain the relationship amongst Translated address and Load time address. Translated address: Address assigned through the translator Load time address: Address ass

What are the major characteristics of a pipeline, What are the major charac...

What are the major characteristics of a pipeline? The major characteristics of a pipeline are: a) Pipelining cannot be executed on a single task, as it works by splitting mu

A subroutine can contain nested form and endform blocks, A subroutine can c...

A subroutine can contain nested form and endform blocks. False.

Hrm, hrm digrams

hrm digrams

How many flip-flops are required to construct mod 30 counter, How many flip...

How many flip-flops are required to construct mod 30 counter ? Ans. Mod - 30 counter +/- requires 5 Flip-Flop as 30 5 . Mod - N counter counts overall ' N ' number of state

What are the exceptions encountered for fp operation, What are the exceptio...

What are the exceptions encountered for FP operation? The exceptions encountered for FP operation are overflow, underflow. /0, inexact and invalid values.

The maximum number of dimensions an array can have in c, The maximum number...

The maximum number of dimensions an array can have in C is C permits arrays of three or more dimensions. The exact limit is examined by the compiler.

Data Warehousing Job Scheduling, 1) Define a job scheduling strategy that w...

1) Define a job scheduling strategy that will meet business requirement of reporting availability by 6am CST for the following cubes? Show the job scheduling dependencies in a pict

Control hazard and delayed branching, Described Instruction or control haza...

Described Instruction or control hazard? Ans: The pipeline can be stalled due to delay in the availability of an instruction. For instance, this may be a result of a miss in t

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