High-performance adaptive routing for networks with arbitrary topology

Authors:
V. Puente;J. A. Gregorio;F. Vallejo;R. Beivide;C. Izu
Affiliations:
Computer Architecture Group, University of Cantabria, Santander, Spain;Computer Architecture Group, University of Cantabria, Santander, Spain;Computer Architecture Group, University of Cantabria, Santander, Spain;Computer Architecture Group, University of Cantabria, Santander, Spain;Computer Science Department, University of Adelaide, SA, Australia
Venue:
Journal of Systems Architecture: the EUROMICRO Journal
Year:
2006

Citing 19
Cited 3

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

IEEE Transactions on Computers
An algorithm for finding Hamilton paths and cycles in random graphs

Combinatorica - Theory of Computing
An extension of the multi-path algorithm for finding Hamilton cycles

Discrete Mathematics - Special volume (part two) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs” (“The theory of regular graphs”)
A Trip-Based Multicasting Model in Wormhole-Routed Networks with Virtual Channels

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

IEEE Transactions on Parallel and Distributed Systems
Low-level router design and its impact on supercomputer system performance

ICS '99 Proceedings of the 13th international conference on Supercomputing
Adaptive-Trail Routing and Performance Evaluation in Irregular Networks Using Cut-Through Switches

IEEE Transactions on Parallel and Distributed Systems
Improving parallel system performance by changing the arrangement of the network links

Proceedings of the 14th international conference on Supercomputing
The adaptive bubble router

Journal of Parallel and Distributed Computing
Myrinet: A Gigabit-per-Second Local Area Network

IEEE Micro
The Quadrics Network: High-Performance Clustering Technology

IEEE Micro
L-Turn Routing: An Adaptive Routing in Irregular Networks

ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
A New Methodology to Computer Deadlock-Free Routing Tables for Irregular Networks

CANPC '00 Proceedings of the 4th International Workshop on Network-Based Parallel Computing: Communication, Architecture, and Applications
An overview of the BlueGene/L Supercomputer

Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Fibre Channel Fabrics: Evaluation and Design

HICSS '96 Proceedings of the 29th Hawaii International Conference on System Sciences Volume 1: Software Technology and Architecture
Characterization of Deadlocks in Irregular Networks

ICPP '99 Proceedings of the 1999 International Conference on Parallel Processing
A Flow Control Mechanism to Avoid Message Deadlock in k-ary n-cube Networks

HIPC '97 Proceedings of the Fourth International Conference on High-Performance Computing
Improving the Efficiency of Adaptive Routing in Networks with Irregular Topology

HIPC '97 Proceedings of the Fourth International Conference on High-Performance Computing
SICOSYS: an integrated framework for studying interconnection network performance in multiprocessor systems

EUROMICRO-PDP'02 Proceedings of the 10th Euromicro conference on Parallel, distributed and network-based processing

The Effect of Network Topology and Channel Labels on the Performance of Label-Based Routing Algorithms

ICCS '08 Proceedings of the 8th international conference on Computational Science, Part I
A general mathematical performance model for wormhole-switched irregular networks

Cluster Computing
A general methodology for direction-based irregular routing algorithms

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

A strategy to implement adaptive routing in irregular networks is presented and analyzed in this work. A simple and widely applicable deadlock avoidance method, applied to a ring embedded in the network topology, constitutes the basis of this high-performance packet switching. This adaptive router improves the network capabilities by allocating more resources to the fastest and most used virtual network, thus narrowing the performance gap with regular topologies. A thorough simulation process, which obtains statistically reliable measurements of irregular network behavior, has been carried out to evaluate it and compare with other state-of-the-art techniques. In all the experiments, our router exhibited the best behavior in terms of maximum/sustained performance and sensitivity to the network topology.