See this document in CiteSeerX!

Wait-free Parallel Algorithms for the Union-Find Problem (1994)  (Make Corrections)  (36 citations)
Richard J. Anderson, Heather Woll
STOC: ACM Symposium on Theory of Computing (STOC)



  Home/Search   Context   Related

 
View or download:
128.95.4.112/homes/anderson/pap...uf.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  128.95.4.112/homes/ander...papers (more)
Homepages:  R.Anderson  

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: We are interested in designing efficient data structures for a shared memory multiprocessor. In this paper we focus on the Union-Find data structure. We consider a fully asynchronous model of computation where arbitrary delays are possible. Thus we require our solutions to the data structure problem have the wait-free property, meaning that each thread continues to make progress on its operations, independent of the speeds of the other threads. In this model efficiency is best measured in terms ... (Update)

Cited by:   More
Distributed Scheduling for Disconnected Cooperation - Malewicz (2003)   (Correct)
A Method for Creating Near-Optimal Instances of a Certified.. - Malewicz (2003)   (Correct)
On-the-Fly Maintenance of Series-Parallel.. - Bender, Fineman.. (2004)   (Correct)

Active bibliography (related documents):   More   All
0.5:   Parallel Algorithms with Processor Failures and Delays - Buss, Kanellakis, Ragde.. (1995)   (Correct)
0.3:   A Theory of Competitive Analysis for Distributed Algorithms - Ajtai, Aspnes, Dwork, Waarts (1994)   (Correct)
0.3:   Collective Consistency - Dwork, Ho, Strong (1996)   (Correct)

Similar documents based on text:   More   All
0.2:   Wait-Free Algorithms for Heaps - Greg Barnes (1994)   (Correct)
0.2:   Waitfree distributed memory management by Create, and Read.. - Hesselink, Groote (1998)   (Correct)
0.2:   Long-lived, Fast, Waitfree Renaming with Optimal.. - Eberly, Higham..   (Correct)

Related documents from co-citation:   More   All
23:   A methodology for implementing highly concurrent data objects - Herlihy - 1993
13:   Parallel Algorithms with Processor Failures and Delays - Buss, Kanellakis et al. - 1991
12:   The APRAM: Incorporating asynchrony into the PRAM model (context) - Cole, Zajicek - 1989

BibTeX entry:   (Update)

R.J. Anderson and H. Woll. Wait-free parallel algorithms for the unionfind problem. In Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, pages 360--370, May 1991. http://citeseer.ist.psu.edu/anderson94waitfree.html   More

@inproceedings{ anderson91waitfree,
    author = "Richard J. Anderson and Heather Woll",
    title = "Wait-free Parallel Algorithms for the Union-Find Problem",
    booktitle = "{STOC}: {ACM} Symposium on Theory of Computing ({STOC})",
    year = "1991",
    url = "citeseer.ist.psu.edu/anderson94waitfree.html" }
Citations (may not include all citations):
917   and the ordering of events in a distributed system (context) - Lamport, clocks - 1978
606   How to make a multiprocessor computer that correctly execute.. (context) - Lamport - 1979
476   Programming Language (context) - Kernighan, Ritchie - 1978
258   Data Structures and Network Algorithms (context) - Tarjan - 1983
250   volume 1 of The Art of Computer Programming (context) - Knuth - 1968
218   Probabilistic construction of deterministic algorithms: appr.. (context) - Raghavan - 1986
186   A methodology for implementing highly concurrent data struct.. - Herlihy - 1990
85   The APRAM: Incorporating asynchrony into the PRAM model (context) - Cole, Zajicek - 1989
78   Efficiency of a good but not linear set union algorithm (context) - Tarjan - 1975
75   Deterministic coin tossing with applications to optimal para.. (context) - Cole, Vishkin - 1986
72   A more practical PRAM model (context) - Gibbons - 1989
57   Impossibility and universality results for wait-free synchro.. (context) - Herlihy - 1988
56   Efficient robust parallel computations (context) - Kedem, Palem et al. - 1990
55   Worst-case analysis of set union algorithms (context) - Tarjan, van Leeuwen - 1984
51   Axioms for concurrent objects (context) - Herlihy, Wing - 1987
45   Wait-free data structures in the asynchronous PRAM model - Aspnes, Herlihy - 1990
43   On describing the behavior and implementation of distributed.. - Lynch, Fischer - 1981
40   Efficient parallel algorithms can be made robust (context) - Kanellakis, Shvartsman - 1989
37   Asynchronous shared memory parallel computation (context) - Nishimura - 1990
36   Wait-free parallel algorithms for the union-find problem - Anderson, Woll - 1991
35   The expected advantage of asynchrony (context) - Cole, Zajicek - 1990
32   Sticky bits and universality of consensus (context) - Plotkin - 1989
27   as good as synchronous PRAMs (context) - Martel, Subramonian et al. - 1990
7   Parallel algorithms for generating random permutations on a .. (context) - Anderson - 1990
4   Certified write-all on a strongly asynchronous PRAM (context) - Buss, Ragde - 1990
1   Wait-free primitives for list compression (context) - Anderson - 1991
1   Asynchrony in Shared Memory Parallel Computation (context) - Nishimura - 1991



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://128.95.4.112/homes/anderson/papers.html):   More
Optical Communication for Pointer Based Algorithms - Anderson (1988)   (Correct)
Algorithms for the Certified Write All Problem - Anderson (1994)   (Correct)
Computer Science Problems in Astrophysical Simulation - Richard Anderson   (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