Communications of the ACM - Special section on computer architecture
A Fault-Tolerant Modular Architecture for Binary Trees
IEEE Transactions on Computers - The MIT Press scientific computation series
A Reconfiguration Scheme for Yield Enhancement of Large Area Binary Tree Architectures
IEEE Transactions on Computers - Fault-Tolerant Computing
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
Some Practical Issues in the Design of Fault-Tolerant Multiprocessors
IEEE Transactions on Computers - Special issue on fault-tolerant computing
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
An Efficient Modular Spare Allocation Scheme and Its Application to Fault Tolerant Binary Hypercubes
IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Binary Tree Architecture
ICCI '91 Proceedings of the International Conference on Computing and Information: Advances in Computing and Information
Fault-tolerance and reconfiguration of circulant graphs and hypercubes
Proceedings of the 2008 Spring simulation multiconference
Applying fault-tolerant solutions of circulant graphs to multidimensional meshes
Computers & Mathematics with Applications
| Hi-index | 0.00 |
The modular design approach we propose for fault-tolerant Boolean n-cube architectures lets us reduce hardware cost and increase system reliability, while assuring high performance during message routing. Use of a specific module size with shared links and switches during reconfiguration helps keep system costs low. Though this strategy may increase the number of routing steps needed to transmit a message between nodes, routing performance nonetheless surpasses competing approaches, if we consider switching delays.