ACM Home Page
Please provide us with feedback. Feedback
A study of concurrent real-time garbage collectors
Full text PdfPdf (432 KB)
Source
Conference on Programming Language Design and Implementation archive
Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation table of contents
Tucson, AZ, USA
SESSION: Session II table of contents
Pages 33-44  
Year of Publication: 2008
ISBN:978-1-59593-860-2
Also published in ...
Authors
Filip Pizlo  Purdue University, West Lafayette, IN, USA
Erez Petrank  Microsoft Corporation, Redmond, WA, USA
Bjarne Steensgaard  Microsoft Corporation, Redmond, WA, USA
Sponsors
ACM: Association for Computing Machinery
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 22,   Downloads (12 Months): 285,   Citation Count: 5
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1375581.1375587
What is a DOI?

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
 
15
ECMA. Standard ECMA-335, Common Language Infrastructure (CLI), 4th edition edition, June 2006. http://www.ecmainternational. org/.
 
16
Roger Henriksson. Scheduling Garbage Collection in Embedded Systems. PhD thesis, Lund Institute of Technology, 1998.
 
17
18
 
19
20
21
22
23
24
25
26
 
27
Sven Gestegård Robertz and Roger Henriksson. Time-triggered garbage collection - robust and adaptive real-time GC scheduling for embedded systems. LCTES 2003.
28
29


Collaborative Colleagues:
Filip Pizlo: colleagues
Erez Petrank: colleagues
Bjarne Steensgaard: colleagues