WEKO3
アイテム
Group Communication Protocol for Hierarchical Group
https://ipsj.ixsq.nii.ac.jp/records/11281
https://ipsj.ixsq.nii.ac.jp/records/112812a3d40a7-faa4-4f7e-a738-0a1a0475e6d1
| 名前 / ファイル | ライセンス | アクション |
|---|---|---|
IPSJ-JNL4403018.pdf (339.9 kB)
|
Copyright (c) 2003 by the Information Processing Society of Japan
|
|
| オープンアクセス | ||
| Item type | Journal(1) | |||||||
|---|---|---|---|---|---|---|---|---|
| 公開日 | 2003-03-15 | |||||||
| タイトル | ||||||||
| タイトル | Group Communication Protocol for Hierarchical Group | |||||||
| タイトル | ||||||||
| 言語 | en | |||||||
| タイトル | Group Communication Protocol for Hierarchical Group | |||||||
| 言語 | ||||||||
| 言語 | eng | |||||||
| キーワード | ||||||||
| 主題Scheme | Other | |||||||
| 主題 | 特集：高速ネットワークとマルチメディアアプリケーション | |||||||
| 資源タイプ | ||||||||
| 資源タイプ識別子 | http://purl.org/coar/resource_type/c_6501 | |||||||
| 資源タイプ | journal article | |||||||
| その他タイトル | ||||||||
| その他のタイトル | 分散処理 | |||||||
| 著者所属 | ||||||||
| Department of Computers and Systems Engineering Tokyo Denki University | ||||||||
| 著者所属 | ||||||||
| Department of Computers and Systems Engineering Tokyo Denki University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computers and Systems Engineering, Tokyo Denki University | ||||||||
| 著者所属(英) | ||||||||
| en | ||||||||
| Department of Computers and Systems Engineering, Tokyo Denki University | ||||||||
| 著者名 |
Kojiro, Taguchi
× Kojiro, Taguchi
|
|||||||
| 著者名(英) |
Kojiro, Taguchi
× Kojiro, Taguchi
|
|||||||
| 論文抄録 | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | A group including a large number of processes implies largecomputation and communication overheads O(n2) to manipulate andtransmit messages for number n of processes in a group.In this paper we discuss a hierarchical group (HG) where subgroups ofprocesses are interconnected in order to reduce the overheads.We propose a hierarchical group (HG) protocol to causally deliver messages toprocesses in the hierarchical group.In the HG protocol each message carries a vector whose size is the numberof subgroups smaller than number of processes in a group. | |||||||
| 論文抄録(英) | ||||||||
| 内容記述タイプ | Other | |||||||
| 内容記述 | A group including a large number of processes implies largecomputation and communication overheads O(n2) to manipulate andtransmit messages for number n of processes in a group.In this paper, we discuss a hierarchical group (HG) where subgroups ofprocesses are interconnected in order to reduce the overheads.We propose a hierarchical group (HG) protocol to causally deliver messages toprocesses in the hierarchical group.In the HG protocol, each message carries a vector whose size is the numberof subgroups, smaller than number of processes in a group. | |||||||
| 書誌レコードID | ||||||||
| 収録物識別子タイプ | NCID | |||||||
| 収録物識別子 | AN00116647 | |||||||
| 書誌情報 |
情報処理学会論文誌 巻 44, 号 3, p. 674-681, 発行日 2003-03-15 |
|||||||
| ISSN | ||||||||
| 収録物識別子タイプ | ISSN | |||||||
| 収録物識別子 | 1882-7764 | |||||||
