Enforcing In-Order Packet Delivery in PC Clusters using Adaptive Routing
暂无分享,去创建一个
Adaptive routing has been widely studied for interconnection networks in massively parallel computers and system area networks (SAN). Adaptive routing dynamically selects the path followed by packets, thus providing high network throughput. However, it may deliver packets out-of-order, which some message passing libraries don’t accept. In this paper, we propose a mechanism for guaranteeing in-order packet delivery. It is based on limiting packet injection at source hosts by using an end-to-end flow control. This mechanism may require certain amount of buffer resources at destination hosts to sort out-of-order delivered packets. This amount depends on the limitation injection degree of packets imposed by the mechanism. Evaluation results under NAS Parallel Benchmarks show that the proposed mechanism achieves a similar throughput to that achieved by the original adaptive routing, even without using sorting buffers at destination hosts.
[1] Hideharu Amano,et al. Descending layers routing: a deadlock-free deterministic routing using virtual channels in system area networks with irregular topologies , 2003, 2003 International Conference on Parallel Processing, 2003. Proceedings..
[2] Steven L. Scott,et al. The Cray T3E Network: Adaptive Routing in a High Performance 3D Torus , 1996 .
[3] Antonio Robles,et al. Supporting adaptive routing in IBA switches , 2003, J. Syst. Archit..