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

Memory management, what is hashed page tables & explain of there work & fig... what is hashed page tables & explain of there work & figure

Program that will input an interger target value, When you turn in an assig... When you turn in an assignment to be graded in this class, you are making the claim that you neither gave nor received assistance on the work you turned in (except, of course, assi

What are the operations that can be performed on a directory, What are the ... What are the operations that can be performed on a directory? The operations that can be performed on a directory are Search for a file Create a file Delete a

How program execute in operating system, Q. How Program execute in operatin... Q. How Program execute in operating system? Program execution- The operating system fills the contents (or sections) of a file into memory as well as begins its execution. A us

Explain fixed partitioning in memory management, FIXED PARTITIONING Us... FIXED PARTITIONING Using fixed partitioning we are able to allocate the memory Here we are dividing the memory into a few fixed partitions.Every partition may not be of the si

Basic server model, Suppose we want to program a Web server; we could easil... Suppose we want to program a Web server; we could easily do so without using concurrency, as follows: while(true) wait connection read from socket and parse url look up url cont

What is the design issues involved in segmentation?, SEGMENTATION HARDWARE ... SEGMENTATION HARDWARE An execution to map two-dimensional user-defined addresses into one-dimensional physical addresses. This mapping is affected by means of segment table. Ev

Linear programming problem, A paper mill produces two grades of paper viz.,... A paper mill produces two grades of paper viz., X and Y. Because of raw material restrictions, it cannot produce more than 400 tons of grade X paper and 300 ton

Hashed page table, W hat is hashed page table & method of hashed page tabl... W hat is hashed page table & method of hashed page table with details

Explain the booting process for a windows xp system, Q. Explain the booting... Q. Explain the booting process for a Windows XP system? Answer: (1) Since the hardware powers on the BIOS begins executing From ROMand loads as well as executes the bootstrap