An Abstraction to Support Design of Deadlock-free Routing Algorithms for Large and Hierarchical NoCs
An Abstraction to Support Design of Deadlock-free Routing Algorithms for Large and Hierarchical NoCs
复制标题
支持大型分层 NoC 无死锁路由算法设计的抽象
DOI：
--
复制
发表时间：
2011
期刊：
影响因子：
--
通讯作者：
Shashi Kumar
中科院分区：
文献类型：
--
作者：
Rickard Holsmark;Shashi Kumar
需要新的技术和工具来处理构建具有数百个内核的多核平台所需的片上网络的复杂性。在电子系统的设计和分析中有用的层次和抽象的概念，在网络设计领域也将是有用的。在本文中，我们提出了一个抽象的网络，以减少复杂的设计和分析的无死锁路由的大型和层次化的网络。提高抽象级别必然会导致某些信息的丢失。与在较低抽象级别上考虑网络时相比，这种信息的丢失反过来通常会导致设计性能的损失。我们表明，我们提出的抽象导致非常小的性能损失。特别是，我们表明，通信距离（跳数）的平均增加是低或非抽象的设计。我们基于模拟的评估表明，抽象路由设计对消息延迟没有负面影响。相反，抽象路由显示出轻微的优势，如果更多的网络通信是本地的，并限制在子网内，这种优势就会增加。
New techniques and tools will be required to handle the complexity of on-chip networks required for building multi-core platforms with hundreds of cores. The concepts of hierarchy and abstraction, which have been useful in the design and analysis of electronic systems, will also be useful in the network design area. In this paper we propose an abstraction for networks to reduce the complexity of design and analysis of deadlock-free routing for large and hierarchical networks. Raising the level of abstraction necessarily leads to loss of some information. This loss of information in turn often results in loss of performance of the design as compared to when the network was considered at a lower level of abstraction. We show that our proposed abstraction leads to very small loss of performance. In particular, we show that average increase in communication distance (hops) is low or comparable to non-abstract design. Our simulation-based evaluation indicates that abstract routing design has no negative impact on message latency. On the contrary, abstract routing shows a slight advantage, which increases if more network communication is local and confined within subnets.