@inbook{ea9693e674ec42ccb8f7037e15c46abe,
title = "A GPU algorithm for greedy graph matching",
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.",
author = "{Fagginger Auer}, B.O. and R.H. Bisseling",
year = "2012",
doi = "10.1007/978-3-642-30397-5_10",
language = "English",
isbn = "978-364-23039-6-8",
series = "Lecture notes in computer science",
publisher = "Springer",
number = "7174",
pages = "108--119",
editor = "Rainer Keller and Kramer, {David Anthony} and Jan-Philipp Weiss",
booktitle = "Facing the multicore-challenge II : aspects of new paradigms and technologies in parallel computing",
}