On Path-length and Routing-tag Algorithm for Hybrid Irregular Multi-stage Interconnection Networks

Authors:
Nitin;Vivek Kumar Sehgal;Nakul Sharma;Kunal Krishna;Abhishek Bhatia
Affiliations:
Jaypee University of Information Technology, India;Jaypee University of Information Technology, India;Jaypee University of Information Technology, India;Jaypee University of Information Technology, India;Jaypee University of Information Technology, India
Venue:
SNPD '07 Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01
Year:
2007

Citing 0
Cited 2

Designing a Fault-tolerant Fully-Chained Combining Switches Multi-stage Interconnection Network with Disjoint Paths

The Journal of Supercomputing
Stochastic communication for application-specific Networks-on-Chip

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we proposed two different path-length algorithms and routing-tag algorithm for fault-tolerant hybrid irregular multi-stage interconnection networks (MINs) called as Hybrid Zeta Networks-2 (HZTN) [1,2,3]. In HZTN, 50% of requests are accepted at minimum path-length of 2 in contrast with the regular Augmented Shuffle-Exchange Network (ASEN) [4], Extra-stage Cube Network (ESC) [5], Augmented Baseline Network (ABN) [6], and Benes Network (BN) [7]. They all are having constant path length on all the routes, which makes delay encountered to the same delay along all the paths, thus increasing average latency. Furthermore, the fault-tolerance and reparability of HZTN is evaluated. In addition to this adaptive fault-tolerant routing algorithm for the same have been proposed. This adaptive fault-tolerant routing is provided by exploiting the inherent redundancy of the irregular topology, which does not lead to blocking of request.