Proceedings of IEEE 24th International Symposium on Fault- Tolerant Computing (1994)

Austin, TX, USA

June 15, 1994 to June 17, 1994

ISBN: 0-8186-5520-8

pp: 392-401

B. Mans , Dept. d'Inf., Quebec Univ., Hull, Que., Canada

ABSTRACT

Chordal rings (or circulant graphs) are a popular class of fault-tolerant network topologies which include rings and complete graphs. For this class, the fundamental problem of leader election has been extensively studied assuming either a fault-free system or an upper-bound on the number of link failures. We consider chordal rings where an arbitrary number of lines has failed and a processor can only detect the status of its incident links. We shows that a leader election protocol in a faulty chordal ring requires only O(n log n) messages in the worst-case, where n is the number of processors. Moreover, we show that this is optimal. If the network is not partitioned, the algorithm will detect it and will elect a leader. In case the failures have partitioned the network a distinctive element will be determined in each active component and will detect that a partition has occurred; depending on the application, these distinctive elements can thus take the appropriate actions.<>

INDEX TERMS

multiprocessor interconnection networks, fault tolerant computing, reliability, message passing, parallel architectures

CITATION

B. Mans and N. Santoro, "Optimal fault-tolerant leader election in chordal rings,"

*Proceedings of IEEE 24th International Symposium on Fault- Tolerant Computing(FTCS)*, Austin, TX, USA, 1994, pp. 392-401.

doi:10.1109/FTCS.1994.315621

CITATIONS