首页> 外文期刊>Very Large Scale Integration (VLSI) Systems, IEEE Transactions on >Adaptive and Deadlock-Free Tree-Based Multicast Routing for Networks-on-Chip
【24h】

Adaptive and Deadlock-Free Tree-Based Multicast Routing for Networks-on-Chip

机译:片上网络的自适应且无死锁的基于树的组播路由

获取原文
获取原文并翻译 | 示例

摘要

This paper presents the first synthesizable network-on-chip (NoC) based on a mesh topology, which supports adaptive and deadlock-free tree-based multicast routing without virtual channels. The deadlock-free routing algorithms for unicast and multicast packets are the same. Therefore, the routing function gate-level implementation is very efficient. Multicast packets are injected to the network by sending multiple packet headers beforehand. The packet headers contain destination addresses to set up multicast trees connecting a source with multiple destination nodes. An additional locally uniform identification (ID) field is packetized together with flits belonging to the same packet. Therefore, flits of different unicast or multicast packets can be interleaved in the same queue because of the local ID-tags, which are updated and mapped dynamically to support bandwidth scalability of interconnection links. Deadlocks in tree-based multicast routing are handled using a flit-by-flit round arbitration and a fair hold–release tagging mechanism. The effectiveness of the novel mechanism has been experimented under multiple multicast conflicts scenarios, where the experimental results show that all traffic is accepted in-order and lossless in their destination nodes even if adaptive routing functions are used and the sizes of the multicast messages are very long.
机译:本文提出了第一个基于网状拓扑的可合成片上网络(NoC),它支持无虚拟通道的自适应和无死锁的基于树的多播路由。单播和多播数据包的无死锁路由算法相同。因此,路由功能门级实现非常有效。通过预先发送多个数据包头,可以将组播数据包注入网络。数据包头包含目标地址,以建立将源与多个目标节点连接的多播树。将附加的本地统一标识(ID)字段与属于同一数据包的碎片打包在一起。因此,由于本地ID标签,可以将不同的单播或多播数据包的分支插入同一队列中,它们会动态更新和映射以支持互连链路的带宽可伸缩性。基于树的多播路由中的死锁使用逐个循环仲裁和公平的保持释放标记机制来处理。在多种组播冲突情况下,对这种新型机制的有效性进行了实验,实验结果表明,即使使用了自适应路由功能,并且组播消息的大小非常大,所有流量仍在其目的节点中按顺序被接受且无损失。长。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号