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

What is independent process, What is independent process? A process is ... What is independent process? A process is independent it cannot influence or be affected by the other processes implementing in the system. Any process does not share data with

What are the five major activities of an operating system, What are the fiv... What are the five major activities of an operating system in regard to process management? The creation and deletion of both user and system processes The suspension and res

What is meant by file management systems?, What is meant by file management... What is meant by file management systems? File Management systems are as well referred to as simply a file system .File system is the system that an OS operating system or prog

Define drawback of distributed systems, Define drawback of Distributed syst... Define drawback of Distributed systems Reliability is a drawback of Distributed systems

Define throughput, Define throughput? Throughput in CPU scheduling is t... Define throughput? Throughput in CPU scheduling is the number of processes that are completed per unit time. For long processes, this rate might be one process per hour; for sh

Define jobs which are admitted to the system for processing, Define the Job... Define the Jobs which are admitted to the system for processing is called The Jobs which are admitted to the system for processing is known as long-term scheduling.

Discuss distributed file system caching, Problem: (a) Discuss Distribut... Problem: (a) Discuss Distributed File System Caching. (Your discussion should include the goal and architecture of distributed file system caching and the various possible c

What is segmentation?, What is segmentation? In a segmented memory mana... What is segmentation? In a segmented memory management scheme a programmer views a program to be collection of program components called as segments. Every segment is a logical

Write a note on threads, Question 1 Explain (a) tightly coupled systems   ... Question 1 Explain (a) tightly coupled systems                               (b) Loosely coupled system Question 2 Describe the RPC model Question 3 Write a note o

Unix and linux commands, To explore the UNIX file system, use basic UNIX co... To explore the UNIX file system, use basic UNIX commands and use a text editor. Task:   1.      Logon to Linux. 2.      Create a directory "Unix" under your home d