A study of concurrent real-time garbage collectors
Authors:
Open Access
- 30 May 2008
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 43 (6) , 33-44
Abstract
Concurrent garbage collection is highly attractive for real-time systems, because offloading the collection effort from the executing threads allows faster response, allowing for extremely short deadlines at the microseconds level. Concurrent collectors also offer much better scalability over incremental collectors. The main problem with concurrent real-time collectors is their complexity. The first concurrent real-time garbage collector that can support fine synchronization, STOPLESS, has recently been presented by Pizlo et al. In this paper, we propose two additional (and different) algorithms for concurrent real-time garbage collection: CLOVER and CHICKEN. Both collectors obtain reduced complexity over the first collector STOPLESS, but need to trade a benefit for it. We study the algorithmic strengths and weaknesses of CLOVER and CHICKEN and compare them to STOPLESS. Finally, we have implemented all three collectors on the Bartok compiler and runtime for C# and we present measurements to compare their efficiency and responsiveness.Keywords
This publication has 25 references indexed in Scilit:
- A parallel, incremental, mostly concurrent garbage collector for serversACM Transactions on Programming Languages and Systems, 2005
- The pauseless GC algorithm2005
- An on-the-fly mark and sweep garbage collector based on sliding views2003
- A real-time garbage collector with low overhead and consistent utilization2003
- A parallel, real-time garbage collector2001
- On bounding time and space for multiprocessor garbage collection1999
- Mostly parallel garbage collectionACM SIGPLAN Notices, 1991
- Trading data space for reduced time and code space in real-time garbage collection on stock hardware1984
- On-the-fly garbage collectionCommunications of the ACM, 1978
- List processing in real time on a serial computerCommunications of the ACM, 1978