| Presentation | 2024-03-14 Time Analysis of Space Efficient Uniform Partitioning in Population Protocols Pascal Sahner, Ryota Eguchi, Fukuhito Ooshita, Michiko Inoue, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Population protocols are a theoretical model for modeling a set of units with low computational capabilities - so called agents - that can communicate with each other pairwise. Their possible applications are, for example, nano-robots consisting of only a few molecules or mobile sensors in a sensor network. Despite the performance limitations of a single agent, the entire population can fulfill global tasks that go beyond this limitation. For this purpose, it is often helpful to divide the agents into separate groups. In this way, for example, task distribution can be achieved. Exactly this subdivision, the exact k-partition problem, was dealt with in the doctoral dissertation [Yas22]. In addition to lower bounds on space complexity, upper bounds in the form of concrete protocols are also given. However, since the focus of the work is space complexity, the time complexity was only estimated using simulations. Therefore, in this work we focus on the time complexity aspect of those protocols and problems. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | population protocoluniform k-partition problem,distributed systemdistributed algorithmtime complexity analysis |
| Paper # | COMP2023-34 |
| Date of Issue | 2024-03-07 (COMP) |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2024/3/14(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | The University of Electro-Communications |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Theoretical Computer Science, etc |
| Chair | Hiroyuki Uno(Osaka Metropolitan Univ.) |
| Vice Chair | Shuji Kijima(Shiga Univ.) |
| Secretary | Shuji Kijima(Hosei Univ.) |
| Assistant | Ei Ando(Senshu Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Theoretical Foundations of Computing |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Time Analysis of Space Efficient Uniform Partitioning in Population Protocols |
| Sub Title (in English) | |
| Keyword(1) | population protocoluniform k-partition problem,distributed systemdistributed algorithmtime complexity analysis |
| 1st Author's Name | Pascal Sahner |
| 1st Author's Affiliation | Nara Insitute of Science and Technology/RWTH Aachen(NAIST/RWTH Aachen) |
| 2nd Author's Name | Ryota Eguchi |
| 2nd Author's Affiliation | Nara Insitute of Science and Technology(NAIST) |
| 3rd Author's Name | Fukuhito Ooshita |
| 3rd Author's Affiliation | Fukui University of Technology(FUT) |
| 4th Author's Name | Michiko Inoue |
| 4th Author's Affiliation | Nara Insitute of Science and Technology(NAIST) |
| Date | 2024-03-14 |
| Paper # | COMP2023-34 |
| Volume (vol) | vol.123 |
| Number (no) | COMP-444 |
| Page | pp.pp.34-41(COMP), |
| #Pages | 8 |
| Date of Issue | 2024-03-07 (COMP) |