Is there a scheme for servicing disk requests that we would be even less inclined to call disk scheduling than FCFS?
What will be an ideal response?
We could certainly choose the requests at random. Some people would argue that this
would deliver even worse performance than FCFS, but on reflection one realizes that random
and FCFS should perform identically, since we are assuming random arrivals of disk requests
to begin with. In the text we pointed out several examples, however, where disk requests do not arrive randomly, so in fact FCFS probably would tend to be at least a bit better than random.
In addition, a purely random scheduling algorithm allows for indefinite postponement
because an unlucky request might never be chosen.
You might also like to view...
A class may have ________ default constructor(s) and ________ destructor(s).
A) only one, only one B) only one, more than one C) more than one, only one D) more than one, more than one E) no, only one
Given the following code snippet, what will be displayed on the web page if the user enters 4 at the prompt?
``` var myNum = prompt("Enter a number:"); var result = myNum + myNum; document.write(result); ``` a. 44 b. 8 c. NaN d. 4 4
The Print method of class PrintDocument sends a _____ object to the printer for printing.
a) Graphics b) PrintDocument c) PrintPreviewDialog d) Brush
The ____ Site Summary category is used to ensure that all site pages are attached to the correct templates and style sheets.
A. Files B. CSS C. Shared Content D. Problems