摘要
针对FPGA可重构设计过程中会产生大量空闲碎片的问题,设计一种针对FPGA可重构设计的碎片合并算法。重点研究可重构设计中空闲碎片合并算法以及合并之后正在运行的任务重新定位的策略。对给出的碎片合并原则及资源定位策略进行详细分析,并通过建模给出证明过程。最后,进行实验测试,测试结果表明,对于1000个连续产生的随机任务进行碎片合并之后,所有任务一次申请资源成功率达到87.4%,等待一个任务结束之后资源申请成功率达到95.4%。
In FPGA reconfigurable design process,it will produce a lot of free fragments,in light of this problem,we design a fragment merging algorithm aiming at the FPGA reconfigurable design,the emphasis of the study puts on the free fragments merging algorithm in reconfigurable design and the re-positioning policy of running tasks after merging.We also elaborately analyse the fragment merging principle and the resource location policy,and provide the testifying process through modelling.At last,the experimental test is carried out,its result shows,after merging the fragment of 1000 continuously produced random tasks,the success rate of the one-off resource application in all tasks reaches 87.4%,and the success rate of resource application after the finish of one task reaches 95.4%.
出处
《计算机应用与软件》
CSCD
北大核心
2013年第5期197-199,共3页
Computer Applications and Software
基金
2011年广西教育厅科研课题(200103YB168)
关键词
重构
FPGA
碎片合并
资源定位
任务预测
Reconfiguration FPGA Fragment merge Resource location Task prediction
