Distributed-Memory Algorithms for Maximal Cardinality Matching Using Matrix Algebra
Authors: 
Ariful Azad, Aydin BuluçAuthors Info & Claims
Ariful Azad, Aydin BuluçAuthors Info & ClaimsPages 398 - 407
Abstract
We design and implement distributed-memory parallel algorithms for computing maximal cardinality matching in a bipartite graph. Relying on matrix algebra building blocks, our algorithms expose a higher degree of parallelism on distributed-memory platforms than existing graph-based algorithms. In contrast to existing parallel algorithms, empirical approximation ratios of the new algorithms are insensitive to concurrency and stay relatively constant with increasing processor counts. On real instances, our algorithms achieve up to 300x speedup on 1024 cores of a Cray XC30 supercomputer. Even higher speedups are obtained on larger synthetically generated graphs where our algorithms show good scaling on up to 16,384 processors.
Recommendations
A matrix-algebraic formulation of distributed-memory maximal cardinality matching algorithms in bipartite graphs
We describe parallel algorithms for computing maximal cardinality matching in a bipartite graph on distributed-memory systems. Unlike traditional algorithms that match one vertex at a time, our algorithms process many unmatched vertices simultaneously ...
A Parallel Tree Grafting Algorithm for Maximum Cardinality Matching in Bipartite Graphs
IPDPS '15: Proceedings of the 2015 IEEE International Parallel and Distributed Processing SymposiumIn computing matching's in graphs on parallel processors, it is challenging to achieve high performance because these algorithms rely on searching for paths in the graph, and when these paths become long, there is little concurrency. We present a new ...
Reducing rank-maximal to maximum weight matching
Given a bipartite graph G(V,E), V=A@?@?B where |V|=n,|E|=m and a partition of the edge set into r@?m disjoint subsets E=E"1@?@?E"2@?@?...@?@?E"r, which are called ranks, the rank-maximal matching problem is to find a matching M of G such that |M@?E"1| ...
Comments
Information & Contributors
Information
Published In
September 2015
876 pages
ISBN:9781467365987
Publisher
IEEE Computer Society
United States
Publication History
Published: 08 September 2015
Author Tags
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 08 Feb 2025