The Community for Technology Leaders
2011 IEEE International Symposium on Workload Characterization (IISWC) (2011)
Austin, TX, USA
Nov. 6, 2011 to Nov. 8, 2011
ISBN: 978-1-4577-2063-5
pp: 149-158
Toyotaro Suzumura , Tokyo Institute of Technology, Japan
Koji Ueno , Tokyo Institute of Technology, Japan
Hitoshi Sato , Tokyo Institute of Technology, Japan
Katsuki Fujisawa , Chuo University, Japan
Satoshi Matsuoka , Tokyo Institute of Technology, Japan
ABSTRACT
Graph500 is a new benchmark for supercomputers based on large-scale graph analysis, which is becoming an important form of analysis in many real-world applications. Graph algorithms run well on supercomputers with shared memory. For the Linpack-based supercomputer rankings, TOP500 reports that heterogeneous and distributed-memory super-computers with large numbers of GPGPUs are becoming dominant. However, the performance characteristics of large-scale graph analysis benchmarks such as Graph500 on distributed-memory supercomputers have so far received little study. This is the first report of a performance evaluation and analysis for Graph500 on a commodity-processor-based distributed-memory supercomputer. We found that the reference implementation "replicated-csr" based on distributed level-synchronized breadth-first search solves a large free graph problem with 2
INDEX TERMS
CITATION

K. Fujisawa, H. Sato, S. Matsuoka, T. Suzumura and K. Ueno, "Performance characteristics of Graph500 on large-scale distributed environment," 2011 IEEE International Symposium on Workload Characterization (IISWC), Austin, TX, USA, 2011, pp. 149-158.
doi:10.1109/IISWC.2011.6114175
83 ms
(Ver 3.3 (11022016))