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

DOI10.1145/321921.321933zbMATH Open0315.68052OpenAlexW1991115187MaRDI QIDQ4076784FDOQ4076784

Authors: R. A. Cody, E. 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

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

Cited In (14)

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

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4076784)