A provably efficient algorithm for dynamic storage allocation
- 28 February 1989
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 38 (1) , 2-35
- https://doi.org/10.1016/0022-0000(89)90031-7
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- A Stochastic Model of Fragmentation in Dynamic Storage AllocationSIAM Journal on Computing, 1985
- Algorithms for resolving conflicts in dynamic storage allocationJournal of the ACM, 1985
- On the Asymptotic Optimality of First-Fit Storage AllocationIEEE Transactions on Software Engineering, 1985
- An Introduction to Combinatorial Models of Dynamic Storage AllocationSIAM Review, 1983
- Optimal Fit of Arbitrary Sized SegmentsThe Computer Journal, 1982
- Worst case fragmentation of first fit and best fit storage allocation strategiesThe Computer Journal, 1977
- On the external storage fragmentation produced by first-fit and best-fit allocation strategiesCommunications of the ACM, 1975
- Weak convergence of compound stochastic process, IStochastic Processes and their Applications, 1973
- Limiting diffusion approximations for the many server queue and the repairman problemJournal of Applied Probability, 1965
- A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of ObservationsThe Annals of Mathematical Statistics, 1952