基于放置代价的可重构系统任务统一调度算法  

Unified task scheduling algorithm of reconfigurable system based on placement cost

作　　者：蔡富强[1] 郭兵[1] 沈艳[2] 王继禾[1] 伍元胜[1] 

机构地区：[1]四川大学计算机学院,成都610065 [2]成都信息工程学院控制工程学院,成都610225

出　　处：《计算机应用》2010年第11期2870-2872,共3页journal of Computer Applications

基　　金：国家863计划项目(2008AA01Z105);四川省杰出青年科技基金资助项目(2010JQ0011)

摘　　要：高效的任务调度算法对可重构系统的性能有极大的影响。针对目前可重构系统任务在线调度算法的不足,提出了一种基于放置代价的调度算法。该算法考虑了3种代价,分别为:硬件任务在FPGA上的执行时间、占用的FPGA面积以及FPGA的碎片情况,并且也考虑了软硬件任务的统一调度。在调度过程中,当代价超过设定的阈值时,就拒绝其在FPGA上运行,并由CPU执行其软实现。通过合理地拒绝一些代价较大的任务,能够从整体上提高任务调度成功率。实验表明,同已有算法相比,该算法能够获得更高的任务截止保证率。High efficient task scheduling algorithms can greatly influence the performance of reconfigurable systems. This paper analyzed the disadvantages of some current on-line reconfigurable system task scheduling algorithms, and proposed a new scheduling algorithm based on placement cost. This scheduling algorithm considered three types of cost, including hardware task execution time in FPGA, occupied FPGA area and fragmentation situation of FPGA, and also considered the unified scheduling of hardware and software tasks. When a hardware task was in scheduling, if the placement cost exceeded the setting threshold value, the task would be rejected to run in FPGA, but its software implementation could run in CPU. By reasonably rejecting some high cost tasks, this algorithm could achieve a higher overall successful scheduling rate. The simulation results show that this scheduling algorithm can achieve a higher deadline-guarantee ratio than others.

关 键 词：可重构系统 调度算法 放置算法 放置代价 硬件任务 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构] TP316[自动化与计算机技术—计算机科学与技术]