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

摘要

提出了一种基于三维空间邻接度的放置算法,该算法将硬件任务按照长、宽及调度时间构成一个三维资源模型,将每个硬件任务看成是一个空间块.首先对可重构资源进行编码,到达的任务总是通过某个顶点依附另一个任务的边界被放置,确定候选的放置顶点;然后以到达任务与已放置在三雏空间的邻接度为代价函数,选择代价函数值最大的顶点放置任务,从而使得到达任务与已放置任务在三维空间接触的邻接面最大.可使任务安排得更紧凑,减小对系统资源的浪费,提高芯片利用率.%This paper considered the hardware tasks in accordance with the length, width and scheduling time to form a threedimensional 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.