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

Enforce memory protection at compile time?, Why is it not possible to enfor... Why is it not possible to enforce memory protection at compile time?   Every process should be protected against unwanted interference by other process, whether intentional or

Multiprogramming, explain how response time are reduced by allowing time sh... explain how response time are reduced by allowing time sharing on top of multiprogramming

How can the deadlock be prevented?, How can the deadlock be prevented? ... How can the deadlock be prevented? To evade deadlocks first we will have to obtain the information about how resources are to be requested. And as well we should make sure that

Explain lru page replacement in detail, LRU page replacement In least ... LRU page replacement In least lately used page replacement algorithm we will replace that page that hasn't been used for the longest period of time. This is similar as an opti

What is a pure demand paging, What is a pure demand paging? When starti... What is a pure demand paging? When starting implementation of a process with no pages in memory, the operating system sets the instruction pointer to the first instruction of t

Define system call, Define System Call A system call is a request that ... Define System Call A system call is a request that is made by any program to the operating system for carrying out tasks - picked from a predefined set - which the said program

Explain rehashing to handle collision, Explain Rehashing to Handle Collisio... 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

Explain bounded buffer and unbounded buffer, Explain bounded buffer and unb... Explain bounded buffer and unbounded buffer. Here in a producer-consumer problem the producer process produces information that is consumed by a consumer process. At this time

Explain the exit (status) function, Explain the Exit (status) Function  ... Explain the Exit (status) Function  Exit function causes the calling process to be terminated. Actually, all file descriptors are immediately closed but the process is   not

Producer - consumer system, In this exercise we are going to use  pthread()... 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