New upperbounds for decentralized extrema-finding in a ring of processors

  • H. L. Bodlaender
  • J. van Leeuwen
Contributed Papers

DOI: 10.1007/3-540-16078-7_70

Part of the Lecture Notes in Computer Science book series (LNCS, volume 210)
Cite this paper as:
Bodlaender H.L., van Leeuwen J. (1986) New upperbounds for decentralized extrema-finding in a ring of processors. In: Monien B., Vidal-Naquet G. (eds) STACS 86. STACS 1986. Lecture Notes in Computer Science, vol 210. Springer, Berlin, Heidelberg

Abstract

We show that decentralized extrema-finding ("election") is more efficient in bidirectional rings than in unidirectional rings of processors, by exhibiting a (non-probabilistic) algorithm for distributed extrema-finding in bidirectional rings that requires fewer messages on the average than any such algorithm for unidirectional rings.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag 1986

Authors and Affiliations

  • H. L. Bodlaender
    • 1
  • J. van Leeuwen
    • 1
  1. 1.Department of Computer ScienceUniversity of UtrechtUtrechtthe Netherlands

Personalised recommendations