ACM Home Page
Please provide us with feedback. Feedback
A comparative analysis of disk scheduling policies
Full text PdfPdf (674 KB)
Source
Communications of the ACM archive
Volume 15 ,  Issue 3  (March 1972) table of contents
Pages: 177 - 184  
Year of Publication: 1972
ISSN:0001-0782
Authors
Toby J. Teorey  Univ. of Wisconsin, Madison
Tad B. Pinkerton  Univ. of Wisconsin, Madison
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 12,   Downloads (12 Months): 55,   Citation Count: 68
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/361268.361278
What is a DOI?

ABSTRACT

Five well-known scheduling policies for movable head disks are compared using the performance criteria of expected seek time (system oriented) and expected waiting time (individual I/O request oriented). Both analytical and simulation results are obtained. The variance of waiting time is introduced as another meaningful measure of performance, showing possible discrimination against individual requests. Then the choice of a utility function to measure total performance including system oriented and individual request oriented measures is described. Such a function allows one to differentiate among the scheduling policies over a wide range of input loading conditions. The selection and implementation of a maximum performance two-policy algorithm are discussed.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Abate, J., and Dubner, H. Optimizing the performance of a drum-like storage. IEEE Trans. Comput. C-18, 11 (Nov. 1969), 992-997.
 
2
Dahl, O.J., and Nygaard, K. SIMULA--A language for programming and description of discrete event systems: Introduction and users' manual. Norwegian Computing Center, Oslo, 1966.
 
3
Denning, P.J. Effects of scheduling on file memory operations. Proc. AFIPS 1967 SJCC, Vol. 30, AFIPS Press, Montvale, N.J., pp. 9-21.
 
4
Feller, W. An bltroduction to Probability Theory and Its Applications, Vol. 1, 3rd ed. Wiley, New York, 1968.
5
 
6
Introduction to IBM System/360 direct access storage devices and organization methods, C20-1649-4, IBM.
 
7
Little, J.D.C. A proof for the queuing formula: L = XW. Oper. Res. 9, 3 (1961), 383-387.
 
8
 
9
 
10
Seaman, P.H., Lind, R.A., and Wilson, T.L. An analysis of auxiliary-storage activity. IBM Syst. J. 5, 3 (1966), 158-170.
 
11
Weingarten, A. The analytical design of real-time disk systems. Proc. IFIP Congr. 1968, North Holland Pub. Co., Amsterdam, pp. D131-D137.

CITED BY  68

Collaborative Colleagues:
Toby J. Teorey: colleagues
Tad B. Pinkerton: colleagues