Optimization and approximation algorithm for placement of records on linear storage devices
From MaRDI portal
Publication:1158748
DOI10.1007/BF02279814zbMath0473.68024OpenAlexW143765064MaRDI QIDQ1158748
Publication date: 1982
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02279814
Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (1)
Cites Work
- Unnamed Item
- Optimization and approximation algorithm for placement of records on linear storage devices
- Some simplified NP-complete graph problems
- Near-optimal heuristics for an assignment problem in mass storage
- Near-Optimal Solutions to a 2-Dimensional Placement Problem
- Dynamic Placement of Records in Linear Storage
- On the Optimality of the Probability Ranking Scheme in Storage Applications
- Minimizing expected travel time on geometrical patterns by optimal probability rearrangements
- Placement of Records on a Secondary Storage Device to Minimize Access Time
This page was built for publication: Optimization and approximation algorithm for placement of records on linear storage devices
