The Community for Technology Leaders
Green Image
Issue No. 03 - March (1986 vol. 35)
ISSN: 0018-9340
pp: 281-283
S. Guha , Department of Mathematics, Jadavpur University
ABSTRACT
A new routing algorithm is proposed in this correspondence for the network architecture developed in [1]. It has been shown that this algorithm gives the shortest path between the source to destination, when all the processors and the communication links of the network are non- faulty. For the situation when some of the processors are faulty, a heuristic function is given, which if used in the routing algorithm will give shortest path from the source to destination, if such a path exists.
INDEX TERMS
provisional matching factor, Heuristic function, match, matching, matching factor
CITATION
S. Guha, A. Sen, "On Fault-Tolerant Distributor Communication Architecture", IEEE Transactions on Computers, vol. 35, no. , pp. 281-283, March 1986, doi:10.1109/TC.1986.1676752
82 ms
(Ver 3.1 (10032016))