Wim H. Hesselink, Jan Friso Groote  Home/Search
Context Related
| cs.rug.nl/~eke/iwi/prep...98805.ps.gz cwi.nl/ftp/CWIreports/...SENR9811.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: cs.rug.nl/~eke/iwi/preprints/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The acronym CRUD represents an interface specification and an algorithm for the management of memory shared by concurrent processes. The memory cells form a directed acyclic graph. This graph is only modified by adding a new node with a list of reachable children, and by removing unreachable nodes. If memory is not full, the algorithm ensures waitfree redistribution of free nodes. It uses atomic counters for reference counting and consensus variables to ensure exclusive access. Performance is... (Update)
Context of citations to this paper: More
...of some processors to complete tasks on time. Here again, a common challenge is to perform N independent tasks on P processors [14]. Such tasks could be copying a large array, searching a collection of data, or applying a function to all elements of a matrix [12, 13]...
...multiprocessors with unpredictable load patterns. Here a common challenge is to eciently perform t independent tasks on n processors [17]. Such tasks could be copying a large array, searching a collection of data, or applying a function to all elements of a matrix [14, 15] In...
Cited by: More
Towards Practical Deterministic - Write-All Algorithms Bogdan (Correct)
Towards Practical Deterministic Write-All Algorithms - Chlebus, Dobrev, Kowalski, .. (2001) (Correct)
Lock-Free Reference Counting - Detlefs, Martin, Moir, Steele, Jr. (2001) (Correct)
Active bibliography (related documents): More All
0.5: Invariants for the Construction of a Handshake Register - Hesselink (1998) (Correct)
0.5: the Garbage Collection Bibliography - Richard Jones (2003) (Correct)
0.3: Almost Wait-free Resizable Hashtables - Gao Department Of (Correct)
Similar documents based on text: More All
0.6: The Design of a Linearization of a Concurrent Data Object - Hesselink (Correct)
0.5: Eternity Variables to Simulate Specifications - Hesselink (2002) (Correct)
0.5: Wait-Free Consensus - Aspnes (1992) (Correct)
Related documents from co-citation: More All
5: Parallel Algorithms with Processor Failures and Delays - Buss, Kanellakis et al. - 1991
5: Fault-Tolerant Parallel Computation (context) - Kanellakis, Shvartsman - 1997
5: The Art of Computer Programming Vol (context) - Knuth - 1968
BibTeX entry: (Update)
J.F. Groote and W.H. Hesselink. Wait-free distributed memory management by Create and Read until Deletion (CRUD). Technical Report SEN-R9811, CWI, Amsterdam, 1998. http://citeseer.ist.psu.edu/hesselink98waitfree.html More
@incollection{ hesselink98waitfree,
author = "Wim H. Hesselink and Jan Friso Groote",
title = "Waitfree distributed memory management by Create, and Read Until Deletion ({CRUD})",
booktitle = "113",
month = "31",
publisher = "Centrum voor Wiskunde en Informatica (CWI)",
address = "ISSN 1386-369X",
pages = "17",
year = "1998",
url = "citeseer.ist.psu.edu/hesselink98waitfree.html" }
Citations (may not include all citations):652 A discipline of programming (context) - Dijkstra - 1976
334 A Computational Logic Handbook (context) - Boyer, Moore - 1988
208 An axiomatic proof technique for parallel programs (context) - Owicki, Gries - 1976
125 Wait--free synchronization - Herlihy - 1991
36 The discrete time ToolBus -- a software coordination archite.. - Bergstra, Klint - 1998
26 algorithms for automatic dynamic memory management (context) - Jones, Lins - 1996
17 Long-lived renaming made fast - Buhrman, Garay et al. - 1995
14 Core Technologies for System Renovation - Brand, van den and et al. - 1996
3 Bounded Delay for a Free Address (context) - Hesselink - 1996
2 fly garbage collection for several mutators (context) - Jonker - 1992
2 The design of a linearization of a concurrent data object - Hesselink - 1998
1 A formal proof of fault-tolerant progress - Hesselink
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.rug.nl/~eke/iwi/preprints/): More
Change of structure in financial time series, long range.. - Mikosch, Starica (1999) (Correct)
Summation of Formal Solutions of a Class of Linear.. - Braaksma, Faber, Immink (1998) (Correct)
Stochastic Models for Transport in a Fluidized Bed - Dehling, Hoffmann, Stuut (1998) (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