An Availability-Aware Task Scheduling Strategy for Heterogeneous Systems
Xiao Qin1 Tao Xie2
1 Department of Computer Science and Software Engineering
Auburn University, Auburn, AL 36849-5347.
2 Department of Computer Science
San Diego State University, San Diego, CA 92182
High availability is a key requirement in the design and development of heterogeneous systems, where processors operate at different speeds and are not continuously available for computation. Most existing scheduling algorithms designed for heterogeneous systems do not factor in availability requirements imposed by multiclass applications. To remedy this shortcoming, we investigate in this paper the scheduling problem for multiclass applications running in heterogeneous systems with availability constraints. In an effort to explore this issue, we model each node in a heterogeneous system using the node’s computing capability and availability. Multiple classes of tasks are characterized by their execution times and availability requirements. To incorporate availability and heterogeneity into scheduling, we define new metrics to quantify system availability and heterogeneity for multi-class tasks. We then propose a scheduling algorithm to improve availability of heterogeneous systems while maintaining good performance in response time of tasks. Experimental results show that our algorithm achieves a good trade-off between availability and responsiveness.
IEEE Transactions on Computers, vol. 57, no. 2, pp. 188-199, Feb. 2008.
The work reported in this paper was supported by the US National Science Foundation under Grants No. CCF-0742187, No. CNS-0757778, No. CNS-0831502, No. OCI-0753305, and No. DUE-0621307, and Auburn University under a startup grant.