摘要： 针对动态可重构系统中为新到达任务安排任务启动时间和放置位置的问题，提出一种基于顶点链表的Look-aheadest算法。将任务调度的时间作为时间维，通过已到达任务与已放置任务在三维空间的邻接面构建代价函数，获取具有最大代价函数值的放置位置和启动时间，使硬件任务放置更为紧凑，提高调度成功率。仿真结果表明，在可接受的运行开销内，该算法能有效提高任务接受率。

关键词: 动态可重构, 任务顶点, 邻接面, 代价函数

Abstract: Finding the available start time and empty space for arrival tasks on FPGAs with runtime partially reconfigurable abilities is the most important phase in on-line schedule algorithm. This paper proposes the Look-aheadest algorithm based on vertexes of the already running tasks. It takes schedule time of tasks as the time dimension, constructs a cost function according to the adjacent surface of the arrival tasks and placed tasks, gets the location and starting time that have the maximum cost function value to schdule the arrival tasks. By utilizing the temporal information and optimized place strategy, the proposed algorithm achieves high schedule performance and reduces the waste of reconfigurable resources. Simulation results show that the proposed algorithm can achieve higher task accept ratio, and the runtime efficiency is acceptable.

Key words: dynamic reconfigurable, task vertexes, adjacent surface, cost function

中图分类号: 

• N945