A model for masking rotational latency by dynamic disk allocation

Authors:
D. E. Gold;D. J. Kuck
Affiliations:
Univ. of Illinois at Urbana-Champaign, Urbana;Univ. of Illinois at Urbana-Champaign, Urbana
Venue:
Communications of the ACM
Year:
1974

Citing 1
Cited 3

Minimizing Drum Latency Time

Journal of the ACM (JACM)

Sequentiality and prefetching in database systems

ACM Transactions on Database Systems (TODS)
ACM forum

Communications of the ACM
Access and Alignment of Data in an Array Processor

IEEE Transactions on Computers

Quantified Score

Hi-index	48.24

Visualization

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.