Enforcing in-order packet delivery in system area networks with adaptive routing

Authors:
Michihiro Koibuchi;Juan C. Martinez;Jose Flich;Antonio Robles;Pedro Lopez;Jose Duato
Affiliations:
Department of Computer Engineering, Technical University of Valencia, Camino de Vera, 46022 Valencia, Spain and Department of Information and Computer Science, Keio University 3-14-1 Hiyoshi, Koho ...;Department of Computer Engineering, Technical University of Valencia, Camino de Vera, 46022 Valencia, Spain;Department of Computer Engineering, Technical University of Valencia, Camino de Vera, 46022 Valencia, Spain;Department of Computer Engineering, Technical University of Valencia, Camino de Vera, 46022 Valencia, Spain;Department of Computer Engineering, Technical University of Valencia, Camino de Vera, 46022 Valencia, Spain;Department of Computer Engineering, Technical University of Valencia, Camino de Vera, 46022 Valencia, Spain
Venue:
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part I
Year:
2005

Citing 11
Cited 4

High-Performance Routing in Networks of Workstations with Irregular Topology

IEEE Transactions on Parallel and Distributed Systems
PM2: a high performance communication middleware for heterogeneous network environments

Proceedings of the 2000 ACM/IEEE conference on Supercomputing
Interconnection Networks: An Engineering Approach

Interconnection Networks: An Engineering Approach
Myrinet: A Gigabit-per-Second Local Area Network

IEEE Micro
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels

IEEE Transactions on Parallel and Distributed Systems
A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks

IEEE Transactions on Parallel and Distributed Systems
L-Turn Routing: An Adaptive Routing in Irregular Networks

ICPP '02 Proceedings of the 2001 International Conference on Parallel Processing
Avoiding Network Congestion with Local Information

ISHPC '02 Proceedings of the 4th International Symposium on High Performance Computing
Performance Evaluation of RHiNET-2/NI: A Network Interface for Distributed Parallel Computing Systems

CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
RHiNET: A Network for High Performance Parallel Computing Using Locally Distributed Computers

IWIA '99 Proceedings of the 1999 International Workshop on Innovative Architecture
Supporting adaptive routing in IBA switches

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

A Simple Data Transfer Technique Using Local Address for Networks-on-Chips

IEEE Transactions on Parallel and Distributed Systems
An Effective Design of Deadlock-Free Routing Algorithms Based on 2D Turn Model for Irregular Networks

IEEE Transactions on Parallel and Distributed Systems
Breaking adaptive multicast deadlock by virtual channel address/data FIFO decoupling

Proceedings of the 2nd International Workshop on Network on Chip Architectures
Distributed adaptive routing for big-data applications running on data center networks

Proceedings of the eighth ACM/IEEE symposium on Architectures for networking and communications systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Adaptive routing, which dynamically selects the route of packets, has been widely studied for interconnection networks in massively parallel computers and system area networks. Although adaptive routing has the advantage of providing high bandwidth, it may deliver packets out-of-order, which some message passing libraries do not accept. In this paper, we propose two mechanisms called (1) FIFO transmission and (2) couple limitation to guarantee in-order packet delivery in adaptive routing. Both of them limit packet injection at source hosts. The FIFO transmission completely avoids packet sorting at destination hosts, while the couple limitation uses a few buffers to sort packets at destination hosts. Evaluation results show that the FIFO transmission and the couple limitation achieve a similar throughput to that of a method equipped with huge (infinite) buffers enough to store all out-of-order packets at destination hosts under both synthetic traffic and NAS Parallel Benchmarks. nchmarks.