Highly adaptive and deadlock-free routing for three-dimensional networks-on-chip

被引:25
|
作者
Dahir, Nizar [1 ,2 ]
Mak, Terrence [3 ]
Al-Dujaily, Ra'ed [1 ]
Yakovlev, Alex [1 ]
机构
[1] Newcastle Univ, Sch Elect & Elect Engn, Newcastle Upon Tyne NE1 7RU, Tyne & Wear, England
[2] Univ Kufa, IT Res Ctr, Najaf, Iraq
[3] Chinese Univ Hong Kong, Dept Comp Sci & Engn, Shatin, Hong Kong, Peoples R China
来源
基金
英国工程与自然科学研究理事会;
关键词
network-on-chip; network routing; three-dimensional integrated circuits; deadlock-free routing; three-dimensional networks-on-chip; 3D NoC; three-2D turn model adaptive routing; 3D plane-balanced approach; degree of adaptiveness; 3D odd-even turn model; large-scale 3D integration;
D O I
10.1049/iet-cdt.2013.0029
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
This study proposes a new method for designing adaptive routing algorithms for three-dimensional (3D) networks-on-chip (NoCs). This method is based on extending the existing 2D turn model adaptive routing to a 3D scenario. A 3D plane-balanced approach with maximal degree of adaptiveness is achieved by applying a well-defined set of rules for different strata of the 3D NoC. The proposed method is applicable to any of the turn models. In this study, the authors employ odd-even turn model as a basis for introducing the proposed strategy. Experimental results show that the new 3D odd-even turn model can achieve up to 28.5% improvement in performance over conventional 3D odd-even approach. The improvement is consistent for different traffic types and selection strategies. The proposed method enables a new avenue to explore adaptive approaches for future large-scale 3D integration.
引用
收藏
页码:255 / 263
页数:9
相关论文
共 50 条
  • [1] Highly adaptive and deadlock-free routing for three-dimensional networks-on-chip (vol 7, pg 255, 2013)
    Dahir, Nizar
    Mak, Terrence
    Al-Dujaily, Ra'ed
    Missailidis, Petros
    Yakovlev, Alex
    IET COMPUTERS AND DIGITAL TECHNIQUES, 2016, 10 (01): : 45 - 45
  • [2] Fault Tolerant Deadlock-free Adaptive Routing Algorithms for Hexagonal Networks-on-Chip
    Moriam, Sadia
    Fettweis, Gerhard P.
    19TH EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN (DSD 2016), 2016, : 131 - 137
  • [3] Adaptive and Deadlock-Free Tree-Based Multicast Routing for Networks-on-Chip
    Samman, Faizal Arya
    Hollstein, Thomas
    Glesner, Manfred
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2010, 18 (07) : 1067 - 1080
  • [4] A deadlock-free routing algorithm for dynamically reconfigurable Networks-on-Chip
    Jackson, Chris
    Hollis, Simon J.
    MICROPROCESSORS AND MICROSYSTEMS, 2011, 35 (02) : 139 - 151
  • [5] Ring-Split: Deadlock-Free Routing Algorithm for Circulant Networks-on-Chip
    Romanov, Aleksandr Y.
    Myachin, Nikolay M.
    Lezhnev, Evgenii, V
    Ivannikov, Alexander D.
    El-Mesady, Ahmed
    MICROMACHINES, 2023, 14 (01)
  • [6] An Efficient Deadlock-Free Multicast Routing Algorithm for Mesh-Based Networks-on-Chip
    Lee, Kuen-Jong
    Chang, Chin-Yao
    Yang, Hung-Yang
    2013 INTERNATIONAL SYMPOSIUM ON VLSI DESIGN, AUTOMATION, AND TEST (VLSI-DAT), 2013,
  • [7] Deadlock-free routing and component placement for irregular mesh-based networks-on-chip
    Schäfer, MKF
    Hollstein, T
    Zimmer, H
    Glesner, M
    ICCAD-2005: INTERNATIONAL CONFERENCE ON COMPUTER AIDED DESIGN, DIGEST OF TECHNICAL PAPERS, 2005, : 238 - 245
  • [8] An Efficient Deadlock-Free Multicast Routing Algorithm for Mesh-Based Networks-on-Chip
    Lee, Kuen-Jong
    Chang, Chin-Yao
    Yang, Hung-Yang
    2013 INTERNATIONAL SYMPOSIUM ON VLSI DESIGN, AUTOMATION, AND TEST (VLSI-DAT), 2013,
  • [9] Deadlock-free generic routing algorithms for 3-dimensional Networks-on-Chip with reduced vertical link density topologies
    Ying, Haoyuan
    Jaiswal, Ashok
    Hollstein, Thomas
    Hofmann, Klaus
    JOURNAL OF SYSTEMS ARCHITECTURE, 2013, 59 (07) : 528 - 542
  • [10] An Efficient Adaptive Deadlock-Free Routing Algorithm for Torus Networks
    Luo, Wei
    Xiang, Dong
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2012, 23 (05) : 800 - 808