基于FPGA可重构设计中资源动态分配算法研究  

Research on Resources Dynamic Allocation Algorithm Based on FPGA Reconfiguration Design

作　　者：李可长[1] 

机构地区：[1]柳州职业技术学院,广西柳州545006

出　　处：《柳州职业技术学院学报》2012年第3期52-56,共5页Journal of Liuzhou Vocational & Technical College

基　　金：2011年度广西高等学校科研资助项目(200103YB168)

摘　　要：针对可重构计算中对FPGA逻辑资源动态分配问题开展了深入的研究,详细分析了再FPGA上实现可重构设计问题时资源动态分配的常用策略。提出了一种基于局部最优性的资源动态分配算法,该算法既考虑了资源动态分配的最优化特点,同时也综合了算法实现难度和任务可重构实现等待延时等主要因素,经测试表明,本文提出的资源动态分配算法资源利用率平均可达到60%以上,任务加载平均延时为3.5毫秒,总体性能优于传统的资源分配算法。After deeply studied the dynamic allocation of the logical resources in FPGA of reconfigurable computing and detailed analyzed the common strategies in solving this problem, a dynamic allocation algo- rithm based on locally optimal solution has been proposed. This algorithm not only takes the optimization of the dynamic allocation into account, but also considers the factors such as the difficulties and the time delay in realizing the algorithm. The test result shows that the availability of resources can achieve more the 60%, and the average time delay is 3.5ms, performing better than the traditional resources allocation al- gorithm.

关 键 词：可重构计算 FPGA逻辑资源:分配策略. 

分 类 号：TN791[电子电信—电路与系统]