Permanently starves cpu-bound programs, Operating System

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







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
Related Questions
Explain in detail about ipc in linux

Explain the ExitThread Function used in the Windows NT ExitThread(ExitCode) The ExitThread( ) call is made to end the currently running thread. If the current thread is th

Q. What merit is there in having different time-quantum sizes on different levels of a multilevel queuing system? Answer: Processes that require more frequent servicing for ins

Define the properties of Interactive operating system Interactive:- This system is composed of many short transactions where the results of the next transaction may be unpred

What is macro expansion

Define a layer that is not of an IO management moduleĀ  MCS that is Management Control System is not of an IO management module

approaches to identify free memory area in a heap

What is the use of multiprogramming on individual processors ? In the usual multiprocessor, which is dealing with independent or coarse-grained synchronization granularity, it i

What is ERD? Entity Relationship Diagram is the graphical representation of the object relationship pair. It is mostly used in database applications.

Here are the conditions necessary for a deadlock to occur; note that all of them are necessary, and none is suf?cient: 1. ?nite resources: the resources are held in a mutually-e