Interconnection networks for large-scale parallel processing: theory and case studies
Interconnection networks for large-scale parallel processing: theory and case studies
Computer Arithmetic: Principles, Architecture and Design
Computer Arithmetic: Principles, Architecture and Design
Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
Conflict Resolution and Fault-Free Path Selection in Multicast-Connected Cube-Based Networks
IEEE Transactions on Computers
| Hi-index | 14.99 |
The complementary two-stage cube (C2SC) provides four paths between every source and destination pair so that all single faults and many multiple faults can be tolerated. One of the key issues in multiple-path multistage interconnection networks (MIN's) is the manner in which rerouting is achieved when the network has faults. In this paper, we present four reconfiguration schemes for broadcast connections of the C2SC in the presence of one or multiple faults, and these are: destination discriminator, divide and broadcast, decoded routing tag, and conservative schemes. A hardware implementation and a cost/performance analysis of the four schemes were carried out. The analysis includes comparison of hardware cost, reconfiguration time, cost-reconfiguration time product, and regularity and modularity. The cost/performance analysis and simulation results indicate that the destination discriminator scheme has the lowest cost-reconfiguration time product and has relatively high regularity and modularity.