摘要
在对可重构硬件上的空闲资源进行管理时,采用平面划分算法寻找最大空闲矩形存在冗余计算和重复计算的问题.为此,文中提出了一种基于虚拟无向图的计算最大空闲矩形的算法.该算法基于FPGA二维区域模型,利用无向图与FPGA模型之间的相互映射关系,通过在虚拟无向图中寻找有效回路和通路间接完成寻找最大空闲矩形的任务,使空闲区域划分过程大大简化.最后,文中通过仿真实验对比了该方法与已有的SL算法的性能,结果表明,KAMER_VU算法有效降低了系统硬件布局时间,提高了为任务分配硬件资源的成功率.
In order to avoid the redundancy and duplication when using the plane partition algorithm to find all maximal empty rectangles,an algorithm based on virtual undigraph marked as KAMER_VU is proposed to manage the reconfigurable empty hardware resources.Based on the FPGA of two-dimension region,the algorithm uses the mapping between the undigraph and the FPGA model and indirectly finds all maximal empty rectangles by looking for effective loop and pathway in the virtual undigraph,thus simplifying the partition of free region.Some simulations are then performed to make a comparison between the proposed algorithm and the existing SL algorithm.The results indicate that KAMER_VU effectively saves time for hardware distribution and increases the success probabi-lity of hardware allocation for task.
出处
《华南理工大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
2010年第11期91-95,共5页
Journal of South China University of Technology(Natural Science Edition)
基金
黑龙江省自然科学基金资助项目(B2007-07)
齐齐哈尔市工业攻关项目(GYGG-09009)
