Wait-free concurrent memory management by create and read until deletion (CaRuD)

Distributed Computing

Volumn 14, Issue 1, 2001, Pages 31-39

  Hesselink, Wim H ^a   Groote, Jan Friso ^b,c  

^a UNIVERSITY OF GRONINGEN   (Netherlands)

^b CWI   (Netherlands)

^c EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Concurrent garbage collection; Consensus; Reference counting; Shared memory; Terms; Wait free

Indexed keywords

ALGORITHMS; DATABASE SYSTEMS; GRAPH THEORY; INTERFACES (COMPUTER); RESPONSE TIME (COMPUTER SYSTEMS); STORAGE ALLOCATION (COMPUTER);

CONCURRENT GARBAGE COLLECTION; CREATE AND READ UNTIL DELETION INTERFACE; DIRECTED ACYCLIC GRAPH; REFERENCE COUNTING; SHARED MEMORY; WAIT FREE CONCURRENT MEMORY MANAGEMENT;

PARALLEL PROCESSING SYSTEMS;

EID: 0034881394     PISSN: 01782770     EISSN: None     Source Type: Journal    
DOI: 10.1007/PL00008924     Document Type: Article

References (18)

1. The discrete time ToolBus - A software coordination architecture
2. Efficient annotated terms
3. Long-lived renaming made fast
4. An efficient lock-free algorithm for parallel accessible hashtables
5. A methodoly for implementing highly concurrent data structures
6. Wait-free synchronization
7. Lock-free garbage collection for multiprocessors
8. Bounded delay for a free address
9. The design of a linearization of a concurrent data object
10. Progress under bounded fairness
11. Waitfree distributed memory management by create, and read until deletion (CRUD)
12. Garbage collection, algorithms for automatic dynamic memory management
13. On-the-fly garbage collection for several mutators
14. An axiomatic proof technique for parallel programs
15. Lock-free linked lists using compare-and-swap