Development of Cluster-Fault-Tolerant Routing Algorithms in Cayley Graphs
| Project/Area Number |
22500041
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Section | 一般 |
|---|
| Research Field |
Computer system/Network
|
|---|
| Research Institution | Tokyo University of Agriculture and Technology |
|---|
Principal Investigator |
KANEKO Keiichi 東京農工大学, 大学院・工学研究院, 教授 (20194904)
|
|---|
| Project Period (FY) |
2010 – 2012
|
| Project Status |
Completed (Fiscal Year 2012)
|
| Budget Amount *help |
¥2,860,000 (Direct Cost: ¥2,200,000、Indirect Cost: ¥660,000)
Fiscal Year 2012: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2011: ¥910,000 (Direct Cost: ¥700,000、Indirect Cost: ¥210,000)
Fiscal Year 2010: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
|
|---|
| Keywords | ディペンダブルコンピューティング / ディペンダブル・コンピューティング / 相互結合網 / アルゴリズム / 計算機システム / ネットワーク |
|---|
| Research Abstract |
In pancake graphs, we have developed a fault-tolerant routing algorithm and a cluster-fault-tolerant routing algorithm for one-to-one communication. As a preliminary step for applying this approach to various Cayley graphs, we have developed in perfect hierarchical hypercubes and hierarchical cubic networks disjoint-path routing algorithms for one-to-many communication. In addition, we have developed an internally disjoint paths routing algorithm in substring reversal graphs. We have also developed a disjoint paths routing algorithm for many-to-many communication in perfect hierarchical hypercubes.
|
Report
(4 results)
Research Products
(35 results)
