Distributed-Memory Algorithms for Maximal Cardinality Matching Using Matrix Algebra

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 con...

Celý popis

Uložené v:
Podrobná bibliografia
Vydané v:Proceedings / IEEE International Conference on Cluster Computing s. 398 - 407
Hlavní autori: Azad, Ariful, Buluc, Aydin
Médium: Konferenčný príspevok..
Jazyk:English
Vydavateľské údaje: IEEE 01.09.2015
Predmet:
Algorithm design and analysis
Approximation algorithms
Bipartite graph
cardinality matching
Heuristic algorithms
matching
Matrices
matrix algebra
maximal matching
Partitioning algorithms
Sparse matrices
ISSN:1552-5244
On-line prístup:Získať plný text
Tagy: Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
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.
AbstractList 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.
Author Azad, Ariful
Buluc, Aydin
Author_xml – sequence: 1
  givenname: Ariful
  surname: Azad
  fullname: Azad, Ariful
  email: azad@lbl.gov
  organization: Comput. Res. Div., Lawrence Berkeley Nat. Lab., Berkeley, CA, USA
– sequence: 2
  givenname: Aydin
  surname: Buluc
  fullname: Buluc, Aydin
  email: abuluc@lbl.gov
  organization: Comput. Res. Div., Lawrence Berkeley Nat. Lab., Berkeley, CA, USA
BookMark eNotjslqwzAYhFVIoWnqcw-9-AXsapd1DG66gEOhic_hly0nAi9FUiF--ya0lxnmgxnmHi3GabQIPRKcE4L1c1nVu_3mK6eYiFzSG5RoVRAuFZNCF2qBlkQImgnK-R1KQnAGU6kk15gu0e7Fheid-Ym2zbZ2mPycrvvj5F08DSHtJp9u4ewG6NMSfOtG6F2cLyw2Jzce0zpc9RK9O1-L1nh4QLcd9MEm_75C9etmX75n1efbR7muMkc5iRkILBlhYEwjrDHCcNJ20DQgCkuVkR1oihW3nHFsGQZstISOKWBKkJYLtkJPf7vOWnv49peXfj4ohpXEmv0Ct7JTmA
CODEN IEEPAD
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/CLUSTER.2015.62
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Computer Science
EISBN 9781467365987
146736598X
EndPage 407
ExternalDocumentID 7307609
Genre orig-research
GroupedDBID 29O
6IE
6IF
6IH
6IK
6IL
6IN
AAJGR
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
IPLJI
M43
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i241t-a506313abbc5ebb5b41dfacca58e27b6fa92074e4340e30a0b96af37a3751d453
IEDL.DBID RIE
ISICitedReferencesCount 2
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000378648100051&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1552-5244
IngestDate Wed Aug 27 02:50:17 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i241t-a506313abbc5ebb5b41dfacca58e27b6fa92074e4340e30a0b96af37a3751d453
PageCount 10
ParticipantIDs ieee_primary_7307609
PublicationCentury 2000
PublicationDate 20150901
PublicationDateYYYYMMDD 2015-09-01
PublicationDate_xml – month: 09
  year: 2015
  text: 20150901
  day: 01
PublicationDecade 2010
PublicationTitle Proceedings / IEEE International Conference on Cluster Computing
PublicationTitleAbbrev CLUSTER
PublicationYear 2015
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssib026764902
ssj0037306
Score 1.944047
Snippet We design and implement distributed-memory parallel algorithms for computing maximal cardinality matching in a bipartite graph. Relying on matrix algebra...
SourceID ieee
SourceType Publisher
StartPage 398
SubjectTerms Algorithm design and analysis
Approximation algorithms
Bipartite graph
cardinality matching
Heuristic algorithms
matching
Matrices
matrix algebra
maximal matching
Partitioning algorithms
Sparse matrices
Title Distributed-Memory Algorithms for Maximal Cardinality Matching Using Matrix Algebra
URI https://ieeexplore.ieee.org/document/7307609
WOSCitedRecordID wos000378648100051&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwGG2QePCECsbf6cGjg25t1_VoUOIBCAliuJG2a3UJP8wYBv97226gBy_etmZLln7f8r22730PgDuLOZTglAachXaBkiQkEIokgVERkmFsqPBb2a99Nhwm0ykf1cD9XgujtfbkM912l_4sP12pjdsq69hsZLFT6x0wxkqt1i53opjFhKN96yhsn_XKIkrdYouQqq1PiHin25-MLVZ0vC7adjY5v3xVfFnpNf73Qceg9aPPg6N95TkBNb08BY2dQQOs_tcmGD-6trjO0UqnwcBxar_gw_xtlWfF-2INLV6FA7HNFmIOuy5TSlBuxwrPsISeT-Bu82zrXnSHzC0w6T29dJ-DykUhyGx1LgJBLQoJsZBSUS0llSRMjbCBo4mOmIyN4JHFEZpggjRGAkkeC4OZwIyGKaH4DNSXq6U-B5AbiYgSKlQyIrGRnHEhTIpUxBTiEl2Appuj2UfZKGNWTc_l38NX4MhFoCRsXYN6kW_0DThUn0W2zm99dL8BF9ykxQ
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PT8IwGG0ImugJFYy_7cGjg3Zr1_VoUIJxEBLAcCNt1-kSfpgxDP73tttAD168bc2WLP2-5Xtt3_seAHcGcyjBKXU4w2aBEgTEEYoETqxcJLEfU5FvZb-GrN8PJhM-qID7nRZGa52Tz3TTXuZn-dFSre1WWctkI_OtWm-PEuLiQq21zR7XZz7haNc8yjNP59oiSu1yi5CysQ9GvNUOx0ODFi2zizatUc4vZ5W8sHRq__ukI9D4UejBwa72HIOKXpyA2taiAZZ_bB0MH21jXOtppSOnZ1m1X_Bh9rZMk-x9voIGscKe2CRzMYNtmysFLDdjWc6xhDmjwN6myca-aI-ZG2DceRq1u07po-Akpj5njqAGh2BPSKmolpJKgqNYmNDRQLtM-rHgrkESmngEaQ8JJLkvYo8Jj1EcEeqdgupiudBnAPJYIqKEwkq6xI8lZ1yIOELKZQpxic5B3c7R9KNolTEtp-fi7-FbcNAd9cJp-Nx_uQSHNhoFfesKVLN0ra_BvvrMklV6k0f6G9gwqAw
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Abook&rft.genre=proceeding&rft.title=Proceedings+%2F+IEEE+International+Conference+on+Cluster+Computing&rft.atitle=Distributed-Memory+Algorithms+for+Maximal+Cardinality+Matching+Using+Matrix+Algebra&rft.au=Azad%2C+Ariful&rft.au=Buluc%2C+Aydin&rft.date=2015-09-01&rft.pub=IEEE&rft.issn=1552-5244&rft.spage=398&rft.epage=407&rft_id=info:doi/10.1109%2FCLUSTER.2015.62&rft.externalDocID=7307609
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1552-5244&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1552-5244&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1552-5244&client=summon