This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
December 1983 (vol. 32 no. 12)
pp. 1099-1108
K. Padmanabhan, Laboratory for Advanced Supercomputers, Department of Computer Science, University of Illinois
A general class of fault-tolerant multistage interconnection networks is presented, wherein fault-tolerance is achieved by providing multiple disjoint paths between every input and output. These networks are derived from the Omega networks and as such retain all the connection properties of the parent networks in the absence of faults. An R-path network in this class can tolerate (R-1) arbitrary faults in the intermediate stages of the network at a cost that is far less than providing R copies of the original network. Different techniques for constructing such networks are presented and relevant properties and control algorithms are investigated.
Index Terms:
redundant path networks, Array processors, fault tolerance, interconnection networks, multiprocessor systems, nonblocking networks, Omega networks, parallel processing
Citation:
K. Padmanabhan, D.H. Lawrie, "A Class of Redundant Path Multistage Interconnection Networks," IEEE Transactions on Computers, vol. 32, no. 12, pp. 1099-1108, Dec. 1983, doi:10.1109/TC.1983.1676170
Usage of this product signifies your acceptance of the Terms of Use.