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

Explain general graph directory, General graph directory The serious pr... General graph directory The serious problem with using an acyclic-graph structure is ensuring that there are no cycles. When we insert links to an existing tree-structured dire

Define a set of methods that allow executing a program, A set of methods th... A set of methods that allow executing a program which is not completely in memory   is called A set of methods that allow executing a program which is not completely in memory

Operation management, trace the historical evolution of the operations mana... trace the historical evolution of the operations managent from themainly rural agricultural era of the artisans to the present day industrial revolution, high technoligical advance

Index node (inode), A file system depends on data structures about the file... A file system depends on data structures about the files, beside the file structure. The former is named metadata-data that defines data. Each file is accumulated with an inode, wh

Define page stealing, Define Page stealing    Page stealing is taking ... Define Page stealing    Page stealing is taking page frames another working sets

Define process swapping , Swapping : Whole process is moved from the swap... Swapping : Whole process is moved from the swap machine to the main memory for execution. Process size must be equal or less than to the used main memory. It is easier to exe

Explain process scheduling in multiprogramming, Normal 0 false ... Normal 0 false false false EN-US X-NONE X-NONE MicrosoftInternetExplorer4

Nachos file system, File System Interface and Implementation The Nachos ... File System Interface and Implementation The Nachos file system, as distributed, uses a single-level index allocation method for data allocation of files. In the current design,

Naming scheme for servers in an enterprise, Problem: Within a corporate... Problem: Within a corporate environment, there are usually many servers located across various departments. Naming of servers is often a tedious task. In many circumstances, w

Explain the thread contextual data, Explain the Thread Contextual Data  ... Explain the Thread Contextual Data  Threads in Net Ware carry additional context as well. Per-thread, stacks, errno, Net Ware Errno, t_errno and others are available to the ap