LBDR: A load-balanced deadlock-free routing strategy for chiplet systems

被引:2
|
作者
Cao, Zhipeng [1 ]
Wan, Zhiquan [2 ]
Li, Peijie [1 ]
Liu, Qinrang [1 ]
Wang, Caining [3 ]
Shao, Yangxue [3 ]
机构
[1] Informat Engn Univ, Zhengzhou 450001, Peoples R China
[2] Zhejiang Lab, Hangzhou 311121, Peoples R China
[3] Songshan Lab, Zhengzhou 450000, Peoples R China
关键词
Chiplet system; Load balance; Deadlock-freedom; Routing strategy; ON-CHIP; NETWORK; MODEL;
D O I
10.1016/j.vlsi.2024.102149
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
Chiplet integration technology offers enhanced performance and reduced costs by breaking down a large chip into smaller chiplets, which are then interconnected using advanced packaging technology. However, the current chiplet interconnects give priority to correctness concerns rather than load balancing issues. While prioritizing correctness aims to prevent deadlocks, a system that is free of deadlocks can still experience load imbalances that compromise its overall performance. This paper presents the LBDR strategy, which is a loadbalanced deadlock-free routing strategy for chiplet systems, and effectively enhances the system performance. Firstly, we develop a novel boundary nodes selection criterion and a heuristic algorithm based node binding mechanism to maintain a balanced load on vertical links for each chiplet's outbound traffic. Secondly, we select turn restrictions at the boundary nodes to ensure that inbound traffic flows evenly into the chiplet, while maintaining a deadlock-free system. Experiments using the Garnet in gem5 simulator show that this strategy outperforms existing methods in terms of load balancing, throughput, and latency, and is applicable to a variety of traffic scenarios.
引用
收藏
页数:12
相关论文
共 50 条
  • [1] ASDR: An Application-Specific Deadlock-Free Routing for Chiplet-Based Systems
    Ye, Yaoyao
    Liu, Zixuan
    Liu, Jungan
    Jiang, Li
    [J]. PROCEEDINGS OF THE 2023 16TH INTERNATIONAL WORKSHOP ON NETWORK ON CHIP ARCHITECTURES, NOCARC 2023, 2023, : 46 - 51
  • [2] Load-balanced anycast routing
    Lin, CY
    Lo, JH
    Kuo, SY
    [J]. TENTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 2004, : 701 - 708
  • [3] Transitively Deadlock-Free Routing Algorithms
    Quintin, Jean-Noel
    Vigneras, Pierre
    [J]. 2016 2ND IEEE INTERNATIONAL WORKSHOP ON HIGH-PERFORMANCE INTERCONNECTION NETWORKS IN THE EXASCALE AND BIG-DATA ERA (HIPINEB), 2016, : 16 - 24
  • [4] German methodologies for deadlock-free routing
    Park, H
    Agrawal, DP
    [J]. 10TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM - PROCEEDINGS OF IPPS '96, 1996, : 638 - 643
  • [5] Configuring Methods for Deadlock-Free Routing
    Olenev, Valentin
    Karandashev, Alexandr
    [J]. INTERNATIONAL JOURNAL OF EMBEDDED AND REAL-TIME COMMUNICATION SYSTEMS (IJERTCS), 2022, 13 (01):
  • [6] Configuring Methods for Deadlock-Free Routing
    Olenev, Valentin
    Karandashev, Alexandr
    [J]. INTERNATIONAL JOURNAL OF TEACHER EDUCATION AND PROFESSIONAL DEVELOPMENT, 2020, 3 (01) : 1 - +
  • [7] Chaotic routing strategy with load-balanced effects for communication networks
    Department of Electrical and Electronic Engineering, Nagasaki University, 1-14 Bunkyo-machi, Nagasaki 852-8521, Japan
    不详
    [J]. Proc Int Jt Conf Neural Networks, 2011, (1643-1650):
  • [8] Deadlock-free interval routing schemes
    Flammini, M
    [J]. STACS 97 - 14TH ANNUAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, 1997, 1200 : 351 - 362
  • [9] Chaotic Routing Strategy with Load-Balanced Effects for Communication Networks
    Kimura, Takayuki
    Ikeguchi, Tohru
    [J]. 2011 INTERNATIONAL JOINT CONFERENCE ON NEURAL NETWORKS (IJCNN), 2011, : 1643 - 1650
  • [10] Deadlock-free interval routing schemes
    Flammini, M
    [J]. NETWORKS, 1999, 34 (01) : 47 - 60