A Population Protocol for Uniform k-partition under Global Fairness

被引：0
|
作者：
Yasumi, Hiroto [1 ]
Kitamura, Naoki [2 ]
Ooshita, Fukuhito [3 ]
Izumi, Taisuke [2 ]
Inoue, Michiko [3 ]
机构：
[1] Natl Inst Technol, Nara Coll, Nara, Japan
[2] Nagoya Inst Technol, Nagoya, Aichi, Japan
[3] Nara Inst Sci & Technol, Nara, Japan
来源：
2018 IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM WORKSHOPS (IPDPSW 2018) | 2018年
基金：
日本科学技术振兴机构;
关键词：
NETWORKS;
D O I：
10.1109/IPDPSW.2018.00128
中图分类号：
TP3 [计算技术、计算机技术];
学科分类号：
0812 ;
摘要：
In this paper, we consider a uniform k-partition problem in a population protocol model. The uniform k-partition problem divides a population into k groups of the same size. For this problem, we give a symmetric protocol with designated initial states under global fairness. This protocol requires 3k - 2 states; that is, the protocol is asymptotically space-optimal.
引用
收藏
页码：813 / 819
页数：7
相关论文
共 50 条
  • [1] On uniform k-partition problems
    Dell'Olmo, P
    Hansen, P
    Pallottino, S
    Storchi, G
    [J]. DISCRETE APPLIED MATHEMATICS, 2005, 150 (1-3) : 121 - 139
  • [2] A Parallel and Uniform k-Partition Method for Montgomery Multiplication
    Neto, Joao Carlos
    Tenca, Alexandre Ferreira
    Ruggiero, Wilson Vicente
    [J]. IEEE TRANSACTIONS ON COMPUTERS, 2014, 63 (09) : 2122 - 2133
  • [3] On the k-partition dimension of graphs
    Estrada-Moreno, Alejandro
    [J]. THEORETICAL COMPUTER SCIENCE, 2020, 806 : 42 - 52
  • [4] FACETS OF THE K-PARTITION POLYTOPE
    CHOPRA, S
    RAO, MR
    [J]. DISCRETE APPLIED MATHEMATICS, 1995, 61 (01) : 27 - 48
  • [5] Projection results for the k-partition problem
    Fairbrother, Jamie
    Letchford, Adam N.
    [J]. DISCRETE OPTIMIZATION, 2017, 26 : 97 - 111
  • [6] Exploiting sparsity for the min k-partition problem
    Guanglei Wang
    Hassan Hijazi
    [J]. Mathematical Programming Computation, 2020, 12 : 109 - 130
  • [7] Space-Optimal Population Protocols for Uniform Bipartition Under Global Fairness
    Yasumi, Hiroto
    Ooshita, Fukuhito
    Yamaguchi, Ken'ichi
    Inoue, Michiko
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2019, E102D (03): : 454 - 463
  • [8] Exploiting sparsity for the min k-partition problem
    Wang, Guanglei
    Hijazi, Hassan
    [J]. MATHEMATICAL PROGRAMMING COMPUTATION, 2020, 12 (01) : 109 - 130
  • [9] A k-partition, graph theoretic approach to perceptual organization
    Byrne, J
    Gandhe, A
    Prasanth, RK
    Ravichandan, B
    Huff, M
    Mehra, RK
    Sarkar, S
    [J]. INTERNATIONAL CONFERENCE ON INTEGRATION OF KNOWLEDGE INTENSIVE MULTI-AGENT SYSTEMS: KIMAS'03: MODELING, EXPLORATION, AND ENGINEERING, 2003, : 336 - 342
  • [10] Efficient algorithms for some k-partition problem of graphs
    Takaki, A
    Wada, K
    Kawaguchi, K
    [J]. ELECTRONICS AND COMMUNICATIONS IN JAPAN PART III-FUNDAMENTAL ELECTRONIC SCIENCE, 1997, 80 (07): : 74 - 84
12345