Self-stabilizing symmetry breaking in constant-space (extended abstract)

Authors:
Alain Mayer;Yoram Ofek;Rafail Ostrovsky;Moti Yung
Affiliations:
Computer Science Department, Brown University, Providence, RI;IBM T.J. Watson Research Center, Yorktown Heights, NY;MIT Laboratory for Computer Science, 545 Technology Square, Cambridge, MA;IBM T.J. Watson Research Center, Yorktown Heights, NY
Venue:
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Year:
1992

Citing 28
Cited 18

Electing a leader in a synchronous ring

Journal of the ACM (JACM)
On the bit complexity of distributed computations in a ring with a leader

PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Probabilistic solitude verification on a ring

PODC '86 Proceedings of the fifth annual ACM symposium on Principles of distributed computing
Deterministic coin tossing and accelerating cascades: micro and macro techniques for designing parallel algorithms

STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
Breaking symmetry in synchronous networks

Proc. of the Aegean workshop on computing on VLSI algorithms and architectures
The Cambridge Fast Ring Networking System

IEEE Transactions on Computers
Uniform self-stabilizing rings

VLSI Algorithms and Architectures
Token Systems That Self-Stabilize

IEEE Transactions on Computers
Calling names in nameless networks

Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
Probabilistic self-stabilization

Information Processing Letters
Self-stabilizing extensions for message-passing systems

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Token management schemes and random walks yield self-stabilizing mutual exclusion

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Principle for high speed network control: congestion-and deadlock-freeness, self-routing, and a single buffer per link

PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
Self-stabilizing ring orientation

Proceedings of the 4th international workshop on Distributed algorithms
Memory-efficient self stabilizing protocols for general networks

Proceedings of the 4th international workshop on Distributed algorithms
On the computational power needed to elect a leader (extended abstract)

Proceedings of the 4th international workshop on Distributed algorithms
Resource bounds for self stabilizing message driven protocols

PODC '91 Proceedings of the tenth annual ACM symposium on Principles of distributed computing
Distributed computing: models and methods

Handbook of theoretical computer science (vol. B)
Distributed program checking: a paradigm for building self-stabilizing distributed protocols (extended abstract)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Self-stabilization by local checking and correction (extended abstract)

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Computing on an anonymous ring

Proceedings of the fourth annual ACM symposium on Principles of distributed computing
Self-stabilizing systems in spite of distributed control

Communications of the ACM
On the advantages of free choice: a symmetric and fully distributed solution to the dining philosophers problem

POPL '81 Proceedings of the 8th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Symmetry Breaking in Asynchronous Rings with O(n) Messages

Proceedings of the 3rd International Workshop on Distributed Algorithms
A technique for proving lower bounds for distributed maximum-finding algorithms (Preliminary Version)

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Local and global properties in networks of processors (Extended Abstract)

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Detecting termination of distributed computations using markers

PODC '83 Proceedings of the second annual ACM symposium on Principles of distributed computing
Distributed elections in an archimedean ring of processors

STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing

Memory-efficient and self-stabilizing network RESET (extended abstract)

PODC '94 Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing
Faster computation on directed networks of automata

Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Log-space polynomial end-to-end communication

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Memory requirements for silent stabilization

PODC '96 Proceedings of the fifteenth annual ACM symposium on Principles of distributed computing
Memory space requirements for self-stabilizing leader election protocols

Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Self-stabilizing algorithms for synchronous unidirectional rings

Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Self-stabilizing unidirectional network algorithms by power-supply

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Self-stabilizing token circulation on asynchronous uniform unidirectional rings

Proceedings of the nineteenth annual ACM symposium on Principles of distributed computing
The wake up and report problem is time-equivalent to the firing squad synchronization problem

SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Token-based self-stabilizing uniform algorithms

Journal of Parallel and Distributed Computing - Self-stabilizing distributed systems
Determination of the Topology of a Directed Network

IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
The wake up and report problem is time-equivalent to the firing squad synchronization problem

Distributed Computing
Symmetric network computation

Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures
Self-stabilizing population protocols

ACM Transactions on Autonomous and Adaptive Systems (TAAS)
On distributed verification

ICDCN'06 Proceedings of the 8th international conference on Distributed Computing and Networking
Flat holonomies on automata networks

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Self-stabilizing population protocols

OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
Brief announcement: deterministic self-stabilizing leader election with O(log log n)-bits

Proceedings of the 2013 ACM symposium on Principles of distributed computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the problem of self-stabilizing round-robin token management scheme on an anonymous bidirectional ring of identical processors, where each processor is an asynchronous probabilistic (coin-flipping) finite state machine which sends and receives messages. We show that the solution to this problem is equivalent to symmetry breaking (i.e., leader election). Requiring only constant-size messages and message-passing model has practical implications: our solution can be implemented in high-speed networks using a universal fast hardware switches (i.e., finite state machines) of size independent of the size of the network.