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

DOI10.1145/321921.321933zbMath0315.68052OpenAlexW1991115187MaRDI QIDQ4076784

R. A. Cody, Edward G. jun. Coffman

Publication date: 1976

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321921.321933

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45) Information storage and retrieval of data (68P20) General topics in the theory of software (68N01)

Related Items (14)

A note on minimizing the sum of squares of machine completion times on two identical parallel machines ⋮ Tighter bounds on a heuristic for a partition problem ⋮ A dual criteria sequencing problem with earliness and tardiness penalties ⋮ The benefit of preemption with respect to the \(\ell_p\) norm ⋮ Record allocation for minimizing seek delay ⋮ Tight bounds for selfish and greedy load balancing ⋮ Tight Bounds for Online Vector Scheduling ⋮ An efficient polynomial time approximation scheme for load balancing on uniformly related machines ⋮ Semi-Online Hierarchical Scheduling on Two Machines for lp-Norm Load Balancing ⋮ A new model for selfish routing ⋮ An efficient algorithm for allocating paged, drum-like storage ⋮ A unified view of parallel machine scheduling with interdependent processing rates ⋮ A Unified Approach to Truthful Scheduling on Related Machines ⋮ On-line preemptive machine scheduling with \(\ell _p\) norm on two uniform machines

This page was built for publication: Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices