The Community for Technology Leaders
Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on (1995)
Aizu-Wakamatsu, Fukushima, Japan
Mar. 15, 1995 to Mar. 17, 1995
ISBN: 0-8186-7038-X
pp: 162
Qian-Ping Gu , Dept. of Comput. Software, Aizu Univ., Japan
Shietung Peng , Dept. of Comput. Software, Aizu Univ., Japan
ABSTRACT
We give an O(r/sup 2/) time algorithm for constructing a fault-free routing path of optimal length between any true non-fault nodes of an r-dimensional torus with 2r-1 faulty nodes. We show that the Rabin diameter of a r-dimensional torus is its diameter plus one. We also describe a cluster fault tolerant (CFT) routing model and give an efficient algorithm for node-to-node CFT routing.
INDEX TERMS
computational complexity; fault tolerant computing; multiprocessor interconnection networks; parallel algorithms; toroidal networks; fault tolerant routing; O(r/sup 2/) time algorithm; fault-free routing path; true nonfault nodes; r-dimensional torus; Rabin diameter; cluster fault tolerant routing model; node-to-node cluster fault tolerant routing
CITATION
Qian-Ping Gu, Shietung Peng, "Fault tolerant routing in toroidal networks", Parallel Algorithms / Architecture Synthesis, AIZU International Symposium on, vol. 00, no. , pp. 162, 1995, doi:10.1109/AISPAS.1995.401342
96 ms
(Ver 3.3 (11022016))