In-Order Packet Delivery in Interconnection Networks using Adaptive Routing

Authors:
J. C. Martinez;J. Flich;A. Robles;P. Lopez;J. Duato;Michihiro Koibuchi
Affiliations:
Universidad Politécnica de Valencia, Spain;Universidad Politécnica de Valencia, Spain;Universidad Politécnica de Valencia, Spain;Universidad Politécnica de Valencia, Spain;Universidad Politécnica de Valencia, Spain;Keio University, Japan
Venue:
IPDPS '05 Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01
Year:
2005

Citing 8
Cited 1

The Chaos Router

IEEE Transactions on Computers
The Mercury Interconnect Architecture: a cost-effective infrastructure for high-performance servers

Proceedings of the 24th annual international symposium on Computer architecture
A comparison of router architectures for virtual cut-through and wormhole switching in a NOW environment

Journal of Parallel and Distributed Computing
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels

IEEE Transactions on Parallel and Distributed Systems
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
Performance Evaluation of Adaptive Routing Algorithms for k-ary-n-cubes

PCRCW '94 Proceedings of the First International Workshop on Parallel Computer Routing and Communication
Supporting Fully Adaptive Routing in InfiniBand Networks

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Supporting adaptive routing in IBA switches

Journal of Systems Architecture: the EUROMICRO Journal - Special issue: Evolutions in parallel distributed and network-based processing

An Effective Design of Deadlock-Free Routing Algorithms Based on 2D Turn Model for Irregular Networks

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most commercial switch-based network technologies for PC clusters use deterministic routing. Alternatively, adaptive routing could be used to improve network performance. In this case, switches decide the path to reach the destination by using local information about the state of the possible outgoing links. However, there are two drawbacks that discourage adaptive routing from being applied to commercial interconnects. The first one concerns the possible switch complexity increase with respect to deterministic routing. The second drawback is due to the fact that adaptive routing may introduce out-of-order packet delivery, which is not acceptable for some applications. For the best of our knowledge, there are no works that analyze the degree of out-of-order packet delivery caused by different network and traffic conditions. In this paper, we take on such a challenge. We show that only for high traffic conditions (reaching saturation) out-of-order delivery is introduced. Moreover, by using small buffers and simple sorting mechanisms at destination, we show that high network throughput can be obtained at the same time packets are delivered in order. Thus, the paper demonstrates that it is possible to use adaptive routing, while still guaranteeing in-order packet delivery, without using large buffer resources nor degrading significantly its performance.