This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Family of Mechanisms for Congestion Control in Wormhole Networks
September 2005 (vol. 16 no. 9)
pp. 772-784
Pedro L?pez, IEEE Computer Society
Jos? Duato, IEEE

Abstract—Multiprocessor interconnection networks may reach congestion with high traffic loads, which prevents reaching the wished performance. Unfortunately, many of the mechanisms proposed in the literature for congestion control either suffer from a lack of robustness, being unable to work properly with different traffic patterns or message lengths, or detect congestion relying on global information that wastes some network bandwidth. This paper presents a family of mechanisms to avoid network congestion in wormhole networks. All of them need only local information, applying message throttling when it is required. The proposed mechanisms use different strategies to detect network congestion and also apply different corrective actions. The mechanisms are evaluated and compared for several network loads and topologies, noticeably improving network performance with high loads but without penalizing network behavior for low and medium traffic rates, where no congestion control is required.

[1] A. Agarwal, “Limits on Interconnection Network Performance,” IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 4, pp. 398-412, Oct. 1991.
[2] E. Baydal, P. López, and J. Duato, “A Simple and Efficient Mechanism to Prevent Saturation in Wormhole Networks,” Proc. Int'l Parallel and Distributed Processing Symp., May 2000.
[3] E. Baydal, P. López, and J. Duato, “Avoiding Network Congestion with Local Information,” Proc. Int'l Symp. High Performance Computing, May 2002.
[4] E. Baydal, “Una Contribución al Control de la Congestión en Redes de Interconexión con Conmutación Wormhole,” PhD thesis, Universidad Politécnica de Valencia, (in Spanish), http://www.gap.upv.esver.html, Nov. 2002.
[5] A.A. Chien, “A Cost and Speed Model for k-Ary n-Cube Wormhole Routers,” Proc. Hot Interconnects Conf. '93, Aug. 1993.
[6] A. Cristal, D. Ortega, J. Llosa, and M. Valero, “Out of Order Commit Processors,” Proc. Int'l Symp. High-Performance Computer Architecture, Feb. 2004.
[7] W.J. Dally and H. Aoki, “Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 4, pp. 466-475, Apr. 1993.
[8] J. Duato and P. López, “Performance Evaluation of Adaptive Routing Algorithms for k-Ary n-Cubes,” Proc. Parallel Computer Routing and Comm. Workshop, pp. 45-49, 1994.
[9] J. Duato, S. Yalamanchili, and L.M. Ni, Interconnection Networks: An Engineering Approach, second ed., Morgan Kauffman, 2002.
[10] J. Flich, M.P. Malumbres, P. López, and J. Duato, “Performance Evaluation of Networks of Workstations with Hardware Shared Memory Model Using Execution-Driven Simulation,” Proc. Int'l Conf. Parallel Processing, Sept. 1999.
[11] M. Gerla and L. Kleinrock, “Flow Control: A Comparative Survey,” IEEE Trans. Comm., vol. 28, no. 4, Apr. 1980.
[12] C. Hyatt and D.P. Agrawal, “Congestion Control in the Wormhole-Routed Torus with Clustering and Delayed Deflection,” Proc. Parallel Computing, Routing, and Comm. Workshop, June 1997.
[13] C. Izu and A. Arruabarena, “Congestion Control for a k-Ary n-Cube Static Network with Bimodal Traffic,” Proc. Australasian Conf. Parallel and Real Time Systems, 1998.
[14] V. Jacobson, “Congestion Avoidance and Control,” Proc. ACM SIGCOMM '88 Conf., 1988.
[15] R. Jain, “Myths about Congestion Management in High-Speed Networks,” Internetworking: Research and Experience, vol. 3, no. 3, 1992.
[16] J.H. Kim, Z. Liu, and A.A. Chien, “Compressionless Routing: A Framework for Adaptive and Fault-Tolerant Routing,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 3, Mar. 1997.
[17] F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. San Mateo, Calif.: Morgan Kaufmann Publishers, 1992.
[18] P. López and J. Duato, “Deadlock-Free Adaptive Routing Algorithms for the 3D-Torus: Limitations and Solutions,” Proc. Parallel Architectures and Languages Europe '93, June 1993.
[19] P. López, J.M. Martínez, J. Duato, and F. Petrini, “On the Reduction of Deadlock Frequency by Limiting Message Injection in Wormhole Networks,” Proc. Parallel Computer Routing and Comm. Workshop, June 1997.
[20] P. López, J.M. Martínez, and J. Duato, “DRIL: Dynamically Reduced Message Injection Limitation Mechanism for Wormhole Networks,” Proc. Int'l Conf. Parallel Processing, Aug. 1998.
[21] J.M. Martínez, P. López, and J. Duato, “A Cost-Effective Approach to Deadlock Handling in Wormhole Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 7, pp. 719-729, July 2001.
[22] J.M. Martínez, P. López, and J. Duato, “FC3D: Flow Control-Based Distributed Deadlock Detection Mechanism for True Fully Adaptive Routing in Wormhole Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 8, pp. 765-779, Aug. 2003.
[23] J.F. Martínez, J. Torrellas, and J. Duato, “Improving the Performance of Bristled CC-NUMA Systems using Virtual Channels and Adaptivity,” Proc. ACM Int'l Conf. Supercomputing, June 1999.
[24] F. Petrini and M. Vanneschi, “Minimal Adaptive Routing with Limited Injection on Toroidal k-Ary n-Cubes,” Proc. Supercomputing '96, 1996.
[25] T.M. Pinkston and S. Warnakulasuriya, “On Deadlocks in Interconnection Networks,” Proc. Int'l Symp. Computer Architecture, June 1997.
[26] F. Silla, M.P. Malumbres, J. Duato, D. Dai, and D.K. Panda, “Impact of Adaptivity on the Behavior of Networks of Workstations under Bursty Traffic,” Proc. Int'l Conf. Parallel Processing, Aug. 1998.
[27] A. Smai and L. Thorelli, “Global Reactive Congestion Control in Multicomputer Networks,” Proc. Int'l Conf. High Performance Computing, 1998.
[28] V. Soteriou and L.-S. Peh, “Dynamic Voltage Power Management for Power Optimization of Interconnection Networks Using On/Off Links,” Proc. Hot Interconnects Conf., Aug. 2003.
[29] M. Thottetodi, A.R. Lebeck, S.S. Mukherjee, “Self-Tuned Congestion Control for Multiprocessor Networks,” Technical Report CS-2000-15, Duke Univ., Nov. 2000.
[30] M. Thottetodi, A.R. Lebeck, S.S. Mukherjee, “Self-Tuned Congestion Control for Multiprocessor Networks,” Proc. Int'l Symp. High-Performance Architecture, Feb. 2001.

Index Terms:
Wormhole switching, congestion control, message throttling.
Citation:
Elvira Baydal, Pedro L?pez, Jos? Duato, "A Family of Mechanisms for Congestion Control in Wormhole Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 9, pp. 772-784, Sept. 2005, doi:10.1109/TPDS.2005.102
Usage of this product signifies your acceptance of the Terms of Use.