• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IEEE Transactions on Parallel and Distributed Systems >A Self-Routing on-Chip Network
【24h】

A Self-Routing on-Chip Network

机译：自路由片上网络

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

This paper introduces a new nonblocking self-routing network, called a multi-root binary tree, which may be used to interconnect the cores in multicore chips. The multi-root binary tree network differs from other binary tree-based networks in that the cores are placed at the roots rather than the leaves or the interior nodes of the trees. The self-routing property of a multi-root binary tree is built on the concept of replication and clustering. A new replication and clustering method, called the triangular shift pairing is given to connect the cores together over dedicated paths. It is shown that connecting cores in clusters requires at least n/2 columns of pairings for an n -core network in a grid layout model and triangular shift wiring method matches this lower bound. The replication and clustering concept leads to a simple self-routing scheme that pairs cores by decoding both unicast and multicast connection requests using lgn -bit cluster address bits. In particular, it is established that cores can identify the cluster with which they pair with other cores using simple modulo addition of their own ids and addresses of the targeted cores in 2lgn single bit-decoding steps. It is also shown that, if connection requests are uniformly distributed among the cores then blocking due to target conflicts can be avoided if cores serve connection requests at a small multiple of the frequencies with which they receive them.
机译：本文介绍了一种新的无阻塞自路由网络，称为多根二进制树，可用于互连多核芯片中的内核。多根二叉树网络与其他基于二叉树的网络的不同之处在于，核心位于树的根部，而不是叶或树的内部节点。多根二叉树的自我路由属性建立在复制和群集的概念上。给出了一种新的复制和群集方法，称为三角移位配对，以通过专用路径将内核连接在一起。结果表明，在网格布局模型中，对于n核网络，群集中的连接核至少需要n / 2列配对，并且三角移位布线方法与此下限相匹配。复制和群集概念导致了一种简单的自路由方案，该方案通过使用lgn位群集地址位对单播和多播连接请求进行解码来对内核进行配对。特别地，已经确定，内核可以在2lgn单比特解码步骤中使用其自身的id和目标内核的地址的简单模加来标识与其他内核配对的集群。还表明，如果连接请求在内核之间均匀分布，那么如果内核以接收请求的频率的一小倍来服务连接请求，则可以避免由于目标冲突而造成的阻塞。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号