ACM Portal
  Subscribe (Full Service)    Register (Limited Service, Free)    Login
  Search:   The ACM Digital Library   The Guide
  
ACM Home Page
Please provide us with feedback. Feedback
On the near-optimality of the shortest-latency-time-first drum scheduling discipline
Full text PdfPdf (217 KB)
Source
Communications of the ACM archive
Volume 16 ,  Issue 6  (June 1973) table of contents
Pages: 352 - 353  
Year of Publication: 1973
ISSN:0001-0782
Authors
Harold S. Stone  Stanford Univ., Stanford, CA
Samuel H. Fuller  Stanford Univ., Stanford, CA
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 11,   Citation Count: 4
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/362248.362257
What is a DOI?

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

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
Denning, P.J. Effects of scheduling on file memory operations. Proc. 1967 AFIPS SJCC, Vol. 30, AF1PS Press, Montvale, N.J. pp. 9-21.
 
2
Fuller, S.H. An optimal drum scheduling algorithm. IEEE Trans. Comput. C-2I, 11 (Nov. 1972), 1153-1165.

CITED BY  4
Samuel H. Fuller , Forest Baskett, An Analysis of Drum Storage Units, Journal of the ACM (JACM), v.22 n.1, p.83-105, Jan. 1975
Samuel H. Fuller, Minimal-total-processing time drum and disk scheduling disciplines, Communications of the ACM, v.17 n.7, p.376-381, July 1974
Richard L. Sites, Optimal shift strategy for a block-transfer CCD memory, Communications of the ACM, v.21 n.5, p.423-425, May 1978
Peter Sanders , Berthold Vöcking, Tail Bounds and Expectations for Random Arc Allocation and Applications, Combinatorics, Probability and Computing, v.12 n.3, p.301-318, May 2003

INDEX TERMS

Keywords:
drum scheduling, minimal latency scheduling, shortest-access-time-first, shortest-latency-time-first

Collaborative Colleagues:
Harold S. Stone: colleagues
Samuel H. Fuller: colleagues

The ACM Portal is published by the Association for Computing Machinery. Copyright © 2009 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us

Useful downloads: Adobe Acrobat    QuickTime    Windows Media Player    Real Player