GPU accelerated maximum cardinality matching algorithms for bipartite graphs - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

GPU accelerated maximum cardinality matching algorithms for bipartite graphs

Abstract

We design, implement, and evaluate GPU-based algorithms for the maximum cardinality matching problem in bipartite graphs. Such algorithms have a variety of applications in computer science, scientific computing, bioinformatics, and other areas. To the best of our knowledge, ours is the first study which focuses on the GPU implementation of the maximum cardinality matching algorithms. We compare the proposed algorithms with serial and multicore implementations from the literature on a large set of real-life problems where in majority of the cases one of our GPU-accelerated algorithms is demonstrated to be faster than both the sequential and multicore implementations.
Fichier principal
Vignette du fichier
matchingGPU.pdf (485 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

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

Identifiers

Cite

Mehmet Deveci, Kamer Kaya, Bora Uçar, Umit V. Catalyurek. GPU accelerated maximum cardinality matching algorithms for bipartite graphs. Euro-Par 2013, Aug 2013, Aachen, Germany. pp.850-861, ⟨10.1007/978-3-642-40047-6_84⟩. ⟨hal-00923449⟩
218 View
441 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More