Latest Deadline First Algorithm for Bandwidth Transfer
Qian Guang-ming · Jisuanji gongcheng · 2013
An algorithm named Latest Deadline First(LDF) is presented to implement the bandwidth transfer at run time in a real-time system scheduled with the Earliest Deadline First(EDF) algorithm if the remaining bandwidth of the system is not enough for new tasks' insertion and/or current tasks acceleration.This algorithm starts from the task with the latest instance deadline so that the times of comparison can be as few as possible before the proper task is found to compress,the bandwidth transfer can be done smoothly as quickly as possible.Simulation experimental results show that the maximum time of comparison of the algorithm is 2n,only one or two comparisons are needed in many cases.