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
基金
日本科学技术振兴机构;
关键词
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 条