David L. Detlefs  Home/Search
Context Related
| digital.fr/pub/misc/detle...thesis.ps.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: fermivista.math....ftp.digital.fr (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We describe a concurrent, atomic garbage collection algorithm for transaction-based languages, a class of languages intended to support reliable distributed systems. A garbage collection algorithm for reliable distributed systems must be atomic: a crash during a garbage collection should result in no loss of data. A concurrent collector allows programs to continue operating as their heaps are collected, minimizing delays imposed by collection. A concurrent collector can be used in reliable... (Update)
Context of citations to this paper: More
...complexity and performance benefits. For example, the collector does not need to be made recoverable; doing so is very complex [33, 70]. Furthermore, the mutators are never interrupted if they follows a wrong pointer as in Appel et al. and the collector is not required to...
...and transactions. Detlefs investigates the use of concurrent, atomic garbage collection for transaction based programming languages [15]. Nettles and O Toole have developed a concurrent, replicating garbage collection algorithm to support persistence in ML programs [24] In...
Cited by: More
A Highly Effective Partition Selection Policy for Object.. - Cook, Wolf, al. (1998) (Correct)
Methods and Models for Management of Distributed and Persistent.. - Feeley (1995) (Correct)
Active bibliography (related documents): More All
0.2: The Measured Cost of Conservative Garbage Collection - Zorn (1993) (Correct)
0.2: Compiler-Based I/O Prefetching for Out-of-Core Applications - Brown, Mowry, Krieger (2001) (Correct)
0.2: Execution Profiling for Non-strict Functional Languages - Sansom (1994) (Correct)
Similar documents based on text: More All
0.3: On the Correctness of Orphan Management Algorithms - Herlihy, Lynch, Merritt, Weihl (1992) (Correct)
0.2: Lock-Free Reference Counting - Detlefs, Martin, Moir, Steele, Jr. (2001) (Correct)
0.1: An Efficient Meta-lock for Implementing Ubiquitous.. - Agesen, Detlefs.. (1999) (Correct)
Related documents from co-citation: More All
2: Atomic Incremental Garbage Collection and Recovery for a Large Stable Heap (context) - Kolodner - 1992
2: A study of three alternative workstation-server architectures for object-oriente.. - DeWitt, Maier et al. - 1990
2: Uniprocessor garbage collection techniques - Wilson - 1992
BibTeX entry: (Update)
David L. Detlefs. Concurrent atomic garbage collection. Technical Report CMU-CS-90-177, School of Computer Science, Carnegie Mellon University, October 1990. http://citeseer.ist.psu.edu/detlefs91concurrent.html More
@incollection{ detlefs91concurrent,
author = "David L. Detlefs",
title = "Concurrent Garbage Collection for {C++}",
booktitle = "Topics in Advanced Language Implementation",
publisher = "MIT Press",
editor = "Peter Lee",
year = "1991",
url = "citeseer.ist.psu.edu/detlefs91concurrent.html" }
Citations (may not include all citations):444 Mach: a new kernel foundation for UNIX development (context) - Accetta, Baron et al. - 1986
190 List processing in real time on a serial computer - Baker - 1978
167 Garbage collection in an uncooperative environment (context) - Hans-Juergen, Mark - 1988
135 Object Oriented Programming: An Evolutionary Approach (context) - Bradley - 1986
106 The EXODUS extensible DBMS project: An overview - Carey, Dewitt et al. - 1990
95 Virtual memory primitives for user programs - Andrew, Li - 1990
85 Garbage collection can be faster than stack allocation - Andrew - 1987
81 Garbage collection of linked data structures (context) - Jacques - 1981
69 Compacting Garbage Collection with Ambiguous Roots - Joel - 1988
65 Lisp and Symbolic Computation (context) - Andrew, tags et al. - 1989
64 A method for overlapping and erasure of lists (context) - Collins - 1960
61 Technical Report CMU-CS (context) - Eric, Draves et al. - 1988
53 Inheritance of synchronization and recovery properties in Av.. (context) - David, Maurice et al. - 1988
36 Experiences with Concurrent Garbage Collectors for Modula (context) - John
20 Concurrent Garbage Collection for C (context) - David - 1990
12 Garbage collection (context) - Andrew - 1990
10 Mostly-Copying Collection Picks Up Generations and C (context) - Joel - 1989
9 ACM Transactions on Computer Systems (context) - Mark, Kolling et al. - 1985
7 Heap Storage Management for the Programming Language Pascal (context) - Britton - 1975
5 A memory allocator with garbage collection for C (context) - Michael - 1988
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.digital.fr.html): More
Fast Implementations of RSA Cryptography - Shand, Vuillemin (1993) (Correct)
Counting Minimum Weight Spanning Trees - Broder, Mayr (Correct)
Report on the Larch Shared Language Version 2.3 - Guttag, Horning, Modet (1993) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC