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

Extjs, tell some thing about htmleditor in extjs whether it contains attach...

tell some thing about htmleditor in extjs whether it contains attachment button or not

Define stack segment, Q. Define Stack segment ? 8086 Microprocessor su...

Q. Define Stack segment ? 8086 Microprocessor supports Word stack. Stack segment parameters tell the assembler to alert linker that this segment statement states the program s

Spatial domain interpolation, Transfer Domain Create an interpolation al...

Transfer Domain Create an interpolation algorithm using the fast Fourier transformer. Assess the performance of the algorithm by using the PSNR and SSIM.  Compare your results w

Performance and issues in pipelining-throughput, Performance and Issues in ...

Performance and Issues in Pipelining Throughput:  Throughput of a pipeline can be defined as the number of results that have been getting per unit time. It can be denoted as:

Define busy waiting and spinlock, Define busy waiting and spinlock.  Wh...

Define busy waiting and spinlock.  When a process is in its critical section, any other process that tries to enter its critical section must loop continuously in the entry cod

What is parsing, a. Define parsing? Give difference among top down parsing ...

a. Define parsing? Give difference among top down parsing and bottom up parsing. b. Determine the self-relocating programs? Why self-relocating programs are less efficient then

Entrepreneurship, explain succession planning and strategies for harvesting...

explain succession planning and strategies for harvesting and ending the venture

Explain the physical and logical paths in a computer, How is communication ...

How is communication between computers established in Internet. What characteristics need to be defined in a communication protocol? Explain the physical and logical paths in a com

Write hit policies, Write Hit Policies: Write through o   Upd...

Write Hit Policies: Write through o   Update next level on every write o   Cache is always clean o   A lots of traffic to next level (mostly write) Write

Multithreaded architecture, Multithreaded Architecture:  It is clear now th...

Multithreaded Architecture:  It is clear now that if we give many contexts to multiple threads, then processors with multiple contexts are known as multithreaded systems. These sys

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