Skip to main content

Communication and time complexity of a distributed election protocol

  • Published:
Queueing Systems Aims and scope Submit manuscript

Abstract

we evaluate several variants of a standard election algorithm on a ring of processors. The performance measures of interest are the number of messages exchanged (communication complexity) and the execution time (time complexity). Classical models use a “synchronism assumption” according to which all processors start at the same time and message delays are constant.

We attempt to capture the essential asynchronism of this class of algorithms by using probabilistic models. Two such models are discussed, one in discrete and one in continuous time. In each case, both the uni- and the bidirectional cases are studied and compared. We obtain expressions for the distributions of the number of exchanged messages and derive their asymptotic behavior whenn, the number of processors in the ring, grows large. The results show how the communication complexity actually depends on the speed of communcations on the ring, and what is the interest of having bidirectional communications.

We also address in part the evaluation of the completion time of the algorithm. This time decomposes into astartup time and anexploration time. We show that the average of the startup time is of the order of logn.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. E. Chang and R. Roberts, An improved algorithm for decentralized extrema-finding in circular configurations of processors, Comm. ACM 22 (1979) 281–283.

    Google Scholar 

  2. A. Erdélyi (ed.),Higher Transcendental Functions, vol. 1 (McGraw-Hill, 1953).

  3. W. Feller,An Introduction to Probability Theory and its Applications, vol 2 (Wiley, 1970).

  4. P. Flajolet, Random tree models in the analysis of algorithms,Proc. PERFORMANCE '87 eds. P.-J. Courtois and G. Latouche (North-holland, 1988).

  5. D.S. Hirschberg and J.B. Sinclair, Decentralized extrema-finding in circular configurations of processors, Comm. ACM 23 (1980) 627–628.

    Google Scholar 

  6. E.L. Ince,Ordinary Differential Equations (Dover, 1926).

  7. C. Kaiser, Election sur un anneau par parcours de reconnaissance, T.S.I. 8 (1989) 241–257.

    Google Scholar 

  8. D. Rotem, E. Korach and N. Santoro, Analysis of a distributed algorithm for extrema-finding in a ring, J. Parallel Distr. Comput. 4 (1987) 575–591.

    Google Scholar 

  9. M. Laventiev and B. Chabat,Méthodes de la Théorie des Fonctions d'une Variable Complexe (MIR Editions, 1977).

  10. G. Le Lann, Distributed systems. Towards a formal approach,IFIP Congress 1977 (North-Holland) pp. 185–187.

  11. G.L. Peterson, AnO(n log n) unidirectional algorithm for the circular extrema problem, ACM Trans. Prog. Languages and Systems 4 no. 4 (1982).

  12. D. Stoyan,Comparison Methods for Queues and Other Stochastic Models (Wiley, New York, 1983).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jean-Marie, A., Baccelli, F. Communication and time complexity of a distributed election protocol. Queueing Syst 9, 83–111 (1991). https://doi.org/10.1007/BF01158793

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01158793

Keywords