Affiliation:
1. Harvard Univ., Cambridge, MA
Abstract
Algorithms for a multiprocessing compactifying garbage collector are presented and discussed. The simple case of two processors, one performing LISP-like list operations and the other performing garbage collection continuously, is thoroughly examined. The necessary capabilities of each processor are defined, as well as interprocessor communication and interlocks. Complete procedures for garbage collection and for standard list processing primitives are presented and thoroughly explained. Particular attention is given to the problems of marking and relocating list cells while another processor may be operating on them. The primary aim throughout is to allow the list processor to run unimpeded while the other processor reclaims list storage The more complex case involving several list processors and one or more garbage collection processors are also briefly discussed.
Publisher
Association for Computing Machinery (ACM)
Cited by
139 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On-the-Fly Garbage Collection: An Exercise in Cooperation;Edsger Wybe Dijkstra;2022-07-12
2. Low-latency, high-throughput garbage collection;Proceedings of the 43rd ACM SIGPLAN International Conference on Programming Language Design and Implementation;2022-06-09
3. Design and analysis of field-logging write barriers;Proceedings of the 2019 ACM SIGPLAN International Symposium on Memory Management - ISMM 2019;2019
4. Code and Data Transformations to Address Garbage Collector Performance in Big Data Processing;2018 IEEE 25th International Conference on High Performance Computing (HiPC);2018-12
5. Making Huge Pages Actually Useful;ACM SIGPLAN Notices;2018-11-30