charm AT lists.siebelschool.illinois.edu

Subject: Charm++ parallel programming system

List archive

[charm] The GraphHPC-2015 contest

From: Alexander Frolov <alexndr.frolov AT gmail.com>
To: charm AT cs.uiuc.edu
Subject: [charm] The GraphHPC-2015 contest
Date: Wed, 18 Feb 2015 21:55:29 +0400
List-archive: <http://lists.cs.uiuc.edu/pipermail/charm/>
List-id: CHARM parallel programming system <charm.cs.uiuc.edu>

Hi!

As a part of the GraphHPC-2015 workshop (http://www.dislab.org/GraphHPC-2015/) a contest is running for most effective implementation of the MST (minimum spanning tree) problem on diverse HPC architectures: multiprocessor compute node, heterogeneous compute node and cluster. An automatic contest system for submitting solutions is provided. More details about the GraphHPC-2015 contest can be found here: http://contest.dislab.org/en

If anybody would like to implement parallel MST on Charm++ that would be great! As far as I know there is no such implementations. But I can be wrong...

Best,

Alexander Frolov

[charm] The GraphHPC-2015 contest, Alexander Frolov, 02/18/2015