Execution cost minimization scheduling algorithms for deadline-constrained parallel applications on heterogeneous clouds
Execution cost minimization scheduling algorithms for deadline-constrained parallel applications on heterogeneous clouds
复制标题
DOI：
10.1007/s10586-020-03151-w
复制
发表时间：
2020-07
期刊：
影响因子：
--
通讯作者：
Weihong Chen;Guoqi Xie;Renfa Li;Keqin Li
中科院分区：
文献类型：
--
作者：
Weihong Chen;Guoqi Xie;Renfa Li;Keqin Li
最近研究了最小化云计算平台上应用程序的执行金钱成本的问题，并且满足应用程序的期限约束是最重要的服务质量要求之一。以前最小化截止日期受限的应用程序的执行金钱成本的方法是“向上”方法（即从退出到进入任务），而不是结合“向上”和“向下”方法。在本研究中，我们提出货币成本优化算法（DCO/DUCO），通过同时采用“向下”和“向上”方法来解决执行成本最小化问题。 “向下”成本优化是通过引入可变期限跨度的概念并将申请的期限转移到每个任务来实现的。在DCO的基础上，利用松弛时间实现“向上”的成本优化，同时不违反任务间的优先级约束和应用程序的截止时间约束。实验结果表明，在各种条件下，所提出的方法比现有方法更有效。
The problem of minimizing the execution monetary cost of applications on cloud computing platforms has been studied recently, and satisfying the deadline constraint of an application is one of the most important quality of service requirements. Previous method of minimizing the execution monetary cost of deadline-constrained applications was the “upward” approach (i.e., fromexittoentrytasks) rather than combining the “upward” and “downward” approaches. In this study, we propose monetary cost optimization algorithm (DCO/DUCO) by employing “downward” and “upward” approaches together to solve the problem of execution cost minimization. “Downward” cost optimization is implemented by introducing the concept of the variable deadline-span and transferring the deadline of an application to each task. On the basis of DCO, the slack time is utilized to implement “upward” cost optimization without violating the precedence constraints among tasks and the deadline constraint of the application. Experimental results illustrate that the proposed approach is more effective than the existing method under various conditions.