| Presentation | 2019-12-13 分散スライシングを実現する省メモリ適応型プロトコル , , , , |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | The goal of the distributed slicing problem is to partition the nodes of a network into $k$ groups depending on the global order of the attribute value each node has. This paper proposes a new distributed protocol for the problem which reduces the memory space of an existing protocol and evaluate their performance in a simulation experiment. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | distributed slicing / distributed algorithm / computer network / sampling |
| Paper # | COMP2019-29 |
| Date of Issue | 2019-12-06 (COMP) |
| Conference Information | |
| Committee | COMP |
|---|---|
| Conference Date | 2019/12/13(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Ikaho Seminar House, Gunma University |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | Toshihiro Fujito(Toyohashi Univ. of Tech.) |
| Vice Chair | Shinichi Nakano(Gunma Univ.) |
| Secretary | Shinichi Nakano(Kumamoto Univ) |
| Assistant | Kazuhisa Seto(Seikei Univ.) |
| Paper Information | |
| Registration To | Technical Committee on Theoretical Foundations of Computing |
|---|---|
| Language | JPN-ONLY |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | |
| Sub Title (in English) | |
| Keyword(1) | distributed slicing |
| Keyword(2) | distributed algorithm |
| Keyword(3) | computer network |
| Keyword(4) | sampling |
| 1st Author's Name | |
| 1st Author's Affiliation | () |
| 2nd Author's Name | |
| 2nd Author's Affiliation | () |
| 3rd Author's Name | |
| 3rd Author's Affiliation | () |
| 4th Author's Name | |
| 4th Author's Affiliation | () |
| Date | 2019-12-13 |
| Paper # | COMP2019-29 |
| Volume (vol) | vol.119 |
| Number (no) | COMP-340 |
| Page | pp.pp.1-7(COMP), |
| #Pages | 7 |
| Date of Issue | 2019-12-06 (COMP) |