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 条
  • [21] Analysing Mechanisms for Virtual Channel Management in Low-Diameter networks
    Cano, Alejandro
    Camarero, Cristobal
    Martinez, Carmen
    Beivide, Ramon
    2023 IEEE 35TH INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE AND HIGH PERFORMANCE COMPUTING, SBAC-PAD, 2023, : 12 - 22
  • [22] FlexVC: Flexible Virtual Channel Management in Low-Diameter Networks
    Fuentes, Pablo
    Vallejo, Enrique
    Beivide, Ramon
    Minkenberg, Cyriel
    Valero, Mateo
    2017 31ST IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2017, : 842 - 854
  • [23] Deadlock-freedom of Scientific Applications Using Strict Colored FIFO Nets
    Wakrime, Abderrahim Ait
    2017 4TH INTERNATIONAL CONFERENCE ON CONTROL, DECISION AND INFORMATION TECHNOLOGIES (CODIT), 2017, : 102 - 107
  • [24] Using Architectural Constraints for Deadlock-Freedom of Component Systems with Multiway Cooperation
    Martens, Moritz
    Majster-Cederbaum, Mila
    THIRD INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF SOFTWARE ENGINEERING, PROCEEDINGS, 2009, : 225 - 232
  • [25] Parsimonious formulations for low-diameter clusters
    Hosseinali Salemi
    Austin Buchanan
    Mathematical Programming Computation, 2020, 12 : 493 - 528
  • [26] Partitioning Low-diameter Networks to Eliminate Inter-job Interference
    Jain, Nikhil
    Bhatele, Abhinav
    Ni, Xiang
    Gamblin, Todd
    Kale, Laxmikant V.
    2017 31ST IEEE INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2017, : 439 - 448
  • [27] Building low-diameter P2P networks
    Pandurangan, G
    Raghavan, P
    Upfal, E
    42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, : 492 - 499
  • [28] Efficient Deadlock-Freedom Checking Using Local Analysis and SAT Solving
    Antonino, Pedro
    Gibson-Robinson, Thomas
    Roscoe, A. W.
    INTEGRATED FORMAL METHODS (IFM 2016), 2016, 9681 : 345 - 360
  • [29] LOW-DIAMETER GRAPH DECOMPOSITION IS IN NC
    AWERBUCH, B
    BERGER, B
    COWEN, L
    PELEG, D
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 621 : 83 - 93
  • [30] A Novel Channel Assignment Method to Ensure Deadlock-Freedom for Deterministic Routing
    Kawano, Ryuta
    Nakahara, Hiroshi
    Tade, Seiichi
    Fujiwara, Ikki
    Matsutani, Hiroki
    Koibuchi, Michihiro
    Amano, Hideharu
    IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2017, E100D (08): : 1798 - 1806