(Enter summary)
Abstract: In multiprogrammed systems, synchronization often turns out to be a performance bottleneck
and the source of poor fault-tolerance. Wait-free and lock-free algorithms can do without
locking mechanisms, and therefore do not su#er from these problems. We present an e#cient
almost wait-free algorithm for parallel accessible hashtables, which promises more robust
performance and reliability than conventional lock-based implementations. Our solution is as
e#cient as sequential hashtables. It can... (Update)
Similar documents based on text: More All
0.5: Almost Wait-free Resizable Hashtables - Gao Department Of
(Correct)
0.1: A Formal Reduction for Lock-Free Parallel - Algorithms Gao And
(Correct)
0.1: Waitfree distributed memory management by Create, and Read.. - Hesselink, Groote (1998)
(Correct)
BibTeX entry: (Update)
H. Gao, J.F. Groote and W.H. Hesselink.: Ecient almost wait-free parallel accessible dynamic hashtables. Technical Report CS-Report 03-03, Eindhoven University of Technology, The Netherlands, 2003. To appear in the proceedings of IPDPS 2004. http://citeseer.ist.psu.edu/gao04ecient.html More
@misc{ gao03ecient,
author = "H. Gao and J. Groote and W. Hesselink",
title = "Ecient almost wait-free parallel accessible dynamic hashtables",
text = "H. Gao, J.F. Groote and W.H. Hesselink.: Ecient almost wait-free parallel
accessible dynamic hashtables. Technical Report CS-Report 03-03, Eindhoven
University of Technology, The Netherlands, 2003. To appear in the proceedings
of IPDPS 2004.",
year = "2003",
url = "citeseer.ist.psu.edu/gao04ecient.html" }
Citations (may not include all citations):
2003
The Art of Computer Programming (context) - Knuth - 1973
1180
The Temporal Logic of Reactive and Concurrent Systems: Speci.. (context) - Manna, Pnueli - 1992
718
Distributed Algorithms (context) - Lynch - 1996
186
A methodology for implementing highly concurrent data object..
- Herlihy - 1993
125
Wait--free synchronization
- Herlihy - 1991
75
Renaming in an asynchronous environment (context) - Attiya, Bar-Noy et al. - 1990
51
Prentice Hall (context) - Harbison - 1992
45
on Programming Languages and Systems (context) - Lamport - 1994
42
Fault-tolerant parallel computation (context) - Kanellakis, Shvartsman - 1997
35
Lock-free linked lists using compare-and-swap
- Valois - 1995
21
Implementing Lock-Free Queues
- Valois - 1994
20
PVS Language Reference (context) - Owre, Shankar et al. - 2001
18
An algorithm for the asynchronous write-all problem based on..
- Groote, Hesselink et al. - 2001
18
Lock-free garbage collection for multiprocessors (context) - Herlihy, Moss - 1992
17
Data Structures = Programs (context) - Wirth - 1976
6
message-passing in an asynchronous distributed environment (context) - Bar-Noy, Dolev - 1989
4
Wait--free linearization with a mechanical proof (context) - Hesselink - 1995
3
Bounded Delay for a Free Address (context) - Hesselink - 1996
2
Wait-free concurrent memory management by Create (context) - Hesselink, Groote - 2001
1
th Summer School (context) - Cassez, Jard et al. - 2000
http://www.cs.rug.nl/~wim/mechver/hashtable
Documents on the same site (http://www.win.tue.nl/~jfg/publications1.html): More
Operational semantics for Petri Net components - Groote, Voorhoeve
(Correct)
The Syntax and Semantics of μCRL - Groote, Ponse
(Correct)
Solving Disjunctive/Conjunctive Boolean Equation Systems.. - Groote, Keinänen (2003)
(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