TOP Events & Outreach News & Announcements Supercomputer Fugaku takes first place in the Graph 500 for the three consecutive terms - A research paper on the algorithm and experimental results at Supercomputer Fugaku was presented at ISC21
Supercomputer Fugaku takes first place in the Graph 500 for the three consecutive terms - A research paper on the algorithm and experimental results at Supercomputer Fugaku was presented at ISC21
The performance of large-scale graph analysis is an important indicator in the analysis of big data that requires large-scale and complex data processing. Fugaku has more than tripled the performance of the K computer, which won first place for nine consecutive terms since June 2015.
*A collaborative research group
Center for Computational Science, RIKEN
Programming Environment Research Team
Team Leader: Mitsuhisa Sato
Senior Scientist: Yuetsu Kodama
Technical Scientist: Masahiro Nakao
Institute of Mathematics for Industry, Kyushu University
Professor: Katsuki Fujisawa
Executive Engineer: Koji Ueno
The extremely large-scale graphs have recently emerged in various application fields, such as transportation, social networks, cyber-security, and bioinformatics. The number of vertices in the graphs has grown from billions to trillions and edges from hundreds of billions to tens of trillions. In recent years, high-performance graph analysis demands have been remarkably increased through converting the real-world data into graph data. Therefore, the large-scale graph analysis has attracted significant attention as a new application of the next-generation supercomputer.
The Graph500 benchmark was designed to measure a computer system's performance for applications that require irregular memory and network access patterns, such as large-scale graph analysis. Following its announcement in June 2010, the Graph500 list was released in November 2010, since it has been updated semiannually. The Graph500 benchmark measures the supercomputer's performance performing a breadth-first search (BFS) in terms of traversed edges per second (TEPS). Thus, the elapsed time of a BFS and the total number of traversed edges determine the performance of the benchmark;
The collaborative research group uses 158,976 nodes, the entire system of Fugaku, and successfully performed a BFS for a huge-scale graph consisting of about 2.2 trillion vertices and 35.2 trillion edges in a harmonic mean of 0.34 seconds. The Graph500 score was 102,955 GTEPS (GigaTEPS), well above the ISC2020 (as of June 2020) score of 70,980 GTEPS. Similarly, the measurement result of the K computer was 31,302 GTEPS (as of June 2019), which is more than three times the performance improvement of the K computer.
As of July 2021, the second place in the ranking of Graph500 is Sunway TaihuLight in China. The measurement result is 23,756 GTEPS. In other words, the performance difference is about four times or more from second place.
The collaborative research group has advanced the development of the software package that performs high-speed processing of large-scale graphs as follows:
1. Algorithms to reduce redundant graph searches,
2. Optimization of communication performance on massively parallel computers connected by thousands to tens of thousands of high-speed networks,
3. Optimization of memory access on multicore processors.
The collaborative research group finally succeeded in coping with large-scale and complicated real data expected in the future and developing graph search software with the world’s highest performance.
The fact that Fugaku was ranked first in the Graph 500 demonstrates that it can perform not only regular calculations commonly used in scientific and engineering calculations but also graph analysis involving many irregular calculations. It shows the versatility of Fugaku, which allows it to be used in a wide range of applications.
It also shows the high level of technical capabilities of the collaborative research group that has developed software to maximize hardware performance. In addition to further optimizing communication performance, the collaborative research team will also reduce redundant searches and equalize memory usage at each node.
The collaborative research group has released source codes that have been achieved high-performance on Fugaku and the K computer so far from the following GitHub repositories.
As a result of utilizing our source codes, a total of four supercomputers were ranked in the top 10 in Graph500.
Rank 1 : Supercomputer Fugaku
Rank 3 : Wisteria/BDEC-01 (Odyssey)
Rank 4 : TOKI-SORA
Rank 7 : Lise
- JUNE 2021 BFS (Graph500 Website)
- See the PDF version of this article（416 KB）
- See the presentation by Masahiro Nakao at the ISC 2021 Digital
（Jul 5, 2021）