A New Online Scheduling Algorithm of Reconfigurable Tasks for Differentiated Service

In existing online scheduling algorithms of reconfigurable tasks,such as first coming first serviced and planning scheduling,the scheduling sequence is determined by the arrival time of the tasks,ignoring the priorities of different tasks and the temporal relations among the sequential tasks.This paper presents a new online scheduling algorithm with planning preempted method,which realizes the differentiation of the scheduling process by distinguishing different priority and urgency of the tasks.By invalidating the task's planned scheduling,the new tasks with higher priority or higher urgency can be scheduled earlier than others.Hence preemptive scheduling in the queue of planned tasks can be achieved.Experiments show that this algorithm gains a considerable improvement in the total scheduling success rate,and the success rate of higher priority tasks' scheduling can be ensured.