NIFDY: a low overhead, high throughput network interface

In this paper we present NIFDY, a network interface that uses admission control to reduce congestion and ensures that packets are received by a processor in the order in which they were sent, even if the underlying network delivers the packets out of order. The basic idea behind NIFDY is that each processor is allowed to have at most one outstanding packet to any other processor unless the destination processor has granted the sender the right to send multiple unacknowledged packets. Further, there is a low upper limit on the number of outstanding packets to all processors.We present results from simulations of a variety of networks (meshes, tori, butterflies, and fat trees) and traffic patterns to verify NIFDY's efficacy. Our simulations show that NIFDY increases throughput and decreases overhead. The utility of NIFDY increases as a network's bisection bandwidth decreases. When combined with the increased payload allowed by in-order delivery NIFDY increases total bandwidth delivered for all networks. The resources needed to implement NIFDY are small and constant with respect to network size.

[1]  Andrew A. Chien,et al.  Compressionless routing: a framework for adaptive and fault-tolerant routing , 1994, ISCA '94.

[2]  Eric A. Brewer,et al.  How to get good performance from the CM-5 data network , 1994, Proceedings of 8th International Parallel Processing Symposium.

[3]  S. L. Scott,et al.  Using feedback to control tree saturation in multistage interconnection networks , 1989, ISCA '89.

[4]  W. Daniel Hillis,et al.  The Network Architecture of the Connection Machine CM-5 , 1996, J. Parallel Distributed Comput..

[5]  Frederic T. Chong,et al.  METRO: a router architecture for high-performance, short-haul routing networks , 1994, ISCA '94.

[6]  V. Rich Personal communication , 1989, Nature.

[7]  Anant Agarwal,et al.  Limits on Interconnection Network Performance , 1991, IEEE Trans. Parallel Distributed Syst..

[8]  Andrew A. Chien,et al.  Software overhead in messaging layers: where does the time go? , 1994, ASPLOS VI.

[9]  David E. Culler,et al.  Active messages: an efficient communication architecture for multiprocessors , 1993 .

[10]  William J. Dally,et al.  Virtual-channel flow control , 1990, [1990] Proceedings. The 17th Annual International Symposium on Computer Architecture.

[11]  Jonathan S. Turner,et al.  Performance of a broadcast packet switch , 1989, IEEE Trans. Commun..

[12]  V. Jacobson,et al.  Congestion avoidance and control , 1988, CCRV.

[13]  T. von Eicken,et al.  Parallel programming in Split-C , 1993, Supercomputing '93.

[14]  Robert H. Halstead,et al.  Multithreaded Computer Architecture , 1994, The Kluwer International Series in Engineering and Computer Science.

[15]  David E. Culler,et al.  Multithreading: Fundamental Limits, Potential Gains, and Alternatives , 1994, Multithreaded Computer Architecture.

[16]  Andrea C. Arpaci-Dusseau,et al.  Parallel programming in Split-C , 1993, Supercomputing '93. Proceedings.

[17]  W. Daniel Hillis,et al.  The network architecture of the Connection Machine CM-5 (extended abstract) , 1992, SPAA '92.

[18]  K. K. Ramakrishnan,et al.  A binary feedback scheme for congestion avoidance in computer networks with a connectionless network layer , 1988, SIGCOMM '88.

[19]  R. Jain Congestion control in computer networks: issues and trends , 1990, IEEE Network.

[20]  Robert Morris,et al.  Use of Link-by-Link Flow Control in Maximizing ATM Network Performance: Simulation Results , 1993 .

[21]  Andrea Carol Dusseau Modeling Parallel Sorts with LogP on the CM-5 , 1994 .

[22]  Eric A. Brewer,et al.  Building a better butterfly: the multiplexed metabutterfly , 1994, Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN).

[23]  William J. Dally,et al.  Express Cubes: Improving the Performance of k-Ary n-Cube Interconnection Networks , 1989, IEEE Trans. Computers.

[24]  Michael Burrows,et al.  Autonet: A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links , 1991, IEEE J. Sel. Areas Commun..

[25]  S. Konstantinidou,et al.  Chaos router: architecture and performance , 1991, [1991] Proceedings. The 18th Annual International Symposium on Computer Architecture.