Precisely Tuned Data-Intensive Algorithms Ascend the Graph500

When the latest version of the Graph 500 list was released Nov. 16 at the SC16 conference, there were two new entries in the top 10, both contributed by Khaled Ibrahim of Berkeley Lab's Computational Research Division. "Ibrahim explains that such workloads, known as communication-bound applications are typically the most difficult to scale on HPC systems. But finding a way to scale up their performance can have a big payoff by reducing the computational "expense," or amount of computing time needed to solve a problem."

The post Precisely Tuned Data-Intensive Algorithms Ascend the Graph500 appeared first on insideHPC.