Fast PGAS implementation of distributed graph algorithms

2010 ACM/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis, SC 2010

Volumn , Issue , 2010, Pages

  Cong, Guojing ^a   Almasi, George ^a   Saraswat, Vijay ^a  

^a IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

Connected components; Minimum spanning tree; Parallel graph algorithms; PGAS

Indexed keywords

ACCESS PATTERNS; CACHE PERFORMANCE; COMMUNICATION EFFICIENCY; CONNECTED COMPONENT; DISTRIBUTED GRAPH ALGORITHMS; DISTRIBUTED MEMORY; GRAPH ALGORITHMS; GRAPH ANALYSIS; MEMORY ACCESS; MINIMUM SPANNING TREE PROBLEM; MINIMUM SPANNING TREES; PARALLEL GRAPH ALGORITHMS; PGAS; SEQUENTIAL IMPLEMENTATION; SPARSE GRAPHS;

ALGORITHMS; OPTIMIZATION; PARALLEL ARCHITECTURES; SHAPE MEMORY EFFECT;

TREES (MATHEMATICS);

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

References (32)

1. M. Adler, W. Dittrich, B. Juurlink, M. Kutyłowski, and I. Rieping. Communication-optimal parallel minimum spanning tree algorithms (extended abstract). In SPAA'98: Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, pages 27-36, New York, NY, USA, 1998. ACM.
2. D. A. Bader and G. Cong. A fast, parallel spanning tree algorithm for symmetric multiprocessors (SMPs). In Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), Santa Fe, New Mexico, Apr 2004.
3. D. A. Bader and G. Cong. Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs. In Proc. 18th Int'l Parallel and Distributed Processing Symp. (IPDPS 2004), Santa Fe, New Mexico, Apr 2004.
4. D. A. Bader and G. Cong. Efficient parallel algorithms for multi-core and multiprocessors. In S. Rajasekaran and J. Reif, editors, Handbook of Parallel Computing: Models, Algorithms, and Applications. CRC press, 2007.
5. D.A. Bader, G. Cong, and J. Feo. On the architectural requirements for efficient execution of graph algorithms. In Proceeding of the 2005 International Conference on Parallel Processing, pages 547-556, 2005.
6. D.A. Bader and J. JáJá. SIMPLE: A methodology for programming high performance algorithms on clusters of symmetric multiprocessors (SMPs). Technical Report CS-TR-3798 and UMIACS-TR-97- 48, Institute for Advanced Computer Studies (UMIACS), University of Maryland, College Park, MD, May 1997. www.umiacs.umd.edu/research/EXPAR.
7. A-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286(5439):509-512, October 1999.
8. Jonathan W. Berry, Bruce Hendrickson, Simon Kahan, and Petr Konecny. Software and algorithms for graph queries on multithreaded architectures. In Proc. International Parallel and Distributed Processing Symposium, volume 0, page 495, Los Alamitos, CA, USA, 2007. IEEE Computer Society.
9. R. D. Blumofe, C. F. Joerg, B. C. Kuszmaul, C. E. Leiserson, K. H. Randall, and Y. Zhou. Cilk: An efficient multithreaded runtime system. J. Parallel & Distributed Comput., 37(1):55-69, 1996.
10. D. Chakrabarti, Y. Zhan, and C. Faloutsos. R-MAT: A recursive model for graph mining. In Proc. 4th SIAM Intl. Conf. on Data Mining, April 2004.
11. P. Charles, C. Donawa, K. Ebcioglu, C. Grothoff, A. Kielstra, C. Van Praun, V. Saraswat, and V. Sarkar. X10: An object-oriented approach to non-uniform cluster computing. In Proceedings of the 2005 ACM SIGPLAN Conference on Object-Oriented Programming Systems, Languages and Applications (OOPSLA), pages 519-538, San Diego, CA, 2005.
12. Y-J Chiang, M.T. Goodrich, E.F. Grove, R. Tamassia, D.E. Vengroff, and J.S. Vitter. External-memory graph algorithms. In Proceedings of the 1995 Symposium on Discrete Algorithms, pages 139-149, 1995.
13. G. Cong and D.A. Bader. An empirical analysis of parallel random permutation algorithms on smps. In the 18th ISCA International Conference on Parallel and Distributed Computing Systems (PDCS 2005), 2005.
14. G. Cong and D.A. Bader. Designing irregular parallel algorithms with mutual exclusion and lock-free protocols. Journal of Parallel and Distributed Computing, 66:854-866, June 2006.
15. D. E. Culler, A. C. Dusseau, R. P. Martin, and K. E. Schauser. Fast parallel sorting under LogP: From theory to practice. In Portability and Performance for Parallel Processing, chapter 4, pages 71-98. John Wiley & Sons, 1993.
16. R. Das, M. Uysal, J. Saltz, and Y-S. Hwang. Communication optimizations for irregular scientific computations on distributed memory architectures. Journal of Parallel and Distributed Computing, 22:462- 479, 1993.
17. DDR3 SDRAM, URL:http://en.wikipedia.org/wiki/DDR3 SDRAM.
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. Frank Dehne, Andreas Fabri, and Andrew Rau-chaplin. Scalable parallel computational geometry for coarse grained multicomputers. International Journal on Computational Geometry, 6:298-307, 1994.
20. M. Faloutsos, P. Faloutsos, and C. Faloutsos. On power-law relationships of the Internet topology. In Proc. ACM SIGCOMM, pages 251-262, 1999.
21. A. V. Gerbessiotis and L. G. Valiant. Direct bulk-synchronous parallel algorithms. J. Parallel & Distributed Comput., 22(2):251-267, 1994.
22. M.T. Goodrich. Communication-efficient parallel sorting. In STOC'96: Proceedings of the twenty-eighth annual ACM symposium on Theory of computing, pages 247-256, New York, NY, USA, 1996. ACM.
23. D.R. Helman and J. JáJá. Designing practical efficient algorithms for symmetric multiprocessors. In Algorithm Engineering and Experimentation (ALENEX'99), volume 1619 of Lecture Notes in Computer Science, pages 37-56, Baltimore, MD, January 1999. Springer-Verlag.
24. IBM Corporation. Remote Direct Memory Access Overview. http://publib.boulder.ibm.com/infocenter/systems/index.jsp?topic=/com.ibm.aix. sni/doc/sni/Remote.htm.
25. Infiniband, URL:http://en.wikipedia.org/wiki/Infiniband.
26. B.M.E. Moret, D.A. Bader, T. Warnow, S.K. Wyman, and M. Yan. GRAPPA: a high-performance computational tool for phylogeny reconstruction from gene-order data. In Proc. Botany, Albuquerque, NM, August 2001.
27. PCI Express, URL:http://en.wikipedia.org/wiki/PCIExpress.
28. Y. Shiloach and U. Vishkin. An O(log n) parallel connectivity algorithm. J. Algs., 3(1):57-67, 1982.
29. Unified Parallel C, URL:http://en.wikipedia.org/wiki/UnifiedParallelC.
30. K. Yelick et al., The Berkeley UPC Compiler, URL:http://upc.lbl.gov/.
31. L. G. Valiant. A bridging model for parallel computation. Commun. ACM, 33(8):103-111, 1990.
32. A. Yoo, E. Chow, K. Henderson, W. McLendon, B. Hendrickson, and Ü. V. Çatalyürek. A scalable distributed parallel breadth-first search algorithm on Bluegene/L. In Proc. Supercomputing (SC 2005), Seattle, WA, November 2005.