| Project/Area Number |
13680390
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
計算機科学
|
|---|
| Research Institution | Gunma University |
|---|
Principal Investigator |
IGARASHI Yoshihide Gunma University, Faculty of Engineering, Department of Computer Science, Professor, 工学部, 教授 (60006260)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
MOTEGI Kazuhiro Gunma University, Faculty of Engineering, Department of Computer Science, Research Associate, 工学部, 助手 (00251124)
|
|---|
| Project Period (FY) |
2001 – 2003
|
| Project Status |
Completed (Fiscal Year 2003)
|
| Budget Amount *help |
¥3,300,000 (Direct Cost: ¥3,300,000)
Fiscal Year 2003: ¥800,000 (Direct Cost: ¥800,000)
Fiscal Year 2002: ¥1,200,000 (Direct Cost: ¥1,200,000)
Fiscal Year 2001: ¥1,300,000 (Direct Cost: ¥1,300,000)
|
|---|
| Keywords | asynchronous shared memory / distributed algorithm / distributed system / group mutual exclusion / information security / k-exclusion / multi-party computation / mutual exclusion / 分散システム / 情報セキュリティ / 非同期共有メモリ / 相互排他問題 / k-排他問題 / 情報セキュティ / _<k->排他問題 |
|---|
| Research Abstract |
The main results which we obtained are as follows :
(1)We formalized the problem of how to transmit an information-theoretically secure bit using random deals of cards among players in hierarchical groups. Then we designed protocols for the problem, and for each protocol we gave sufficient conditions to successfully construct a secret key exchange spanning tree for the hand sizes of the players an the eavesdropper.
(2)We proved that the node connectivity of a hyper-ring with N nodes is equal to its degree by presenting an algorithm for the explicit construction of node-disjoint paths connecting a pair of given nodes.
(3)We analyzed two algorithms for the k-exclusion problem on the asynchronous multi-writer/reader shared memory model and their correctness. We gave an upper bound on waiting time for each algorithm.
(4)We gave some results which improve the efficiency of parallel algorithms for computing the minimum spanning trees. We also show that for dense graphs we can achieve 0(log n) time on EWEW PRAM.
(5)We prepared two simple algorithms based on bounded tickets for the mutual exclusion problem on the asynchronous single-writer/multi-reader shared memory model.
(6)We defined a turn function based on a temporal relation among events by asynchronous distributed computing. We proposed an algorithm for the turn function that can be implemented in the single-writer/multi-reader shared memory model.
(7)We proposed a method to accelerate Vidyasankar's algorithm for the group k-exclusion problem.
(8)We proposed two algorithms based on ticket orders for the group mutual exclusion problem.
|
