Competitive access time via dynamic storage rearrangement
- 19 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Parallel searching in the planeComputational Geometry, 1995
- Two results on the list update problemInformation Processing Letters, 1991
- Modelling and simulation of an automated warehouse in activityMathematical and Computer Modelling, 1990
- Self-adjusting binary search treesJournal of the ACM, 1985
- Amortized efficiency of list update and paging rulesCommunications of the ACM, 1985
- Static grouping of small objects to enhance performance of a paged virtual memoryACM Transactions on Computer Systems, 1984
- Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage SystemsACM Computing Surveys, 1980
- Near-Optimal Solutions to a 2-Dimensional Placement ProblemSIAM Journal on Computing, 1975
- On the Optimality of the Probability Ranking Scheme in Storage ApplicationsJournal of the ACM, 1973
- An n log n Algorithm to Distribute n Records Optimally in a Sequential Access FilePublished by Springer Nature ,1972