IEEE Transactions on Systems, Man, and Cybernetics, Part A: Systems and Humans
Earliest starting and finishing time duplication-based algorithm
SPECTS'09 Proceedings of the 12th international conference on Symposium on Performance Evaluation of Computer & Telecommunication Systems
Efficient dynamic task scheduling in virtualized data centers with fuzzy prediction
Journal of Network and Computer Applications
Future Generation Computer Systems
ICSI'10 Proceedings of the First international conference on Advances in Swarm Intelligence - Volume Part I
TLA: Temporal look-ahead processor allocation method for heterogeneous multi-cluster systems
Journal of Parallel and Distributed Computing
| Hi-index | 14.98 |
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.