作　　者： ; ; ; (梁）;

机构地区： 复旦大学信息科学与工程学院计算机与信息技术系

出　　处： 《计算机辅助设计与图形学学报》 2007年第5期635-641,共7页

摘　　要： 在对可重构硬件资源进行抽象的基础上,采用软硬件混合任务有向无环图来描述应用,提出一种基于列表的混合任务调度算法.该算法通过任务计算就绪顺序及可重构资源状态确定硬件任务的动态预配置优先级,按此优先级进行硬件任务预配置,隐藏硬件任务的配置时间,从而获得硬件任务运算加速.实验结果表明,针对可重构系统中的软硬件混合任务调度,能够有效地降低配置时间对应用执行时间的影响. Based on the abstract model of reconfigurable hardware resources, we use Hybrid Tasks Directed Acyclic Graph （HTDAG） to describe an application and propose a list scheduling algorithm. By the computation of ready sequences of tasks and the status of reconfigurable hardware resources, this algorithm determines the dynamic pre-configuration priorities of hardware tasks and pre-configures hardware tasks according to their priorities. It hides the configuration latency through pre-configuration, and achieves the acceleration result. Experimental results indicate that the algorithm is able to reduce configuration overhead and shorten the total execution time for hybrid task scheduling in reconfigurable system.

关 键 词： 可重构计算 配置 有向无环图 混合任务调度

领　　域： [自动化与计算机技术] [自动化与计算机技术]