The K computer at Japan's RIKEN Institute took the top spot in the 2014 Graph 500 supercomputer rankings, which were announced June 23 at the International Supercomputing Conference in Leipzig, Germany.
The Graph 500 benchmark, first issued in 2010, gauges the ability of supercomputers on data-intensive loads rather than simple speed, with the goal of improving computing involving complex data problems in cybersecurity, medical informatics, data enrichment, social networks, and symbolic networks. Breadth-first graph search, measured by the number of traversed edges per second (TEPS), or the connection between two data points, involves a substantially larger degree of irregular computations than the LINPACK benchmark, which is used in the Top 500 rankings.
The K computer was able to solve a breadth-first search of an extremely large graph of 1 trillion nodes and 16 trillion edges in 0.98 seconds, landing it in first place with a score of 17,977 gigaTEPS. Sequoia, at the U.S. Lawrence Livermore Laboratory, and Mira, at the U.S. Argonne National Laboratory, followed with scores of 16,599 gigaTEPS and 14,328 gigaTEPS, respectively.
The results indicate the K computer excels at regular parallel computing as well as graph analysis and has a wide range of applications.
From Asian Scientist
View Full Article
Abstracts Copyright © 2014 Information Inc., Bethesda, Maryland, USA
No entries found