可重构系统中基于空间邻接度的实时任务放置算法  

Real-time task placement algorithm of reconfigurable system based on space adjacency degree

作　　者：焦铬[1,2] 李仁发[2] 李浪[1,2] 陈坚祯[1] 邹祎[1] 彭日光[2] 

机构地区：[1]衡阳师范学院计算机科学系,湖南衡阳421008 [2]湖南大学计算机与通信学院,长沙410082

出　　处：《计算机应用研究》2011年第4期1290-1292,1295,共4页Application Research of Computers

基　　金：国家"863"计划资助项目(2007AA01Z104);湖南省教育厅科研资助项目(10C0488)

摘　　要：提出了一种基于三维空间邻接度的放置算法,该算法将硬件任务按照长、宽及调度时间构成一个三维资源模型,将每个硬件任务看成是一个空间块。首先对可重构资源进行编码,到达的任务总是通过某个顶点依附另一个任务的边界被放置,确定候选的放置顶点;然后以到达任务与已放置在三维空间的邻接度为代价函数,选择代价函数值最大的顶点放置任务,从而使得到达任务与已放置任务在三维空间接触的邻接面最大。可使任务安排得更紧凑,减小对系统资源的浪费,提高芯片利用率。This paper considered the hardware tasks in accordance with the length,width and scheduling time to form a three-dimensional resource model,each hardware-task as a space block,vertex-based task management list.First selected the value of a unit volume of space for large blocks,then put the container back to space,in the place of space block,occupied a certain angle,and the movement of space adjacent to a large degree as far as possible from all vertices in a viable location,chose the best vertex to place the task.It made task arrangement more compact,reduced the waste of system resource and improved chip utilization.

关 键 词：动态可重构 放置算法 代价函数 空间邻接度 

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