Space-Optimal Population Protocols for Uniform Bipartition Under Global Fairness

被引：1
|
作者：
Yasumi, Hiroto [1 ]
Ooshita, Fukuhito [1 ]
Yamaguchi, Ken'ichi [2 ]
Inoue, Michiko [1 ]
机构：
[1] Nara Inst Sci & Technol, Grad Sch Sci & Technol, Ikoma 6300192, Japan
[2] Nara Coll, Natl Inst Technol, Coll Informat Sci, Koriyama, Fukushima 6391080, Japan
来源：
IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS | 2019年 / E102D卷 / 03期
关键词：
population protocol; uniform bipartition; distributed protocol; COMPUTATION; NETWORKS;
D O I：
10.1587/transinf.2018FCP0009
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we consider a uniform bipartition problem in a population protocol model. The goal of the uniform bipartition problem is to divide a population into two groups of the same size. We study the problem under global fairness with various assumptions: 1) a population with or without a base station, 2) symmetric or asymmetric protocols, and 3) designated or arbitrary initial states. As a result, we completely clarify solvability of the uniform bipartition problem under global fairness and, if solvable, show the tight upper and lower bounds on the number of states.
引用
收藏
页码：454 / 463
页数：10
相关论文
共 12 条
  • [1] Space-Optimal Counting in Population Protocols
    Beauquier, Joffroy
    Burman, Janna
    Claviere, Simon
    Sohier, Devan
    [J]. DISTRIBUTED COMPUTING (DISC 2015), 2015, 9363 : 631 - 646
  • [2] Space-Optimal Majority in Population Protocols
    Alistarh, Dan
    Aspnes, James
    Gelashvili, Rati
    [J]. SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 2221 - 2239
  • [3] Space-Optimal Proportion Consensus with Population Protocols
    Cordasco, Gennaro
    Gargano, Luisa
    [J]. STABILIZATION, SAFETY, AND SECURITY OF DISTRIBUTED SYSTEMS, SSS 2017, 2018, 10616 : 384 - 398
  • [4] A Population Protocol for Uniform k-partition under Global Fairness
    Yasumi, Hiroto
    Kitamura, Naoki
    Ooshita, Fukuhito
    Izumi, Taisuke
    Inoue, Michiko
    [J]. 2018 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW 2018), 2018, : 813 - 819
  • [5] Finding space-optimal linear array for uniform dependence algorithms with arbitrary convex index sets
    Ke, JY
    Tsay, JC
    [J]. JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 1998, 14 (04) : 743 - 763
  • [6] Optimal Time and Space Leader Election in Population Protocols
    Berenbrink, Petra
    Giakkoupis, George
    Kling, Peter
    [J]. PROCEEDINGS OF THE 52ND ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (STOC '20), 2020, : 119 - 129
  • [7] Fast Space Optimal Leader Election in Population Protocols
    Gasieniec, Leszek
    Stachowiak, Grzegorz
    [J]. SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 2653 - 2667
  • [8] Brief Announcement: Space- Optimal Naming in Population Protocols
    Burman, Janna
    Beauquier, Joffroy
    Sohier, Devan
    [J]. PODC'18: PROCEEDINGS OF THE 2018 ACM SYMPOSIUM ON PRINCIPLES OF DISTRIBUTED COMPUTING, 2018, : 479 - 481
  • [9] Enhanced Phase Clocks, Population Protocols, and Fast Space Optimal Leader Election
    Gasieniec, Leszek
    Stachowiak, Grzegorz
    [J]. JOURNAL OF THE ACM, 2021, 68 (01)
  • [10] Almost Logarithmic-Time Space Optimal Leader Election in Population Protocols
    Gasieniec, Leszek
    Stachowiak, Grzegorz
    Uznanski, Przemyslaw
    [J]. SPAA'19: PROCEEDINGS OF THE 31ST ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURESS, 2019, 2019, : 93 - 102
12