DocumentCode :
1074260
Title :
Graph Analysis with High-Performance Computing
Author :
Hendrickson, Bruce ; Berry, JonatHan W.
Author_Institution :
Sandia Nat. Labs., Albuquerque
Volume :
10
Issue :
2
fYear :
2008
Firstpage :
14
Lastpage :
19
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.
Keywords :
graph theory; multi-threading; multiprocessing systems; parallel machines; graph algorithms; graph analysis; high-performance computing; massively multithreaded machines; Communication networks; Computational geometry; Computer networks; Concurrent computing; Distributed computing; IP networks; Load management; Parallel processing; Social network services; Sparse matrices; HPC; combinatorial; combinatorics; combinatorics in computing; computing; graph analysis; high-performance computing; scalable algorithms;
fLanguage :
English
Journal_Title :
Computing in Science & Engineering
Publisher :
ieee
ISSN :
1521-9615
Type :
jour
DOI :
10.1109/MCSE.2008.56
Filename :
4454426
Link To Document :
بازگشت