...
首页> 外文期刊>Journal of grid computing >Cost-Time Efficient Scheduling Plan for Executing Workflows in the Cloud
【24h】

Cost-Time Efficient Scheduling Plan for Executing Workflows in the Cloud

机译:在云中执行工作流的节省时间的高效计划计划

获取原文
获取原文并翻译 | 示例

摘要

The emergence of Cloud Computing as a model of service provisioning in distributed systems instigated researchers to explore its pros and cons on executing different large scale scientific applications, i.e., Workflows. One of the most challenging problems in clouds is to execute workflows while minimizing the execution time as well as cost incurred by using a set of heterogeneous resources over the cloud simultaneously. In this paper, we present, Budget and Deadline Constrained Heuristic based upon Heterogeneous Earliest Finish Time (HEFT) to schedule workflow tasks over the available cloud resources. The proposed heuristic presents a beneficial trade-off between execution time and execution cost under given constraints. The proposed heuristic is evaluated for different synthetic workflow applications by a simulation process and comparison is done with state-of-art algorithm i.e. BHEFT. The simulation results show that our proposed scheduling heuristic can significantly decrease the execution cost while producing makespan as good as the best known scheduling heuristic under the same deadline and budget constraints.
机译:云计算作为分布式系统中服务提供模型的出现,促使研究人员探索其在执行不同的大规模科学应用程序(即工作流)方面的利弊。云中最具挑战性的问题之一是执行工作流,同时通过在云上同时使用一组异构资源来最大程度地缩短执行时间和成本。在本文中,我们提出了基于异构最早完成时间(HEFT)的预算和截止日期约束启发式算法,以在可用云资源上调度工作流任务。所提出的启发式方法在给定的约束条件下提出了执行时间与执行成本之间的有益折衷。通过模拟过程针对不同的合成工作流程应用评估了拟议的启发式方法,并使用最新算法(即BHEFT)进行了比较。仿真结果表明,在相同的期限和预算约束下,我们提出的调度启发式算法可以显着降低执行成本,同时产生的生成时间与最知名的调度启发式算法一样。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号