rHALB: a new load-balanced routing algorithm for k-ary n-cube networks

Authors:
Huaxi Gu;Jie Zhang;Kun Wang;Changshan Wang
Affiliations:
State key lab of ISN, Xidian University, Xi'an, China;Dept. of Computing and Information Systems, University of Bedfordshire, UK;School of Computer Science, Xidian University, Xi'an, China;School of Computer Science, Xidian University, Xi'an, China
Venue:
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
Year:
2007

Citing 14
Cited 1

A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks

IEEE Transactions on Parallel and Distributed Systems
ROMM routing on mesh and torus networks

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Compressionless Routing: A Framework for Adaptive and Fault-Tolerant Routing

IEEE Transactions on Parallel and Distributed Systems
Software-Based Rerouting for Fault-Tolerant Pipelined Communication

IEEE Transactions on Parallel and Distributed Systems
Worst-case traffic for oblivious routing functions

Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures
Interconnection Networks: An Engineering Approach

Interconnection Networks: An Engineering Approach
Software-Based Deadlock Recovery Technique for True Fully Adaptive Routing in Wormhole Networks

ICPP '97 Proceedings of the international Conference on Parallel Processing
Generalized Theory for Deadlock-Free Adaptive Wormhole Routing and its Application to Disha Concurrent

IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
A large scale, homogeneous, fully distributed parallel machine, I

ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Principles and Practices of Interconnection Networks

Principles and Practices of Interconnection Networks
Adaptive channel queue routing on k-ary n-cubes

Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures
Globally Adaptive Load-Balanced Routing on Tori

IEEE Computer Architecture Letters
A survey of research and practices of Network-on-chip

ACM Computing Surveys (CSUR)
Choice of inner switching mechanisms in terabit router

ICN'05 Proceedings of the 4th international conference on Networking - Volume Part I

Optimal wavelength assignment in the implementation of parallel algorithms with ternary n-cube communication pattern on mesh optical network

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new load-balanced routing algorithm for k-ary n-cube networks is proposed in this paper. The new algorithm, called rHALB (r Hop Aware Load-Balanced) routing algorithm, can efficiently balance traffic loads in k-ary ncube networks. It is based on the limited global information, which is a tradeoff between local and global information. rHALB makes use of the number of potential deadlocked packets to detect the congestion, and can direct the traffic to bypass any detected hotspots, thus balancing the traffic. Simulations are carried out on 2D torus networks by using OPNET. The results show that rHALB achieves a better performance (latency and throughput) under various traffic patterns than dimension order routing and Duato's algorithm, which are popularly used in commercial products, and ROMM, ACQ and GAL, which were proposed in literature recently.