Analysis of a distributed algorithm for extrema finding in a ring

D. Rotem, E. Korach, N. Santoro

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

A new and more detailed analysis of the unidirectional algorithm of Chang and Roberts for distributed extrema finding on a ring is presented. This analysis shows that this simple algorithm, which is known to be average case optimal, compares very favorably with all the other known algorithms as it requires O(n log n) messages with probability tending to one. A bidirectional version of this algorithm is presented and is shown to dominate the unidirectional one in its average message complexity. Finally, both the unidirectional and the bidirectional algorithms are generalized to perform k selection in the ring, i.e., find the k largest labeled processors.

Original languageEnglish
Pages (from-to)575-591
Number of pages17
JournalJournal of Parallel and Distributed Computing
Volume4
Issue number6
DOIs
StatePublished - 1 Jan 1987
Externally publishedYes

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Analysis of a distributed algorithm for extrema finding in a ring'. Together they form a unique fingerprint.

Cite this