ZIB

Hits per page

hit 1 - 1 | 1 hit

Select All Export

Electronic Resource

An efficient algorithm for allocating paged, drum-like storage (1978)

Coffman, E. G. ; Johnson, Donald B. ; Leung, Joseph Y. -T.

Springer

BIT 18 (1978), S. 52-66

add to mindlist on the mindlist

Details

ISSN: 1572-9125

Source: Springer Online Journal Archives 1860-2000

Topics: Mathematics

Notes: 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.

Type of Medium: Electronic Resource

URL: http://dx.doi.org/10.1007/BF01947743

Library	Location	Call Number	Volume/Issue/Year	Availability

Others were also interested in ...

Paper (German National Licenses)

Fulltext

hit 1 - 1 | 1 hit