首页> 外文会议>World summit on genetic and evolutionary computation;2009 GEC Summit >Case Study of Finite Resource Optimization in FPGA Using Genetic Algorithm
【24h】

Case Study of Finite Resource Optimization in FPGA Using Genetic Algorithm

机译:基于遗传算法的FPGA有限资源优化案例研究

获取原文

摘要

Modern Field-Programmable Gate Arrays (FPGAs) are becoming very popular in embedded systems and high-performance applications. FPGA has benefited from the shrinking of transistor feature size, which allows more on-chip reconfigurable (e.g. memories and look-up tables) and routing resources. Unfortunately, the amount of reconfigurable resources in a FPGA is fixed and limited. This paper investigates an application-mapping scheme in FPGA by utilizing sequential processing units and task specific hardware. Genetic Algorithm is used in this study. We found that placing sequential processor cores into FPGA can improve the resource utilization efficiency and achieved acceptable system performance. In this paper, two cases were studied to determine the trade-off between resource optimization and system performance.
机译:现代现场可编程门阵列(FPGA)在嵌入式系统和高性能应用中变得非常流行。晶体管特性尺寸的缩小使FPGA受益匪浅,它可以提供更多的片上可重配置(例如存储器和查找表)和路由资源。不幸的是,FPGA中可重新配置的资源数量是固定的且有限的。本文通过利用顺序处理单元和任务特定的硬件,研究了FPGA中的应用程序映射方案。在这项研究中使用了遗传算法。我们发现将顺序处理器内核放入FPGA可以提高资源利用效率并达到可接受的系统性能。本文研究了两种情况,以确定资源优化与系统性能之间的权衡。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号