Symmetry breaking in distributed networks

@article{Itai1990SymmetryBI,
  title={Symmetry breaking in distributed networks},
  author={A. Itai and M. Rodeh},
  journal={Inf. Comput.},
  year={1990},
  volume={88},
  pages={60-87}
}
Abstract Given a ring of n processors it is required to design the processors such that they will be able to choose a leader (a uniquely designated processor) by sending messages along the ring. If the processors are indistinguishable then there exists no deterministic algorithm to solve the problem. To overcome this difficulty, probabilistic algorithms are proposed. The algorithms may run forever but they terminate within finite time on the average. For the synchronous case several algorithms… Expand
Election and symmetry breaking in synchronous general networks
  • M. Y. Chan
  • Computer Science
  • Microprocess. Microsystems
  • 1993
TLDR
Using an algorithm, which generalizes previous results for synchronous ring election and which exploits identifiers and clocks, a new O ( e ) worst case message complexity upper bound is demonstrated for networks of unknown topology. Expand
Message Terminating Algorithms for Anonymous Rings of Unknown Size
TLDR
This paper addresses the design of deterministic and probabilistic algorithms that message terminate with the correct result, and shows the impossibility of computing most functions (the class of nonsymmetric functions) including: leader election, XOR and finding the ring size. Expand
Message Terminate Algorithms for Anonymous Rings of Unknown Size
TLDR
The work addresses algorithms (both deterministic and probabilistic) that always terminate with the correct result and shows the following algorithms that are message terminate, i.e. the algorithm terminates when no more messages are present in the system. Expand
Deterministic Leader Election Takes Θ(D + log n) Bit Rounds
Leader election is, together with consensus, one of the most central problems in distributed computing. This paper presents a distributed algorithm, called ST T , for electing deterministically aExpand
SIMPLE RANDOMIZED LEADER ELECTION WITH EXTENSIONS
TLDR
An optimal algorithm for ring orientation follows easily even for situations where deterministic orientation is impossible, and generalizes to an optimal Las Vegas algorithm for election in an oriented complete graph. Expand
Election on faulty rings with incomplete size information
  • G. Peterson, Byungho Yi
  • Computer Science
  • Proceedings of 1994 6th IEEE Symposium on Parallel and Distributed Processing
  • 1994
TLDR
This paper considers the election problem on asynchronous ring networks in which one link may undetectably fail and finds an optimal algorithm of worst case message complexity O(nlog n) that is proven optimal. Expand
Faults and fault-tolerance in distributed computing systems: the election problem
TLDR
This dissertation examines some issues concerning fault tolerance in distributed computing systems using the election problem as a test bed and shows that a good lower bound is most useful in designing algorithms with good worst-case message complexity. Expand
Deterministic Leader Election Takes $\Theta(D + \log n)$ Bit Rounds
TLDR
It is shown that the bit round complexity of \STT is optimal (up to a constant factor), which is a significant step forward in understanding the interplay between time and message optimality for the election problem. Expand
Asymptotic analysis of a leader election algorithm
TLDR
A precise asymptotic analysis of the average number of rounds M(n) required by the algorithm is given, proving for example that M(∞) := limn→∞ M( n) = 2.441715879..., where n is the number of starting candidates in the election. Expand
Anonymous Processors with Synchronous Shared Memory
TLDR
All the Las Vegas algorithms developed are asymptotically optimal with respect to their expected time, as determined by the available shared memory, and the Monte Carlo algorithms are correct with probabilities that are $1-n^{-\Omega(1)}$, which is best possible when terminating almost surely and using $O(n\log n)$ random bits. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 46 REFERENCES
Probabilistic solitude verification on a ring
TLDR
This paper is concerned with versions of solitude verification which cannot be solved with certainty, but can be solved probabilisticaUy, with arbitrarily small positive probability of error. Expand
On the Bit Complexity of Distributed Computations in a Ring with a Leader
TLDR
The bit complexity of pattern recognition in a distributed ring with a leader is studied, and it is proved that every non-regular language requires at least Ω(n log n) bits for its recognition. Expand
On the bit complexity of distributed computations in a ring with a leader
TLDR
It is proved that a language is recognized by an algorithm that uses 0 (n) bits if and only if it is regular and every non-regular language requires at least g2(n logn) bits for its recognition. Expand
An O(n log n) Unidirectional Distributed Algorithm for Extrema Finding in a Circle
TLDR
Algorithms, which given a circular arrangement of n uniquely numbered processes, determine the maximum number in a distributive manner, disprove Hirschberg and Sinclair's conjecture that O ( n 2 ) is a lower bound on the number of messages passed in undirectional algorithms. Expand
Two lower bounds in asynchronous distributed computation
  • P. Duris, Z. Galil
  • Computer Science
  • 28th Annual Symposium on Foundations of Computer Science (sfcs 1987)
  • 1987
We introduce new techniques for deriving lower bounds on the message complexity in asynchronous distributed computation. These techniques combine the choice of specific patterns of communicationExpand
On the existence of symmetric algorithms to find leaders in networks of communicating sequential processes
SummaryWe define a semantic notion of symmetry well-suited for networks of processes specified in Hoare’s language CSP. Symmetric algorithms to find a leader in such networks are then studied. WeExpand
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
On an improved algorithm for decentralized extrema finding in circular configurations of processors
This note presents a more efficient algorithm for finding the largest element in a circular list of processors when messages can be passed in either direction. It passes 2<italic>N</italic>*floor(lgExpand
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
...
1
2
3
4
5
...