Exploiting global knowledge to achieve self-tuned congestion control for k-ary n-cube networks

被引:24
|
作者
Thottethodi, M
Lebeck, AR
Mukherjee, SS
机构
[1] Purdue Univ, Sch Elect & Comp Engn, W Lafayette, IN 47907 USA
[2] Duke Univ, Levine Sci Res ctr, Dept Comp Sci, Durham, NC 27708 USA
[3] Intel Corp, Shrewsbury, MA 01545 USA
基金
美国国家科学基金会;
关键词
interconnection networks; wormhole; k-ary n-cubes; congestion control; global information; self-tuning;
D O I
10.1109/TPDS.2004.1264810
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
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, or communication patterns. This paper presents a global-knowledge-based, self-tuned, congestion control technique that prevents saturation at high loads across different communication patterns for k-ary n-cube networks. 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.
引用
收藏
页码:257 / 272
页数:16
相关论文
共 27 条
  • [21] Multidestination message passing in wormhole k-ary n-cube networks with base routing conformed paths
    Panda, DK
    Singal, S
    Kesavan, R
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1999, 10 (01) : 76 - 96
  • [22] Largest Connected Component of a k-ary n-cube with Faulty Vertices
    Dong, Qiang
    JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2013, 29 (04) : 777 - 783
  • [23] The Bipancycle-Connectivity and the m-Pancycle-Connectivity of the k-ary n-cube
    Fang, Jywe-Fei
    COMPUTER JOURNAL, 2010, 53 (06) : 667 - 678
  • [24] Performance Comparison of Simple Regular Meshes and Their k-ary n-cube Variants in Optical Networks
    Kianrad, Ahmad
    Dadlani, Aresh
    Rajabi, Ali
    Aghajani, Mohammadreza
    Khonsari, Ahmad
    Razi, Seyed Hasan Seyed
    ADVANCES IN COMPUTER SCIENCE AND ENGINEERING, 2008, 6 : 543 - +
  • [25] Optimal all-ports collective communication algorithms for the k-ary n-cube interconnection networks
    Touzene, A
    JOURNAL OF SYSTEMS ARCHITECTURE, 2004, 50 (04) : 221 - 231
  • [26] Unpaired Many-to-Many Disjoint Path Covers on Bipartite k-Ary n-Cube Networks with Faulty Elements
    Li, Jing
    Melekian, Chris
    Zuo, Shurong
    Cheng, Eddie
    INTERNATIONAL JOURNAL OF FOUNDATIONS OF COMPUTER SCIENCE, 2020, 31 (03) : 371 - 383
  • [27] The properties and t/s-diagnosability of k-ary n-cube networks (Nov, 10.1007/s11227-021-04155-y, 2021)
    Xie, Yuhao
    Liang, Jiarong
    Yin, Wen
    Li, Changzhen
    JOURNAL OF SUPERCOMPUTING, 2022, 78 (05) : 7058 - 7058