Reachability-Based Fault-Tolerant Routing
ICPADS '06 Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1
Region-based routing: a mechanism to support efficient routing algorithms in NoCs
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Routing-contained virtualization based on Up*/Down* forwarding
HiPC'07 Proceedings of the 14th international conference on High performance computing
Segment-based routing: an efficient fault-tolerant routing algorithm for meshes and Tori
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Tree-turn routing: an efficient deadlock-free routing algorithm for irregular networks
The Journal of Supercomputing
A first effort for a distributed segment-based approach on self-assembled nano networks
Proceedings of the Sixth International Workshop on Network on Chip Architectures
| Hi-index | 0.00 |
Cluster networks are seen as the future access networksfor multimedia streaming, E-commerce, network storage,etc. For these applications, performance and high availabilityare particularly crucial. Regular topologies are preferredwhen performance is the primary concern. However,due to spatial constraints or fault-related issues, the networkstructure may become irregular, which makes moredifficult to find deadlock-free minimal paths.Over the recent years, several solutions have been proposed.One of them is the LASH routing, which enables minimalrouting by assigning paths to different virtual layers.In this paper, we propose an extension of LASH in orderto reduce the number of required virtual layers by allowingtransitions between virtual layers.Evaluation results show that the new routing scheme(LASH-TOR) is able to obtain full minimal routing with areduced number of virtual channels. For torus and meshnetworks, with only two virtual channels, LASH throughputis increased by an average factor of improvement of3.30 for large networks. For regular networks with some unconnected(faulty) links, equal performance improvementsare achieved. Even for highly irregular networks of size upto 128 switches the new routing scheme only needs three virtualchannels for guaranteeing minimal routing. Besides,LASH-TOR performs well compared to Dimension OrderRouting for mesh and torus networks.