ACM Home Page
Please provide us with feedback. Feedback
A real-time garbage collector with low overhead and consistent utilization
Full text PdfPdf (517 KB)
Source ACM SIGPLAN Notices archive
Volume 38 ,  Issue 1  (January 2003) table of contents
Pages: 285 - 298  
Year of Publication: 2003
ISSN:0362-1340
Also published in ...
Authors
David F. Bacon  IBM T.J. Watson Research Center, Yorktown Heights, NY
Perry Cheng  IBM T.J. Watson Research Center, Yorktown Heights, NY
V. T. Rajan  IBM T.J. Watson Research Center, Yorktown Heights, NY
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 18,   Downloads (12 Months): 171,   Citation Count: 60
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues   peer to peer  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/640128.604155
What is a DOI?

ABSTRACT

Now that the use of garbage collection in languages like Java is becoming widely accepted due to the safety and software engineering benefits it provides, there is significant interest in applying garbage collection to hard real-time systems. Past approaches have generally suffered from one of two major flaws: either they were not provably real-time, or they imposed large space overheads to meet the real-time bounds. We present a mostly non-moving, dynamically defragmenting collector that overcomes both of these limitations: by avoiding copying in most cases, space requirements are kept low; and by fully incrementalizing the collector we are able to meet real-time bounds. We implemented our algorithm in the Jikes RVM and show that at real-time resolution we are able to obtain mutator utilization rates of 45% with only 1.6--2.5 times the actual space required by the application, a factor of 4 improvement in utilization over the best previously published results. Defragmentation causes no more than 4% of the traced data to be copied.


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
Henriksson, R. Scheduling Garbage Collection in Embedded Systems. PhD thesis, Lund Institute of Technology, July 1998.
 
16
 
17
 
18
Joseph, M., and Pandya, P. K. Finding response times in a real-time system. Computer Journal 29, 5 (1986), 390--395.
19
20
21
 
22
23
 
24
 
25
Zorn, B. Barrier methods for garbage collection. Tech. Rep. CU-CS-494-90, University of Colorado at Boulder, 1990.

CITED BY  60
 
 
 
 
 
 
 
 
 
 
 
 

Collaborative Colleagues:
David F. Bacon: colleagues
Perry Cheng: colleagues
V. T. Rajan: colleagues

Peer to Peer - Readers of this Article have also read: