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

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Parallel Processing Symposium, 7th International (IPPS '93 s. 57 - 64
Hlavní autoři: Sha, E.H.-M., Steiglitz, K.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE Comput. Soc. Press 1993
Témata:
Bipartite graph
Computer science
Distributed algorithms
Fault tolerance
Fault tolerant systems
Runtime
System recovery
Very large scale integration
ISBN:9780818634420, 0818634421
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí: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