Low Latency and Energy Efficient Scalable Architecture for Massive NoCs Using Generalized de Bruijn Graph
Low Latency and Energy Efficient Scalable Architecture for Massive NoCs Using Generalized de Bruijn Graph
复制标题
DOI：
10.1109/tvlsi.2010.2050914
复制
发表时间：
2011-08
影响因子：
2.8
通讯作者：
Mohammad Hosseinabady;M. R. Kakoee;J. Mathew;D. Pradhan
中科院分区：
文献类型：
--
作者：
Mohammad Hosseinabady;M. R. Kakoee;J. Mathew;D. Pradhan
在单芯片中使用数千个核心是处理复杂应用（例如图形和多媒体处理中使用的应用）不断提高的性能要求的自然趋势。基于片上网络（NoC）的片上系统（SoC）平台可能是部署具有数千个内核的大型多核设计的可行选择。本文提出了广义二进制de Bruijn（GBDB）图作为一个可靠的和有效的网络拓扑结构的大型片上网络。我们提出了一个可靠的路由算法绕道两个相邻的交换机之间的故障通道。此外，使用整数线性规划，我们提出了一个最佳的基于瓦片的实现GBDB的NoC中的通道的数量是小于环，其中具有相同数量的链接。我们的实验结果表明，广义de Bruijn图的延迟和能量消耗远远低于Mesh和Torus。基于de Bruijn图的NoC的低能耗使其适用于必须在有限电池上操作的便携式设备。此外，门级实现所提出的可靠路由显示小面积，功率和时序开销，由于所提出的可靠路由算法。
Employing thousands of cores in a single chip is the natural trend to handle the ever increasing performance requirements of complex applications such as those used in graphics and multimedia processing. System-on-chips (SoCs) platforms based on network-on-chips (NoCs) could be a viable option for the deployment of large multicore designs with thousands of cores. This paper proposes the generalized binary de Bruijn (GBDB) graph as a reliable and efficient network topology for a large NoC. We propose a reliable routing algorithm to detour a faulty channel between two adjacent switches. In addition, using integer linear programming, we propose an optimal tile-based implementation for a GBDB-based NoC in which the number of channels is less than that of Torus which has the same number of links. Our experimental results show that the latency and energy consumption of the generalized de Bruijn graph are much less than those of Mesh and Torus. The low energy consumption of a de Bruijn graph-based NoC makes it suitable for portable devices which have to operate on limited batteries. Also, the gate level implementation of the proposed reliable routing shows small area, power, and timing overheads due to the proposed reliable routing algorithm.