ACM Home Page
Please provide us with feedback. Feedback
Stopless: a real-time garbage collector for multiprocessors
Full text PdfPdf (304 KB)
Source
International Symposium on Memory Management archive
Proceedings of the 6th international symposium on Memory management table of contents
Montreal, Quebec, Canada
SESSION: Optimization and real time GC table of contents
Pages: 159 - 172  
Year of Publication: 2007
ISBN:978-1-59593-893-0
Authors
Filip Pizlo  Purdue University, West Lafayette, IN
Daniel Frampton  Australian National University, Canberra, Australia
Erez Petrank  Microsoft Research, Redmond, WA
Bjarne Steensgaard  Microsoft Research, Redmond, WA
Sponsors
ACM: Association for Computing Machinery
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 8,   Downloads (12 Months): 115,   Citation Count: 9
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/1296907.1296927
What is a DOI?

ABSTRACT

We present Stopless: a concurrent real-time garbage collector suitable for modern multiprocessors running parallel multithreaded applications. Creating a garbage-collected environment that supports real-time on modern platforms is notoriously hard,especially if real-time implies lock-freedom. Known real-time collectors either restrict the real-time guarantees to uniprocessors only, rely on special hardware, or just give up supporting atomic operations (which are crucial for lock-free software). Stopless is the first collector that provides real-time responsiveness while preserving lock-freedom, supporting atomic operations, controlling fragmentation by compaction, and supporting modern parallel platforms. Stopless is adequate for modern languages such as C# or Java. It was implemented on top of the Bartok compiler and runtime for C# and measurements demonstrate high responsiveness (a factor of a 100 better than previously published systems), virtually no pause times, good mutator utilization, and acceptable overheads.


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
16
 
17
 
18
Roger Henriksson. Predictable automatic memory management for embedded systems. In OOPSLA '97 Workshop on Garbage Collection and Memory Management.
 
19
Roger Henriksson. Scheduling Garbage Collection in Embedded Systems. PhD thesis, Lund Institute of Technology, July 1998.
 
20
21
 
22
Richard E. Jones. Garbage Collection: Algorithms for Automatic Dynamic Memory Management. Wiley, Chichester, July 1996. With a chapter on Distributed Garbage Collection by R. Lins.
23
24
25
26
27
28
29
30
 
31
Sven Gestegård Robertz and Roger Henriksson. Time--triggered garbage collection -- robust and adaptive real--time GC scheduling for embedded systems. In LCTES 2003.
32
33

CITED BY  9

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