Time-Optimal Leader Election in Population Protocols

被引：5
|
作者：
Sudo, Yuichi [1 ]
Ooshita, Fukuhito [2 ]
Izumi, Taisuke [3 ]
Kakugawa, Hirotsugu [4 ]
Masuzawa, Toshimitsu [1 ]
机构：
[1] Osaka Univ, Osaka 5650871, Japan
[2] Nara Inst Sci & Technol, Nara 6300192, Japan
[3] Nagoya Inst Technol, Nagoya, Aichi 4668555, Japan
[4] Ryukoku Univ, Otsu, Shiga 5202194, Japan
来源：
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | 2020年 / 31卷 / 11期
关键词：
Protocols; Voting; Sociology; Statistics; Phase locked loops; Schedules; Epidemics; Population protocols; leader election; stabilization time; COMPUTATION;
D O I：
10.1109/TPDS.2020.2991771
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this article, we present the first leader election protocol in the population protocol model that stabilizes within O(log n) parallel time in expectation with O(log n) states per agent, where n is the number of agents. Given a rough knowledge m of lg n such that m >= lg n and m = O(log n), the proposed protocol guarantees that exactly one leader is elected and the unique leader is kept forever thereafter. This protocol is time-optimal because it was recently proven that any leader election protocol requires Omega(log n) parallel time.
引用
下载
收藏
页码：2620 / 2632
页数：13
相关论文
共 50 条
  • [1] 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
  • [2] Time-Optimal Self-Stabilizing Leader Election on Rings in Population Protocols
    Yokota, Daisuke
    Sudo, Yuichi
    Masuzawa, Toshimitsu
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2021, E104A (12) : 1675 - 1684
  • [3] Optimal Time and Space Leader Election in Population Protocols
    Berenbrink, Petra
    Giakkoupis, George
    Kling, Peter
    PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20), 2020, : 119 - 129
  • [4] TIME-OPTIMAL LEADER ELECTION IN GENERAL NETWORKS
    PELEG, D
    JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1990, 8 (01) : 96 - 99
  • [5] Brief Announcement: Beeping a Time-Optimal Leader Election
    Dufoulon, Fabien
    Burman, Janna
    Beauquier, Joffroy
    PODC'18: PROCEEDINGS OF THE 2018 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2018, : 237 - 239
  • [6] Fast Space Optimal Leader Election in Population Protocols
    Gasieniec, Leszek
    Stachowiak, Grzegorz
    SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 2653 - 2667
  • [7] Almost Logarithmic-Time Space Optimal Leader Election in Population Protocols
    Gasieniec, Leszek
    Stachowiak, Grzegorz
    Uznanski, Przemyslaw
    SPAA'19: PROCEEDINGS OF THE 31ST ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURESS, 2019, 2019, : 93 - 102
  • [8] Polylogarithmic-Time Leader Election in Population Protocols
    Alistarh, Dan
    Gelashvili, Rati
    AUTOMATA, LANGUAGES, AND PROGRAMMING, PT II, 2015, 9135 : 479 - 491
  • [9] Leader Election Requires Logarithmic Time in Population Protocols
    Sudo, Yuichi
    Masuzawa, Toshimitsu
    PARALLEL PROCESSING LETTERS, 2020, 30 (01)
  • [10] Near-Optimal Leader Election in Population Protocols on Graphs
    Alistarh, Dan
    Rybicki, Joel
    Voitovych, Sasha
    PROCEEDINGS OF THE 2022 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, PODC 2022, 2022, : 246 - 256
12345