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

树拓扑片上网络的低能耗映射
引用本文:常政威,桑楠,熊光泽.树拓扑片上网络的低能耗映射[J].电子科技大学学报(社会科学版),2010(4).
作者姓名:常政威  桑楠  熊光泽
作者单位:四川电力试验研究院;电子科技大学计算机科学与工程学院;
基金项目:国家863项目(2006AA01Z173,2007AA01Z131)
摘    要:针对树拓扑片上网络(NoC)中通信时延受约束的低能耗映射问题,提出了一种递归的二路划分算法RPM(recursive bipartitioning for mapping)。RPM基于分而治之策略,首先将NoC映射转化为多层次的IP核通信任务图划分问题,并采用带参数的Kernighan-Lin算法实现最小割值划分。实验结果表明,与已有算法相比,RPM可以在较短的时间内获得能耗更低的映射解。通过设置不同的参数,RPM既可以用于生成高质量的优化解,也可用于快速的NoC设计空间探索中。

关 键 词:二路划分  能耗优化  映射  片上网络  树拓扑  

Low Energy Mapping for Tree Based Networks-on-Chip
CHANG Zheng-wei,SANG Nan, XIONG Guang-ze.Low Energy Mapping for Tree Based Networks-on-Chip[J].Journal of University of Electronic Science and Technology of China(Social Sciences Edition),2010(4).
Authors:CHANG Zheng-wei  SANG Nan    XIONG Guang-ze
Institution:CHANG Zheng-wei1,SANG Nan2,, XIONG Guang-ze2 (1. Sichuan Electric Power Tests , Research Institute Chengdu 610072,2. School of Computer Science , Engineering,University of Electronic Science , Technology of China Chengdu 610054)
Abstract:A recursive bipartitioning algorithm,RPM,is proposed for low energy mapping in tree-based Network-on-Chip (NoC) architectures subject to communication latency constraints. The mapping problem is formulated to multi-level IP core communication task graph partitioning problems,and the modified Kernighan-Lin mincut heuristic is used to solve them. Experimental results show that RPM obtains lower energy mapping solutions compared with existing algorithms.
Keywords:bipartitioning  energy optimization  mapping  networks-on-chip  tree based topology  
本文献已被 CNKI 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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