Abstract
A simple real-time garbage collection algorithm is presented which does not copy, thereby avoiding some of the problems caused by the asynchronous motion of objects. This in-place "treadmill" garbage collection scheme has approximately the same complexity as other non-moving garbage collectors, thus making it usable in a high-level language implementation where some pointers cannot be traced. The treadmill is currently being used in a Lisp system built in Ada.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Graphics and Computer-Aided Design,Software
Reference28 articles.
1. Andre David L. Paging in Lisp Programs. M.S. Thesis U. of Maryland 1986. Andre David L. Paging in Lisp Programs . M.S. Thesis U. of Maryland 1986.
2. Real-time concurrent collection on stock multiprocessors
3. Algorithms for resolving conflicts in dynamic storage allocation
4. List processing in real time on a serial computer
5. Baker Henry. "Garbage Collection in Ada". Ada-9X Revision Request#643 Ada Joint Program Office Oct. 1989. Baker Henry. "Garbage Collection in Ada". Ada-9X Revision Request#643 Ada Joint Program Office Oct. 1989.
Cited by
61 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Adding Support for Reference Counting in the D Programming Language;Proceedings of the 17th International Conference on Software Technologies;2022
2. Transactional Sapphire;ACM Transactions on Programming Languages and Systems;2018-12-31
3. A survey of real‐time capabilities in functional languages and compilers;Concurrency and Computation: Practice and Experience;2018-10-23
4. Promotion Condition Optimization based on Application Features in Generational GC of Android Application Runtime;Journal of Information Processing;2018
5. A low Overhead Per Object Write Barrier for the Cog VM;Proceedings of the 11th edition of the International Workshop on Smalltalk Technologies;2016-08-23