A GPU algorithm for greedy graph matching
Publication date
2012
Authors
Fagginger Auer, B.O.
Bisseling, Rob H.
Editors
Keller, Rainer
Kramer, David Anthony
Weiss, Jan-Philipp
Advisors
Supervisors
Document Type
Part of book
Metadata
Show full item recordCollections
License
Abstract
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.
Keywords
Taverne
Citation
Fagginger Auer, B O & Bisseling, R H 2012, A GPU algorithm for greedy graph matching. in R Keller, D A Kramer & J-P Weiss (eds), Facing the multicore-challenge II : aspects of new paradigms and technologies in parallel computing. Lecture notes in computer science, no. 7174, Springer, Heidelberg, pp. 108-119. https://doi.org/10.1007/978-3-642-30397-5_10