Article

Free access

Wait-free parallel algorithms for the union-find problem

Authors:

Richard J. Anderson,

Heather WollAuthors Info & Claims

STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of Computing

Pages 370 - 380

https://doi.org/10.1145/103418.103458

Published: 03 January 1991 Publication History

PDF eReader

References

[1]

J. Aspnes and M. Herlihy. Wait-free data structures in the asynchronous PRAM model. in Second Annual Symposium on Parallel Algorithms and Architectures, pages 340-349, 1990.

Digital Library

Google Scholar

[2]

R. J. Anderson. Parallel algorithms for generating random permutations on a shared memory machine. In Second Annual Symposium on Parallel Algorithms and Architectures, pages 95-102, 1990.

Digital Library

Google Scholar

[3]

R. J. Anderson. Wait-free primitives for list compression. Work in progress, 1991.

Google Scholar

[4]

J. Buss and P. Ragde. Certified write-all on a strongly asynchronous P RAM. Preliminary Report, 1990.

Google Scholar

[5]

R. Cole and U. Vishkin. Deterministic coin tossing with applications to optimal parallel llst ranking. Information and Computation, 70:32-53, 1986.

Digital Library

Google Scholar

[6]

P. Gibbons. A more practical PRAM model. In 1989 A CM Symposium on Parallel Algorithms and Architectures, pages 158-168, 1989.

Digital Library

Google Scholar

[7]

M. Herlihy. Impossibility and universality results for wait-free synchronization. In Proceedings of the Seventh Annual A CM Symposium on Principles of Distributed Computing, pages 276-291, 1988.

Digital Library

Google Scholar

[8]

M. Herlihy. A methodology for implementing highly concurrent data structures. In Second A CM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pages 197-206, 1990.

Digital Library

Google Scholar

[9]

M. P. Herlihy and J. M. Wing. Axioms for concurrent objects. In Proceedings of the Fourteenth Annual A CM Symposium on Principles of Programming Languages, pages 13- 26, 1987.

Digital Library

Google Scholar

[10]

Z.M. Kedem, K. V. Palem, and P. G. Spiraids. Efficient robust parallel computations. In Proceedings of the 22nd A CM Symposium on Theory of Computation, pages 138-148, 1990.

Digital Library

Google Scholar

[11]

P. Kanellakis and A. Shvartsman. Efficient parallel algorithms can be made robust. In Proceedings o.f the Eighth Annual A CM Symposium on Principles of Distributed Computing, pages 211-222, 1989.

Digital Library

Google Scholar

[12]

C. Martel, R. Subramonian, and A. Park. Asynchronous PRAMs are (almost) as good as synchronous PRAMs. In 31st Symposium on Foundations of Computer Science, pages 590-599, 1990.

Digital Library

Google Scholar

[13]

N. Nishimura. Asynchronous shared memory parallel computation. In Second Annual Symposium on Parallel Algorithms and Architectures, pages 76-84, 1990.

Digital Library

Google Scholar

[14]

R.Cole and O. Zajicek. The APRAM: Incorporating asynchrony into the P RAM model. In 1989 A CM Symposium on Parallel Algorithms and Architectures, pages 169-178, 1989.

Digital Library

Google Scholar

[15]

R.Cole and O. Zajicek. The expected advantage of asynchrony. In Second Annual Symposium on Parallel Algorithms and Architectures, pages 85-94, 1990.

Digital Library

Google Scholar

[16]

R.E. Tarjan. Data Structures and Network Algorithms. SIAM, 1983.

Digital Library

Google Scholar

Cited By

View all

Pisha LYadegari S(2024)Specular Path Generation and Near-Reflective Diffraction in Interactive Acoustical SimulationsIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2023.323866230:7(3609-3621)Online publication date: Jul-2024
https://doi.org/10.1109/TVCG.2023.3238662
Kim CHan CPark H(2024)BTS: Load-Balanced Distributed Union-Find for Finding Connected Components with Balanced Tree Structures2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00089(1090-1102)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00089
Attiya HFouren AKo J(2024)Lower Bounds on the Amortized Time Complexity of Shared ObjectsTheory of Computing Systems10.1007/s00224-024-10184-w68:5(1372-1426)Online publication date: 12-Jul-2024
https://doi.org/10.1007/s00224-024-10184-w
Show More Cited By

Index Terms

Recommendations

Are Lock-Free Concurrent Algorithms Practically Wait-Free?

Lock-free concurrent algorithms guarantee that some concurrent operation will always make progress in a finite number of steps. Yet programmers prefer to treat concurrent code as if it were wait-free, guaranteeing that all operations always make ...
A methodology for creating fast wait-free data structures
PPoPP '12: Proceedings of the 17th ACM SIGPLAN symposium on Principles and Practice of Parallel Programming

Lock-freedom is a progress guarantee that ensures overall program progress. Wait-freedom is a stronger progress guarantee that ensures the progress of each thread in the program. While many practical lock-free algorithms exist, wait-free algorithms are ...
Operation-Level Wait-Free Transactional Memory with Support for Irrevocable Operations
Transactional memory (TM) aims to be a general purpose concurrency mechanism. However, operations which cause side-effects cannot be easily managed by a TM system, in which transactions are executed optimistically. In particular, networking, I/O, and some ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of Computing

January 1991

572 pages

ISBN:0897913973

DOI:10.1145/103418

Chairmen:
Cris Koutsougeras
Tulane Univ., New Orleans, LA
,
Jeff Vitter
Brown Univ., Providence, RI

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 January 1991

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC91

Sponsor:

SIGACT

STOC91: 23rd Annual ACM Symposium on Theory of Computing

May 5 - 8, 1991

Louisiana, New Orleans, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

78
Total Citations
View Citations
2,128
Total Downloads

Downloads (Last 12 months)557
Downloads (Last 6 weeks)91

Reflects downloads up to 12 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Pisha LYadegari S(2024)Specular Path Generation and Near-Reflective Diffraction in Interactive Acoustical SimulationsIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2023.323866230:7(3609-3621)Online publication date: Jul-2024
https://doi.org/10.1109/TVCG.2023.3238662
Kim CHan CPark H(2024)BTS: Load-Balanced Distributed Union-Find for Finding Connected Components with Balanced Tree Structures2024 IEEE 40th International Conference on Data Engineering (ICDE)10.1109/ICDE60146.2024.00089(1090-1102)Online publication date: 13-May-2024
https://doi.org/10.1109/ICDE60146.2024.00089
Attiya HFouren AKo J(2024)Lower Bounds on the Amortized Time Complexity of Shared ObjectsTheory of Computing Systems10.1007/s00224-024-10184-w68:5(1372-1426)Online publication date: 12-Jul-2024
https://doi.org/10.1007/s00224-024-10184-w
Wang YZhang FLin MWang SSun XJin RKoyejo SMohamed SAgarwal ABelgrave DCho KOh A(2022)Robust graph structure learning via multiple statistical testsProceedings of the 36th International Conference on Neural Information Processing Systems10.5555/3600270.3602595(32083-32096)Online publication date: 28-Nov-2022
https://dl.acm.org/doi/10.5555/3600270.3602595
Koohi Esfahani MKilpatrick PVandierendonck HRauchwerger LCameron KNikolopoulos DPnevmatikatos D(2022)MASTIFFProceedings of the 36th ACM International Conference on Supercomputing10.1145/3524059.3532365(1-13)Online publication date: 28-Jun-2022
https://dl.acm.org/doi/10.1145/3524059.3532365
Blin NCarlinet ELemaitre FLacassagne LGeraud T(2022)Max-Tree Computation on GPUsIEEE Transactions on Parallel and Distributed Systems10.1109/TPDS.2022.315848833:12(3520-3531)Online publication date: 1-Dec-2022
https://doi.org/10.1109/TPDS.2022.3158488
Chu DZhang FZhang WLin XZhang Y(2022)Hierarchical Core Decomposition in Parallel: From Construction to Subgraph Search2022 IEEE 38th International Conference on Data Engineering (ICDE)10.1109/ICDE53745.2022.00090(1138-1151)Online publication date: May-2022
https://doi.org/10.1109/ICDE53745.2022.00090
Xu JGuo HShen HRaj MWang XXu XWang ZPeterka T(2021)Asynchronous and Load-Balanced Union-Find for Distributed and Parallel Scientific Data Visualization and AnalysisIEEE Transactions on Visualization and Computer Graphics10.1109/TVCG.2021.307458427:6(2808-2820)Online publication date: Jun-2021
https://doi.org/10.1109/TVCG.2021.3074584
Koohi Esfahani MKilpatrick PVandierendonck H(2021)Thrifty Label Propagation: Fast Connected Components for Skewed-Degree Graphs2021 IEEE International Conference on Cluster Computing (CLUSTER)10.1109/Cluster48925.2021.00042(226-237)Online publication date: Sep-2021
https://doi.org/10.1109/Cluster48925.2021.00042
Shafin KPesout TLorig-Roach RHaukness MOlsen HBosworth CArmstrong JTigyi KMaurer NKoren SSedlazeck FMarschall TMayes SCosta VZook JLiu KKilburn DSorensen MMunson KVollger MMonlong JGarrison EEichler ESalama SHaussler DGreen RAkeson MPhillippy AMiga KCarnevali PJain MPaten B(2020)Nanopore sequencing and the Shasta toolkit enable efficient de novo assembly of eleven human genomesNature Biotechnology10.1038/s41587-020-0503-6Online publication date: 4-May-2020
https://doi.org/10.1038/s41587-020-0503-6
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Are Lock-Free Concurrent Algorithms Practically Wait-Free?

A methodology for creating fast wait-free data structures

Operation-Level Wait-Free Transactional Memory with Support for Irrevocable Operations