Multi-core spanning forest algorithms using the disjoint-set data structure

Proceedings of the 2012 IEEE 26th International Parallel and Distributed Processing Symposium, IPDPS 2012

Volumn , Issue , 2012, Pages 827-835

  Patwary, Md Mostofa Ali ^a   Refsnes, Peder ^b   Manne, Fredrik ^b  

^a NORTHWESTERN UNIVERSITY   (United States)

^b UNIVERSITY OF BERGEN   (Norway)

Author keywords

connected components; Disjoint sets; Multi core; spanning forrest

Indexed keywords

CONNECTED COMPONENT; DISJOINT SETS; HIGHLY-PORTABLE; MULTI CORE; MULTI-CORE ALGORITHM; SPANNING FORREST; SPARSE GRAPHS;

DATA STRUCTURES; DISTRIBUTED PARAMETER NETWORKS; FORESTRY;

ALGORITHMS;

ALGORITHMS; DATA BASES; PROBLEM SOLVING; TREES;

EID: 84866874919     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/IPDPS.2012.79     Document Type: Conference Paper

References (12)

1. R. C. Murphy, J. Berry, W. McLendon, B. Hendrickson, D. Gregor, and A. Lumsdaine, "DFS: A simple to write yet difficult to execute benchmark," in Proceedings of the IEEE International Symposium on Workload Characterizations (IISWC06), 2006.
2. R. C. Murphy, K. B. Wheeler, B. W. Barrett, and J. A. Ang, "Introducing the Graph 500," Cray User's Group (CUG), 2010.
3. D. J. Bader and G. Cong, "A fast, parallel spanning tree algorithm for symmetric multiprocessors (smps)," Journal of Parallel and Distributed Computing, vol. 65, pp. 994-1006, 2005.
4. R. E. Tarjan and J. van Leeuwen, "Worst-case analysis of set union algorithms," J. ACM, vol. 31, no. 2, pp. 245-281, 1984.
5. E. W. Dijkstra, A Discipline of Programming. Prentice-Hall, 1976.
6. M. M. A. Patwary, J. R. S. Blair, and F. Manne, "Experiments on union-find algorithms for the disjoint-set data structure," in Proceedings of SEA 2010, vol. 6067. Lecture Notes in Computer Science, Springer, 2010, pp. 411-423.
7. Y. Shiloach and U. Vishkin, "An O(log n) parallel connectivity algorithm," J. Alg., vol. 3, no. 1, pp. 57-67, 1982.
8. G. Cybenko, T. G. Allen, and J. E. Polito, "Practical parallel algorithms for transitive closure and clustering," Internat. J. Par. Comput., vol. 17, pp. 403-423, 1988.
9. R. J. Anderson and H. Woll, "Wait-free parallel algorithms for the union-find problem," in Proceedings of the twenty-third annual ACM symposium on Theory of computing (STOC 91), 1991, pp. 370-380.
10. F. Manne and M. M. A. Patwary, "A scalable parallel union-find algorithm for distributed memory computers," vol. 6067. Lecture Notes in Computer Science, Springer, 2010, pp. 186-195.
11. "OpenMP specifications." [Online]. Available: http://openmp.org/wp/openmp-specifications/
12. D. Chakrabarti and C. Faloutsos, "Graph mining: Laws, generators, and algorithms," ACM Comput. Surv., vol. 38, no. 1, p. 2, 2006.