ACM Home Page
Please provide us with feedback. Feedback
Atomic garbage collection: managing a stable heap
Full text PdfPdf (1.53 MB)
Source International Conference on Management of Data archive
Proceedings of the 1989 ACM SIGMOD international conference on Management of data table of contents
Portland, Oregon, United States
Pages: 15 - 25  
Year of Publication: 1989
ISBN:0-89791-317-5
Also published in ...
Authors
Elliot Kolodner  Massachusetts Institute of Technology, Cambridge
Barbara Liskov  Massachusetts Institute of Technology, Cambridge
William Weihl  Massachusetts Institute of Technology, Cambridge
Sponsor
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 1,   Downloads (12 Months): 10,   Citation Count: 7
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/67544.66928
What is a DOI?

ABSTRACT

Modern database systems use transactions to achieve a high degree of fault-tolerance. Many modern programming languages and systems provide garbage collected heap storage, which frees the programmer from the job of explicitly deallocating storage. In this paper we describe integrated garbage collection and recovery algorithms for managing a stable heap in which accessible objects survive both system crashes and media failures. A garbage collector typically both moves and modifies objects which can lead to problems when the heap is stable because a system crash after the start of collection but before enough of the reorganized heap reaches the disk can leave the disk in an inconsistent state. Furthermore, collection has to be coordinated with the recovery system. We present a collection algorithm and recovery system that solves these problems.


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
M. P. Atkinson, P. J. Bailey, K. J. Chisholm, P. W. Cockshott, and R. Morrison. An Approach to Persistant Programming. The Computer Journal, 26(4):360-365, 1983.
 
3
4
5
6
7
8
 
9
Jeffrey L. Eppinger and Alfred Z. Spector. Virtual Memory Management for Recoverable Objects in the TABS Prototype. Technical Report CMU-CS-85-163, Department of Computer Science, Carnegie Mellon University, Pittsburgh, Pa., December 1985.
10
 
11
12
13
 
14
 
15
16
 
17
Barbara Liskov. Overview of the Argus Language and System. Programming Methodology Group Memo 40, Laboratory for Computer Science, MIT, Cambridge, Ms., February 1984.
18
19
 
20
 
21
Nathaniel Mishkin. Managing Permanent Objects. Technical Report YALEU/DCS/RR-338, Department of Computer Science, Yale University, New Haven, Ct., November 1984.
22
23
 
24
Richard F. Rashid. Threads of a New System. Unix Review, 4(8):37-49, August 1986.
 
25
Alfred Z. Spector, J. J. Bloch, Dean Daniels, R. P. Draves, Daniel Duchamp, Jeffrey L. Eppinger, S. G. Menees, and D. S. Thompson. The camelot project. Database Engineering, 9(4), December 1986.
26
 
27
Satish M. Thatte. Persistent Memory: Merging AI- Knowledge and Databases. Texas Instruments Engineering journal, 3(1), January-February 1986.
28
 
29
Daniel Weinreb, Neal Feinberg, Dan Gerson, and Charles Lamb. An Object-Oriented Database System to Support an Integrated Programming Environment. 1988. Submitted for publication.
 
30
Stanley Zdonik and Peter Wegner. Language and methodology for object-oriented database environments. In Proceedings of the 19th Annual Hawaiian Conference on Systems Science, January 1986.


Collaborative Colleagues:
Elliot Kolodner: colleagues
Barbara Liskov: colleagues
William Weihl: colleagues

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