article

Free access

On the near-optimality of the shortest-latency-time-first drum scheduling discipline

Authors:

Harold S. Stone,

Samuel H. FullerAuthors Info & Claims

Communications of the ACM, Volume 16, Issue 6

Pages 352 - 353

https://doi.org/10.1145/362248.362257

Published: 01 June 1973 Publication History

PDF eReader

Abstract

For computer systems in which it is practical to determine the instantaneous drum position, a popular discipline for determining the sequence in which the records are to be accessed is the so-called shortest-latency-time-first, SLTF, discipline. When a collection of varying-length records is to be accessed from specified drum positions, it is known that the SLTF discipline does not necessarily minimize the drum latency time. However, we show that the total time to access the entire collection for any SLTF schedule is never as much as a drum revolution longer than a minimum latency schedule.

References

[1]

Denning, P.J. Effects of scheduling on file memory operations. Proc. 1967 AFIPS SJCC, Vol. 30, AF1PS Press, Montvale, N.J. pp. 9-21.

Google Scholar

[2]

Fuller, S.H. An optimal drum scheduling algorithm. IEEE Trans. Comput. C-2I, 11 (Nov. 1972), 1153-1165.

Digital Library

Google Scholar

Cited By

View all

Reza AMirzaee R(2017)Non-preemptive offline multi-job mapping for a photonic network on a chipNano Communication Networks10.1016/j.nancom.2016.09.00411(11-23)Online publication date: Mar-2017
https://doi.org/10.1016/j.nancom.2016.09.004
Sanders P(2004)Algorithms for Scalable Storage ServersSOFSEM 2004: Theory and Practice of Computer Science10.1007/978-3-540-24618-3_8(82-101)Online publication date: 2004
https://doi.org/10.1007/978-3-540-24618-3_8
Sanders PVöcking B(2003)Tail Bounds and Expectations for Random Arc Allocation and ApplicationsCombinatorics, Probability and Computing10.1017/S096354830300560112:3(301-318)Online publication date: 1-May-2003
https://dl.acm.org/doi/10.1017/S0963548303005601
Show More Cited By

On the near-optimality of the shortest-latency-time-first drum scheduling discipline
1. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
  2. Theory and algorithms for application domains
    1. Machine learning theory
      1. Reinforcement learning

Recommendations

Minimal-total-processing time drum and disk scheduling disciplines

This article investigates the application of minimal-total-processing-time (MTPT) scheduling disciplines to rotating storage units when random arrival of requests is allowed. Fixed-head drum and moving-head disk storage units are considered, and ...
An Optimal Drum Scheduling Algorithm

Suppose a set of N records must be read or written from a drum, fixed-head disk, or similar storage unit of a computer system. The records vary in length and are arbitrarily located on the surface of the drum. The problem considered here is to find an ...
Airstic drum: a drumstick for integration of real and virtual drums
ACE'12: Proceedings of the 9th international conference on Advances in Computer Entertainment

Drum kits consist of various kinds of percussion instruments. As all percussion instruments are large and heavy, they are inconvenient for drummers to carry and set up. Virtual drums, which include motion sensors and enable drummers to imitate playing ...

Comments

Information & Contributors

Information

Published In

Communications of the ACM Volume 16, Issue 6

June 1973

60 pages

ISSN:0001-0782

EISSN:1557-7317

DOI:10.1145/362248

Editor:
Robert L. Ashenhurst
Univ. of Chicago, Chicago, IL

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 June 1973

Published in CACM Volume 16, Issue 6

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

19
Total Citations
View Citations
311
Total Downloads

Downloads (Last 12 months)50
Downloads (Last 6 weeks)9

Reflects downloads up to 16 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Reza AMirzaee R(2017)Non-preemptive offline multi-job mapping for a photonic network on a chipNano Communication Networks10.1016/j.nancom.2016.09.00411(11-23)Online publication date: Mar-2017
https://doi.org/10.1016/j.nancom.2016.09.004
Sanders P(2004)Algorithms for Scalable Storage ServersSOFSEM 2004: Theory and Practice of Computer Science10.1007/978-3-540-24618-3_8(82-101)Online publication date: 2004
https://doi.org/10.1007/978-3-540-24618-3_8
Sanders PVöcking B(2003)Tail Bounds and Expectations for Random Arc Allocation and ApplicationsCombinatorics, Probability and Computing10.1017/S096354830300560112:3(301-318)Online publication date: 1-May-2003
https://dl.acm.org/doi/10.1017/S0963548303005601
Sanders PVöcking B(2002)Random Arc Allocation and ApplicationsAlgorithm Theory — SWAT 200210.1007/3-540-45471-3_13(121-130)Online publication date: 21-Jun-2002
https://doi.org/10.1007/3-540-45471-3_13
BOZER YPARK J(2001)Expected move request waiting times in single-device, polling-based material handling systemsIIE Transactions10.1080/0740817010893680633:1(55-63)Online publication date: Jan-2001
https://doi.org/10.1080/07408170108936806
Seeger B(1996)An analysis of schedules for performing multi-page requestsInformation Systems10.1016/0306-4379(96)84498-X21:5(387-407)Online publication date: 1-Jul-1996
https://dl.acm.org/doi/10.1016/0306-4379%2896%2984498-X
BOZER YSRINIVASAN M(1991)Tandem Configurations for Automated Guided Vehicle Systems and the Analysis of Single Vehicle LoopsIIE Transactions10.1080/0740817910896384223:1(72-82)Online publication date: Mar-1991
https://doi.org/10.1080/07408179108963842
BARTHOLDI JPLATZMAN L(1989)Decentralized Control of Automated Guided Vehicles on a Simple LoopIIE Transactions10.1080/0740817890896620921:1(76-81)Online publication date: Mar-1989
https://doi.org/10.1080/07408178908966209
Ikeda HOhzawa YOnaga K(1987)TRACER: Transposed File Organization Scheme with Consecutive Retrieval Property and Its Application to Statistical Database SystemFoundations of Data Organization10.1007/978-1-4613-1881-1_10(125-132)Online publication date: 1987
https://doi.org/10.1007/978-1-4613-1881-1_10
Smith A(1981)Input/output optimization and disk architectures: A surveyPerformance Evaluation10.1016/0166-5316(81)90013-41:2(104-117)Online publication date: May-1981
https://doi.org/10.1016/0166-5316(81)90013-4
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

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

Minimal-total-processing time drum and disk scheduling disciplines

An Optimal Drum Scheduling Algorithm

Airstic drum: a drumstick for integration of real and virtual drums

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

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations