ACM Home Page
Please provide us with feedback. Feedback
Non-blocking root scanning for real-time garbage collection
Full text PdfPdf (299 KB)
Source ACM International Conference Proceeding Series; Vol. 343 archive
Proceedings of the 6th international workshop on Java technologies for real-time and embedded systems table of contents
Santa Clara, California
SESSION: Real-time garbage collection and class library safety table of contents
Pages 68-76  
Year of Publication: 2008
ISBN:978-1-60558-337-2
Authors
Wolfgang Puffitsch  Vienna University of Technology, Austria
Martin Schoeberl  Vienna University of Technology, Austria
Sponsors
ACM : Assoc. for Computing Machinery
: Sun Microsystems, Inc.
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 3,   Downloads (12 Months): 43,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

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

ABSTRACT

Root scanning is a well known source of blocking times due to garbage collection. In this paper, we show that root scanning only needs to be atomic with respect to the thread whose stack is scanned. We propose two solutions to utilize this fact: (a) block only the thread whose stack is scanned, or (b) shift the responsibility for root scanning from the garbage collector to the application threads. The latter solution eliminates blocking due to root scanning completely. Furthermore, we show that a snapshot-at-beginning write barrier is sufficient to ensure the consistency of the root set even if local root sets are scanned independently of each other. The impact of solution (b) on the execution time of a garbage collector is shown for two different variants of the root scanning algorithm. Finally, we evaluate the resulting real-time garbage collector in a real system to confirm our theoretical findings.


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
R. Henriksson. Scheduling real-time garbage collection. In Proceedings of NWPER'94, Lund, Sweden, 1994.
11
12
 
13
M. Schoeberl. A time predictable instruction cache for a Java processor. In On the Move to Meaningful Internet Systems 2004: Workshop on Java Technologies for Real-Time and Embedded Systems (JTRES 2004), volume 3292 of LNCS, pages 371--382, Agia Napa, Cyprus, October 2004. Springer.
 
14
M. Schoeberl. JOP: A Java Optimized Processor for Embedded Real-Time Systems. PhD thesis, Vienna University of Technology, 2005.
 
15
16
17
 
18
19
 
20
 
21
T. Yuasa. Return barrier. In Proceedings of the International Lisp Conference 2002, 2002.


Collaborative Colleagues:
Wolfgang Puffitsch: colleagues
Martin Schoeberl: colleagues