The results of the GraphHPC-2015

As a part of the GraphHPC-2015 workshop a contest was held on the most efficient implementation of the Minimum Spanning Tree (MST) problem.

The contest was conducted using an automatic contest system. The task is described on the Problem page. The following computer systems were provided to run the tasks:

• Multi-node cluster with 8 computing nodes connected by dual-port Infiniband FDR x4 interconnect (fat tree topology), consisting of x2 6-core Intel Xeon E5-2630 2.3 GHz (HT-enabled) processors and 78GB of DDR3 DRAM.

• Single computing node IBM SystemX 3650 consisting of x2 Intel Xeon E5-2690 2.9 GHz (HT-enabled), NVIDIA GPU K20x (ECC is disabled), 128GB of DDR3 DRAM.

Dates: Contest started on January 20 and ended on March 2, 2015. The results were announced on March 5, 2015 at the GraphHPC-2015 workshop.

Final results

Alexander Daryin from T-Platforms won the first place in the GraphHPC contest with a score of 3080 MTEPS. Fedor Minyuk from Europlan took the second place with a score of 2488 MTEPS. Alexander Kolganov was third with a score of 1655 MTEPS. In the student competition the winner was Artem Mazeev from CMC MSU with a score of 1651 MTEPS, Denis Kuplyakov and Vadim Zaytsev won the second and the third places respectively.

The first place winners (in student and general classification) were awarded with SSD disks (Intel 530 Series, 240 GB). The second place winner was awarded with NVIDIA Jetson TK1 DevKit. Other winners received “Concrete Mathematics: A Foundation for Computer Science” books. All participants received certificates and souvenirs from the GraphHPC-2015 partners: NVIDIA, IBM, T-Platforms, Intel, AMD, and Sapphire.

Results

Node

Cluster