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

Naïve bayes algorithm for text classification, Assignment 3: Naïve Bayes al...

Assignment 3: Naïve Bayes algorithm for text classification. First part: In this assignment, we will redo the task of classifying documents (assignment 2) using the same R

Explain about bus of register transfer, Explain about Bus of register trans...

Explain about Bus of register transfer Since a computer has   several registers, paths must be provided to transfer information among registors. If separate lines are used amon

Explain cgi standard, Explain CGI standard. The CGI Standard: Techno...

Explain CGI standard. The CGI Standard: Technology utilized for building dynamic web documents is termed as Common Gateway Interface (CGI). The CGI standard gives how a serv

Types of structure charts, Types of Structure Charts Transaction struc...

Types of Structure Charts Transaction structure - control module calls subordinate modules, each of which handles a certain transaction More afferent processes Le

Using binary search, A sorted file having 16 items. Using binary search, th...

A sorted file having 16 items. Using binary search, the maximum number of comparisons to find for an item in this file is The maximum number of comparison is 4

What is the main problem with segmentation, What is the main problem with s...

What is the main problem with segmentation? Problem with segmentation (i) Is with paging, such mapping needs two memory references per logical address that slows down the

What is the principle of locality, What is "the principle of locality"? ...

What is "the principle of locality"? It's the nature of the processes that they refer only to the small subset of the total data space of the process. I.e. the process frequ

Show division and multiplication operation, Q. Show Division and multiplica...

Q. Show Division and multiplication operation? These operations can be represented as x + y = (N x   × 2 Ex-Ey + N y ) × 2 Ey and x-y = (N x × 2 Ex-Ey -N y ) × 2 Ey

Explain various fields in ipv6 base header, Explain various fields in IPV6 ...

Explain various fields in IPV6 base header? Although IPv6 base header is double as large as an IPv4 header, this contains less information. Given diagram demonstrates the forma

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