| Project/Area Number |
07650429
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
情報通信工学
|
|---|
| Research Institution | Tottori University |
|---|
Principal Investigator |
MASUYAMA Hiroshi Tottori University, Professor, 工学部, 教授 (30034391)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
TANAKA Masatoshi Tottori University Faculty of Engineering, Assistant Professor, 工学部, 助手 (00252883)
|
|---|
| Project Period (FY) |
1995 – 1996
|
| Project Status |
Completed (Fiscal Year 1996)
|
| Budget Amount *help |
¥1,500,000 (Direct Cost: ¥1,500,000)
Fiscal Year 1996: ¥800,000 (Direct Cost: ¥800,000)
Fiscal Year 1995: ¥700,000 (Direct Cost: ¥700,000)
|
|---|
| Keywords | BPC Permutation / Hypercube / Arc Fault / Node Fault / The Number of Transmission Steps / Optimum Algorithm / プロセッサ相互結合ネットワーク / データ転送 / エンベッディング / サブキューブ |
|---|
| Research Abstract |
Dimensional communicable 2 subcubes allocation problems in faulty hypercubes are studied in this research. An n-cube is investigated on whether the faulty n-cube possesses 2 m-dimensional disjoint fault-free subcubes or not. Larger values of m is more efficient in practical uses, so the case of m=n-2 is first examined. By giving a property of "the number of faults on an n-cube in which there always exist at least two fault-free (n-2) -subcubes is not over n-1", we obtained a property of "The number of faults located on an n-cube in which there always exist at least two fault-free (n-i-2) -subcubes is not over 2^i (n-i+1) -2". Next, the number of disjoint paths between the two subcubes is investigated. This number suggests the maximum number of faults by which the communication between these subcubes is never cut off. Then, whether the communication between two fault-free subcubes is always available or not when these two fault-free subcubes exist was discussed. This discussion gives a solution to establish a system where a regular hypercube alogrithm executing in an (m+1) -subcube still be executed by two fault-free disjoint communicable m-subcubes without any degradation even if the (m+1) -subcube becomes faulty.
|
