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

Authors:
Harold S. Stone;Samuel H. Fuller
Affiliations:
Stanford Univ., Stanford, CA;Stanford Univ., Stanford, CA
Venue:
Communications of the ACM
Year:
1973

Citing 0
Cited 5

An Analysis of Drum Storage Units

Journal of the ACM (JACM)
Optimal shift strategy for a block-transfer CCD memory

Communications of the ACM
Minimal-total-processing time drum and disk scheduling disciplines

Communications of the ACM
Random Arc Allocation and Applications

SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Tail Bounds and Expectations for Random Arc Allocation and Applications

Combinatorics, Probability and Computing

Quantified Score

Hi-index	48.25

Visualization

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.