Computer
Optical bus control for distributed multiprocessors
Journal of Parallel and Distributed Computing
The Organization of Permutation Architectures with Bused Interconnections
IEEE Transactions on Computers
Analysis of Packet-Switched Multiple-Bus Multiprocessor Systems
IEEE Transactions on Computers
Bus-based networks for fan-in and uniform hypercube algorithms
Parallel Computing
The bus-connected ringed tree: a versatile interconnection network
Journal of Parallel and Distributed Computing
Optimal Realization of Sets of Interconnection Functions on Synchronous Multiple Bus Systems
IEEE Transactions on Computers
Exact Bounds on Running ASCEND/DESCEND and FAN-IN Algorithms on Synchronous Multiple Bus Networks
IEEE Transactions on Parallel and Distributed Systems
On the Complexity of Optimal Bused Interconnections
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
We consider a large class of algorithms called "Fan-in algorithms'' that are useful for problems involving semigroup operations. This paper deals with the design of fault-tolerant multiple bus networks (MBNs) suited to run Fan-in algorithms. We present two methods for constructing Fan-in MBNs with tolerance to bus faults, that have nearly optimal performance and processor fan-out. We also present a general framework that converts any Fan-in MBN (including those resilient to bus faults) into one with tolerance to processor faults, and for which faulty processors slow the original algorithm (for fault-free processors) by only one step. Keywords: Fault-tolerance, Interconnection networks, Multiple bus networks, Fan-in algorithms, Parallel processing