Issue No.02 - March/April (2008 vol.10)
Bruce Hendrickson , Sandia National Laboratories
Jonathan W. Berry , Sandia National Laboratories
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MCSE.2008.56
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.
computing, combinatorics, combinatorial, scalable algorithms, graph analysis, HPC, high-performance computing, combinatorics in computing
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