A Survey of Multistage Interconnection Networks

Author(s):  
Amit Prakash ◽  
Dilip K. Yadav ◽  
Arvind Choubey

Background: Multistage interconnection networks are being used in computer and communications. Multiprocessor architectures for parallel computing exercise these interconnection networks for connecting various processing elements and transfer data between sub-systems of a digital system. The vast diversity of the field poses an obstacle to realize different kinds of interconnection networks and their relationship. Methods: This paper consists of an extensive survey of multistage interconnection networks. Results: A broad classification of multistage interconnection networks based on network functionality, reliability and fault tolerance is presented in order to emphasize the important principles which differentiate the network architectures. For each class of network, significant results are given and the basic design principles are explained. Conclusion: The various multistage interconnection networks design provide high performance, availability, throughput, lower latency, less power consumption along with improved fault-tolerance and reliability. However, there is a rising demand for new fault-tolerant and reliable multistage interconnection networks.

2005 ◽  
Vol 06 (04) ◽  
pp. 361-382 ◽  
Author(s):  
K. V. Arya ◽  
R. K. Ghosh

This paper proposes a technique to modify a Multistage Interconnection Network (MIN) to augment it with fault tolerant capabilities. The augmented MIN is referred to as Enhanced MIN (E-MIN). The technique employed for construction of E-MIN is compared with the two known physical fault tolerance techniques, namely, extra staging and chaining. EMINs are found to be more generic than extra staged networks and less expensive than chained networks. The EMIN realizes all the permutations realizable by the original MIN. The routing strategies under faulty and fault free conditions are shown to be very simple in the case of E-MINs.


2000 ◽  
Vol 01 (04) ◽  
pp. 315-329 ◽  
Author(s):  
PETER KOK KEONG LOH ◽  
WEN JING HSU

Hierarchical interconnection networks with n-dimensional hypercube clusters can strike a balance between wide application suitability, size scalability as well as reliability. Cluster communications support for such networks must therefore be reliable and efficient without incurring large overheads. This paper proposes a reliable and cost-effective intra-cluster communications strategy for such a class of interconnection networks. The routing algorithm can tolerate up to (n - 1) component faults in the cluster and generates routes that are cycle-free and livelock-free. The message is guaranteed to be optimally (respectively, sub-optimally) delivered within a maximum of n (respectively, 2n - 1) hops. The message overhead incurred is one of the lowest reported for the specified fault tolerance level – with only a single n-bit routing vector accompanying the message to be communicated. Finally, routing hardware support may be simply achieved with standard components, facilitating integration with the host network.


Author(s):  
Shilpa Gupta ◽  
G. L. Pahuja

Multistage interconnection networks (MIN) are becoming attractive choice as they provide fast and efficient communication at reasonable cost, for multiprocessing systems. Shuffle exchange network (SEN) are specific class of MIN characterized as lowest cost unipath MIN. Several developments have made SEN MIN fault tolerant with redundant paths by increasing the number or size of switching elements (SE). However, recently [Formula: see text] has been advanced by reducing the number of stages, but has serious limitation namely: (i) partial connectivity of each source–destination pair, (ii) unique path. A new method has been proposed in this paper to develop a new topology of MIN with one stage less than the basic unipath MIN of same class with multiple and disjoint path facility that mitigates the shortcomings of the above network and is truly [Formula: see text] MIN. Due to less number of stages used in the proposed network communication delays are also reduced as the path length is reduced. Parametric performances such as Terminal, Broadcast and Network Reliabilities, MTTF, Bandwidth have been computed for different network sizes and demonstrated that it not only outperforms other SEN variants, but has improved features of fault tolerance all because of disjoint minimal path set. Further the comments generated previously in literature about better reliability performance of [Formula: see text] than other two networks [Formula: see text] have been refuted and have demonstrated that [Formula: see text]2 network has better performance than other two for larger network size. Also it can be concluded that the performance of proposed [Formula: see text] is best among all these networks.


Sign in / Sign up

Export Citation Format

Share Document