On the Near-Optimality of the Shortest-Latency-Time-First
Drum Scheduling Discipline

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.

CACM June, 1973

Stone, H. S.
Fuller, S.  H.

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

4.31 4.41 6.35

CA730604 JB January 23, 1978  3:12 PM

2496	5	2496
2496	5	2496
2496	5	2496
2628	5	2496
3097	5	2496
2375	6	2496
2496	6	2496
2496	6	2496