Maintaining bipartite matchings in the presence of failures

The authors present an on-line distributed reconfiguration algorithm for finding a new maximum matching incrementally after some nodes have failed. Their algorithm is deadlock free, and with k failures maintains at least M-k matching pairs during the reconfiguration process, where M is the size of t...

Full description

Saved in:
Bibliographic Details
Published in:Parallel Processing Symposium, 7th International (IPPS '93 pp. 57 - 64
Main Authors: Sha, E.H.-M., Steiglitz, K.
Format: Conference Proceeding
Language:English
Published: IEEE Comput. Soc. Press 1993
Subjects:
Bipartite graph
Computer science
Distributed algorithms
Fault tolerance
Fault tolerant systems
Runtime
System recovery
Very large scale integration
ISBN:9780818634420, 0818634421
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The authors present an on-line distributed reconfiguration algorithm for finding a new maximum matching incrementally after some nodes have failed. Their algorithm is deadlock free, and with k failures maintains at least M-k matching pairs during the reconfiguration process, where M is the size of the original maximum matching. The algorithm tolerates failures that occur during reconfiguration. The worst-case reconfiguration time is O(k min( mod A mod , mod B mod )) after k failures, where A and B are the node sets, but simulations show that the average-case reconfiguration time is much better. The algorithm is also simple enough to be implemented in hardware.< >
AbstractList The authors present an on-line distributed reconfiguration algorithm for finding a new maximum matching incrementally after some nodes have failed. Their algorithm is deadlock free, and with k failures maintains at least M-k matching pairs during the reconfiguration process, where M is the size of the original maximum matching. The algorithm tolerates failures that occur during reconfiguration. The worst-case reconfiguration time is O(k min( mod A mod , mod B mod )) after k failures, where A and B are the node sets, but simulations show that the average-case reconfiguration time is much better. The algorithm is also simple enough to be implemented in hardware.< >
Author Sha, E.H.-M.
Steiglitz, K.
Author_xml – sequence: 1
  givenname: E.H.-M.
  surname: Sha
  fullname: Sha, E.H.-M.
  organization: Dept. of Comput. Sci. & Eng., Notre Dame Univ., IN, USA
– sequence: 2
  givenname: K.
  surname: Steiglitz
  fullname: Steiglitz, K.
BookMark eNotj01Lw0AYhBdUUNvcxdP-gcT9_sCTFK2FioX2Xt7svrEr7TYk68F_b6AODMM8h4G5J9f5nJGQB84azpl_Wm0224Z7LxthhNPmilTeOua4M1IpwW5JNY7fbJLWzmhxR54_IOUyOeUv2qYehpIK0hOUcJjQSFOm5YC0H3DEHJCeO9pBOv5MfU5uOjiOWP3njOzeXneL93r9uVwtXtZ1cr7UkcvAteFgGAfrgUkQamK6VTqgDW1so47gbXRohQ9cqWCd4CqicQKknJHHy2xCxH0_pBMMv_vLQfkHKJhH2A
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/IPPS.1993.262856
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Xplore POP ALL
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
EndPage 64
ExternalDocumentID 262856
GroupedDBID 6IE
6IK
6IL
AAJGR
AAWTH
ACGHX
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
OCL
RIB
RIC
RIE
RIL
ID FETCH-LOGICAL-i89t-d13c1561a601a79a03a2413c5b45ce7cbdbd5da97d8e729c144c78214de682a33
IEDL.DBID RIE
ISBN 9780818634420
0818634421
IngestDate Tue Aug 26 22:33:51 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i89t-d13c1561a601a79a03a2413c5b45ce7cbdbd5da97d8e729c144c78214de682a33
PageCount 8
ParticipantIDs ieee_primary_262856
PublicationCentury 1900
PublicationDate 19930000
PublicationDateYYYYMMDD 1993-01-01
PublicationDate_xml – year: 1993
  text: 19930000
PublicationDecade 1990
PublicationTitle Parallel Processing Symposium, 7th International (IPPS '93
PublicationTitleAbbrev IPPS
PublicationYear 1993
Publisher IEEE Comput. Soc. Press
Publisher_xml – name: IEEE Comput. Soc. Press
SSID ssj0000558652
Score 1.2241797
Snippet The authors present an on-line distributed reconfiguration algorithm for finding a new maximum matching incrementally after some nodes have failed. Their...
SourceID ieee
SourceType Publisher
StartPage 57
SubjectTerms Bipartite graph
Computer science
Distributed algorithms
Fault tolerance
Fault tolerant systems
Runtime
System recovery
Very large scale integration
Title Maintaining bipartite matchings in the presence of failures
URI https://ieeexplore.ieee.org/document/262856
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NTwMhECW28eBJrTV-h4PXbdkFFohHY-NBmyY2preGjyHZy7Zpt_5-gd3WmHjxBhwIgV14b2beDEKPHkpjiaaZCQwoY5rbzJTURxWID5ehVzLJxz7fxHQqFws16_JsJy0MAKTgMxjFZvLlu5XdRVPZuIh6v7KHekKIVqp1MKcQzmXJE--KOdooY0Xe5dfZ98neS0nUOJDmjyjUo6N2zl-1VdLTMjn916LO0PBHoodnh8fnHB1BPUCn-xoNuPtlL9DTe6D-TVsGAptqHb-UBnDAqSmIcourGgcMiNdJhhQmXXnsdRWD1bdDNJ-8zJ9fs65gQlZJ1WQupzbQsVwHkqWF0oTq6DWz3DBuQVjjjONOK-EkBExtA5eyASDkzEEpC03pJerXqxquEPa5Z044okBzZgujmAtIRgpVWpaDJ9doEHdiuW5TYizbTbj5c_QWnbRRgtFucYf6zWYH9-jYfjXVdvOQjvEbuluagA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFH7oFPQ0nRN_m4PXbm2TtAkexTFxGwOH7DbyE3rpxtb595uk3UTw4i0NIZQkbb7vvfe9B_BkTSZVLHAkHQOKiKAqkhm2XgVi3c_QchbkY5-jfDJh8zmfNnm2gxbGGBOCz0zPN4MvXy_V1pvK-qnX-2WHcEQJSZNarLU3qMSUsowG5uWztGE_pMmws3uOd37KmPcdbf7wUj3cq2f9VV0lXC6D9r9e6wy6PyI9NN1fP-dwYMoOtHdVGlDz0V7A89iR_6ouBIFksfJnpTLIIdUQRrlBRYkcCkSrIERyky4tsqLw4eqbLswGr7OXYdSUTIgKxqtIJ1g5QpYIR7NEzkWMhfebKSoJVSZXUktNteC5ZsahauXYlHIQISHaZCwVGF9Cq1yW5gqQTSzRuY65EZSoVHKiHZZhOc8USYyNr6HjV2KxqpNiLOpFuPmz9xFOhrPxaDF6m7zfwmkdM-itGHfQqtZbcw_H6qsqNuuHsKXf94Cdxw
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=Parallel+Processing+Symposium%2C+7th+International+%28IPPS+%2793&rft.atitle=Maintaining+bipartite+matchings+in+the+presence+of+failures&rft.au=Sha%2C+E.H.-M.&rft.au=Steiglitz%2C+K.&rft.date=1993-01-01&rft.pub=IEEE+Comput.+Soc.+Press&rft.isbn=9780818634420&rft.spage=57&rft.epage=64&rft_id=info:doi/10.1109%2FIPPS.1993.262856&rft.externalDocID=262856
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818634420/lc.gif&client=summon&freeimage=true
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818634420/mc.gif&client=summon&freeimage=true
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=9780818634420/sc.gif&client=summon&freeimage=true