A New Adaptive Hardware Tree-Based Multicast Routing in K-Ary N-Cubes
IEEE Transactions on Computers
Performance Evaluation of a New Hardware Supported Multicast Scheme for K-ary N-cubes
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
IEEE Transactions on Parallel and Distributed Systems
A new injection limitation mechanism for wormhole networks
Computer Communications
| Hi-index | 0.00 |
Networks using wormhole switching have traditionallyrelied upon deadlock avoidance strategies for the design ofdeadlock-free algorithms. The past few years have seen arise in popularity of deadlock recovery strategies, that arebased on the property that deadlocks are quite rare in practiceand happen only at or beyond the network saturationpoint. In fact, recovery-based routing algorithms have ahigher potential performance over the deadlock avoidance-basedones which allow less routing freedom.In this paper we present a recovery-based fully adaptiverouting algorithm, LIFE, which is based on an innovativeinjection policy that reduces the probability of deadlocks tonegligible values, both with uniform and non-uniform trafficpatterns.The experimental results, conducted on a 8-ary 3-cubewith 512 nodes, show that it is possible to implement truefully adaptive routing using only two virtual channels. Also,LIFE outperforms state-of-the-art avoidance- and recovery-basedalgorithms of the same cost, both in terms of through-putand message latency under uniform traffic and providesstable throughput under non-uniform traffic patterns.