Thumbnail
Access Restriction
Subscribed

Author Kuck, D. J. ♦ Gold, D. E.
Source ACM Digital Library
Content type Text
Publisher Association for Computing Machinery (ACM)
File Format PDF
Language English
Subject Keyword Rotational latency ♦ Memory hierarchy ♦ Staging ♦ Buffer memory ♦ Storage allocation ♦ Permutation algorithm
Abstract This paper presents the background and algorithms for masking the rotational latency of a disk or drum. It discusses the anticipatory input and output of blocks of data to buffer and primary memories for a mono-programmed computer system. A basic permutation algorithm and several variations are given. Because of the anticipatory nature of the I/O scheduling, these algorithms are restricted to classes of programs with predictable behavior. While the methods are not restricted to numerical computations, matrix and partial differential equation methods are typical examples of their use. It is shown that latency may be masked using a small amount of buffer memory. The methods discussed are independent of the overall size of the data base being considered.
Description Affiliation: Univ. of Illinois at Urbana-Champaign, Urbana (Gold, D. E.; Kuck, D. J.)
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 17
Issue Number 5
Page Count 11
Starting Page 278
Ending Page 288


Open content in new tab

   Open content in new tab
Source: ACM Digital Library