Self-stabilizing algorithms for synchronous unidirectional rings
Conference
·
OSTI ID:416842
- MCC, Morristown, NJ (United States)
In this work we investigate the notion of built-in fault-tolerant (i.e. self-stabilizing) computations on a synchronous uniform unidirectionalring network. Our main result is a protocol-compiler that transforms any self-stabilizing protocol P for a (synchronous or asynchronous) bidirectional ring to a self-stabilizing protocol P{prime} which runs on the synchronous unidirectional ring. P{prime} requires O(S{sub LE} (n)+S(n)) space and has expected stabilization time O(T{sub LE}(n) + n{sup 2} + nT(n)), where S(n) (T(n)) is the space (time) performance of P and S{sub LE}(n) (T{sub LE}(n)) is the space (time) performance of a self-stabilizing leader-election protocol on a bidirectional ring. As subroutines, we also solve the problems of leader election and round-robin token management in our setting.
- OSTI ID:
- 416842
- Report Number(s):
- CONF-960121--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Self-stabilizing unidirectional network algorithms by power-supply
Efficiency of synchronous versus asynchronous distributed systems
Distributed algorithms for election in unidirectional and complete networks
Conference
·
Sun Jun 01 00:00:00 EDT 1997
·
OSTI ID:471665
Efficiency of synchronous versus asynchronous distributed systems
Journal Article
·
Fri Jul 01 00:00:00 EDT 1983
· J. Assoc. Comput. Mach.; (United States)
·
OSTI ID:5364935
Distributed algorithms for election in unidirectional and complete networks
Thesis/Dissertation
·
Mon Dec 31 23:00:00 EST 1984
·
OSTI ID:5608910