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

Full description

Saved in:
Bibliographic Details
Published in:Communications of the ACM 1973-06, Vol.16 (6), p.352-353
Main Authors: Stone, Harold S., Fuller, Samuel H.
Format: Magazinearticle
Language:English
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0001-0782
1557-7317
DOI:10.1145/362248.362257