Graph Analysis with High-Performance Computing
Sandia National Laboratories, Albuquerque
Computing in Science & Engineering In Computing in Science & Engineering, Vol. 10, No. 2. (March 2008), pp. 14-19
@article{hendrickson2008graph,
title={Graph analysis with high-performance computing},
author={Hendrickson, B. and Berry, J.W.},
journal={Computing in Science & Engineering},
volume={10},
number={2},
pages={14–19},
issn={1521-9615},
year={2008},
publisher={IEEE}
}
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.
January 20, 2011 by hgpu
