A Push-Relabel-Based Maximum Cardinality Bipartite Matching Algorithm on GPUs

Abstract : We design, develop, and evaluate an atomic- and lock-free GPU implementation of the push-relabel algorithm in the context of finding maximum cardinality matchings in bipartite graphs. The problem has applications on computer science, scientific computing, bioinformatics, and other areas. Although the GPU parallelization of the push-relabel technique has been investigated in the context of flow algorithms, to the best of our knowledge, ours is the first study which focuses on the maximum cardinality matching. We compare the proposed algorithms with serial, multicore, and manycore bipartite graph matching implementations from the literature on a large set of real-life problems. Our experiments show that the proposed push- relabel-based GPU algorithm is faster than the existing parallel and sequential implementations.
Complete list of metadatas

https://hal.inria.fr/hal-00923464
Contributor : Equipe Roma <>
Submitted on : Thursday, January 2, 2014 - 8:34:43 PM
Last modification on : Wednesday, November 20, 2019 - 3:14:41 AM
Long-term archiving on: Saturday, April 8, 2017 - 10:34:50 AM

File

matchingGPU.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Mehmet Deveci, Kamer Kaya, Bora Uçar, Umit Catalyurek. A Push-Relabel-Based Maximum Cardinality Bipartite Matching Algorithm on GPUs. 42nd International Conference on Parallel Processing, Oct 2013, Lyon, France. pp.21 - 29, ⟨10.1109/ICPP.2013.11⟩. ⟨hal-00923464⟩

Share

Metrics

Record views

410

Files downloads

656