Effective “static-graph” reorganization to improve locality in garbage-collected systems
- 1 May 1991
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 26 (6), 177-191
- https://doi.org/10.1145/113446.113461
Abstract
No abstract availableThis publication has 23 references indexed in Scilit:
- Some issues and strategies in heap management and memory hierarchiesACM SIGPLAN Notices, 1991
- Improving locality of reference in a garbage-collecting memory management systemCommunications of the ACM, 1988
- Garbage collection can be faster than stack allocationInformation Processing Letters, 1987
- Static grouping of small objects to enhance performance of a paged virtual memoryACM Transactions on Computer Systems, 1984
- Generation ScavengingACM SIGPLAN Notices, 1984
- A real-time garbage collector based on the lifetimes of objectsCommunications of the ACM, 1983
- List processing in real time on a serial computerCommunications of the ACM, 1978
- An empirical study of list structure in LispCommunications of the ACM, 1977
- Improving locality by critical working setsCommunications of the ACM, 1974
- A nonrecursive list compacting algorithmCommunications of the ACM, 1970