检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]国家数字交换系统工程技术研究中心,郑州450002
出 处:《电子与信息学报》2014年第10期2536-2540,共5页Journal of Electronics & Information Technology
基 金:国家"863"计划项目(2009AA012201);河南省自然科学基金(122300413201)资助课题
摘 要:针对片上网络(NoC)较远距离节点路由跳数较大导致的网络功耗和面积过大问题,该文通过分析Mesh和集中式Mesh(CMesh)结构特性,提出一种基于Mesh的新型层次化CHMesh结构。该结构分两层,底层以Mesh方式互连,并划分为多个路由区域,以保证邻近节点的通信需求,上层以CHMesh方式通过中间节点将底层各个区域进行互连,以降低网络直径。设计了针对性最短路径CHXY路由算法,该算法复杂度低,能够避免死锁。性能分析和仿真实验表明,在非均匀流量模式下,CHMesh结构的吞吐量比传统Mesh和Ref-Mesh分别提高约60%和10%,在较大规模片上网络中更有优势。As the number of modules in System-on-Chip (SoC) increases, the topology is more likely to suffer from excessive end-to-end hop-counts, causing an increase of power consumption and area overhead. Concerning this issue, a novel Mesh-based Hierarchical topology called CHMesh is proposed, which is divided into two levels. The bottom level is interconnected with Mesh and divided into several regions, so as to guarantee communications of adjacent nodes, and the upper level employs intermediate nodes to promote the interconnection among different bottom routing regions with CMesh, so as to decrease the network diameter. Correspondingly, this article elaborates on a shortest-path CHXY routing algorithm, which has a low complexity and can realize deadlock avoidance. Performance analysis and experimental results demonstrate that, compared with traditional Mesh and Ref-Mesh, the CHMesh can increase the average throughput by about 60% and 10% respectively under non-uniform traffic patterns, presenting more advantages on large-scale NoC.
分 类 号:TN47[电子电信—微电子学与固体电子学]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:18.118.82.212