FlexVC: Flexible Virtual Channel Management in Low-Diameter Networks

被引:2
|
作者
Fuentes, Pablo [1 ]
Vallejo, Enrique [1 ]
Beivide, Ramon [1 ]
Minkenberg, Cyriel [2 ]
Valero, Mateo [3 ,4 ]
机构
[1] Univ Cantabria, Santander, Spain
[2] Rockley Photon Inc, Pasadena, CA USA
[3] Barcelona Supercomp Ctr, Barcelona, Spain
[4] UPC, Barcelona, Spain
关键词
Buffer management; deadlock avoidance; DEADLOCK;
D O I
10.1109/IPDPS.2017.110
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Deadlock avoidance mechanisms for lossless lowdistance networks typically increase the order of virtual channel (VC) index with each hop. This restricts the number of buffer resources depending on the routing mechanism and limits performance due to an inefficient use. Dynamic buffer organizations increase implementation complexity and only provide small gains in this context because a significant amount of buffering needs to be allocated statically to avoid congestion. We introduce FlexVC, a simple buffer management mechanism which permits a more flexible use of VCs. It combines statically partitioned buffers, opportunistic routing and a relaxed distancebased deadlock avoidance policy. FlexVC mitigates Head-of-Line blocking and reduces up to 50% the memory requirements. Simulation results in a Dragonfly network show congestion reduction and up to 37.8% throughput improvement, outperforming more complex dynamic approaches. FlexVC merges different flows of traffic in the same buffers, which in some cases makes more difficult to identify the traffic pattern in order to support nonminimal adaptive routing. An alternative denoted FlexVCminCred improves congestion sensing for adaptive routing by tracking separately packets routed minimally and nonminimally, rising throughput up to 20.4% with 25% savings in buffer area.
引用
收藏
页码:842 / 854
页数:13
相关论文
共 50 条
  • [1] 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
  • [2] Building low-diameter peer-to-peer networks
    Pandurangan, G
    Raghavan, P
    Upfal, E
    IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2003, 21 (06) : 995 - 1002
  • [3] Integration: Reaching consensus in low-diameter wireless networks
    Olariu, Stephan
    Nickerson, Jeffrey
    MILCOM 2006, VOLS 1-7, 2006, : 2007 - +
  • [4] PolarFly: A Cost-Effective and Flexible Low-Diameter Topology
    Lakhotia, Kartik
    Besta, Maciej
    Monroe, Laura
    Isham, Kelly
    Iff, Patrick
    Hoefler, Torsten
    Petrini, Fabrizio
    SC22: INTERNATIONAL CONFERENCE FOR HIGH PERFORMANCE COMPUTING, NETWORKING, STORAGE AND ANALYSIS, 2022,
  • [5] Finding conserved low-diameter subgraphs in social and biological networks
    Pan, Hao
    Lu, Yajun
    Balasundaram, Balabhaskar
    Borrero, Juan S.
    NETWORKS, 2024, : 509 - 527
  • [6] Ensuring Deadlock-Freedom in Low-Diameter InfiniBand Networks
    Schneider, Timo
    Bibartiu, Otto
    Hoefler, Torsten
    2016 IEEE 24TH ANNUAL SYMPOSIUM ON HIGH-PERFORMANCE INTERCONNECTS (HOTI), 2016, : 1 - 8
  • [7] Parsimonious formulations for low-diameter clusters
    Hosseinali Salemi
    Austin Buchanan
    Mathematical Programming Computation, 2020, 12 : 493 - 528
  • [8] 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
  • [9] Building low-diameter P2P networks
    Pandurangan, G
    Raghavan, P
    Upfal, E
    42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, : 492 - 499
  • [10] LOW-DIAMETER GRAPH DECOMPOSITION IS IN NC
    AWERBUCH, B
    BERGER, B
    COWEN, L
    PELEG, D
    LECTURE NOTES IN COMPUTER SCIENCE, 1992, 621 : 83 - 93