Access Restriction

Author Fuller, Samuel H. ♦ Stone, Harold S.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Minimal latency scheduling ♦ Shortest-latency-time-first ♦ Drum scheduling ♦ Shortest-access-time-first
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.
Description Affiliation: Stanford Univ., Stanford, CA (Stone, Harold S.; Fuller, Samuel H.)
Age Range 18 to 22 years ♦ above 22 year
Educational Use Research
Education Level UG and PG
Learning Resource Type Article
Publisher Date 2005-08-01
Publisher Place New York
Journal Communications of the ACM (CACM)
Volume Number 16
Issue Number 6
Page Count 2
Starting Page 352
Ending Page 353

Open content in new tab

   Open content in new tab
Source: ACM Digital Library