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

Perform subtraction in base 5 using r and r-1 complement, Q Write a menu dr...

Q Write a menu driven program to perform subtraction in base 5 using r and (r-1) complement with necessary validations.

What are assembly attributes, Attributes are declarative tags in code that ...

Attributes are declarative tags in code that put in additional metadata into an assembly.

Describe the basic aspects of ENIAC, Q. Describe the basic aspects of ENIAC...

Q. Describe the basic aspects of ENIAC? The main aspects of ENIAC can be summarized as: ENIAC was a general purpose-computing machine in that vacuum tube technology was

What are latches and flipflops, What are latches and flipflops? There a...

What are latches and flipflops? There are two types of circuits as follows: a. Combinational b. Sequential Flipflops and latches both come into the category of "sequen

Explain classification based on grain size, Explain Classification Based On...

Explain Classification Based On Grain Size This categorization is based on distinguishing the parallelism in a program to be executed on a multiprocessor system. The concept is

What is throughput of a system, Throughput of a system is? Ans. "Throug...

Throughput of a system is? Ans. "Throughput" of a system is no. of programs processed by this per unit time.

Minimum total number of shelv, Write a program that finds the minimum total...

Write a program that finds the minimum total number of shelv, C/C++ Programming

Explain what is defecttracker, DefectTracker from Pragmatic Software - D...

DefectTracker from Pragmatic Software - Defect Tracker is a fully web-based defect tracking and hold up ticket system that manages issues and bugs, customer needs, test cases, a

Associative mapping - computer architecture, Associative Mapping: It i...

Associative Mapping: It is a more flexible mapping technique A primary memory block can be placed into any specific cache block position. Space in the cache may be

What is presentation layer, Q. What is Presentation layer? Presentatio...

Q. What is Presentation layer? Presentation layer: When two hosts are communicating with each other they might use different coding standards and character sets for represent

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