Preemptive task scheduling algorithm based on availability in heterogeneous systems
异构系统中一种基于可用性的抢占式任务调度算法

Most existing scheduling algorithms designed for heterogeneous systems do not factor in availability requirements imposed by multiclass tasks especially preemptive tasks. To remedy this shortcoming, based on the existing scheduling algorithm, this paper researched into the scheduling problem for multiclass preemptive tasks running in heterogeneous systems with availability constraints. In an effort to explore this issue, the paper calculated the average waiting time to give prioty to each node, and improved the existing algorithm to work under the preemptive model.This paper proposed a preemptive task scheduling algorithm based on availability in heterogeneous systems,which could improve the availability of heterogeneous systems without inducing the cost of the hardware while reducing average waiting time of tasks.Experimental results show that this algorithm can achieve a good trade-off between availability and waiting time.