Abstract
Cody and Coffman have studied the problem of distributing a set of a equal-size records among the sectors of a drum-like storage device so as to minimize the average rotational latency cost. This paper is an extension of that work. We employ the same model but a different latency delay function. Motivated by the NP-completeness of the general problem and the fact that an arbitrary assignment can have an expected latency cost almost twice that of an optimal assignment, we propose and analyze a fast heuristic whose performance compares favorably with that of an optimal algorithm.
Original language | English (US) |
---|---|
Pages (from-to) | 52-66 |
Number of pages | 15 |
Journal | BIT |
Volume | 18 |
Issue number | 1 |
DOIs | |
State | Published - Mar 1978 |
Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Software
- Computational Mathematics
- Applied Mathematics
- Computer Networks and Communications