ACM Home Page
Please provide us with feedback. Feedback
Portable, unobtrusive garbage collection for multiprocessor systems
Full text PdfPdf (1.37 MB)
Source Annual Symposium on Principles of Programming Languages archive
Proceedings of the 21st ACM SIGPLAN-SIGACT symposium on Principles of programming languages table of contents
Portland, Oregon, United States
Pages: 70 - 83  
Year of Publication: 1994
ISBN:0-89791-636-0
Authors
Damien Doligez  École Normale Supérieure, INRIA Rocquencourt École Polytechnique
Georges Gonthier  INRIA Rocquencourt, 78153 LE CHESNAY CEDEX, France
Sponsors
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGPLAN: ACM Special Interest Group on Programming Languages
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 55,   Citation Count: 42
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/174675.174673
What is a DOI?

ABSTRACT

We describe and prove the correctness of a new concurrent mark-and-sweep garbage collection algorithm. This algorithm derives from the classical on-the-fly algorithm from Dijkstra et al. [9]. A distinguishing feature of our algorithm is that it supports multiprocessor environments where the registers of running processes are not readily accessible, without imposing any overhead on the elementary operations of loading a register or reading or initializing a field. Furthermore our collector never blocks running mutator processes except possibly on requests for free memory; in particular, updating a field or creating or marking or sweeping a heap object does not involve system-dependent synchronization primitives such as locks. We also provide support for process creation and deletion, and for managing an extensible heap of variable-sized objects.


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
CYPRESS. BiCMOS/CMOS data book. Cypress Semiconductor, 1991.
9
10
 
11
HERLIHY, M., AND Moss, J. E. S. Non-blocking garbage collection for multiprocessors. Technical report CRL 90/9, DEC Cambridge Research Lab., 1990.
12
13
 
14
KUNG, H. T., AND SONG, S. W. An efficient parallel garbage collection system and its correctness proof. In Foundations of Computer Science 1977 (1977), IEEE Computer Society Press, pp. 120-131.
 
15
LAMPORT, L. Garbage collection with multiple processes" an exercise in parallelism. In Proc. IEEE Conf. Parallel Processing (1976), pp. 50-54.
 
16
LAMPORT, L. The temporal logic of actions. Research report 79, DEC Systems Research Center, 1991.
 
17
LEROY, X., AND MAUNY, M. The Canal Light system, version 0.5 -- documentation and user's guide. Technical report L-5, INRIA, 1992.
 
18
 
19
 
20
21

CITED BY  42

Collaborative Colleagues:
Damien Doligez: colleagues
Georges Gonthier: colleagues