Efficient routing in network-on-chip for 3D topologies

被引:4
|
作者
Silva Junior, Luneque [1 ]
Nedjah, Nadia [2 ]
Mourelle, Luiza De Macedo [3 ]
机构
[1] Univ Fed Rio de Janeiro, Syst Engn & Comp Sci Postgrad Program, Rio De Janeiro, Brazil
[2] Univ Estado Rio De Janeiro, Dept Elect Engn & Telecommun, Rio De Janeiro, Brazil
[3] Univ Estado Rio De Janeiro, Dept Syst Engn & Computat, Rio De Janeiro, Brazil
关键词
topology; ant colony optimisation; network on chip; routing; COLONY; OPTIMIZATION; ALGORITHMS;
D O I
10.1080/00207217.2014.989545
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
With the increasing of the integration capability intra-chip, nowadays numerous integrated systems explore a set of processing elements, such as in multicore processors. An efficient interconnection of those elements can be obtained via the use of Network on chip (NoC). This approach is similar to the traditional computer networks where, not restricted to multiprocessors, it is possible to interconnect several dedicated devices. Like other networks, NoCs can be arranged in different topologies, such as ring, mesh and torus. It has shared links that can be used in the transmission of packets of different nodes. Thus, the network congestion is an issue and must be treated to reduce delays. Algorithms based on ant colony optimisation have proven to be effective in static routing in systems designed to perform a fixed set of tasks, or where the communication pattern is known. This article introduces 3D ant colony routing (3D-ACR) and applies it as routing policy of NoCs having three different 3D topologies: mesh, torus and hypercube. Experimental results show that 3D ant colony routing performs consistently better compared with the previously proposed routing strategies.
引用
收藏
页码:1695 / 1712
页数:18
相关论文
共 50 条
  • [1] Volumetric Degenerative Routing for 3D Network-on-Chip
    Bala, Druhin
    You, Chao
    2012 IEEE INTERNATIONAL CONFERENCE ON WIRELESS INFORMATION TECHNOLOGY AND SYSTEMS (ICWITS), 2012,
  • [2] A Method for Integrating Network-on-chip Topologies with 3D ICs
    Kumar, M. Pawan
    Kumar, Anish S.
    Murali, Srinivasan
    Benini, Luca
    Veezhinathan, Kamakoti
    2011 IEEE COMPUTER SOCIETY ANNUAL SYMPOSIUM ON VLSI (ISVLSI), 2011, : 60 - 65
  • [3] Deflection Routing in 3D Network-on-Chip with TSV Serialization
    Lee, Jinho
    Lee, Dongwoo
    Kim, Sunwook
    Choi, Kiyoung
    2013 18TH ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE (ASP-DAC), 2013, : 29 - 34
  • [4] An Efficient Highly Adaptive and Deadlock-Free Routing Algorithm for 3D Network-on-Chip
    Zeng, Lian
    Pan, Tieyuan
    Jiang, Xin
    Watanabe, Takahiro
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2016, E99A (07) : 1334 - 1344
  • [5] An Adaptive Routing Algorithm Based on Network Partitioning for 3D Network-on-Chip
    Dai, Jindun
    Jiang, Xin
    Watanabe, Takahiro
    2017 INTERNATIONAL CONFERENCE ON COMPUTER, INFORMATION AND TELECOMMUNICATION SYSTEMS (IEEE CITS), 2017, : 229 - 233
  • [6] A Path Optimized Multicast Routing Algorithm for 3D Network-on-Chip
    Liu, Zhaorui
    Wu, Ning
    Zhou, Lei
    Yan, Gaizhen
    WORLD CONGRESS ON ENGINEERING AND COMPUTER SCIENCE, WCECS 2015, VOL I, 2015, : 43 - 48
  • [7] Low-overhead Routing Algorithm for 3D Network-on-Chip
    Ben Ahmed, Akram
    Ben Abdallah, Abderazek
    2012 THIRD INTERNATIONAL CONFERENCE ON NETWORKING AND COMPUTING (ICNC 2012), 2012, : 23 - 32
  • [8] Deflection Routing in 3D Network-on-Chip with Limited Vertical Bandwidth
    Lee, Jinho
    Lee, Dongwoo
    Kim, Sunwook
    Choi, Kiyoung
    ACM TRANSACTIONS ON DESIGN AUTOMATION OF ELECTRONIC SYSTEMS, 2013, 18 (04)
  • [9] A New Recursive Partitioning Multicast Routing Algorithm for 3D Network-on-Chip
    Meena, Narendra Kumar
    Kapoor, Hemangee K.
    Chakraborty, Shounak
    18TH INTERNATIONAL SYMPOSIUM ON VLSI DESIGN AND TEST, 2014,
  • [10] Energy efficient 3D network-on-chip based on approximate communication
    Momeni, M.
    Shahhoseini, H. S.
    COMPUTER NETWORKS, 2022, 203