Challenges in parallel graph processing

Parallel Processing Letters

Volumn 17, Issue 1, 2007, Pages 5-20

  Lumsdaine, Andrew ^a   Gregor, Douglas ^a   Hendrickson, Bruce ^b   Berry, Jonathan ^b  

^a INDIANA UNIVERSITY   (United States)

^b SANDIA NATIONAL LABORATORIES   (United States)

Author keywords

Distributed memory; Graph algorithms; Graph theory; Multithreading; Parallel architectures; Shortest paths

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; COMPUTER HARDWARE; COMPUTER SOFTWARE; DATA MINING; PARALLEL PROCESSING SYSTEMS;

DISTRIBUTED MEMORY; GRAPH ALGORITHMS; MULTITHREADING; PARALLEL ARCHITECTURES;

GRAPH THEORY;

EID: 34147120152     PISSN: 01296264     EISSN: None     Source Type: Journal    
DOI: 10.1142/S0129626407002843     Document Type: Conference Paper

References (21)

1. G. Amza, A. L. Cox, S. Dwarkadas, P. Keleher, H. Lu, R. Rajamony, W. Yu, and W. Zwaenepoel. Treadmarks: Shared memory computing on networks of workstations. IEEE Computer, 29(2): 18-28, 1996.
2. W. Anderson, P. Briggs, C. S. Hellberg, D. W. Hess, A. Khokhlov, M. Lanzagorta, and R. Rosenberg. Early experiences with scientific programs on the Cray MTA-2. In Proc. SC'03, 2003.
3. D. Bader and K. Madduri. Designing multithreaded algorithms for breadth-first search and st-connectivity on the Cray MTA-2. In Proc. 35th Int'l Conf. on Parallel Processing (ICPP), Columbus, OH, August 2006. IEEE Computer Society.
4. J. W. Berry, B. Hendrickson, S. Kahan, and P. Konecny. Graph software development and performance on the MTA-2 and Eldorado. In Cray User's Group, May 2006.
5. L. Dagum and R. Menon. Openmp: An industry-standard api for shared-memory programming. IEEE Computational Science and Engineering, 05(1):46-55, 1998.
6. T. A. El-Ghazawi, W. W. Carlson, and J. M. Draper. UPC Language Specification, 1.1 edition, May 2003. http://www.gwu.edu/~upc/downloads/- upc_specs_1.1p2pre1.pdf.
7. J. Feo, D. Harper, S. Kahan, and P. Konecny. Eldorado. In Proc. 2nd Conf. Computing Frontiers, pages 28-34, 2005.
8. E. Gabriel, G. E. Fagg, G. Bosilca, T. Angskun, J. J. Dongarra, J. M. Squyres, V. Sahay, P. Kambadur, B. Barrett, A. Lumsdaine, R. H. Castain, D. J. Daniel, R. L. Graham, and T. S. Woodall. Open MPI: Goals, concept, and design of a next generation MPI implementation. In Proceedings, 11th European PVM/MPI Users' Group Meeting, pages 97-104, Budapest, Hungary, September 2004.
9. D. Gregor, N. Edmonds, B. Barrett, and A. Lumsdaine. The Parallel Boost Graph Library. http://www.osl.iu.edu/research/pbgl, 2005.
10. D. Gregor and A. Lumsdaine. The Parallel BGL: A generic library for distributed graph computations. In Parallel Object-Oriented Scientific Computing (POOSC), July 2005.
11. W. Gropp, S. Huss-Lederman, A. Lumsdaine, E. Lusk, B. Nitzberg, W. Saphir, , and M. Snir. MPI - The Complete Reference: Volume 2, the MPI-2 Extensions. MIT Press, 1998.
12. J. JáJá. An introduction to parallel algorithms. Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, USA, 1992.
13. K. Madduri, D. A. Bader, J. W. Berry, and J. Crobak. Parallel shortest path algorithms for solving large-scale instances. In 9th DIMACS Implementation Challenge: Shortest Paths, November 2006.
14. Message Passing Interface Forum. MPI: A Message Passing Interface. In Proc. of Supercomputing '93, pages 878-883. IEEE Computer Society Press, November 1993.
15. U. Meyer and P. Sanders. Delta-stepping: A parallel single source shortest path algorithm. In ESA '98: Proceedings of the 6th Annual European Symposium on Algorithms, pages 393-404, London, UK, 1998. Springer-Verlag.
16. R. C. Murphy, J. Berry, W. McLendon III, B. Hendrickson, D. Gregor, and A. Lumsdaine. DRS: A simple to write yet difficult to execute benchmark. In Proc. IEEE Intl. Symp. Workload Characterizations, October 2006.
17. R. C. Murphy and P. M. Kogge. On the memory access patterns of supercomputer applications: Benchmark selection and its implications. IEEE Trans. Computers, 2007. To appear.
18. System Application Program Interface (API) [C Language]. Information technology - Portable Operating System Interface (POSIX). IEEE Press, Piscataway, NJ, 1990.
19. K. Underwood, M. Vance, J. Berry, and B. Hendrickson. Analyzing the scalability of Eldorado. In Proc. Cray User's Group, May 2006.
20. L. G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8):103-111, 1990.
21. A. Yoo, E. Chow, K. Henderson, W. McLendon, B. Hendrickson, and U. Catalyurek. A scalable distributed parallel breadth-first search algorithm on BlueGene/L. In SC '05: Proceedings of the 2005 ACM/IEEE conference on Supercomputing, page 25, Washington, DC, USA, 2005. IEEE Computer Society.