Abstract
Congestion leads to a severe performance degradation in multiprocessor interconnection networks. Therefore, the use of techniques that prevent network saturation are of crucial importance. Some recent proposals use global network information, thus requiring that nodes exchange some control information, which consumes a far from negligible bandwidth. As a consequence, the behavior of these techniques in practice is not as good as expected.
In this paper, we propose a mechanism that uses only local information to avoid network saturation. Each node estimates traffic locally by using the percentage of free virtual output channels that can be used to forward a message towards its destination. When this number is below a threshold value, network congestion is assumed to exist and message throttling is applied. The main contributions of the proposed mechanism are two: i) it is more selective than previous approaches, as it only prevents the injection of messages when they are destined to congested areas; and ii) it outperforms recent proposals that rely on global information.
This work was supported by the Spanish CICYT under Grant TIC2000-1151-C07
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Agarwal, “Limits on interconnection network performance”, IEEE Trans. on Parallel and Distributed Systems, vol. 2, no. 4, pp. 398–412, Oct. 1991.
E. Baydal, P. López and J. Duato, “A Simple and Efficient Mechanism to Prevent Saturation in Wormhole Networks”, in 14th. Int. Parallel & Distributed Processing Symposium, May 2000.
W. J. Dally and C. L. Seitz, “Deadlock-free message routing in multiprocessor interconnection networks,” IEEE Trans. on Computers, vol. C-36, no. 5, pp. 547–553, May 1987.
W. J. Dally, “Virtual-channel flow control,” IEEE Trans. on Parallel and Distributed Systems, vol. 3, no. 2, pp. 194–205, March 1992.
W. J. Dally and H. Aoki, “Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels”, IEEE Trans. on Parallel and Distributed Systems, vol. 4, no. 4, pp. 466–475, April 1993.
J. Duato, “A new theory of deadlock-free adaptive routing in wormhole networks,” IEEE Trans. on Parallel and Distributed Systems, vol. 4, no. 12, pp. 1320–1331, Dec. 1993.
J. Duato, S. Yalamanchili and L.M. Ni, Interconnection Networks: An Engineering Approach, IEEE Computer Society Press, 1997.
C. Hyatt and D. P. Agrawal, “Congestion Control in the Wormhole-Routed Torus With Clustering and Delayed Deflection” Workshop on Parallel Computing, Routing, and Communication (PCRCW’97), June 1997, Atlanta, GA.
V. Jacobson, “Congestion Avoidance and Control”, Proc. ACM SIGCOMM’88, Stanford, CA, August 1988.
J. H. Kim, Z. Liu and A. A. Chien, “Compressionless routing: A framework for Adaptive and Fault-Tolerant Routing,” in IEEE Trans. on Parallel and Distributed Systems, Vol. 8, No. 3, 1997.
F. T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. San Mateo, CA, USA, Morgan Kaufmann Publishers, 1992.
P. López and J. Duato, “Deadlock-free adaptive routing algorithms for the 3D-torus: Limitations and solutions,” in Proc. of Parallel Architectures and Languages Europe 93, June 1993.
P. López, J.M. Martínez and J. Duato, “A Very Efficient Distributed Deadlock Detection Mechanism for Wormhole Networks,” in Proc. of High Performance Computer Architecture Workshop, Feb. 1998.
P. López, J.M. Martínez and J. Duato, “DRIL: Dynamically Reduced Message Injection Limitation Mechanism for Wormhole Networks,” 1998 Int. Conference Parallel Processing, August 1998.
J.M. Martínez, P. López, J. Duato and T.M. Pinkston, “Software-Based Deadlock Recovery Technique for True Fully Adaptive Routing in Wormhole Networks,” 1997 Int. Conference Parallel Processing, August 1997.
T.M. Pinkston and S. Warnakulasuriya, “On Deadlocks in Interconnection Networks”, in the 24th Int. Symposium on Computer Architecture, June 1997.
A. Smai and L. Thorelli, “Global Reactive Congestion Control in Multicomputer Networks”, 5th Int. Conference on High Performance Computing, 1998.
M. Thottetodi, A.R. Lebeck, S.S. Mukherjee, “Self-Tuned Congestion Control for Multiprocessor Networks”, Technical Report CS-2000-15, Duke University, 2000.
M. Thottetodi, A.R. Lebeck, S.S. Mukherjee, “Self-Tuned Congestion Control for Multiprocessor Networks”, Proc. of 7th. Int. Symposium on High Performance Computer Architecture, 2001.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baydal, E., López, P., Duato, J. (2002). Avoiding Network Congestion with Local Information. In: Zima, H.P., Joe, K., Sato, M., Seo, Y., Shimasaki, M. (eds) High Performance Computing. ISHPC 2002. Lecture Notes in Computer Science, vol 2327. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47847-7_6
Download citation
DOI: https://doi.org/10.1007/3-540-47847-7_6
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43674-4
Online ISBN: 978-3-540-47847-8
eBook Packages: Springer Book Archive