An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle

@article{Dolev1982AnOL,
  title={An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle},
  author={D. Dolev and M. Klawe and M. Rodeh},
  journal={J. Algorithms},
  year={1982},
  volume={3},
  pages={245-260}
}
Abstract In this paper we present algorithms, which given a circular arrangement of n uniquely numbered processes, determine the maximum number in a distributive manner. We begin with a simple unidirectional algorithm, in which the number of messages passed is bounded by 2 n log n + O ( n ). By making several improvements to the simple algorithm, we obtain a unidirectional algorithm in which the number of messages passed is bounded by 1.5 n log n + O ( n ). These algorithms disprove Hirschberg… Expand
Some Lower Bound Results for Decentralized Extrema-Finding in Rings of Processors
  • H. Bodlaender
  • Computer Science, Mathematics
  • J. Comput. Syst. Sci.
  • 1991
TLDR
It is shown that arbitrary algorithms that solve the problem of finding the largest of a set of n uniquely numbered processors by means of an asynchronous distributed algorithm without a central controller cannot have a better worst-case number of messages than algorithms that use only comparisons between identities. Expand
An improved election algorithm in chordal ring networks
  • Yi Pan
  • Mathematics, Computer Science
  • Int. J. Comput. Math.
  • 1991
TLDR
This paper presents an efficient election algorithm which works on all chordal ring networks, and shows that the algorithm has an O(n) message complexity both on a regular chordalRing with only O( n log log n) links and on an irregular chordal Ring withonly O(N) links. Expand
Symmetry breaking in distributed networks
TLDR
Probabilistic algorithms are proposed to overcome the difficulty of designing a ring of n processors such that they will be able to choose a leader by sending messages along the ring, if the processors are indistinguishable. Expand
A Simple, Efficient Algorithm for Maximum Finding on Rings
TLDR
A new deterministic algorithm for maximum finding on asynchronous unidirectional rings is presented that achieves a lower worst case message complexity and exhibits its structure thus permitting a better understanding of various message saving mechanisms. Expand
Computing on an anonymous ring
TLDR
A new technique for proving lower bounds in the synchronous model is presented, based on a string-producing mechanism from formal language theory, and tight lower bounds of O(nlogn) (for particular n) are proved for XOR, SUM, Orientation, and Start Synchronization. Expand
Improvements in the time complexity of two message-optimal election algorithms
TLDR
Algorithms for election in asynchronous general networks and in synchronous rings are presented, and their time behavior is significantly improved over currently available algorithms. Expand
Language Complexity on the Synchronous Anonymous Ring
A set of n nondistinct processors, organized as a ring and operating synchronously, have to compute a function of their initial values. Every computable function can be computed with O(n log n)Expand
The impact of synchronous communication on the problem of electing a leader in a ring
TLDR
The problem of electing a leader in a synchronous ring of n processors is considered and it is shown that if processor ID's are chosen from some countable set, then there is an algorithm which uses only O(n) messages in the worst case. Expand
Gap theorems for distributed computing
TLDR
A gap theorem for asynchronous distributed computation on the ring is established which says that either the function computed is constant and no messages need to be sent, or, in case of an arbitrary non-constant function, ~(nlgn ) bits are required. Expand
Analysis of a Distributed Algorithm for Extrema Finding in a Ring
TLDR
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. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 11 REFERENCES
An improved algorithm for decentralized extrema-finding in circular configurations of processes
This note presents an improvement to LeLann's algorithm for finding the largest (or smallest) of a set of uniquely numbered processes arranged in a circle, in which no central controller exists andExpand
An O(nlog n) Unidirectional Algorithm for the Circular Extrema Problem
TLDR
Solutions may be compared using several measures; the total number of messages transmitted by the processes, the number of distinct messages used and the total message delay time are among them. Expand
Decentralized extrema-finding in circular configurations of processors
TLDR
This note presents an efficient algorithm for finding the largest (or smallest) of a set of uniquely numbered processors arranged in a circle, in which no central controller exists and the number of processors is not known a priori. Expand
The Lord of the Ring or Probabilistic Methods for Breaking Symmetry in Distributive Networks
  • The Lord of the Ring or Probabilistic Methods for Breaking Symmetry in Distributive Networks
  • 1981
A Formal Model for Message Passing Systems
  • A Formal Model for Message Passing Systems
  • 1980
A Formal Model for Message Passing Systems," TR-91
  • Indiana University,
  • 1980
A Distributed Algorithm for Minimum Spanning Tree
  • MIT, LIDS-P-906-A
  • 1979
SPIRA, "A Distributed Algorithm for Minimum Spanning Tree," MIT, LIDS-P-906-A
  • 1979
Distributed Systems-Toward a Formal Approach Information Processing 77
  • Distributed Systems-Toward a Formal Approach Information Processing 77
  • 1977
...
1
2
...