Wait-free parallel algorithms for the union-find problem

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F130073, Issue , 1991, Pages 370-380

  Anderson, Richard J ^a   Wont, Heather ^b  

^a UNIVERSITY OF WASHINGTON   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATA STRUCTURES;

DATA STRUCTURE OPERATIONS; EFFICIENT DATA STRUCTURES; GENERAL ADVERSARY; MACHINE MODELING; SHARED MEMORY MULTIPROCESSOR; UNION-FIND DATA STRUCTURES; UNION-FIND PROBLEMS; WORST-CASE PERFORMANCE;

COMPUTATION THEORY;

EID: 85031394797     PISSN: 07378017     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/103418.103458     Document Type: Conference Paper

References (16)

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
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
3. R. J. Anderson. Wait-free primitives for list compression. Work in progress, 1991
4. J. Buss and P. Ragde. Certified write-All on a strongly asynchronous PRAM. Preliminary Report, 1990
5. R. Cole and U. Vishkin. Deterministic coin tossing with applications to optimal parallel list ranking. Information and Computation, 70:32-53, 1986
6. P. Gibbons. A more practical PRAM model, In 1989 ACM Symposium on Parallel Algorithms and Architectures, pages 158-168, 1989
7. M. Herlihy. Impossibfity and universality results for wait-free synchronization. In Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, pages 276-291, 1988
8. M. Herlihy. A methodology for implementing highly concurrent data structures. In Second ACM SIGPLA N Symposium on Principles and Practice of Parallel Programming, pages 197-206, 1990
9. M. P. Herlihy and J. M. Wing. Axioms for concurrent objects. In Proceedings of the Fourteenth Annual ACM Symposium on Principles of Programming Languages, pages 13-26, 1987
10. Z. M. Kedem, K. V. Palem, and P. G. Spirakis Efficient robust parallel computations In Proceedings of the 22nd ACM Symposium on Theory of Computation, pages 138-148, 1990
11. P. Kanellakis and A. Shvartsman. Efficient parallel algorithms can be made robust. In Proceedings of the Eighth Annual A CM Symposium on Principles of Distributed Computing, pages 211-222, 1989
12. C. Martel, R. Subramonian, and A. Park Asynchronous PRAMs are (ahnost) as good as synchronous PRAMs. In 31st Symposium on Foundations of Computer Science, pages 590-599, 1990
13. N. Nishimura. Asynchronous shared memory parallel computation. In Second Annual Symposium on Parallel Algorithms and Architectures, pages 76-84, 1990
14. R.Cole and O. Zajicek. The APRAM: Incorporating asynchrony into the PRAM model In 1989 ACM Symposium on Parallel Algorithms and Architectures, pages 169-178, 1989
15. R.Cole and O. Zajicek. The expected advant age of asynchrony. In Second Annual Symposium on Parallel Algorithms and Architectures, pages 85-94, 1990
16. R. E. Tarjan. Data Structures and, Network Algorithms, SIAM 1983