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
关键词
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 条
  • [21] Compact self-stabilizing leader election for general networks
    Blin, Lelia
    Tixeuil, Sebastien
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2020, 144 : 278 - 294
  • [22] Compact Self-Stabilizing Leader Election for General Networks
    Blin, Lelia
    Tixeuil, Sebastien
    LATIN 2018: THEORETICAL INFORMATICS, 2018, 10807 : 161 - 173
  • [23] A self-stabilizing leader election algorithm for tree graphs
    Antonoiu, G
    Srimani, PK
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1996, 34 (02) : 227 - 232
  • [24] An Aggregate Computing Approach to Self-Stabilizing Leader Election
    Mo, Yuanqiu
    Beal, Jacob
    Dasgupta, Soura
    2018 IEEE 3RD INTERNATIONAL WORKSHOPS ON FOUNDATIONS AND APPLICATIONS OF SELF* SYSTEMS (FAS*W), 2018, : 112 - 117
  • [25] Space Complexity of Self-stabilizing Leader Election in Passively-Mobile Anonymous Agents
    Cai, Shukai
    Izumi, Taisuke
    Wada, Koichi
    STRUCTURAL INFORMATION AND COMMUNICATION COMPLEXITY, 2010, 5869 : 113 - 125
  • [26] On the Power of Oracle Ω? for Self-Stabilizing Leader Election in Population Protocols
    Beauquier, Joffroy
    Blanchard, Peva
    Burman, Janna
    Denysyuk, Oksana
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2016, 2016, 10083 : 20 - 35
  • [27] An exercise in fault-containment: Self-stabilizing leader election
    Ghosh, S
    Gupta, A
    INFORMATION PROCESSING LETTERS, 1996, 59 (05) : 281 - 288
  • [28] An O(n)-time self-stabilizing leader election algorithm
    Datta, Ajoy K.
    Larmore, Lawrence L.
    Vemula, Priyanka
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 2011, 71 (11) : 1532 - 1544
  • [29] Upper and Lower Bounds of Space Complexity of Self-Stabilizing Leader Election in Mediated Population Protocol
    Mizoguchi, Ryu
    Ono, Hirotaka
    Kijima, Shuji
    Yamashita, Masafumi
    PRINCIPLES OF DISTRIBUTED SYSTEMS, 2010, 6490 : 491 - 503
  • [30] Space Complexity of Self-Stabilizing Leader Election in Population Protocol Based on k-Interaction
    Xu, Xiaoguang
    Yamauchi, Yukiko
    Kijima, Shuji
    Yamashita, Masafumi
    STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2013, 2013, 8255 : 86 - 97