Abstract | ||
---|---|---|
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. |
Year | DOI | Venue |
---|---|---|
1983 | 10.1109/TC.1983.1676170 | IEEE Trans. Computers |
Keywords | Field | DocType |
r-path network,parent network,omega network,redundant path multistage interconnection,connection property,fault-tolerant multistage interconnection network,arbitrary fault,r copy,general class,control algorithm,original network,fault tolerance,parallel processing | Control algorithm,Disjoint sets,Computer science,Parallel computing,Parallel processing,Multistage interconnection networks,Input/output,Real-time computing,Fault tolerance,Distributed computing | Journal |
Volume | Issue | ISSN |
32 | 12 | 0018-9340 |
Citations | PageRank | References |
55 | 3.46 | 7 |
Authors | ||
2 |
Name | Order | Citations | PageRank |
---|---|---|---|
K. Padmanabhan | 1 | 55 | 3.46 |
Duncan H. Lawrie | 2 | 1196 | 463.99 |