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!
Description
Summary: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.< >
ISBN:9780818634420
0818634421
DOI:10.1109/IPPS.1993.262856