On an Optimally Fault-Tolerant Multiprocessor Network Architecture
- 1 May 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-36 (5) , 619-623
- https://doi.org/10.1109/tc.1987.1676947
Abstract
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.Keywords
This publication has 14 references indexed in Scilit:
- A Regular Fault-Tolerant Architecture for Interconnection NetworksIEEE Transactions on Computers, 1985
- Connectivity of Regular Directed Graphs with Small DiametersIEEE Transactions on Computers, 1985
- Fault-Tolerant Multiprocessor Link and Bus Network ArchitecturesIEEE Transactions on Computers, 1985
- Generalized Hypercube and Hyperbus Structures for a Computer NetworkIEEE Transactions on Computers, 1984
- A Fault-Tolerant Communication Architecture for Distributed SystemsIEEE Transactions on Computers, 1982
- The Binary Tree as an Interconnection Network: Applications to Multiprocessor Systems and VLSIIEEE Transactions on Computers, 1981
- Distributed fault-tolerance for large multiprocessor systemsPublished by Association for Computing Machinery (ACM) ,1980
- The cube-connected-cycles: A versatile network for parallel computationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1979
- A Graph Model for Fault-Tolerant Computing SystemsIEEE Transactions on Computers, 1976
- On the Construction of (d, k) GraphsIEEE Transactions on Electronic Computers, 1965