基于深度优先贪婪搜索的可重构硬件任务划分算法(4)

来源:网络(转载) 作者:陈乃金 发表于:2012-01-26 13:49  点击:
【关健词】可重构计算;时域划分;深度优先贪婪搜索;通信成本;资源约束;
COMPTON K, HAUCK S. Reconfigurable computing: A survey of systems and software [J]. ACM Computing Surveys, 2002, 34(2): 171-210. [2] JOCH A, KOSSENTINI F, SCHWARZ H, et al. Performance comparison

  COMPTON K, HAUCK S. Reconfigurable computing: A survey of systems and software [J]. ACM Computing Surveys, 2002, 34(2): 171-210.
  [2]
  JOCH A, KOSSENTINI F, SCHWARZ H, et al. Performance comparison of video coding standards using Lagrangian coder control [C]// Processing of 2002 IEEE International Conference on Image Processing. Washington, DC: IEEE Computer Society, 2002: 501-504.
  [3]
  CAMPI F, TOMA M, LODI A, et al. A VLIW processor with reconfigurable instruction set for embedded applications [J]. IEEE Journal of Solid-State Circuits, 2003, 38(11): 1876-1886.
  [4]
  do NASCIMENTO P S B, de MEDEIROS V W C, SOUZA V L S, et al. A temporal partitioning methodology for reconfigurable high performance computers [C]// Proceedings of the 2008 International Conference on Reconfigurable Computing and FPGAs. Washington, DC: IEEE Computer Society, 2008: 307-312.
  [5]
  KEJARIW A, VEIDENBAUM A V, NICOLAU A, et al. Challenges in exploitation of loop parallelism in embedded applications [C]// Proceedings of the 4th International Conference on Hardware/Software Codesign and System Synthesis. New York: ACM Press, 2006: 173-180.
  [6]
  do NASCIMENTO P S B, de LIMA M E. Temporal partitioning for image processing based on time-space complexity in reconfigurable architecture [C]// DATE06: Proceedings of the Conference on Design, Automation and Test in Europe. Washington, DC: IEEE Computer Society, 2006: 375-380.
  [7]
  陈乃金,江建慧,陈昕,等.动态可重构系统的时域划分及其行为级算法的定量分析[J].小型微型计算机系统,2011,32(2):328-332.
  [8]
  OU C-W, RANKA S. Parallel incremental graph partitioning [J]. IEEE Transactions on Parallel and Distributed Systems, 1997, 8(8): 884-896.
  [9]
  陈伟男,周博,彭澄廉.概率构造算法与遗传算法融合的可重构计算系统硬件任务划分[J].计算机辅助设计与图形学学报,2007,19(8):960-965.
  [10]
  ZHANG X J, NG K W. A temporal partitioning approach based on reconfiguration granularity estimation for dynamically reconfigurable systems [C]// Proceedings of the 2nd IEEE International Conference on Field-Programmable Technology. Washington, DC: IEEE Computer Society, 2003: 344-347.
  [11]
  PURNA K M G, BHATIA D. Temporal partitioning and scheduling data flow graphs for reconfigurable computers [J]. IEEE Transactions on Computers, 1999, 48(6): 579-590.
  [12]
  周博,邱卫东,谌勇辉,等.基于簇的层次敏感的可重构系统任务划分算法[J].计算机辅助设计与图形学学报,2006,18(5):667-673.
  
  收稿日期:2011-07-28;修回日期:2011-09-22。
  
   基金项目:国家863计划项目(2009AA011705);芜湖市科技计划自然科学资金资助项目(芜科计字[2009]190号);安徽省教育厅自然科学资金资助项目(KJ2007B247, KJ2010B018);安徽省高等学校青年教师科研资助计划自然科学基金资助项目(2007jq1086)。
  
  作者简介:
  陈乃金(1972-),男,安徽合肥人,讲师,博士研究生,主要研究方向:可重构计算、时域划分。
 

(责任编辑:南粤论文中心)转贴于南粤论文中心: http://www.nylw.net(南粤论文中心__代写代发论文_毕业论文带写_广州职称论文代发_广州论文网)
顶一下
(0)
0%
踩一下
(0)
0%


版权声明:因本文均来自于网络,如果有版权方面侵犯,请及时联系本站删除.