| 英語タイトル | A Fault-Tolerant Routing Algorithm for Hypercube Multi-Computers |
|---|---|
| 著者 | |
| 論文誌 | CDROM Proceedings of the Second IEEE International Conference on Systems, Man and Cybernetics |
| 巻 | |
| 号 | |
| ページ | |
| 出版年 | 2002年10月 |
| 概要 | A variety of routing algorithms have been proposed for hypercube networks. Recently, several routing algorithms has introduced the concept related to unsafe nodes and its extension, and achieved a successful routing. This paper focuses on one-to-one routing and shows that considerable number of unexplored shortest paths can be found by introducing a preliminary knowledge into the routing. |
| ファイル | BibTeX |