Self-tuned congestion control for multiprocessor networks

被引:38
作者
Thottethodi, M [1 ]
Lebeck, AR [1 ]
Mukherjee, SS [1 ]
机构
[1] Duke Univ, Dept Comp Sci, Durham, NC 27708 USA
来源
HPCA: SEVENTH INTERNATIONAL SYMPOSIUM ON HIGH-PERFORMANCE COMPUTING ARCHITECTURE, PROCEEDINGS | 2001年
关键词
D O I
10.1109/HPCA.2001.903256
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Network performance in tightly-coupled multiprocessors typically degrades rapidly beyond network saturation. Consequently, designers must keep a network below its saturation point by reducing the load on the network. Congestion control via source throttling-a common technique to reduce the network load-prevents new packets from entering the network in the presence of congestion. Unfortunately, prior schemes to implement source throttling either lack vital global information about the network to make the correct decision (whether to throttle or not) or depend on specific network parameters, network topology or communication patterns. This paper presents a global-knowledge-based, self-tuned, congestion control technique that prevents saturation at high loads across different network configurations and communication patterns. Our design is composed of two key components. First, we use global information about a network to obtain a timely estimate of network congestion. We compare this estimate to a threshold value to determine when to throttle packet injection. The second component is a self-tuning mechanism that automatically determines appropriate threshold values based on throughput feedback. A combination of these two techniques provides high performance under heavy load, does not penalize performance under light load, and gracefully adapts to changes in communication patterns.
引用
收藏
页码:107 / 118
页数:12
相关论文
共 28 条
[1]  
ANJAN KV, 1995, ACM COMP AR, P201, DOI 10.1109/ISCA.1995.524561
[2]   Alleviating consumption channel bottleneck in wormhole-routed k-ary n-cube systems [J].
Basak, D ;
Panda, DK .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1998, 9 (05) :481-496
[3]  
Baydal E., 2000, Proceedings 14th International Parallel and Distributed Processing Symposium. IPDPS 2000, P617, DOI 10.1109/IPDPS.2000.846043
[4]   TCP VEGAS - END-TO-END CONGESTION AVOIDANCE ON A GLOBAL INTERNET [J].
BRAKMO, LS ;
PETERSON, LL .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1995, 13 (08) :1465-1480
[5]  
DALLY WJ, 1987, IEEE T COMPUT, V36, P547, DOI 10.1109/TC.1987.1676939
[6]   VIRTUAL-CHANNEL FLOW-CONTROL [J].
DALLY, WJ .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1992, 3 (02) :194-205
[7]   THE TORUS ROUTING CHIP [J].
DALLY, WJ ;
SEITZ, CL .
DISTRIBUTED COMPUTING, 1986, 1 (04) :187-196
[8]  
DIEFENDORFF K, 1999, MICROPROCESSOR REPOR, V13
[9]   A NEW THEORY OF DEADLOCK-FREE ADAPTIVE ROUTING IN WORMHOLE NETWORKS [J].
DUATO, J .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1993, 4 (12) :1320-1331
[10]  
EMER J, 1999, MICROPROCESSOR F OCT