This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Distributed Resolution of Network Congestion and Potential Deadlock Using Reservation-Based Scheduling
August 2005 (vol. 16 no. 8)
pp. 686-701

Abstract—Efficient and reliable communication is essential for achieving high performance in a networked computing environment. Finite network resources bring about unavoidable competition among in-flight network packets, resulting in network congestion and, possibly, deadlock. Many techniques have been proposed to improve network performance by efficiently handling network congestion and potential deadlock. However, none of them provide an efficient way of accelerating the movement of network packets in congestion toward their destinations. In this paper, we propose a new mechanism for detecting and resolving network congestion and potential deadlocks. The proposed mechanism is based on efficiently tracking paths of congestion and increasing the scheduling priority of packets along those paths. This acts to throttle other packets trying to enter those congested regions—in effect, locking out packets from congested regions until congestion has had the opportunity to disperse. Simulation results show that the proposed technique effectively disperses network congestion and is also applicable in helping to resolve potential deadlock.

[1] A.K.G. Arjun Singh, W.J. Dally, and B. Towles, “GOAL: A Load-Balanced Adaptive Routing Algorithm for Torus Networks,” Proc. Int'l Symp. Computer Architecture (ISCA), pp. 194-205, June 2003.
[2] D. Avresky, V. Shurbanov, R. Horst, and P. Mehra, “Performance Evaluation of the ServerNet$^R$ SAN under Self-Similar Traffic,” Proc. 13th Int'l Parallel and Distributed Processing and 10th Symp. Parallel and Distributed Processing, pp. 143-147, 1999.
[3] E. Baydal, P. López, and J. Duato, “A Simple and Efficient Mechanism to Prevent Saturation in Wormhole Networks,” Proc. 14th Int'l Conf. Parallel and Distributed Processing Symp., pp. 617-622, May 2000.
[4] M. Crovella and A. Bestavros, “Self-Similarity in World Wide Web Traffic: Evidence and Possible Causes,” Proc. ACM Sigmetrics Conf. Measurement and Modeling of Computer Systems, pp. 160-169, May 1996.
[5] J. Duato, “A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 12, pp. 1320-1331, Dec. 1993.
[6] J. Duato and T.M. Pinkston, “A General Theory for Deadlock-Free Adaptive Routing Using a Mixed Set of Resources,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 12, pp. 1219-1235, Dec. 2001.
[7] J. Flich, P. Lopez, M.P. Malumbres, and J. Duato, “Boosting the Performance of Myrinet Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 7, pp. 693-709, July 2002.
[8] A.G. Greenberg and B. Hajek, “Deflection Routing in Hypercube Networks,” IEEE Trans. Comm., vol. 40, no. 6, pp. 1070-1081, June 1992.
[9] InfiniBand Trade Assoc., InfiniBand Architecture. Specification, vol. 1, Release 1.0a, http:/www.infinibandta.com, 2001.
[10] D.N. Jayasimha, L. Schwiebert, D. Manivannan, and J.A. May, “A Foundation for Designing Deadlock-Free Routing Algorithms in Wormhole Networks,” J. ACM, vol. 50, no. 2, pp. 250-275, Mar. 2003.
[11] J. Kim, Z. Liu, and A. Chien, “Compressionless Routing: A Framework for Adaptive and Fault-Tolerant Routing,” IEEE Trans. Parallel and Distributed Systems, vol. 8, no. 3, pp. 229-244, Mar. 1997.
[12] S. Konstantinidou and L. Snyder, “Chaos Router: Architecture and Performance,” Proc. 18th Int'l Symp. Computer Architecture, pp. 212-221, May 1991.
[13] C.E. Leiserson, Z.S. Abuhamdeh, D.C. Douglas, C.R. Feynman, M.N. Ganmukhi, J.V. Hill, W.D. Hillis, B.C. Kuszmaul, M.A.S. Pierre, D.S. Wells, M.C. Wong, S.-W. Yang, and R. Zak, “The Network Architecture of the Connection Machine CM-5,” Proc. Symp. Parallel and Distributed Algorithms, pp. 272-285, 1992.
[14] W.E. Leland, M.S. Taqq, W. Willinger, and D.V. Wilson, “On the Self-Similar Nature of Ethernet Traffic,” Proc. ACM SIGCOMM Conf., pp. 183-193, Sept. 1993.
[15] P. López, J. Martinez, and J. Duato, “DRIL: Dynamically Reduced Message Injection Limitation Mechanism for Wormhole Networks,” Proc. 1998 Int'l Conf. Parallel Processing (ICPP '98), pp. 535-542, Aug. 1998.
[16] D. Manivannan and M. Singhal, “An Efficient Distributed Algorithm for Detection of Knots and Cycles in a Distributed Graph,” IEEE Trans. Parallel and Distributed Systems, vol. 14, no. 10, pp. 961-972, Oct. 2003.
[17] J.M. Martinez, P. Lopez, 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. 7, July 2003.
[18] N. McKeown, “Scheduling Algorithms for Input-Queued Cell Switches,” PhD thesis, Univ. of California at Berkeley, 1995.
[19] N. McKeown, “The iSLIP Scheduling Algorithm for Input-Queued Switches,” IEEE/ACM Trans. Networking, vol. 7, no. 2, pp. 188-201, Apr. 1999.
[20] S.S. Mukherjee, P. Bannon, S. Lang, A. Spink, and D. Webb, “The Alpha 21364 Network Architecture,” Proc. Symp. High Performance Interconnects (HOT Interconnects 9), pp. 113-117, Aug. 2001.
[21] N. Ni and L.N. Bhuyan, “Fair Scheduling for Input Buffered Switches,” Proc. 15th Int'l Parallel and Distributed Processing Symp., pp. 1682-1689, Apr. 2001.
[22] P. Palazzari and M. Coli, “Virtual Cut-Through Implementation of the Hole-Based Packet Switching Routing Algorithm,” Proc. Sixth Euromicro Workshop Parallel and Distributed Processing, pp. 416-421, Jan. 1998.
[23] A.K. Parekh and R.G. Gallager, “A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single-Node Case,” IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 344-357, June 1993.
[24] L.-S. Peh and W.J. Dally, “Flit-Reservation Flow Control,” Proc. Sixth Int'l Symp. High Performance Computer Architecture, pp. 73-84, Jan. 2000.
[25] L.-S. Peh and W.J. Dally, “A Delay Model and Speculative Architecture for Pipelined Routers,” Proc. Seventh Int'l Symp. High Performance Computer Architecture, pp. 255-266, Jan. 2001.
[26] F. Petrini, J. Duato, P. Lopez, and J.M. Martinez, “LIFE: A Limited Injection, Fully Adaptive, Recovery-Based Routing Algorithm,” Proc. Fourth Int'l Conf. High Performance Computing, pp. 316-321, Dec. 1997.
[27] T.M. Pinkston, “Flexible and Efficient Routing Based on Progressive Deadlock Recovery,” IEEE Trans. Computers, vol. 48, no. 7, pp. 649-669, July 1999.
[28] V. Puente, C. Izu, R. Beivide, J.A. Gregorio, F. Vallejo, and J.M. Prellezo, “The Adaptive Bubble Router,” J. Parallel and Distributed Computing, vol. 61, no. 9, pp. 1180-1208, Sept. 2001.
[29] L. Schwiebert and D.N. Jayasimha, “A Necessary and Sufficient Condition for Deadlock-Free Wormhole Routing,” J. Parallel and Distributed Computing, vol. 32, no. 1, pp. 103-117, Jan. 1996.
[30] J. Shin and T.M. Pinkston, “The Performance of Routing Algorithms under Bursty Traffic Loads,” Proc. Int'l Conf. Parallel and Distributed Processing Techniques and Applications (PDPTA '03), pp. 737-743, June 2003.
[31] A. Singh, W.J. Dally, B. Towles, and A.K. Gupta, “Locality-Preserving Randomized Oblivious Routing on Torus Networks,” Proc. ACM Symp. Parallel Algorithms and Architectures (SPAA), Aug. 2002.
[32] A.-H. Smai and L.-E. Thorelli, “Global Reactive Congestion Control in Multicomputer Networks,” Proc. Fifth Int'l Conf. High Performance Computing, pp. 179-186, Dec. 1998.
[33] M. Thottethodi, A.R. Lebeck, and S.S. Mukherjee, “Self-Tuned Congestion Control for Multiprocessor Networks,” Proc. Seventh Int'l Symp. High Performance Computer Architecture, pp. 107-118, Jan. 2001.
[34] M.S. Thottethodi, A.R. Lebeck, and S.S. Mukherjee, “BLAM: A High-Performance Routing Algorithm for Virtual Cut-Through Networks,” Proc. 14th Int'l Parallel and Distributed Processing Symp. (IPDPS), Apr. 2003.
[35] F.A. Tobagi and V.B. Hunt, “Performance Analysis of Carrier Sense Multiple Access with Collision Detection,” Computer Networks, vol. 4, pp. 245-259, 1980.
[36] A.K. Venkatramani and T.M. Pinkston, “An Efficient, Fully Adaptive Deadlock Recovery Scheme: DISHA,” Proc. 22nd Int'l Symp. Computer Architecture, pp. 201-210, June 1995.
[37] A.K. Venkatramani, T.M. Pinkston, and J. Duato, “Generalized Theory for Deadlock-Free Adaptive Wormhole Routing and Its Application to Disha Concurrent,” Proc. 10th Int'l Parallel Processing Symp., pp. 815-821, Apr. 1996.
[38] S. Warnakulasuriya and T.M. Pinkston, “Characterization of Deadlocks in $k{\hbox{-}}{\rm{Ary}}$ $n{\hbox{-}}{\rm{Cube}}$ Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 10, no. 9, pp. 904-921, Sept. 1999.
[39] S. Warnakulasuriya and T.M. Pinkston, “A Formal Model of Message Blocking and Deadlock Resolution in Interconnection Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 3, pp. 212-229, Mar. 2000.
[40] S. Warnakulasuriya and T.M. Pinkston, “Characterization of Deadlocks in Irregular Networks,” J. Parallel and Distributed Computing, vol. 62, no. 1, pp. 61-84, Jan. 2002.
[41] K. Yum, A. Vaidya, C. Das, and A. Sivasubramaniam, “Investigating QoS Support for Traffic Mixes with the MediaWorm Router,” Proc. Sixth Int'l Symp. High-Performance Computer Architecture, pp. 97-108, Jan. 1999.
[42] L. Zhang, “VirtualClock: A New Traffic Control Algorithm for Packet-Switched Networks,” ACM Trans. Computer Systems, vol. 9, no. 2, pp. 101-124, May 1991.
[43] T.M. Pinkston, “Deadlock Characterization and Resolution in Interconnection Networks,” Deadlock Resolution in Computer-Integrated Systems, chapter 13, M. Zhou and M. Pia Fanti, eds., Marcel Dekker/CRC Press, pp. 445-492, 2004.
[44] J. Duato, I. Johnson, J. Flich, F. Naven, P. Garcia, and T. Nachiondo, “A New Scalable and Cost-Effective Congestion Management Strategy for Lossless Multistage Interconnection Networks,” Proc. 11th Int'l Symp. High-Performance Computer Architecture, pp. 108-119, Feb. 2005.

Index Terms:
Interconnection networks, congestion, deadlock, router scheduling, router architecture.
Citation:
Yong Ho Song, Timothy Mark Pinkston, "Distributed Resolution of Network Congestion and Potential Deadlock Using Reservation-Based Scheduling," IEEE Transactions on Parallel and Distributed Systems, vol. 16, no. 8, pp. 686-701, Aug. 2005, doi:10.1109/TPDS.2005.93
Usage of this product signifies your acceptance of the Terms of Use.