An Introduction to Combinatorial Models of Dynamic Storage Allocation
- 1 July 1983
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Review
- Vol. 25 (3) , 311-325
- https://doi.org/10.1137/1025074
Abstract
No abstract availableThis publication has 30 references indexed in Scilit:
- A two-dimensional bin-packing model of preemptive, FIFO storage allocationJournal of Algorithms, 1982
- A 54 algorithm for two-dimensional packingJournal of Algorithms, 1981
- A 2.5 times optimal algorithm for packing in two dimensionsInformation Processing Letters, 1980
- Free store distribution under random fit allocation: part 2The Computer Journal, 1980
- A weighted buddy method for dynamic storage allocationCommunications of the ACM, 1974
- A class of dynamic memory allocation algorithmsCommunications of the ACM, 1973
- A note on storage fragmentation and program segmentationCommunications of the ACM, 1969
- A fast storage allocatorCommunications of the ACM, 1965
- Multiprogram schedulingCommunications of the ACM, 1960
- Multiprogram schedulingCommunications of the ACM, 1960