An efficient algorithm for allocating paged, drum-like storage

DOI10.1007/BF01947743zbMATH Open0379.68022OpenAlexW2051724247MaRDI QIDQ4158467FDOQ4158467

Authors: Donald B. Johnson, Joseph Y.-T. Leung, E. 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

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

Cites Work

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

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

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