期刊文献+

基于遗传蚁群算法的片上网络映射研究 被引量:8

Research of Network on Chip Mapping Based on Genetic and Ant Colony Algorithm
下载PDF
导出
摘要 基于2DMesh结构的片上网络在设计之初就要考虑模块映射问题,以满足通信功耗的约束。提出一种基于遗传蚁群映射算法的方法解决片上网络设计中通信功耗最小化问题。该算法针对标准蚁群算法易于出现早熟停滞等缺陷,引入轮盘赌选择机制及染色体杂交等手段,使映射功耗函数快速收敛,达到良好的全局寻优效果。 At the beginning of Network on Chip(NoC) design, cores of mapping are considered based on 2D Mesh topology such that the communication energy constraint is satisfied. A Genetic And Ant Colony(GAAC) mapping algorithm is presented to solve NoC design problem with an objective of minimizing the communication energy. To solve the problem that the ant colony algorithm often gets stock into premature stagnation in the iteration process, roulette wheel selection and crossover of chromosome are introduced to improve the result of energy-aware mapping function fast converged and optimized solution.
出处 《计算机工程》 CAS CSCD 北大核心 2010年第22期262-264,共3页 Computer Engineering
基金 江苏省专用集成电路设计重点实验室开放课题基金资助项目(JSICK0801) 南通大学自然科学基金资助项目(07Z122)
关键词 片上网络 遗传蚁群映射算法 轮盘赌选择 染色体杂交 Network on Chip(NoC) Genetic And Ant Colony(GAAC) mapping algorithm roulette wheel selection crossover of chromosome
  • 相关文献

参考文献8

  • 1Benini L, Micheli G D. Networks on Chips: A New SoC Paradigm[J]. IEEE Computer Magazine, 2002, 35(1): 70-78.
  • 2Dally W J, Towles B. Route Packets, Not Wires: On-chip Interconnectlon Networks[C]//Proc. of Design Automation Conf.. Las Vegas, NV, USA: [s. n.], 2001: 684-689.
  • 3Kumar S J, Sch A, Soininen J, et al. A Network on Chip Architecture and Design Methodology[C]//Proc. of IEEE Computer Society Annual Symposium on VLS1. [S. l.]: IEEE Press, 2002: 105-112.
  • 4Hu Jingcao, Marculescu R. Energy-aware Communication and Task Scheduling for Network on Chip Architectures Under Real-time Constraints[C]//Proc. of DATE'04. Paris, France: IEEE ComputerSociety, 2004: 234-239.
  • 5Lei Tang, Kumar S. A Two-step Genetic Algorithm for Mapping Task Graphs to a Network on Chip Architecture[C]//Proc. of the Euromicro Symposium on Digital System Design. [S. l.]: IEEE Press, 2003: 180-187.
  • 6Ascia G, Catania V, Palesi M. An Evolutionary Approach to Network on Chip Mapping Problem[C]//Proc. of 2005 1EEE Congress on Evolutionary Computation. [S. l.]: IEEE Press, 2005:112-119.
  • 7杨盛光,李丽,高明伦,张宇昂.面向能耗和延时的NoC映射方法[J].电子学报,2008,36(5):937-942. 被引量:46
  • 8Ni L M, McKinley P K. A Survey of Wormhole Routing Techniques in Direct Networks[J]. Computer, 1993, 26(2): 62-76.

二级参考文献15

  • 1吴春明,陈治,姜明.蚁群算法中系统初始化及系统参数的研究[J].电子学报,2006,34(8):1530-1533. 被引量:47
  • 2Hu J, Marculescu R. Energy-aware communication and task scheduling for network-on-chip architectures under real-time constraints[ A ]. Proc DATE' 04[ C]. Paris:IEEE, 2004. 234 - 239.
  • 3Nickray M,Dehyadgari M, Afzali-kusha. Power and delay optimizalion for network on chip [ A ]. ECCTD ' 05[C ]. Cork, Ireland: IEEE, 2005.273 - 276.
  • 4Tang Lei, Shashi Kumar. A two-step genetic algorithm for mapping task graphs to a network on chip architecture[A]. DSD'03 [ C ]. Antalya, Turkey:IEEE., 2003. 180 - 187.
  • 5Zhou W B, Zhang Y, Mao Z G. An application specific NoC mapping for optimized delay [ A]. DTIS 2006 [ C ]. Gammarth, Tunisia: IEEE,2006. 184- 188.
  • 6Marcon C, Calazans N, et al. Exploring NoC mapping strategies:an energy and timing aware technique[ A]. DATE' 2005 [ C]. Munich, Germany: IEEE, 2005.1. 502 - 507.
  • 7Ye T T, Benini L, Micheli G De. Analysis of power consumption on switch fabrics in network reuters[ A]. DAC' 02[C]. New Orleans, LA: ACM Press, 2002. 524 - 529.
  • 8Maniezzo V, Colomi A. The ant system applied to the quadratic assignment problem[ J]. IEEE Tran on Knowledge and Data Engineering, 1999,11(9) :769 - 778.
  • 9Maniezzo V, Colomi A. The ant system applied to the quadratic assignment problem[J]. IEEE Transactions on Knowledge and Data Engineering, 1999, 11(5) :769 - 778.
  • 10Sttltzle T, Dorigo M. ACO Algorithms for the Quadratic Assignment Problem, New Ideas in Optimization[ M ]. McGraw- Hill, 1999.

共引文献45

同被引文献55

引证文献8

二级引证文献29

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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