This correspondence presents a class of optimally fault tolerant multiprocessor network architecture, based on the networks proposed earlier by Pradhan , where the networks are represented by regular digraphs. Because of optimal fault tolerance, the number of connections per node is precisely related to the degree of fault tolerance the network is designed to provide. The routing of messages in presence of 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.
ASJC Scopus subject areas
- Theoretical Computer Science
- Hardware and Architecture
- Computational Theory and Mathematics