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 条
  • [41] Effective methodology for deadlock-free minimal routing in InfiniBand networks
    Sancho, JC
    Robles, A
    Flich, J
    López, P
    Duato, J
    2002 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, PROCEEDING, 2002, : 409 - 418
  • [42] Mining Low-Diameter Clusters Conserved in Graph Collections
    Oklahoma State University
  • [43] Designing low-diameter interconnection networks with multi-ported host-switch graphs
    Yasudo, Ryota
    Nakano, Koji
    Koibuchi, Michihiro
    Matsutani, Hiroki
    Amano, Hideharu
    CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE, 2023, 35 (11):
  • [44] PROBLEMS OF ANALYZING LOW-DIAMETER STEEL SAMPLES IN SPECTROMETER
    MACK, H
    NEUE HUTTE, 1978, 23 (07): : 261 - 265
  • [45] Slim Fly: A Cost Effective Low-Diameter Network Topology
    Besta, Maciej
    Hoefler, Torsten
    SC14: INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS, 2014, : 348 - 359
  • [46] Implementing Low-Diameter On-Chip Networks for Manycore Processors Using a Tiled Physical Design Methodology
    Ou, Yanghui
    Agwa, Shady
    Batten, Christopher
    2020 14TH IEEE/ACM INTERNATIONAL SYMPOSIUM ON NETWORKS-ON-CHIP (NOCS), 2020,
  • [47] On Fault-Tolerant Low-Diameter Clusters in Graphs
    Lu, Yajun
    Salemi, Hosseinali
    Balasundaram, Balabhaskar
    Buchanan, Austin
    INFORMS JOURNAL ON COMPUTING, 2022, 34 (06) : 3181 - 3199
  • [48] Deadlock Freedom for Asynchronous and Cyclic Process Networks
    van den Heuvel, Bas
    Perez, Jorge A.
    ELECTRONIC PROCEEDINGS IN THEORETICAL COMPUTER SCIENCE, 2021, (347): : 38 - 56
  • [49] Building resilient low-diameter peer-to-peer topologies
    Wouhaybi, Rita H.
    Campbell, Andrew T.
    COMPUTER NETWORKS, 2008, 52 (05) : 1019 - 1039
  • [50] Type-Based Deadlock-Freedom Verification for Non-Block-Structured Lock Primitives and Mutable References
    Suenaga, Kohei
    PROGRAMMING LANGUAGES AND SYSTEMS, PROCEEDINGS, 2008, 5356 : 155 - 170