Global reactive congestion control in multicomputer networks

In this paper we develop a general approach to global reactive congestion control in multicomputer networks. The approach uses a timeout mechanism to detect congestion, and exploits control lines such as those used for handshaking in the flit-level flow control of wormhole routers to distribute information about congestion. It is also based on a mechanism that limits the demands placed by the network interface and the processing element. The approach is described in detail and evaluated through simulation experiments. We show that the proposed congestion control can provide network stability and predictable network performance. By choosing the right timeout, we can provide bounds on average delay and worst-case delay. Furthermore, with appropriate timeouts the network can be kept out of saturation. Other attributes of the approach include fairness and applicability to a wide range of network architectures.

[1]  Seth Copen Goldstein,et al.  NIFDY: a low overhead, high throughput network interface , 1995, ISCA.

[2]  Dhabaleswar K. Panda,et al.  How much does network contention affect distributed shared memory performance? , 1997, Proceedings of the 1997 International Conference on Parallel Processing (Cat. No.97TB100162).

[3]  Stephen W. Keckler,et al.  The M-Machine multicomputer , 1995, MICRO 1995.

[4]  Suresh Chalasani,et al.  A comparison of adaptive wormhole routing algorithms , 1993, ISCA '93.

[5]  S. Lam,et al.  Congestion Control of Store-and-Forward Networks by Input Buffer Limits - An Analysis , 1979, IEEE Transactions on Communications.

[6]  Andrew A. Chien,et al.  Compressionless Routing: A Framework for Adaptive and Fault-Tolerant Routing , 1997, IEEE Trans. Parallel Distributed Syst..

[7]  Lori Pollock,et al.  An experimental study of several cooperative register allocation and instruction scheduling strategies , 1995, MICRO 1995.

[8]  William J. Dally,et al.  Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels , 1993, IEEE Trans. Parallel Distributed Syst..

[9]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[10]  Pedro López,et al.  Deadlock-Free Adaptive Routing Algorithms for the 3D-Torus: Limitations and Solutions , 1993, PARLE.

[11]  Mario Gerla,et al.  Flow Control: A Comparative Survey , 1980, IEEE Trans. Commun..

[12]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[13]  Alok N. Choudhary,et al.  Designing and implementing high-performance media-on-demand servers , 1995, IEEE Parallel Distributed Technol. Syst. Appl..

[14]  Raj Jain,et al.  Myths about Congestion Management in High Speed Networks , 1992, INDC.

[15]  John L. Hennessy,et al.  Application and Architectural Bottlenecks in Large Scale Distributed Shared Memory Machines , 1996, 23rd Annual International Symposium on Computer Architecture (ISCA'96).

[16]  William J. Dally Virtual-Channel Flow Control , 1992, IEEE Trans. Parallel Distributed Syst..