Affiliation:
1. Univ. Mathematical Lab, Cambridge, England
Abstract
A simple nonrecursive list structure compacting scheme or garbage collector suitable for both compact and LISP-like list structures is presented. The algorithm avoids the need for recursion by using the partial structure as it is built up to keep track of those lists that have been copied.
Publisher
Association for Computing Machinery (ACM)
Cited by
212 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Mutator-Driven Object Placement using Load Barriers;Proceedings of the 21st ACM SIGPLAN International Conference on Managed Programming Languages and Runtimes;2024-09-13
2. The One Pass (OP) Compactor: An Intellectual Abstract;Proceedings of the 2024 ACM SIGPLAN International Symposium on Memory Management;2024-06-20
3. Garbage Collection for Mostly Serialized Heaps;Proceedings of the 2024 ACM SIGPLAN International Symposium on Memory Management;2024-06-20
4. Cornucopia Reloaded: Load Barriers for CHERI Heap Temporal Safety;Proceedings of the 29th ACM International Conference on Architectural Support for Programming Languages and Operating Systems, Volume 2;2024-04-27
5. Unified Shared Memory: Friend or Foe? Understanding the Implications of Unified Memory on Managed Heaps;Proceedings of the 20th ACM SIGPLAN International Conference on Managed Programming Languages and Runtimes;2023-10-19