DocumentCode
1153433
Title
On Fault-Tolerant Distributor Communication Architecture
Author
Guha, Sumanta ; Sen, Arunabha
Author_Institution
Department of Mathematics, Jadavpur University
Issue
3
fYear
1986
fDate
3/1/1986 12:00:00 AM
Firstpage
281
Lastpage
283
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.
Keywords
Heuristic function; match; matching; matching factor; provisional matching factor; Computer architecture; Computer networks; Computer science; Costs; Delay; Distributed processing; Fault tolerance; Mathematics; Multiprocessor interconnection networks; Routing; Heuristic function; match; matching; matching factor; provisional matching factor;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/TC.1986.1676752
Filename
1676752
Link To Document