Sufficient conditions for maximally connected dense graphs
Discrete Mathematics
Switching and Finite Automata Theory: Computer Science Series
Switching and Finite Automata Theory: Computer Science Series
Distributed fault-tolerance for large multiprocessor systems
ISCA '80 Proceedings of the 7th annual symposium on Computer Architecture
X-Tree: A tree structured multi-processor computer architecture
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
De bruijn communications networks.
De bruijn communications networks.
A Regular Fault-Tolerant Architecture for Interconnection Networks
IEEE Transactions on Computers
A Study of Odd Graphs as Fault-Tolerant Interconnection Networks
IEEE Transactions on Computers
Performance prediction of distributed load balancing on multicomputer systems
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Semi-Distributed Load Balancing for Massively Parallel Multicomputer Systems
IEEE Transactions on Software Engineering
An Observation on the Bisectional Interconnection Networks
IEEE Transactions on Computers
Wildcard Dimensions, Coding Theory and Fault-Tolerant Meshes and Hypercubes
IEEE Transactions on Computers
Multiple access communications using combinatorial designs
Theoretical aspects of computer science
Multiple Access Communications Using Combinatorial Designs
Theoretical Aspects of Computer Science, Advanced Lectures [First Summer School on Theoretical Aspects of Computer Science, Tehran, Iran, July 2000]
| Hi-index | 14.99 |
A highly versatile communication architecture, the bisectional interconnection network, is proposed. These networks possess many attractive features such as small internode distances, ability to do self-routing which is easily extendible to failure conditions, and the capability of maximal fault tolerance. The proposed architecture allows optimal implementation of various logical configurations. Furthermore, the authors propose the use of a combinatorial structure, called the symmetric balanced incomplete block design (SBIBD), to partition these networks. This important property of partitioning allows the system's expansion with fault tolerance and is utilized to describe two semidistributed fault-diagnostic strategies which require remarkably low overhead and at the same time identify a large number of faulty nodes. Furthermore, based on SBIBDs, a unique approach for making the diagnostic scheme itself fault tolerant is proposed.