Q. Presume that a scheduling algorithm at the level of short-term CPU scheduling favours those processes that have used the least processor time in the recent past. Why this algorithm favour I/O-bound programs and yet not permanently starves CPU-bound programs?

Answer: It will favour the I/O-bound programs for the reason that of the relatively short CPU burst request by them however the CPU-bound programs will not starve for the reason that the I/O-bound programs will relinquish the CPU relatively often to do their I/O.

Posted Date: 7/27/2013 2:43:44 AM | Location : United States

Ask an Expert

Related Discussions:- Permanently starves cpu-bound programs, Assignment Help, Ask Question on Permanently starves cpu-bound programs, Get Answer, Expert's Help, Permanently starves cpu-bound programs Discussions

Write discussion on Permanently starves cpu-bound programs
Your posts are moderated

Write your message here..

Related Questions

List post-installation procedures that need to be performed, Problem: (... Problem: (a) Based on your experience in setting up Windows 2003 Server operating system, briefly describe the twelve different steps in which the installation is conducted du

What is an operating system and its type, What is an operating system and w... What is an operating system and what are the different types of operating systems? Operating System An Operating System or OS is a software program that allows the compute

Transferring files from windows to unix, Transferring files from Windows to... Transferring files from Windows to Unix Be very careful transferring files from Windows to Unix. If you do transfer a file from Windows to Unix open the file, in Unix, using vi

Major advantages of microkernel approach to system design, Q. What are the ... Q. What are the major advantages of the microkernel approach to system design? Answer: Benefits usually include the following (a) Adding a new service doesn't require modify

WINDOWS XP, DESIGN GOALS OF WINDOWS XP.DESCRIBE IN DETAIL. DESIGN GOALS OF WINDOWS XP.DESCRIBE IN DETAIL.

Explain fifo page replacement, FIFO page replacement This is the easie... FIFO page replacement This is the easiest page replacement algorithm. At this juncture the 1 st page entering is the 1 st to leave that is the oldest page leaves. To execute

What is demand paging, What is Demand paging? Virtual memory is commonl... What is Demand paging? Virtual memory is commonly executed by demand paging. In demand paging, the pager brings only those essential pages into memory instead of swapping in a

Information system, using the transformation process model and system think... using the transformation process model and system thinking concepts explain the key operation of TGL works.

Graph - plotting job, This exercise uses a graph-plotting program ( gnuplot... This exercise uses a graph-plotting program ( gnuplot ) to convert tabular data into an image. This is a technique that is very widely used to visualize scientific data; with app

Real time operating system, PART A Question 1 Using your own words... PART A Question 1 Using your own words, explain what a continuous random variable and a continuous probability density function are. Give examples. Question 2 Gi