Comparison of Compacting Algorithms for Garbage Collection
- 1 October 1983
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Programming Languages and Systems
- Vol. 5 (4), 532-553
- https://doi.org/10.1145/69575.357226
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Computer-assisted microanalysis of programsCommunications of the ACM, 1982
- Garbage Collection of Linked Data StructuresACM Computing Surveys, 1981
- Password securityCommunications of the ACM, 1979
- A fast garbage compaction algorithmInformation Processing Letters, 1979
- A time- and space-efficient garbage compaction algorithmCommunications of the ACM, 1978
- A note on compacting garbage collectionThe Computer Journal, 1978
- The earley algorithm as a problem representationInformation Processing Letters, 1974
- Two languages for estimating program efficiencyCommunications of the ACM, 1974
- Optimal measurement points for program frequency countsBIT Numerical Mathematics, 1973
- A Compaction Procedure for Variable-Length Storage ElementsThe Computer Journal, 1967