Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices

Authors:
R. A. Cody;E. G. Coffman, Jr.
Affiliations:
Bell Laboratories, Holmdel, NJ and Pennsylvania State University, University Park, Pennsylvania;Department of Computer Science, Pennsylvania State University Park, PA
Venue:
Journal of the ACM (JACM)
Year:
1976

Citing 1
Cited 12

Operating Systems Theory

Operating Systems Theory

Approximation schemes for scheduling

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Ancient and new algorithms for load balancing in the Lp norm

Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Errata: `` Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices''

Journal of the ACM (JACM)
Vector Assignment Problems: A General Framework

ESA '02 Proceedings of the 10th Annual European Symposium on Algorithms
Record block allocation for retrieval on secondary keys

SIGIR '78 Proceedings of the 1st annual international ACM SIGIR conference on Information storage and retrieval
Vector assignment problems: a general framework

Journal of Algorithms
Selfish load balancing and atomic congestion games

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Better bounds for online load balancing on unrelated machines

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
A new model for selfish routing

Theoretical Computer Science
A smooth broadcasting scheme for VBR-encoded hot videos

Computer Communications
Finding mobile data under delay constraints with searching costs

Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Tight bounds for selfish and greedy load balancing

ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper examines the problem of distributing a set of equal-size records among the sectors of a drum-like storage device in order to exploit known access frequencies and reduce the average access time. A simple catenated search model is defined for which, the problem is shown to be NP-complete. Heuristics are then defined and analyzed in terms of worst-case bounds. It is shown that easily implemented highest-access-frequency-first assignment rules provide an average access time very close to optimal.