期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

基于虚拟冲突阵列的片上网络路由单元设计

Design of Network on Chip Routing Units Based on Virtual Conflict Array
下载PDF
导出
摘要 片上网络(NoC)路由单元共享输入缓存区,只允许顺序访问数据,使片上通信的速度和效率受到限制。为提高NoC的并行性,提出一种基于虚拟冲突阵列的路由单元体系结构。在数据进入路由单元流水线之前,在虚拟冲突阵列中对串行的数据请求进行部分消除,以降低路由单元流水线的传输数据量,提高系统的并行性。实验结果表明,与传统虚拟通道路由单元相比,引入虚拟冲突阵列的路由单元能够有效缩短路由延迟。 Network on Chip(NoC) routing units share the input buffers and only allow sequential access to data,which limits the speed and efficiency of communication on chip.To improve the parallelism of NoC,a routing units architecture based on virtual conflict array is proposed.Before data enters the pipeline of routing units,serial data requests are partially eliminated in the virtual conflict array to reduce the amount of data transmitted by pipeline of routing units and improve the parallelism of the system.Experimental results show that compared with the traditional virtual channel routing units,the routing units with virtual conflict array can effectively shorten the routing delay.
作者 杨天浩 孙晋 YANG Tianhao;SUN Jin(School of Computer Science and Engineering,Nanjing University of Science and Technology,Nanjing 210094,China)
机构地区 南京理工大学计算机科学与工程学院
出处 《计算机工程》 CAS CSCD 北大核心 2019年第7期54-59,共6页 Computer Engineering
基金 国家自然科学基金(61502234) 江苏省自然科学基金(BK20150785)
关键词 片上网络 路由单元体系结构 虚拟冲突阵列 路由延迟 消除率 Network on Chip(NoC) routing unit architecture virtual conflict array routing delay elimination rate
分类号 U412.6 [交通运输工程—道路与铁道工程]
  • 相关文献

参考文献3

二级参考文献23

  • 1ADDO-QUAYE C. Thermal-aware mapping and place- ment for 3-D NoC designs [C] // Proceedings of the 2005 IEEE International SOC Conference. Piscataway, NJ, USA: IEEE, 2005: 25-28.
  • 2SINGH A K, WU Jigang, PRAKASH A, et al. Map- ping algorithms for NoC-based heterogeneous MPSoC platforms [C] // Proceedings of the 12th Euromiero Conference on Digital System Design, Architectures, Methods and Tools. Piseataway, NJ, USA: IEEE, 2009: 133-140.
  • 3TOPCUOGLU H, HARIRI S, WU Minyou. Per- formance-effective and low-complexity task scheduling for heterogeneous computing [J]. IEEE Transactions on Parallel and Distributed Systems, 2002, 13 (3): 260-274.
  • 4DAOUD M I, KHARMA N. Efficient compile-time task scheduling for heterogeneous distributed compu- ting systems [C] // Proceedings of the 12th Interna- tional Conference on Parallel and Distributed Systems. Piscataway, NJ, USA: IEEE Computer Society, 2006 : 1-9.
  • 5WU Minyou, GAJSKI D D. Hypertool: a program- ruing aid for message-passing systems [J ]. IEEE Transactions on Parallel and Distributed Systems, 1990, 1(3): 330 -343.
  • 6CHUNG Y C, RANKA S. Applications and perform- ance analysis of a compile-time optimization approach for list scheduling algorithms on distributed memory muhiprocessors [C]//Proceedings of the Supercomput- ing '92. Piseataway, NJ, USA: IEEE, 1992: 512-521.
  • 7ANMAD I, KWORK Y K. A new approach to sched- uling parallel programs using task duplication [C]// Proceedings of the International Conference on Parallel Processing. Piscataway, NJ, USA: IEEE, 1994: 47- 51.
  • 8SAYUTI M N S M, INDRUSIAK L S. Real-time low- power task mapping in networks-on-chip [C]//Pro- ceedings of the 2013 IEEE Computer Society Annual Symposium on VLSI. Piseataway, NJ, USA: IEEE, 2013: 14-19.
  • 9FERRANDI F, LANZI P L, PILATO C, et al. Ant colony heuristic for mapping and scheduling tasks and communications on heterogeneous embedded systems [J]. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2010, 29 (6) : 911- 924.
  • 10SILVA L, NEDJAH N, MOURELLE L. ACO ap- proach in static routing for network-on-chips with 3D mesh topology [C]//Proceedings of the 2013 IEEE 4th Latin American Symposium on Circuits and Systems. Piscataway, NJ, USA: IEEE, 2013: 1-4.

共引文献10

计算机工程
2019年 第7期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部