首页 | 本学科首页   官方微博 | 高级检索  
     

片上网络拓朴优化:在离散平面上布局与布线
引用本文:马立伟,孙义和.片上网络拓朴优化:在离散平面上布局与布线[J].电子学报,2007,35(5):906-911.
作者姓名:马立伟  孙义和
作者单位:清华大学微电子学研究所,北京 100084
基金项目:国家自然科学基金,高等学校博士学科点专项科研项目
摘    要:微系统芯片(System-on-Chip,SoC)发展到今天,集成密度指数增长和芯片面积的急剧膨胀使得全局连线的延时上升,可靠性下降,成为集成电路的设计瓶颈.片上网络(Network-on-Chip,NoC)是解决整个芯片上数据有效传输的结构之一,以片上网络为基础通信架构的微系统芯片称为片上网上系统芯片(System-on-Network-on-Chip,SoNoC).微系统芯片内通信模式兼有随机性和确定性,应该根据特定应用的通信特征设计片上网络.本文在确定SoNoC设计流程的基础上,根据SoNoC的通信特征,选择了合适的离散平面结构,对SoNoC的运算及控制等模块进行布局、对模块间的通信依赖关系进行布线,发展出FRoD(Floor-plan and Routing on Discrete Plane)算法,以自动生成片上网络的拓扑结构.该算法定义了离散平面的一般表示方法,并在四种典型的离散平面上使用不同规模的随机系统完成了系列实验.为了处理系统和网络之间的耦合关系,逐点分裂的布局算法可以逐步学习和适应系统的通信需求,同时优化系统的执行时间和通信能量,在运行随机任务流图的模拟系统上与随机布局结果相比可以节省30%左右的通信能量,20%左右的系统通信时间.串行、并行和串并混合的布线算法使用最短路径把通信关系分布在离散平面的通道上,使不同的通信关系尽量复用网络通道,与全连接网络相比可以节省10%到30%的面积代价.

关 键 词:微系统芯片  片上网络  片上网上系统芯片  片上网络综合  
文章编号:0372-2112(2007)05-0906-06
收稿时间:2006-08-01
修稿时间:2006-08-012007-01-18

Network-on-Chip Topology Optimizations:Floor-plan and Routing on Discrete Plane
MA Li-wei,SUN Yi-he.Network-on-Chip Topology Optimizations:Floor-plan and Routing on Discrete Plane[J].Acta Electronica Sinica,2007,35(5):906-911.
Authors:MA Li-wei  SUN Yi-he
Affiliation:Institute of Microelectronics,Tsinghua University,Beijing,100084,China
Abstract:As feature size shrinking,integration increasing and chip area expanding,delay and reliability of global wires become the bottleneck of IC design.Network-on-Chips (NoCs) have been proposed as one of the solutions of System-on-Chips (SoCs) communication infrastructure and enable a new SoC paradigm—System-on-Network-on-Chip (SoNoC).Traffic patterns in SoNoC are both stochastic and deterministic;so on-chip networks must be application-specific.Based on SoNoC design flow,a group of algorithms—FRoD (Floor-plan and Routing on Discrete plane) has been proposed.General definition of discrete plane and four discretization methods have been discussed,and the FRoD algorithms have been verified on the four planes.In order to decouple the system requirements and network architectures,the splitting growth floor-plan algorithm has been developed and can save about 30% execution time and 20% transmission energy,compared with random floor-plan results.Sequential,parallel and mixed routing algorithms have been developed to link all the traffic with shortest paths and can save 10%~30% area cost,compared with full-linked networks.
Keywords:network-on-chip  system-on-chip  system-on-network-on-chip  NoC synthesis
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子学报》浏览原始摘要信息
点击此处可从《电子学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号