A GPU Algorithm for Greedy Graph Matching
Mathematics Institute, Utrecht University, Budapestlaan 6, 3584 CD, Utrecht, the Netherlands
Conference for Young Scientists Facing the Multicore-Challenge II, 2011
@article{bisseling2011gpu,
title={A GPU Algorithm for Greedy Graph Matching},
author={Fagginger Auer, B. O. and Bisseling, R. H.},
year={2011}
}
Greedy graph matching provides us with a fast way to coarsen a graph during graph partitioning. Direct algorithms on the CPU which perform such greedy matchings are simple and fast, but offer few handholds for parallelisation. To remedy this, we introduce a fine-grained shared-memory parallel algorithm for maximal greedy matching, together with an implementation on the GPU, which is faster (speedups up to 6.8 for random matching and 5.6 for weighted matching) than the serial CPU algorithms and produces matchings of similar (random matching) or better (weighted matching) quality.
March 12, 2012 by hgpu
