A GPU algorithm for greedy graph matching

Authors:
Bas O. Fagginger Auer;Rob H. Bisseling
Affiliations:
Mathematics Institute, Utrecht University, Utrecht, The Netherlands;Mathematics Institute, Utrecht University, Utrecht, The Netherlands
Venue:
Facing the Multicore-Challenge II
Year:
2012

Citing 12
Cited 2

Hypergraph-Partitioning-Based Decomposition for Parallel Sparse-Matrix Vector Multiplication

IEEE Transactions on Parallel and Distributed Systems
Permuting Sparse Rectangular Matrices into Block-Diagonal Form

SIAM Journal on Scientific Computing
A Two-Dimensional Data Distribution Method for Parallel Sparse Matrix-Vector Multiplication

SIAM Review
Minimum power configuration for wireless communication in sensor networks

ACM Transactions on Sensor Networks (TOSN)
Maximum matching in sparse random graphs

SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
Bipartite Graph Matching Computation on GPU

EMMCVPR '09 Proceedings of the 7th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition
Heuristic initialization for bipartite matching problems

Journal of Experimental Algorithmics (JEA)
A parallel approximation algorithm for the weighted maximum matching problem

PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Parallel greedy graph matching using an edge partitioning approach

Proceedings of the fourth international workshop on High-level parallel programming and applications
The university of Florida sparse matrix collection

ACM Transactions on Mathematical Software (TOMS)
Hypergraph-Based Unsymmetric Nested Dissection Ordering for Sparse LU Factorization

SIAM Journal on Scientific Computing
Match twice and stitch: a new TSP tour construction heuristic

Operations Research Letters

Efficient parallel and external matching

Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing
GPU accelerated maximum cardinality matching algorithms for bipartite graphs

Euro-Par'13 Proceedings of the 19th international conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

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.