article

Free access

A comparative analysis of disk scheduling policies

Authors:

Toby J. Teorey,

Tad B. PinkertonAuthors Info & Claims

Communications of the ACM, Volume 15, Issue 3

Pages 177 - 184

https://doi.org/10.1145/361268.361278

Published: 01 March 1972 Publication History

PDF eReader

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

[1]

Abate, J., and Dubner, H. Optimizing the performance of a drum-like storage. IEEE Trans. Comput. C-18, 11 (Nov. 1969), 992-997.

Digital Library

Google Scholar

[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.

Google Scholar

[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.

Google Scholar

[4]

Feller, W. An bltroduction to Probability Theory and Its Applications, Vol. 1, 3rd ed. Wiley, New York, 1968.

Google Scholar

[5]

Frank, H. Analysis and optimization of disk storage devices for time-sharing systems. J.4CM 16, 4 (Oct. 1969), 602-620.

Digital Library

Google Scholar

[6]

Introduction to IBM System/360 direct access storage devices and organization methods, C20-1649-4, IBM.

Google Scholar

[7]

Little, J.D.C. A proof for the queuing formula: L = XW. Oper. Res. 9, 3 (1961), 383-387.

Digital Library

Google Scholar

[8]

Merten, A.G. Some quantitative techniques for file organization. Ph.D. Th., Tech. Rep. No. 15, U. of Wisconsin Comput. Center, 1970.

Digital Library

Google Scholar

[9]

Pinkerton, T.B. Program behavior and control in virtual storage computer systems. CONCOMP Proj. Rep. No. 4, Ph.D. Th., U. of Michigan, Apr. 1968.

Digital Library

Google Scholar

[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.

Digital Library

Google Scholar

[11]

Weingarten, A. The analytical design of real-time disk systems. Proc. IFIP Congr. 1968, North Holland Pub. Co., Amsterdam, pp. D131-D137.

Google Scholar

Cited By

View all

(2022)BibliographyStorage Systems10.1016/B978-0-32-390796-5.00023-1(641-693)Online publication date: 2022
https://doi.org/10.1016/B978-0-32-390796-5.00023-1
Thomasian A(2022)Disk drive data placement and schedulingStorage Systems10.1016/B978-0-32-390796-5.00012-7(197-222)Online publication date: 2022
https://doi.org/10.1016/B978-0-32-390796-5.00012-7
Yu J(2018)Multimedia Resource SchedulingEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_234(2403-2407)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-1-4614-8265-9_234
Show More Cited By

Recommendations

Survey and analysis of disk scheduling methods

Performance of many important computer applications depends on the performance of Hard Disk Drives (HDDs). Disk capacities and transfer rates have been increasing rapidly, but the improvement in disk access time is disappointingly slow. Caching and ...
Performance Comparison of Mirrored Disk Scheduling Methods with a Shared Non-Volatile Cache

Mirrored disks or RAID1 is a popular disk array paradigm, which in addition to fault-tolerance, doubles the data access bandwidth. This is important in view of rapidly increasing disk capacities and the slow improvement in disk access time. Caching of ...
Mirrored disk rouing and scheduling

Disk mirroring or RAID level 1 stores the same data twice, on two independent disks, to ensure that all single disk failures can be tolerated. This high storage overhead is acceptable in view of the drop in storage cost per gigabyte and rapidly ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

Communications of the ACM Volume 15, Issue 3

March 1972

69 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/361268

Editor:
M. Stuart Lynn
Rice Univ., Houston, TX

Issue’s Table of Contents

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 March 1972

Published in CACM Volume 15, Issue 3

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

181
Total Citations
View Citations
1,509
Total Downloads

Downloads (Last 12 months)221
Downloads (Last 6 weeks)35

Reflects downloads up to 26 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

(2022)BibliographyStorage Systems10.1016/B978-0-32-390796-5.00023-1(641-693)Online publication date: 2022
https://doi.org/10.1016/B978-0-32-390796-5.00023-1
Thomasian A(2022)Disk drive data placement and schedulingStorage Systems10.1016/B978-0-32-390796-5.00012-7(197-222)Online publication date: 2022
https://doi.org/10.1016/B978-0-32-390796-5.00012-7
Yu J(2018)Multimedia Resource SchedulingEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_234(2403-2407)Online publication date: 7-Dec-2018
https://doi.org/10.1007/978-1-4614-8265-9_234
AKAR NTUNÇ ÇGAERTNER MERDEN F(2017)Disk scheduling with shortest cumulative access time first algorithmsTURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES10.3906/elk-1610-27125(3367-3380)Online publication date: 2017
https://doi.org/10.3906/elk-1610-271
Lyon LDenner J(2017)Community collegesCommunications of the ACM10.1145/315291460:12(24-26)Online publication date: 27-Nov-2017
https://dl.acm.org/doi/10.1145/3152914
Denning P(2017)The forgotten engineerCommunications of the ACM10.1145/315291260:12(20-23)Online publication date: 27-Nov-2017
https://dl.acm.org/doi/10.1145/3152912
Andriole S(2017)The death of big softwareCommunications of the ACM10.1145/315272260:12(29-32)Online publication date: 27-Nov-2017
https://dl.acm.org/doi/10.1145/3152722
Brause RBrause R(2017)ProzesseBetriebssysteme10.1007/978-3-662-54100-5_2(27-120)Online publication date: 21-Mar-2017
https://doi.org/10.1007/978-3-662-54100-5_2
Yu J(2017)Multimedia Resource SchedulingEncyclopedia of Database Systems10.1007/978-1-4899-7993-3_234-2(1-5)Online publication date: 18-Jan-2017
https://doi.org/10.1007/978-1-4899-7993-3_234-2
Moran BCohen FWang ZSuvorova SCochran DTaylor TFarrell PHoward S(2016)Bounds on Multiple Sensor FusionACM Transactions on Sensor Networks10.1145/290372212:2(1-26)Online publication date: 2-May-2016
https://dl.acm.org/doi/10.1145/2903722
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Abstract

References

Cited By

Recommendations

Survey and analysis of disk scheduling methods

Performance Comparison of Mirrored Disk Scheduling Methods with a Shared Non-Volatile Cache

Mirrored disk rouing and scheduling

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations