On QoS-based scheduling of a meta-task with multiple QoS demands in heterogeneous computing

This paper investigates the problem of scheduling a set of independent tasks with multiple QoS needs, which may include timeliness, reliability, security, data accuracy, and priority, in a heterogeneous computing system. This problem is referred to as the QoS-based scheduling problem and proven to be NP-hard. In order to solve the QoS-based scheduling problem, a computationally efficient static scheduling algorithm (QSMTS_IP) is developed. The simulation studies carried out show that QSMTS_IP is capable of meeting diverse QoS requirements of marry users simultaneously, while minimizing the number of users whose tasks cannot be scheduled due to the scarcity of resources.