Exact average message complexity values for distributed election on bidirectional rings of processors

Christian Lavault (1)

1 LIPN - Laboratoire d'Informatique de Paris-Nord

Consider a distributed system of n processors arranged on a ring. All processors are labeled with distinct identity-numbers, but are otherwise identical. In this paper, we make use of combinatorial enumeration methods in permutations and derive the one and the same exact asymptotic value, lJ2nH,,+O(n), of the expected number of messages in both probabilistic and deterministicbidirectional variants of Chang-Roberts distributed election algorithm. This confirms the result of Bodlaender and van Leeuwen (1986) that distributed Ieader finding is indeed strictly more efficient on bidirectional rings of processors than on unidirectional ones.

Mots clés: Bidirectional ring; Complexity; Message transmission; Multiprocessor; Ringed network; Distributed system; Computer system; Combinatorial method

Domaines: Combinatoire [math.CO]; Calcul parallèle, distribué et partagé [cs.DC]

Christian Lavault. Exact average message complexity values for distributed election on bidirectional rings of processors. Theoretical Computer Science, 1990, 73 (1), p. 61-79. ⟨hal-00464403⟩