| Budget Amount *help |
¥1,600,000 (Direct Cost: ¥1,600,000)
Fiscal Year 2003: ¥400,000 (Direct Cost: ¥400,000)
Fiscal Year 2002: ¥500,000 (Direct Cost: ¥500,000)
Fiscal Year 2001: ¥700,000 (Direct Cost: ¥700,000)
|
|---|
| Research Abstract |
The research results are summarized as follows:
-resolution of node-to-set disjoint paths problem in rotator graphs,
-resolution of node-to-set disjoint paths problem in pancake graphs,
-resolution of node-to-set disjoint paths problem in burnt pancake graphs,
-resolution of node-to-node disjoint paths problem in pancake graphs,
-resolution of node-to-node disjoint paths problem in generalized rotator graphs,
-resolution of node-to-node disjoint paths problem in bubble-sort graphs,
-resolution of node-to-node disjoint paths problem in substring reversal graphs, development of a fault-tolerant multicast routing algorithm in rotator graphs, and
-development of a minimum feedback node set in trivalent Cayley graphs.
In this study, we have selected several Cayley graphs including rotator graphs as targets and tried to develop routing algorithms which do not lose message sending facilities even if some faults occur with intermediate computers and/or links. As results, we have attained these objects successfully. These results seem to be only small contribution to the whole research field of the massively parallel processing systems.
However, selection of topologies is one of the most important issues in design and development of the massively parallel processing systems and we are convinced that our research results have great meaning as a basis of future research.
|
