International collaborative research groups such as RIKEN have analyzed the results of analysis by the supercomputer "Kei" in Graph500, the international performance ranking of supercomputers for big data processing (large-scale graph analysis), in June 2018. Following that, he won first place for eight consecutive terms (6 terms in total).In addition, Kyushu University, Tokyo Institute of Technology, Barcelona Supercomputing Center, Fujitsu Limited, and Fixstars Corporation participated in the research group.
The analysis target in a complicated phenomenon requires a large-scale graph (showing the relationship between data by nodes and branches) and then high-speed graph analysis by a computer.Graph analysis is used not only in data analysis on the Internet but also in economic and scientific fields, and its application range is expanding.The supercomputer ranking "Graph2010" started in 500 competes for the performance of such graph analysis.
This time, a breadth-first search problem (breadth-first search between two vertices specified on the graph) for a large-scale graph of the problem scale (a numerical value representing the scale of the problem calculated by the benchmark) consisting of about 1 trillion vertices and 16 trillion branches. We succeeded in solving the problem of finding the route that minimizes the distance in 2 seconds.By winning the first place, "K computer" has the ability of graph analysis, which is dominated by irregular calculations, in addition to the regular matrix operations often used in scientific and technological calculations, and the high versatility to support various applications. Demonstrated.At the same time, the advanced software technology of the research team was shown.
For the widespread dissemination of this achievement, the International Collaborative Research Group has made the program open source and is open to the public from the GitHub repository.In the future, it plans to establish a global standard for large-scale high-performance graph processing.