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
In this exercise we are going to use  pthread()to simulate the dynamics between a warehouse, factory and retail. The factory produces product by using parts supplied by the warehou

explain how response time are reduced by allowing time sharing on top of multiprogramming

Define the Non Monolithic Coding First off, client - server developers must adopt a new programming mindset. Much as with the shift to object - oriented design, developers sho

List the Coffman's conditions that lead to a deadlock. Mutual Exclusion : Only one process might be use a critical resource at a time. Hold & Wait: A process may be alloc

Q. Under what conditions do page faults occur? Explain the actions taken by the operating system when a page fault occurs. Answer: A page fault take places when an access to

Define the Main reason to encrypt a file Major reason to encrypt a file is secure it for transmission.

Q. Give the reasons why Windows XP, Solaris and Linux implement multiple locking mechanisms. Explain the circumstances under which they use mutexes, spinlocks, semaphores, adaptiv

What is the main function of the memory-management unit? The runtime mapping from virtual to physical addresses is done by a hardware device known as a memory management unit (

Explain Rehashing to Handle Collision Rehashing:  Re-hashing schemes make use of a second hashing operation while there is a collision. If there is an additional collision, we

Q. Describe the concept of transaction atomicity? Answer: A transaction is a sequence of read as well as writes operations upon some data followed by a commit operation. If the