Designing multithreaded algorithms for Breadth-First Search and si-connectivity on the Cray MTA-2

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 2006, Pages 523-530

  Bader, David A ^a   Madduri, Kamesh ^a  

^a Georgia Institute of Technology   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHM EXECUTION TIME; BREADTH-FIRST SEARCH; MULTITHREADED ALGORITHMS;

COMPUTATIONAL COMPLEXITY; GRAPH THEORY; GRID COMPUTING; LARGE SCALE SYSTEMS; NATURAL SCIENCES COMPUTING; PROBLEM SOLVING;

PARALLEL ALGORITHMS;

EID: 34547399946     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.2006.34     Document Type: Conference Paper

References (44)

1. J. M. Abello and J. S. Vitter, editors. External memory algorithms. American Mathematical Society, Boston, MA, USA, 1999.
2. B. Awerbuch and R. G. Gallager. A new distributed algorithm to find breadth first search trees. IEEE Trans. Inf. Theor., 33(3):315-322, 1987.
3. B. Awerbuch, A. V. Goldberg, M. Luby, and S. A. Plotkin. Network decomposition and locality in distributed computation. In IEEE Symp. on Foundations of Computer Science, pages 364-369, 1989.
4. D. Bader, G. Cong, and J. Feo. On the architectural requirements for efficient execution of graph algorithms. In Proc. 34th Int'l Conf. on Parallel Processing (ICPP), Oslo, Norway, June 2005.
5. D. Bader, J. Feo, and et al. HPCS SSCA#2 Graph Analysis Benchmark Specifications vl.1, Jan. 2006.
6. D. Bader and K. Madduri. Design and implementation of the HPCS graph analysis benchmark on symmetric multiprocessors. In Proc. 12th Int'l Conf. on High Performance Computing, Goa, India, Dec. 2005. Springer-Verlag.
7. D. Bader and K. Madduri. Designing multithreaded algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2. Technical report, Georgia Tech, Feb. 2006.
8. A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, October 1999.
9. G. Barnes and W. L. Ruzzo. Deterministic algorithms for undirected s-t connectivity using polynomial time and sublinear space. In Proc. 23rd Annual ACM Symp. on Theory of Computing, pages 43-53, New York, NY, USA, 1991. ACM Press.
10. U. Brandes. A faster algorithm for betweenness centrality. J. Mathematical Sociology, 25(2):163-177, 2001.
11. A. L. Buchsbaum, M. Goldwasser, S. Venkatasubramanian, and J. Westbrook. On external memory graph traversal. In Proc. 11th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 859-860, Philadelphia, PA, USA, 2000.
12. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-MAT: A recursive model for graph mining. In Proc. 4th SIAM Intl. Conf. on Data Mining, Florida, USA, Apr. 2004.
13. B. Cherkassky, A. Goldberg, and T. Radzik. Shortest paths algorithms: theory and experimental evaluation. Mathematical Programming, 73:129-174, 1996.
14. T. Coffman, S. Greenblatt, and S. Marcus. Graph-based technologies for intelligence analysis. Communications of the ACM, 47(3):45-47, 2004.
15. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Inc., Cambridge, MA, 1990.
16. A. Crauser, K. Mehlhorn, U. Meyer, and P. Sanders. A parallelizationof Dijkstra's shortest path algorithm. In Proc. 23rd Int'l Symp. on Mathematical Foundations of Computer Science, pages 722-731, London, UK, 1998. Springer-Verlag.
17. DARPA Information Processing Technology Office. High productivity computing systems project, 2004. http://www.darpa.mil/ipto/programs/hpcs/.
18. F. Dehne, A. Ferreira, E. Cáceres, S. W. Song, and A. Roncato. Efficient parallel graph algorithms for coarse-grained multicomputers and BSP. Algorithmica, 33:183-200, 2002.
19. C. Demetrescu, A. Goldberg, and D. Johnson. 9th DIMACS implementation challenge - Shortest Paths, http://www.dis.uniromal.it/~challenge9/.
20. E. W. Dijkstra. A note on two problems in connexion with graphs. Numer. Math., 1:269-271, 1959.
21. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the Internet topology. In Proc. ACM SIGCOMM, pages 251-262, 1999.
22. L. C. Freeman. A set of measures of centrality based on betweenness. Sociometry, 40(1):35-41, 1977.
23. H. Gazit and G. L. Miller. An improved parallel algorithm that computes the BFS numbering of a directed graph. Inf. Process. Lett., 28(2):61-65, 1988.
24. J. Greiner. A comparison of data-parallel algorithms for connected components. In Proc. 6th Ann. Symp. Parallel Algorithms and Architectures (SPAA-94), pages 16-25, Cape May, NJ, June 1994.
25. A. Inokuchi, T. Washio, and H. Motoda. An apriori-based algorithm for mining frequent substructures from graph data. In Proc. 4th European Conf. on Principles of Data Mining and Knowledge Discovery, pages 13-23, London, UK, 2000.
26. J. JáJá. An Introduction to Parallel Algorithms. Addison-Wesley Publishing Company, New York, 1992.
27. G. Karypis, E. Han, and V. Kumar. Chameleon: Hierarchical clustering using dynamic modeling. Computer, 32(8):68-75, 1999.
28. J. Kepner, D. P. Koester, and et al. HPCS Scalable Synthetic Compact Application (SSCA) Benchmarks, 2004. http://www.highproductivity.org/ SSCABmks.htm.
29. P. Klein and J. Reif. An efficient parallel algorithm for planarity. J. Comp. and System. Sci., 37(2):190-246, 1988.
30. V. Krebs. Mapping networks of terrorist cells. Connections, 24(3):43-52, 2002.
31. T. Lengauer. Combinatorial algorithms for integrated circuit layout. John Wiley & Sons, Inc., New York, NY, USA, 1990.
32. H. R. Lewis and C. H. Papadimitriou. Symmetric space-bounded computation (extended abstract). In Proc. 7th Colloquium on Automata, Languages and Programming, pages 374-384, London, UK, 1980.
33. U. Meyer. External memory BFS on undirected graphs with bounded degree. In Proc. 12th Annual ACM-SIAM Symp. on Discrete Algorithms, pages 87-88, Philadelphia, PA, USA, 2001.
34. U. Meyer and P. Sanders. Δ-stepping: aparallelizable shortest path algorithm. J. Algorithms, 49(1):114-152, 2003.
35. G. L. Miller and J. H. Reif. Parallel tree contraction and its application. In Proc. 26th Ann. IEEE Symp. Foundations of Computer Science, pages 478-489, Portland, OR, Oct. 1985.
36. B. Moret, D. Bader, and T. Warnow. High-performance algorithm engineering for computational phylogenetics. In Proc. Int'l Conf. on Computational Science, volume 2073-2074 of Lecture Notes in Computer Science, San Francisco, CA, 2001. Springer-Verlag.
37. B. M. Moret, D. Bader, T. Warnow, S. Wyman, and M. Yan. GRAPPA: a high-performance computational tool for phylogeny reconstruction from gene-order data. In Proc. Botany, Albuquerque, NM, Aug. 2001.
38. P. M. Pardalos, M. G. Resende, and K. G. Ramakrishnan, editors. Parallel Processing of Discrete Optimization Problems: DIMACS Workshop April 28-29, 1994. American Mathematical Society, Boston, MA, USA, 1995.
39. R. Seidel. On the all-pairs-shortest-path problem in unweighted undirected graphs. J. Comput. Syst. Sci., 51(3):400-403, 1995.
40. M. Thorup. Undirected single-source shortest paths with positive integer weights in linear time. J. ACM, 46(3):362-394, 1999.
41. J. L. Träff. An experimental comparison of two distributed single-source shortest path algorithms. Parallel Comput., 21(9):1505-1532, 1995.
42. J. Ullman and M. Yannakakis. High-probability parallel transitive closure algorithms. In Proc. 2nd Ann. Symp. Parallel Algorithms and Architectures (SPAA-90), pages 200-209, New York, NY, USA, 1990. ACM Press.
43. A. Vazquez, A. Flammini, A. Maritan, and A. Vespignani. Global protein function prediction in protein-protein interaction networks. Nature Biotechnology, 21 (6):697-700, June 2003.
44. A. Yoo, E. Chow, K. Henderson, W. McLendon, B. Hendrickson, and Ü. V. Çatalyurek. A scalable distributed parallel breadth-first search algorithm on Bluegene/L. In Proc. Supercomputing (SC 2005), Seattle, WA, Nov. 2005.