An auction-based weighted matching implementation on massively parallel architectures

  • Authors:

  • Madan Sathe;Olaf Schenk;Helmar Burkhart

  • Affiliations:

  • Department of Mathematics and Computer Science, University of Basel, Switzerland;Institute of Computational Science, Universita della Svizzera Italiana, Switzerland;Department of Mathematics and Computer Science, University of Basel, Switzerland

  • Venue:
  • Parallel Computing
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Maximum weighted matchings represent a fundamental kernel in massive graph analysis and occur in a wide range of real-life applications. Here, a parallel auction-based matching algorithm is developed, which is able to tackle matchings in very large, dense, and sparse bipartite graphs. It will be demonstrated that the convergence of the auction algorithm crucially depends on two different @e-scaling strategies. The auction algorithm including the @e-scaling strategies has been implemented using a hybrid MPI-OpenMP programming model, and its performance is validated in various applications from bioinformatics, computer vision, and sparse linear algebra. It is concluded that for dense bipartite graphs, the auction algorithm scales well, and for sparse bipartite graphs at least a substantial speedup is achieved against alternative approaches that are based on augmenting path algorithms.