Logic-based distributed routing for NoCs

被引:45
作者
Parallel Architectures Group, Technical University of Valencia, Spain [1 ]
机构
[1] Parallel Architectures Group, Technical University of Valencia
来源
IEEE Comput. Archit. Lett. | 2008年 / 1卷 / 13-16期
关键词
Design constraints - Distributed routing - Efficient routing - Heterogeneous cores - Irregular topology - Manufacturing defects - Power-efficient routing - Practical topology;
D O I
10.1109/L-CA.2007.16
中图分类号
学科分类号
摘要
The design of scalable and reliable interconnection networks for multicore chips (NoCs) introduces new design constraints like power consumption, area, and ultra low latencies. Although 2D meshes are usually proposed for NoCs, heterogeneous cores, manufacturing defects, hard failures, and chip visualization may lead to irregular topologies. In this context, efficient routing becomes a challenge. Although switches can be easily configured to support most routing algorithms and topologies by using routing tables, this solution does not scale in terms of latency and area. We propose a new circuit that removes the need for using routing tables. The new mechanism, referred to as Logic-Based Distributed Routing (LBDR), enables the implementation in NoCs of many routing algorithms for most of the practical topologies we might find in the near future in a multicore chip. From an initial topology and routing algorithm, a set of three bits per switch output port is computed. By using a small logic block, LBDR mimics (demonstrated by evaluation) the behavior of routing algorithms implemented with routing tables. This result is achieved both in regular and irregular topologies. Therefore, LBDR removes the need for using routing tables for distributed routing, thus enabling flexible, fast and power-efficient routing in NoCs.
引用
收藏
页码:13 / 16
页数:3
相关论文
共 11 条
  • [1] Bolotin E., Cidon I., Ginosar R., Kolodny A., Routing Table Minimization for Irregular Mesh NoCs, Design, Automation and Test in Europe Conference (DATE), (2007)
  • [2] Borkar S., et. al., iWarp: An Integrated Solution to High-Speed Parallel Computing, Supercomputing Conference, (1988)
  • [3] Flich J., Mejia A., Lopez P., Duato J., Region-Based Routing: An Efficient Routing Mechanism to Tackle Unreliable Hardware in Networks on Chip, First International Symposium on Networks on Chip (ISNOC), (2007)
  • [4] Gelernter D., A DAG-based algorithm for prevention of store-and-forward deadlock in packet networks, IEEE Transactions on Computers, 30, 10, pp. 709-715, (1981)
  • [5] Glass C., Ni L., The Turn Model for Adaptive Routing, International Conference on Computer Architecture (ISCA), (1992)
  • [6] Gomez M.E., Et al., A Memory Effective Routing Strategy for Regular Interconnection Networks, International Parallel and Distributed Symposium (IPDPS), (2005)
  • [7] Noxim: NoC simulator
  • [8] Palesi M., Kumar S., Holsmark R., A Method for Router Table Compression for Application Specific Routing in Mesh Topology NoC Architectures, Embedded Computer Systems: Architectures, Modeling, and Simulation, (2006)
  • [9] Hoskote Y., Vangal S., Singh A., Borkar N., Borkar S., A 5-GHz Mesh Inte rconnect for a Teraflops Processor, IEEE Micro Magazine, pp. 51-61, (2007)
  • [10] Sancho J.C., Robles A., Duato J., A Flexible Routing Scheme for Networks of Workstations, High Performance Computing Conference (ISHPC), (2000)