搜索路径优化的可重构系统资源管理算法  

Resources management scheme with search route optimization for reconfigurable computing system

作　　者：袁虎[1] 吴强[1] 李仁发[1] 陈宇[1] 刘彦[1] 

机构地区：[1]湖南大学计算机与通信学院,长沙410082

出　　处：《计算机应用研究》2009年第10期3669-3672,共4页Application Research of Computers

基　　金：国家"863"计划资助项目(2007AA01Z104)

摘　　要：提出一种基于二维资源模型的边界—跳跃(border-jump,BJ)算法,能够在不影响放置优化效果的前提下提高搜索速度。同时引入邻接面积TAA(total adjacent area)作为放置优化的重要依据,减少了资源碎片,提高了芯片负载能力。实验结果表明,与已有算法相比,该算法在运行时间和任务调度成功率上都有较好的表现。This paper proposed a border-jump algorithm based on two-dimensional resource model, which could increase the running speed without affecting the placement optimization. At the same time, introduced TAA as an important indicator of the placement optimization. It reduced resources debris and improved chip load capacity. Compared with existing algorithms, the proposed algorithm has better performance in the running time and the rate of successful scheduling.

关 键 词：可重构计算系统 任务接受区域 邻接面积 边界-跳跃算法 放置优化 

分 类 号：TP316.4[自动化与计算机技术—计算机软件与理论]