An efficient algorithm for allocating paged, drum-like storage

DOI10.1007/BF01947743zbMath0379.68022OpenAlexW2051724247MaRDI QIDQ4158467

Donald B. Johnson, Joseph Y.-T. Leung, Edward G. jun. Coffman

Publication date: 1978

Published in: BIT Numerical Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01947743

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in the theory of software (68N01) Algorithms in computer science (68W99)

Cites Work

• Record Allocation for Minimizing Expected Retrieval Costs on Drum-Like Storage Devices
• On the Optimality of the Probability Ranking Scheme in Storage Applications
• Placement of Records on a Secondary Storage Device to Minimize Access Time

This page was built for publication: An efficient algorithm for allocating paged, drum-like storage