A Push-Relabel-Based Maximum Cardinality Bipartite Matching Algorithm on GPUs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

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.
Fichier principal
Vignette du fichier
matchingGPU.pdf (377.99 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00923464 , version 1 (02-01-2014)

Identifiers

Cite

Mehmet Deveci, Kamer Kaya, Bora Uçar, Umit V. 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⟩
211 View
299 Download

Altmetric

Share

Gmail Facebook X LinkedIn More