摘要： 针对可重构系统的任务调度问题，提出一种基于最小裕度优先策略的在线任务预约重调度算法。该算法在任务预约的基础上，对预约失败的任务和已预约的任务按特定优先策略进行重调度。仿真实验结果显示，在正常负载率区间中，该算法有效降低了任务拒绝率，且运行开销较小。
关键词:
在线任务调度,
可重构系统,
预约重调度,
最小裕度优先策略
Abstract: This paper proposes an on-line task reservation reschedule algorithm for reconfigurable system based on Minimum Laxity First(MLF) policy. Based on the task reservation, it reschedules the tasks which fail in previous reservation and tasks which are already reserved, according to certain priority policy. Simulation result shows that under normal system load range, the algorithm effectively reduces the task rejection ratio while keeping runtime overhead manageable.
Key words:
on-line task schedule,
reconfigurable system,
reservation reschedule,
Minimum Laxity First(MLF) policy
中图分类号:
刘沙, 周学功, 王颖, 王伶俐. 可重构系统在线任务预约重调度算法[J]. 计算机工程, 2011, 37(8): 271-274.
LIU Sha, ZHOU Hua-Gong, WANG Ying, WANG Ling-Li. On-line Task Reservation Reschedule Algorithm for Reconfigurable System[J]. Computer Engineering, 2011, 37(8): 271-274.