The benchmark used in Graph500 stresses the communication subsystem of the system, instead of counting double precision floating-point.4 It is based on a breadth-first search in a large undirected graph (a model of Kronecker graph with average degree of 16). There are three computation kernels in the benchmark: the first kernel is to generate the graph and compress it into sparse structures CSR or CSC (Compressed Sparse Row/Column); the second kernel does a parallel BFS search of some random vertices (64 search iterations per run); the third kernel runs a single-source shortest paths (SSSP) computation. Six possible sizes (Scales) of graph are defined: toy (226 vertices; 17 GB of RAM), mini (229; 137 GB), small (232; 1.1 TB), medium (236; 17.6 TB), large (239; 140 TB), and huge (242; 1.1 PB of RAM).5
The reference implementation of the benchmark contains several versions:6
The implementation strategy that have won the championship on the Japanese K computer is described in.7
According to June 2024 release of the list, for the BFS results section, Fugaku ranks highest, but in the SSSP results section Wuhan Supercomputer ranks highest, then Pengcheng Cloudbrain-II, then Fugaku; table shows for BFS results:8
Spain (Barcelona), has a new supercomputer MareNostrum 5 ACC, ranked 8th.
According to November 2022 release of the list:9
Arm-based Fugaku took the top spot of the list.10
According to June 2016 release of the list:11
According to June 2014 release of the list:12
According to June 2013 release of the list:13
The Exascale Report (March 15, 2012). "The Case for the Graph 500 – Really Fast or Really Productive? Pick One". Inside HPC. http://insidehpc.com/2012/03/15/the-case-for-the-graph-500-really-fast-or-really-productive-pick-one/ ↩
"June 2014 | Graph 500". Archived from the original on June 28, 2014. Retrieved June 26, 2014. https://web.archive.org/web/20140628045351/http://www.graph500.org/results_jun_2014 ↩
Ueno, Koji; Suzumura, Toyotaro; Maruyama, Naoya; Fujisawa, Katsuki; Matsuoka, Satoshi (2016). "Extreme scale breadth-first search on supercomputers". 2016 IEEE International Conference on Big Data (Big Data). pp. 1040–1047. doi:10.1109/BigData.2016.7840705. ISBN 978-1-4673-9005-7. S2CID 8680200. 978-1-4673-9005-7 ↩
Performance Evaluation of Graph500 on Large-Scale Distributed Environment // IEEE IISWC 2011, Austin, TX; presentation https://sites.google.com/site/tokyotechsuzumuralab/publication/Graph500-IISWC2011-camera-ready.pdf?attredirects=0 ↩
"Graph500: адекватный рейтинг" (in Russian). Open Systems #1 2011. http://www.osp.ru/os/2011/01/13006961/ ↩
Ueno, K.; Suzumura, T.; Maruyama, N.; Fujisawa, K.; Matsuoka, S. (December 1, 2016). "Extreme scale breadth-first search on supercomputers". 2016 IEEE International Conference on Big Data (Big Data). pp. 1040–1047. doi:10.1109/BigData.2016.7840705. ISBN 978-1-4673-9005-7. S2CID 8680200. 978-1-4673-9005-7 ↩
"Complete Results - Graph 500". 2024. Retrieved July 20, 2024. https://graph500.org/?page_id=238 ↩
"November 2022; Graph 500". June 14, 2017. Retrieved November 18, 2022. https://graph500.org/?page_id=238 ↩
"Fujitsu and RIKEN Take First Place in Graph500 Ranking with Supercomputer Fugaku". HPCwire. June 23, 2020. Retrieved August 8, 2020. https://www.hpcwire.com/off-the-wire/fujitsu-and-riken-take-first-place-in-graph500-ranking-with-supercomputer-fugaku/ ↩
"June 2016 | Graph 500". Archived from the original on June 24, 2016. Retrieved July 6, 2016. https://web.archive.org/web/20160624043849/http://www.graph500.org/results_jun_2016 ↩
"June 2013 | Graph 500". Archived from the original on June 21, 2013. Retrieved June 19, 2013. https://web.archive.org/web/20130621233406/http://www.graph500.org/results_jun_2013 ↩