Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/129712.129777acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article
Free access

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

Published: 01 July 1992 Publication History

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.

References

[1]
ABRAHAMSON, ADLER, H{OHAM, AND KIRKPATRICK, Probabilistic solitude verification on a ring. Proc. 5th A CM Syrup. on Principles of Distributed. Computing (1986).
[2]
Y. AFEK AND G.M. BROWN, Self-stabilization over unreliable communication media, manuscript. (Previous version appeared as: Self-stabilization of the alternating-bit protocol, Proc. 8th IEEE Syrup. on Reliable Distrgbuted Systems (1989), 10-12.
[3]
Y. AFEK, S. KUTTEN, AND M. YVNG, Memory-efficient selfstabilization on general networks, Proc. Jth International Workshop on Distrsbuted Algorithms, Lecture Notes,n Computer Science, Vol 486, Springer-Verlag, New York, (1989), 12-28.
[4]
N. ALON AND M. NAOR, Coin-flipping games immune against linear-sized coalition, Proc. 31st IEEE Syrup. on Foundatsons of Computer Science (1990), 46-54.
[5]
D. ANGLU{N, Local and global properties in networks of processors, Proc. l#th ACM Syrup. on Theory of Computing (1980), 82-93.
[6]
C. ATTIY^, M. SNIR AND M. WARMUTH, Computing on an anonymous ring, Proc. 4th ACM Syrup. on Principles of Distributed. Computing (1985), 196-203. (see also: Jourha! of the ACM 35(4) (1988), 845-875.
[7]
B. AWERBUCH, B. PATT, AND G. V^RGHESE, Selfstabilization by local checking and correction Proc. 33nd IEEE Syrup. on Foundatsons of Computer Scsence (1991), 268-277.
[8]
B. AWERBUCH, AND G. VARGHESE, Distributed program checking: a paradigm for building self-stabilizing distributed protocols, Proc. 33nd IEEE Syrup. on Foun. dat~ons of Computer Sc,ence (1991), 258-267.
[9]
G.M. BROWN, M.G GOUDA, AND C.L. Wu, Token systems that self-stabilize, IEEE Transact,one on Computers 38(6) (1989), 845-852.
[10]
J.E. BURNS AND J. PACHL, Uniform self-stabilizing rings, Proc. 3rd Aegean Workshop on Computing, Lecture Notes in Computer Science, Vol 319, Springer-Verlag, New York, (1988), 391-400. (See also: ACM TOPLAS 11(2) (1989), 330-344.)
[11]
W. Bux, F.H. CLOSe, K. KOMMZRLE, H.J. KELLER AND H.R. MOLLER, Architecture and design of a reliable tokenring network, IEEE J. on Selected Areas sn Comm., 1(5), (1983), 756-765.
[12]
R. COLE AND U. VISHKIN, Determmistic coin tossing and accelerating cascades: micro and macro techniques for demgmng parallel algorithms, Proc. I8th ACM Syrup. on Theory of Computing (1986), 206-219.
[13]
I. CIDON AND Y. OF#, MetaRing - A full-duplex ring with fairness and spatial reuse, Proc INFOCOM'90 969-981. (Also: Accepted to IEEE Tras. on Comm.).
[14]
E.W. DIJKSTRA, Self-stabilizing systems in spite of distributed control, Communtcattons of the ACM 17(11) (1974), 643-644.
[15]
S. DOLEV, A. ISRAELI AND S. MORAN, Resource bounds for self stabilizing message driven protocols, Proc. lOth ACM Syrup. on Principles of Distributed. Computing (1991), 281-293.
[16]
G.N. FRIZDERmKSON AND N. LYNCH, The impact of synchronous communication on the problem of electing a leadeProc. 16th ACM Syrup. on Theory of Computing (1984), 493-503. (see also: J. o} the ACId 34(1) (1987), 98-115.)
[17]
G.N. FREDERICKSON AND N. SANTORO, Breaking Symmetr#r in s2fnchronouv n~tworko, Pro~. l#t A WOC L~~Cur, Notes in Computer Science, Vol 227, Springer-Verlag, New York, (1986), 82-93.
[18]
T. HERMAN, Probabilistic self-stabilization, Informat, on Processing Letters 35 (1990), 63-67.
[19]
A. HOPPER AND R. M. NESt)HAM, The Cambridge fast ring networking system, IEEE Transactions on Computers, 37'(10) (1988), 1214-1223.
[20]
A. IfiRABLI AND M. JALFON, Token management schemes and random walks yield self stabilizing mutual exclusion, Proc. 9th A CM Syrup. on Prtncsples of Dtstrtbuted. Computing (1990), 119-130.
[21]
A. ISRAELI AND M. JAL#ON, Self-Stabilizing Ring Orientation, Proc. Jth Internat,onal Workshop on Des. tributed Algor, thms, Lecture Notes sn Computer Sc,- ence, Vol 486, Springer-Verlag, New York, (1990), 1-14.
[22]
A. ITAI AND M RODEH, Symmetry breaking in distributive networks, Proc. #nd IEEE Syrup. on Foundatsons of Computer Science (1981), 150-159.
[23]
A. ITAI, On the power needed to elect a leader Proc. $th International Workshop on Dtstmbuted Algorithms, Lecture Notes,n Computer Science, Vol 486, Springer- Verlag, New York, (1989), 29-40.
[24]
S. KATZ AND K.J. PERRY, Self-stabilizing extensions for message-passing systems, Proc. 9th A CM Syrup. on Pmncsples of Dtstmbuted. Computing (1990), 91-101.
[25]
A.A. LAZAR, A. T. TZMPL# AND R. GIDRON, MAGNET Ih A metropolitan area network based on asynchronous time sharing, IEEE J. on Selected Areas in Comm., 8(8), (1990), 1582-1594.
[26]
L. LAMPORT AND N.A. LYNCH, Distributed computing models and methods, Handbook on Theoretscal Computer Science, North-Holland, 1990, 1159-1199.
[27]
Y. MANSOUR AND S. ZAKS, On the bit complexity of distributed computations in a ring with a leader, Proc. 5th ACId Syrup. on Principles of Dsstributed. Computing (1986), 131-140.
[28]
J. MISRA, Detecting termination of distributed computations using markers, Proc. $nd A CM Syrup. on Princeplea of Distributed. Computing (1983), 290-294.
[29]
H. OHmSm, N. MORITA, AND S. Suzum, ATM ring protocol and performance, Proc. ICC'89, 13.1, (1989), 394-398
[30]
Y. OFZK ANt) M. YUNG, Principles for high-speed network control Proc. 9th A CM Syrup. on Principles o} Distributed. Comput,n9, (1990).
[31]
J. PACHL, E. KORACH AND D. ROT#M, A technique for proving lower bounds for distributed maximum-finding algorithms, Proc. 1$th ACM Syrup. on Theory of Computing (#982), 378-382.
[32]
F.E. Ross, FDDI - a Tutorial, IBEE Commumcatson Magazine, 24(5), (1986), 10-17.
[33]
M.O. RAmN AND D. LEHMANN, On the advantage of free choice: a symmetric solution to the dining philosophers problem, Proc. ACM Syrup. on Pmnc#ples of Programming Languages. (1981), 133-138.
[34]
B. SCrllEr#Ea AND M. StaR, Calling names on nameless networks, Proc. 8th ACM Syrup. on Pmnciples of Dzs. tributed. Computsng.
[35]
P. SPmAms, B. TAMPAKAS AND A. Tsmms, Symmetry breaking in asynchronous rings in O(n) messages, Proc. 3d Internatsonal Workshop on Distmbuted Algorithms, Lecture Notes,n Computer Science, Vol 393, Springer-Verlag, New York, (1989), 233-241.
[36]
P. VITANYI, Distributed elections in an Archimedian ring of processors, Proc. 16th A CM Syrup. on Theory of Computing (1984), 542-547.

Cited By

View all
  • (2022)A combinatorial characterization of self-stabilizing population protocolsInformation and Computation10.1016/j.ic.2021.104829285(104829)Online publication date: May-2022
  • (2020)Compact self-stabilizing leader election for general networksJournal of Parallel and Distributed Computing10.1016/j.jpdc.2020.05.019Online publication date: Jun-2020
  • (2020)A Combinatorial Characterization of Self-stabilizing Population ProtocolsStabilization, Safety, and Security of Distributed Systems10.1007/978-3-030-64348-5_13(167-182)Online publication date: 25-Nov-2020
  • Show More Cited By

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
STOC '92: Proceedings of the twenty-fourth annual ACM symposium on Theory of Computing
July 1992
794 pages
ISBN:0897915119
DOI:10.1145/129712
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 July 1992

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

STOC92
Sponsor:
STOC92: 24th Annual ACM Symposium on the Theory of Computing 1992
May 4 - 6, 1992
British Columbia, Victoria, Canada

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25
57th Annual ACM Symposium on Theory of Computing (STOC 2025)
June 23 - 27, 2025
Prague , Czech Republic

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)32
  • Downloads (Last 6 weeks)10
Reflects downloads up to 24 Jan 2025

Other Metrics

Citations

Cited By

View all
  • (2022)A combinatorial characterization of self-stabilizing population protocolsInformation and Computation10.1016/j.ic.2021.104829285(104829)Online publication date: May-2022
  • (2020)Compact self-stabilizing leader election for general networksJournal of Parallel and Distributed Computing10.1016/j.jpdc.2020.05.019Online publication date: Jun-2020
  • (2020)A Combinatorial Characterization of Self-stabilizing Population ProtocolsStabilization, Safety, and Security of Distributed Systems10.1007/978-3-030-64348-5_13(167-182)Online publication date: 25-Nov-2020
  • (2018)Compact deterministic self-stabilizing leader election on a ringDistributed Computing10.1007/s00446-017-0294-231:2(139-166)Online publication date: 1-Apr-2018
  • (2017)Stateless ComputationProceedings of the ACM Symposium on Principles of Distributed Computing10.1145/3087801.3087854(419-421)Online publication date: 25-Jul-2017
  • (2016)An efficient self-stabilizing vertex coloring algorithm2016 SAI Computing Conference (SAI)10.1109/SAI.2016.7556052(655-660)Online publication date: Jul-2016
  • (2016)On the Microscopic View of Time and MessagesEmergent Computation10.1007/978-3-319-46376-6_5(71-99)Online publication date: 5-Nov-2016
  • (2015)Self-Stabilized Fast Gossiping AlgorithmsACM Transactions on Autonomous and Adaptive Systems10.1145/281681910:4(1-20)Online publication date: 31-Dec-2015
  • (2015)Energy Modeling of Software for a Hardware Multithreaded Embedded MicroprocessorACM Transactions on Embedded Computing Systems10.1145/270010414:3(1-25)Online publication date: 30-Apr-2015
  • (2015)Design Optimization of Mixed-Criticality Real-Time Embedded SystemsACM Transactions on Embedded Computing Systems10.1145/270010314:3(1-29)Online publication date: 30-Apr-2015
  • Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media