This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
On an Optimally Fault-Tolerant Multiprocessor Network Architecture
May 1987 (vol. 36 no. 5)
pp. 619-623
A. Sengupta, Department of Computer Science, University of South Carolina
This correspondence presents a class of optimally fault tolerant multiprocessor network architecture, based on the networks proposed earlier by Pradhan [71, where the networks are represented by regular digraphs. Because of optimal fault tolerapce, the number of connections per node is precisely related to the degree of fault tolerance the network is designed to provide. The routing of messgges in presence Qf faults is adaptive and unless the number of faults is equal to the degree of fault tolerance the increase in routing delay in presence of faults is minimal.
Index Terms:
shuffle-exchange graph, Connectivity, diameter of graphs, fault-tolerant network, multiprocessor network, regular graphs
Citation:
A. Sengupta, A. Sen, S. Bandyopadhyay, "On an Optimally Fault-Tolerant Multiprocessor Network Architecture," IEEE Transactions on Computers, vol. 36, no. 5, pp. 619-623, May 1987, doi:10.1109/TC.1987.1676947
Usage of this product signifies your acceptance of the Terms of Use.