New upperbounds for decentralized extrema-finding in a ring of processors
- First Online:
- 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
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.
Unable to display preview. Download preview PDF.