An algorithm with constant execution time for dynamic storage allocation
- 19 November 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 20, 21-25
- https://doi.org/10.1109/rtcsa.1995.528746
Abstract
No abstract availableThis publication has 19 references indexed in Scilit:
- Memory allocation costs in large C and C++ programsSoftware: Practice and Experience, 1994
- Evaluating models of memory allocationACM Transactions on Modeling and Computer Simulation, 1994
- Customalloc: Efficient synthesized memory allocatorsSoftware: Practice and Experience, 1993
- Improving the cache locality of memory allocationPublished by Association for Computing Machinery (ACM) ,1993
- Efficient implementation of the first-fit strategy for dynamic storage allocationACM Transactions on Programming Languages and Systems, 1989
- Adaptive exact-fit storage managementCommunications of the ACM, 1985
- The software lookaside buffler reduces search overhead with linked listsCommunications of the ACM, 1984
- Anomalous behavior of the fifty-percent rule in dynamic memory allocationCommunications of the ACM, 1977
- Dynamic memory allocation in computer simulationCommunications of the ACM, 1977
- A comparison of next-fit, first-fit, and best-fitCommunications of the ACM, 1977