A scalable parallel union-find algorithm for distributed memory computers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6067 LNCS, Issue PART 1, 2010, Pages 186-195

  Manne, Fredrik ^a   Patwary, Md Mostofa Ali ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

disjoint sets; distributed memory; parallel Union Find

Indexed keywords

DISJOINT SETS; DISTRIBUTED MEMORY; DISTRIBUTED-MEMORY COMPUTERS; LARGE GRAPHS; PARALLEL IMPLEMENTATIONS; SEQUENTIAL ALGORITHM; SHARED-MEMORY COMPUTERS; SPANNING TREE; UNION-FIND;

PARALLEL ALGORITHMS;

IMAGE PROCESSING;

EID: 77955118855     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14390-8_20     Document Type: Conference Paper

References (10)

1. Anderson, R.J., Woll, H.: Wait-free parallel algorithms for the union-find problem. In: Proceedings of The Twenty-Third Annual ACM Symposium on Theory of Computing (STOC 1991), pp. 370-380 (1991)
2. Bader, D.A., Madduri, K.: GTGraph: A synthetic graph generator suite (2006), http://www.cc.gatech.edu/∼kamesh/GTgraph
3. Bader, D.J., Cong, G.: A fast, parallel spanning tree algorithm for symmetric multiprocessors (smps). Journal of Parallel and Distributed Computing 65, 994-1006 (2005)
4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. The MIT Press, Cambridge (2001)
5. Cybenko, G., Allen, T.G., Polito, J.E.: Practical parallel algorithms for transitive closure and clustering. International Journal of Parallel Computing 17, 403-423 (1988)
6. Davis, T.A.: University of Florida sparse matrix collection. ACM Transactions on Mathematical Software (submitted)
7. Gebremedhin, A.H., Tarafdar, A., Manne, F., Pothen, A.: New acyclic and star coloring algorithms with applications to computing hessians. SIAM Journal on Scientific Computing 29, 515-535 (2007)
8. Koster, J.: Parasol matrices, http://www.parallab.uib.no/projects/ parasol/data
9. Tarjan, R.E., van Leeuwen, J.: Worst-case analysis of set union algorithms. J. ACM 31, 245-281 (1984)
10. Vastenhouw, B., Bisseling, R.H.: A two-dimensional data distribution method for parallel sparse matrix-vector multiplication. SIAM Review 47, 67-95 (2005)