Network on Chips Link Bandwidth Minimization of Deadlock-free Multi-Path Routing

被引:0
|
作者
Dziurzanski, Piotr [1 ]
Maka, Tomasz [1 ]
机构
[1] West Pomeranian Univ Technol, Zolnierska 52, PL-71210 Szczecin, Poland
关键词
Networks on Chip; multi-path routing; deadlock avoidance; linear programming;
D O I
暂无
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
In this paper, a technique for minimizing link bandwidth of a multi-path routing algorithm dedicated to Network on Chip (NoC) is presented. The proposed algorithm is based on the linear programming and allows us to avoid deadlocks and contentions in case of a multi-path routing used for data-dominated streaming multimedia applications. The proposed approach is illustrated with audio and images data description and classification modules for common multimedia processing tasks. Some experimental results obtained from an application implementing the approach is provided.
引用
收藏
页码:131 / 134
页数:4
相关论文
共 50 条
  • [1] Deadlock-free multi-path routing for torus-based NoCs
    Jiao, Yaoting
    Yang, Mei
    Yang, Yulu
    Jiang, Yingtao
    Yun, Xiaochun
    PROCEEDINGS OF THE FIFTH INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: NEW GENERATIONS, 2008, : 253 - +
  • [2] Deadlock-Free Routing in SpaceWire Onboard Network
    Kurbanov, Lev
    Rozhdestvenskaya, Ksenia
    Suvorova, Elena
    PROCEEDINGS OF THE 2018 22ND CONFERENCE OF OPEN INNOVATIONS ASSOCIATION (FRUCT), 2018, : 107 - 114
  • [3] An Efficient Deadlock-Free Adaptive Routing Algorithm for 3D Network-on-Chips
    Dai, Jindun
    Jiang, Xin
    Li, Renjie
    Watanabe, Takahiro
    2017 IEEE 11TH INTERNATIONAL SYMPOSIUM ON EMBEDDED MULTICORE/MANY-CORE SYSTEMS-ON-CHIP (MCSOC 2017), 2017, : 29 - 36
  • [4] A deadlock-free routing algorithm for irregular 3D network-on-chips with wireless links
    Zeynab Mohseni
    Midia Reshadi
    The Journal of Supercomputing, 2018, 74 : 953 - 969
  • [5] A deadlock-free routing algorithm for irregular 3D network-on-chips with wireless links
    Mohseni, Zeynab
    Reshadi, Midia
    JOURNAL OF SUPERCOMPUTING, 2018, 74 (02): : 953 - 969
  • [6] An incremental network topology for contention-free and deadlock-free routing
    Liu, PF
    Lin, YF
    Wu, JJ
    NINTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS, 2002, : 209 - 215
  • [7] ADAPTIVE DEADLOCK-FREE AND LIVELOCK-FREE ROUTING IN THE HYPERCUBE NETWORK
    PIFARRE, GD
    GRAVANO, L
    DENICOLAY, G
    SANZ, JLC
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1994, 5 (11) : 1121 - 1139
  • [8] German methodologies for deadlock-free routing
    Park, H
    Agrawal, DP
    10TH INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM - PROCEEDINGS OF IPPS '96, 1996, : 638 - 643
  • [9] Transitively Deadlock-Free Routing Algorithms
    Quintin, Jean-Noel
    Vigneras, Pierre
    2016 2ND IEEE INTERNATIONAL WORKSHOP ON HIGH-PERFORMANCE INTERCONNECTION NETWORKS IN THE EXASCALE AND BIG-DATA ERA (HIPINEB), 2016, : 16 - 24
  • [10] Configuring Methods for Deadlock-Free Routing
    Olenev, Valentin
    Karandashev, Alexandr
    INTERNATIONAL JOURNAL OF TEACHER EDUCATION AND PROFESSIONAL DEVELOPMENT, 2020, 3 (01) : 1 - +