A new routing mechanism for networks with irregular topology

Authors:
V. Puente;J. A. Gregorio;R. Beivide;F. Vallejo;A. Ibañez
Affiliations:
The University of Cantabria, Spain;The University of Cantabria, Spain;The University of Cantabria, Spain;The University of Cantabria, Spain;The University of Cantabria, Spain
Venue:
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Year:
2001

Citing 7
Cited 4

The Chaos Router

IEEE Transactions on Computers
A Necessary and Sufficient Condition for Deadlock-Free Routing in Cut-Through and Store-and-Forward Networks

IEEE Transactions on Parallel and Distributed Systems
Adaptive-Trail Routing and Performance Evaluation in Irregular Networks Using Cut-Through Switches

IEEE Transactions on Parallel and Distributed Systems
Myrinet: A Gigabit-per-Second Local Area Network

IEEE Micro
Efficient Adaptive Routing in Networks of Workstations with Irregular Topology

CANPC '97 Proceedings of the First International Workshop on Communication and Architectural Support for Network-Based Parallel Computing
Fibre Channel Fabrics: Evaluation and Design

HICSS '96 Proceedings of the 29th Hawaii International Conference on System Sciences Volume 1: Software Technology and Architecture
Adaptive Bubble Router: A Design to Improve Performance in Torus Networks

ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing

Immunet: A Cheap and Robust Fault-Tolerant Packet Routing Mechanism

Proceedings of the 31st annual international symposium on Computer architecture
An Effective Methodology to Improve the Performance of the Up*/Down* Routing Algorithm

IEEE Transactions on Parallel and Distributed Systems
Immucube: Scalable Fault-Tolerant Routing for k-ary n-cube Networks

IEEE Transactions on Parallel and Distributed Systems
Tree-turn routing: an efficient deadlock-free routing algorithm for irregular networks

The Journal of Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Selecting a Pseudo-Hamiltonian cycle in any irregular network and applying a restricted packet injection mechanism to avoid the exhaustion of the storage resources, a new fully adaptive routing algorithm has been developed and tested. Our new routing mechanism outperforms the most relevant routing proposals for networks with irregular topology. In all the tested cases a significant improvement has been obtained. The most spectacular gains were obtained for big networks. For a 512-node network, uniform traffic, and virtual cut-through flow control, our mechanism can outperform, in some cases, the classic up*/down* algorithm by almost a factor of 2.