DocumentCode :
2793849
Title :
Analyzing the Scalability of Graph Algorithms on Eldorado
Author :
Underwood, Keith D. ; Vance, Megan ; Berry, Jonathan ; Hendrickson, Bruce
Author_Institution :
Sandia Nat. Labs., Albuquerque, NM
fYear :
2007
fDate :
26-30 March 2007
Firstpage :
1
Lastpage :
8
Abstract :
The Cray MTA-2 system provides exceptional performance on a variety of sparse graph algorithms. Unfortunately, it was an extremely expensive platform. Cray is preparing an Eldorado platform that leverages the Cray XT3 network and system infrastructure while integrating a new revision of the MTA-2 processors that is pin compatible with the AMD Opteron socket. Unlike the MTA-2, this platform will have a more constrained network bisection bandwidth and will pay a high penalty for random memory accesses. This work assesses the hardware level scalability of the Eldorado platform on several graph algorithms.
Keywords :
graph theory; multi-threading; parallel algorithms; AMD Opteron socket; Cray MTA-2 processors; Cray XT3 network; Eldorado platorm; network bisection bandwidth; random memory accesses; scalability; sparse graph algorithms; Algorithm design and analysis; Bandwidth; Computational modeling; Costs; Hardware; Laboratories; Scalability; Sockets; Sparse matrices; Supercomputers;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Parallel and Distributed Processing Symposium, 2007. IPDPS 2007. IEEE International
Conference_Location :
Long Beach, CA
Print_ISBN :
1-4244-0910-1
Electronic_ISBN :
1-4244-0910-1
Type :
conf
DOI :
10.1109/IPDPS.2007.370686
Filename :
4228414
Link To Document :
بازگشت