Competition GraphHPC-2016 for the fastest implementation of the parallel algorithm Community Detection

Very soon, within the framework of the third scientific and technical conference GraphHPC-2016 , the GraphHPC competition will start, dedicated to the problems of parallel processing of large graphs using supercomputers. This time, participants will have to find the fastest implementation of the Community Detection task in the undirected graph with weights.

To implement the task participants are offered two categories of computing systems:

• single node computing system (CPU and / or GPU);
• 36-node computing cluster.

Students, graduate students, young scientists and IT specialists are invited to participate in the competition, for whom GraphHPC can be a real chance to declare themselves to the scientific community and leading IT companies. On the contest website, you can familiarize yourself with the condition of the problem and download an example implementation

The competition will be held from February 1 to February 29, 2016 using an automatic system that will be launched on February 1. But now you can start working on a solution.
')
Winners and creatively distinguished participants will receive valuable prizes, as well as they will be able to speak at the conference, talking about their implementation of the task. For students there is a separate nomination.