user

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 条
  • [21] The K-partition flash code with BIFC-based sharing and some variants
    Ortiz, Riz Rupert L.
    Fernandez, Proceso L.
    [J]. International Journal of Multimedia and Ubiquitous Engineering, 2014, 9 (09): : 381 - 396
  • [22] Linear algorithms for a k-partition problem of planar graphs without specifying bases
    Wada, K
    Chen, W
    [J]. GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE, 1998, 1517 : 324 - 336
  • [23] Efficient algorithms for a mixed k-partition problem of graphs without specifying bases
    Wada, K
    Takaki, A
    Kawaguchi, K
    [J]. THEORETICAL COMPUTER SCIENCE, 1998, 201 (1-2) : 233 - 248
  • [24] Induced H-packing k-partition number for certain nanotubes and chemical graphs
    Xavier, Antony
    Theresal, Santiagu
    Raja, S. Maria Jesu
    [J]. JOURNAL OF MATHEMATICAL CHEMISTRY, 2020, 58 (06) : 1177 - 1196
  • [25] A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem
    Ghaddar, Bissan
    Anjos, Miguel F.
    Liers, Frauke
    [J]. ANNALS OF OPERATIONS RESEARCH, 2011, 188 (01) : 155 - 174
  • [26] Induced H-packing k-partition problem in certain carbon based nanostructures
    Theresal, Santiagu
    Xavier, Antony
    Raja, S. Maria Jesu
    [J]. JOURNAL OF MATHEMATICAL CHEMISTRY, 2021, 59 (06) : 1429 - 1449
  • [27] An O（k2n2） Algorithm to Find a k-Partition in a k-Connected Graph
    马军
    马绍汉
    [J]. Journal of Computer Science & Technology, 1994, (01) : 86 - 91
  • [28] Induced H-packing k-partition problem in certain carbon based nanostructures
    Santiagu Theresal
    Antony Xavier
    S. Maria Jesu Raja
    [J]. Journal of Mathematical Chemistry, 2021, 59 : 1429 - 1449
  • [29] Induced H-packing k-partition number for certain nanotubes and chemical graphs
    Antony Xavier
    Santiagu Theresal
    S. Maria Jesu Raja
    [J]. Journal of Mathematical Chemistry, 2020, 58 : 1177 - 1196
  • [30] A branch-and-cut algorithm based on semidefinite programming for the minimum k-partition problem
    Bissan Ghaddar
    Miguel F. Anjos
    Frauke Liers
    [J]. Annals of Operations Research, 2011, 188 : 155 - 174
12345