A scalable distributed parallel breadth-first search algorithm on BlueGene/L

Proceedings of the ACM/IEEE 2005 Supercomputing Conference, SC'05

Volumn 2005, Issue , 2005, Pages 25-43

  Yoo, Andy ^a   Chow, Edmond ^c   Henderson, Keith ^a   McLendon, William ^b   Hendrickson, Bruce ^b   Çatalyürek, Ümit ^d  

^a LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

^c D E SHAW RESEARCH   (United States)

^d OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS; SUPERCOMPUTERS;

COLLECTIVE COMMUNICATION; COMMUNICATION OVERHEAD; POISSON RANDOM GRAPHS; SEARCH ALGORITHM;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 33845388971     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SC.2005.4     Document Type: Conference Paper

References (24)

1. Blue Gene/L. http://cmg-rr.llnl.gov/asci/platforms/bluegenel.
2. B. Bollobás. The diameter of random graphs. Trans. American Mathematical Society, 267:41-52, 1981.
3. U. V. Çatalyürek and C. Aykanat. A hypergraph-partitioning approach for coarse-grain decomposition. In ACM/IEEE SC2001, Denver, CO, November 2001.
4. M. Chein and M.-L. Mugnier. Conceptual graphs: Fundamental notions. Revue, d'intelligence artificielle, 6(4):365-406, 1992.
5. A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Phys. Rev. E, 70(6):066111, Dec. 2004.
6. A. Crauser, K. Mehlhorn, U. Meyer, and P. Sanders. A parallelization of Dijkstra's shortest path algorithm. Lecture Notes in Computer Science, 1450:722-731, 1998.
7. J. Duch and A. Arenas. Community detection in complex networks using extremal optimization. arXiv.cond-mat/0501368, Jan. 2005.
8. C. Faloutsos, K. McCurley, and A. Tomkins. Fast discovery of connection subgraphs. In Proceedings of the 10th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 118-127, Seattle, WA, USA, 2004. ACM Press.
9. G. Fox, M. Johnson, S. Otto, J. Salmon, and D. Walker. Solving Problems on Concurrent Processors. Prentice-Hall, Inc., 1988.
10. A. Y. Grama and V. Kumar. A survey of parallel search algorithms for discrete optimization problems, 1993.
11. Y. Han, V. Y. Pan, and J. H. Reif. Efficient parallel algorithms for computing all pair shortest paths in directed graphs. In ACM Symposium on Parallel Algorithms and Architectures, pages 353-362, 1992.
12. B. Hendrickson, R. Leland, and S. Plimpton. An efficient parallel algorithm for partitioning irregular graphs. Int. Journal of High Speed Computing, 7(1):73-88, 1995.
13. P. N. Klein and S. Subramanian. A randomized parallel algorithm for single-source shortest paths. J. Algorithms, 25(2):205-220, 1997.
14. R. Levinson. Towards domain-independent machine intelligence. In G. Mineau, B. Moulin, and J. Sowa, editors, Proc. 1st Int. Conf. on Conceptual Structures, volume 699, pages 254-273, Quebec City, Canada, 1993. Springer-Verlag, Berlin.
15. J. G. Lewis, D. G. Payne, and R. A. van de Geijn. Matrix-vector multiplication and conjugate gradient algorithms on distributed memory computers. In Proceedings of the Scalable High Performance Computing Conference, pages 542-550, 1994.
16. J. G. Lewis and R. A. van de Geijn. Distributed memory matrix-vector multiplication and conjugate gradient algorithms. In Proceedings of Supercomputing'93, pages 484-492, Portland, OR, November 1993.
17. K. Macherey, F. Och, and H. Ney. Natural language understanding using statistical machine translation, 2001.
18. Multiprogrammatic Capability Cluster (MCR). http://www.llnl.gov/linux/ mcr.
19. M. E. J. Newman. From the cover: The structure of scientific collaboration networks. Proceedings of the National Academy of Sciences, 98:404-409, 2001.
20. M. E. J. Newman. Detecting community structure in networks. European Physical Journal B, 38:321-330, May 2004.
21. M. E. J. Newman. Fast algorithm for detecting community structure in networks. Phys. Rev. E, 69(6):066133, June 2004.
22. M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Phys. Rev. E, 69(2):026113, Feb. 2004.
23. I. Pohl. Bi-directional search. Machine Intelligence, 6:127-140, 1971. eds. Meltzer and Michie, Edinburgh University Press.
24. Y.-J. Suh and K. G. Shin. All-to-all personalized communication in multidimensional torus and mesh networks. IEEE Trans. on Parallel and Distributed Systems, 12:38-59, 2001.