The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.02 - March/April (2008 vol.10)
pp: 14-19
Bruce Hendrickson , Sandia National Laboratories
Jonathan W. Berry , Sandia National Laboratories
ABSTRACT
Large, complex graphs arise in many settings including the Internet, social networks, and communication networks. To study such data sets, the authors explored the use of high-performance computing (HPC) for graph algorithms. They found that the challenges in these applications are quite different from those arising in traditional HPC applications and that massively multithreaded machines are well suited for graph problems.
INDEX TERMS
computing, combinatorics, combinatorial, scalable algorithms, graph analysis, HPC, high-performance computing, combinatorics in computing
CITATION
Bruce Hendrickson, Jonathan W. Berry, "Graph Analysis with High-Performance Computing", Computing in Science & Engineering, vol.10, no. 2, pp. 14-19, March/April 2008, doi:10.1109/MCSE.2008.56
REFERENCES
1. T.A. El-Ghazawi, W.W. Carlson, and J.M. Draper, "UPC Language Specification, 1.1 ed.," May 2003; http://upc.lbl.gov/docsuser.
2. L. Dagum and R. Menon, "OpenMP: An Industry-Standard API for Shared-Memory Programming," IEEE Computational Science and Eng., vol. 5, no. 1, 1998, pp. 46–55.
3. IEEE Standard Portable Operating System Interface for Computer Environments, IEEE Press, 1988.
4. W. Anderson et al., "Early Experiences with Scientific Programs on the Cray MTA-2," Proc. Supercomputing 2003, IEEE CS Press, 2003, pp. 46–58.
5. A. Stepanov and M. Lee, The Standard Template Library, tech. report 95-11 (R.1), Hewlett-Packard Labs., 1995.
6. J. Siek, L.-Q. Lee, and A. Lumsdaine, The Boost Graph Library, Addison-Wesley, 2002.
7. D. Gregor and A. Lumsdaine, "The Parallel BGL: A Generic Library for Distributed Graph Computations," Proc. Workshop Parallel Object-Oriented Scientific Computing (POOSC), 2005, www.osl.iu.edu/publications/prints/2005Gregor:POOSC:2005.pdf .
8. J.W. Berry et al., "Software and Algorithms for Graph Queries on Multithreaded Architectures," Proc. 21st Int'l Parallel and Distributed Processing Symp., IEEE Press, 2007, p. 495.
9. A. Lumsdaine et al., "Challenges in Parallel Graph Processing," Parallel Processing Letters, vol. 17, no. 1, 2007, pp. 5–20.
10. S. Milgram, "The Small World Phenomenon," Psychology Today, vol. 1, 1967, pp. 61–67.
11. D. Chakrabarti, Y. Zhan, and C. Faloutsos, "R-MAT: A Recursive Model for Graph Mining," Proc. 4th SIAM Int'l Conf. Data Mining, SIAM Press, 2004.
12. A. Yoo et al., "A Scalable Distributed Parallel Breadth-First Search Algorithm on BlueGene/L," Proc. Supercomputing 2005, IEEE CS Press, 2005, p. 25.
13. D. Bader and K. Madduri, "Designing Multithreaded Algorithms for Breadth-First Search and ST-Connectivity on the Cray MTA-2," Proc. 35th Int'l Conf. Parallel Processing (ICPP), IEEE CS Press, 2006, pp. 523–530.
14. E. Dijkstra, "A Note on Two Problems in Connection with Graphs," Numerische Mathematik, vol. 1, 1959, pp. 269–271.
15. K. Madduri et al., "Parallel Shortest Path Algorithms for Solving Large-Scale Instances," Proc. 9th DIMACS Implementation Challenge: Shortest Paths, 2006; http://dimacs.rutgers.edu/Workshops/Challenge9/ papersmadduri.pdf.
16. U. Meyer and P. Sanders, "Delta-Stepping: A Parallel Single Source Shortest Path Algorithm," Proc. 6th Ann. European Symp. Algorithms, Springer-Verlag, 1998, pp. 393–404.
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool