Placement of Records on a Secondary Storage Device to Minimize Access Time

DOI10.1145/321765.321775zbMath0265.68022OpenAlexW2034912120WikidataQ128922417 ScholiaQ128922417MaRDI QIDQ5681527

David D. Grossman, Harvey F. Silverman

Publication date: 1973

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

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

Mathematics Subject Classification ID

General topics in the theory of software (68N01)

Related Items (12)

Dynamic placement of records and the classical occupancy problem ⋮ Record allocation for minimizing seek delay ⋮ Optimal data placement in two-headed disk systems ⋮ Optimization and approximation algorithm for placement of records on linear storage devices ⋮ Methods for the one-dimensional space allocation problem ⋮ Near-optimal heuristics for an assignment problem in mass storage ⋮ Product location, allocation and server home base location for an order picking line with multiple servers. ⋮ A hybrid filesystem for hard disk drives in tandem with flash memory ⋮ Analysis of set-up time models: a metric perspective ⋮ An efficient algorithm for allocating paged, drum-like storage ⋮ Optimal product and server locations in one-dimensional storage racks ⋮ A two-carousel storage location problem

This page was built for publication: Placement of Records on a Secondary Storage Device to Minimize Access Time