Self-stabilizing leader election in optimal space under an arbitrary scheduler

被引：27
|
作者：
Datta, Ajoy K. [1 ]
Larmore, Lawrence L. [1 ]
Vemula, Priyanka [1 ]
机构：
[1] Univ Nevada, Sch Comp Sci, Las Vegas, NV 89154 USA
来源：
THEORETICAL COMPUTER SCIENCE | 2011年 / 412卷 / 40期
关键词：
Distributed algorithm; Leader election; Self-stabilization; Silent algorithm; Unfair daemon; PROTOCOLS; SYSTEMS;
D O I：
10.1016/j.tcs.2010.05.001
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
A silent self-stabilizing asynchronous distributed algorithm, SSLE, is given for the leader election problem in a connected unoriented (bidirectional) network with unique IDs. SSLE also constructs a BFS tree on the network rooted at that leader. SSLE uses 0(log n) space per process and stabilizes in 0(n) rounds, against the unfair daemon, where n is the number of processes in the network. (C) 2010 Elsevier B.V. All rights reserved.
引用
收藏
页码：5541 / 5561
页数：21
相关论文
共 50 条
  • [1] Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
    Beauquier, Joffroy
    Gradinariu, Maria
    Johnen, Colette
    DISTRIBUTED COMPUTING, 2007, 20 (01) : 75 - 93
  • [2] Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings
    Joffroy Beauquier
    Maria Gradinariu
    Colette Johnen
    Distributed Computing, 2007, 20 : 75 - 93
  • [3] Self-Stabilizing Leader Election in Optimal Space
    Datta, Ajoy K.
    Larmore, Lawrence L.
    Vemula, Priyanka
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, 10TH INTERNATIONAL SYMPOSIUM, SSS 2008, 2008, 5340 : 109 - 123
  • [4] Self-stabilizing mutual exclusion under arbitrary scheduler
    Datta, AK
    Gradinariu, M
    Tixeuil, S
    COMPUTER JOURNAL, 2004, 47 (03): : 289 - 298
  • [5] Self-Stabilizing Leader Election
    Chen, Hsueh-Ping
    Chen, Ho-Lin
    PROCEEDINGS OF THE 2019 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '19), 2019, : 53 - 59
  • [6] Optimal Space Lower Bound for Deterministic Self-Stabilizing Leader Election Algorithms
    Blin, Lelia
    Feuilloley, Laurent
    Le Bouder, Gabriel
    DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 2023, 25 (01):
  • [7] Memory space requirements for self-stabilizing leader election protocols
    Universite de Paris-Sud, Orsay, France
    Proc Annu ACM Symp Princ Distrib Comput, (199-207):
  • [8] Time-Optimal Self-Stabilizing Leader Election in Population Protocols
    Burman, Janna
    Chen, Ho-Lin
    Chen, Hsueh-Ping
    Doty, David
    Nowak, Thomas
    Severson, Eric
    Xu, Chuan
    PROCEEDINGS OF THE 2021 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING (PODC '21), 2021, : 33 - 44
  • [9] Self-stabilizing anonymous leader election in a tree
    Xu, ZY
    Srimani, PK
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2006, 17 (02) : 323 - 335
  • [10] Self-stabilizing Leader Election in Polynomial Steps
    Altisen, Karine
    Cournier, Alain
    Devismes, Stephane
    Durand, Anais
    Petit, Franck
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2014, 2014, 8756 : 106 - 119
12345