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
What are the drawbacks of contiguous allocation of disk space? The disadvantages are a. Suffers from internal fragmentation b. Suffers from external fragmentation c. F

Explain the Real Time Operating System A real-time operating system comprises definite, fixed time constraints. Processing should be done in the defined constraints, or the sys

EXPLAIN THE SCAN SHUDDULING WITH DIAGRAM

Q. List three instances of deadlocks that aren't related to a computer system environment. Answer: Two cars passage a single-lane bridge from opposite directions.

Q. The accelerating search for described in subsequent exercise is typical of hard-disk drives. By contrast floppy disks and several hard disks manufactured before the mid-1980s t

Q. What kinds of services does the process manager provide? Define local procedure call? Answer: The process manager offers services for creating and deleting and using proce

Explain the Spawnvp Function used in the netware Spawnvp(flags, execNmae, argv)   This function executes  similarly to spawnlp( ) except that parameters are passed as a v

What are the methods for handling deadlocks? The deadlock problem can be dealt with in one of the three ways: a. Use a protocol to prevent or avoid deadlocks, ensuring that

Question 1 Describe about the shells of Linux operating system Question 2 Describe briefly about GNOME desktop Question 3 Write note on the following- Encryp

How many disk operations are needed to fetch the i-node for the file /usr/ast/courses/os/handout.t? Assume that the i-node for the root directory is in memory, but nothing else alo