Ensuring Deadlock-Freedom in Low-Diameter InfiniBand Networks

被引:0
|
作者
Schneider, Timo [1 ]
Bibartiu, Otto [1 ]
Hoefler, Torsten [1 ]
机构
[1] Swiss Fed Inst Technol, Dept Comp Sci, Zurich, Switzerland
关键词
TABLES;
D O I
10.1109/HOTI.2016.11
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Lossless networks, such as InfiniBand use flow-control to avoid packet-loss due to congestion. This introduces dependencies between input and output channels, in case of cyclic dependencies the network can deadlock. Deadlocks can be resolved by splitting a physical channel into multiple virtual channels with independent buffers and credit systems. Currently available routing engines for InfiniBand assign entire paths from source to destination nodes to different virtual channels. However, InfiniBand allows changing the virtual channel at every switch. We developed fast routing engines which make use of that fact and map individual hops to virtual channels. Our algorithm imposes a total order on virtual channels and increments the virtual channel at every hop, thus the diameter of the network is an upper bound for the required number of virtual channels. We integrated this algorithm into the InfiniBand software stack. Our algorithms provide deadlock free routing on state-of-theart low-diameter topologies, using fewer virtual channels than currently available practical approaches, while being faster by a factor of four on large networks. Since low-diameter topologies are common among the largest supercomputers in the world, to provide deadlock-free routing for such systems is very important.
引用
收藏
页码:1 / 8
页数:8
相关论文
共 50 条
  • [1] DEADLOCK-FREEDOM IN RESOURCE CONTENTIONS
    CHEN, MC
    REM, M
    ACTA INFORMATICA, 1985, 21 (06) : 585 - 598
  • [2] Verifying Deadlock-Freedom of Communication Fabrics
    Gotmanov, Alexander
    Chatterjee, Satrajit
    Kishinevsky, Michael
    VERIFICATION, MODEL CHECKING, AND ABSTRACT INTERPRETATION, 2011, 6538 : 214 - +
  • [3] Deadlock-Freedom in Computational Neuroscience Simulators
    Sobhani, Vida
    Kauth, Kevin
    Stadtmann, Tim
    Gemmeke, Tobias
    IEEE DESIGN & TEST, 2022, 39 (06) : 70 - 78
  • [4] BINDU: Deadlock-Freedom with One Bubble in the Network
    Parasar, Mayank
    Krishna, Tushar
    PROCEEDINGS OF THE 13TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON NETWORKS-ON-CHIP (NOCS'19), 2019,
  • [5] TESTING DEADLOCK-FREEDOM OF COMPUTER-SYSTEMS
    KAMEDA, T
    JOURNAL OF THE ACM, 1980, 27 (02) : 270 - 280
  • [6] Tighter Reachability Criteria for Deadlock-Freedom Analysis
    Antonino, Pedro
    Gibson-Robinson, Thomas
    Roscoe, A. W.
    FM 2016: FORMAL METHODS, 2016, 9995 : 43 - 59
  • [7] Deadlock-freedom in component systems with architectural constraints
    Martens, Moritz
    Majster-Cederbaum, Mila
    FORMAL METHODS IN SYSTEM DESIGN, 2012, 41 (02) : 129 - 177
  • [8] DEADLOCK-FREEDOM (AND SAFETY) OF TRANSACTIONS IN A DISTRIBUTED DATABASE
    WOLFSON, O
    YANNAKAKIS, M
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1986, 33 (02) : 161 - 178
  • [9] Manifest Deadlock-Freedom for Shared Session Types
    Balzer, Stephanie
    Toninho, Bernardo
    Pfenning, Frank
    PROGRAMMING LANGUAGES AND SYSTEMS, ESOP 2019: 28TH EUROPEAN SYMPOSIUM ON PROGRAMMING, 2019, 11423 : 611 - 639
  • [10] Port Protocols for Deadlock-Freedom of Component Systems
    Lambertz, Christian
    Majster-Cederbaum, Mila
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2010, (38): : 7 - 11