On QoS-based scheduling of a meta-task with multiple QoS demands in heterogeneous computing
On QoS-based scheduling of a meta-task with multiple QoS demands in heterogeneous computing
复制标题
DOI：
10.1109/ipdps.2002.1015532
复制
发表时间：
2002-04
期刊：
影响因子：
--
通讯作者：
A. Doğan;F. Özgüner
中科院分区：
文献类型：
--
作者：
A. Doğan;F. Özgüner
本文研究了在异构计算系统中调度一组具有多个QoS需求的独立任务的问题，这些QoS需求可能包括及时性、可靠性、安全性、数据准确性和优先级。这个问题被称为基于QoS的调度问题，并被证明是NP难的。为了解决基于QoS的调度问题，提出了一种计算效率高的静态调度算法（QSMTS_IP）。仿真结果表明，QSMTS_IP能够同时满足多个用户的QoS需求，同时最大限度地减少因资源不足而无法调度的用户数量。
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.