IaaS云中具有粗粒度计费周期的科学工作流的基于任务的预算分配策略

M. Hilman, M. A. Rodriguez, R. Buyya
{"title":"IaaS云中具有粗粒度计费周期的科学工作流的基于任务的预算分配策略","authors":"M. Hilman, M. A. Rodriguez, R. Buyya","doi":"10.1109/eScience.2017.25","DOIUrl":null,"url":null,"abstract":"The use of cloud computing, particularly of Infrastructure as a Service clouds, for the execution of largescale scientific workflows has been a topic of interest in recent years. These environments offer on-demand access to all of the infrastructure required for the deployment of workflows, allowing users to pay only for what they use. This leads to schedulers having to find a trade-off between two conflicting quality of service requirements: time and cost. The majority of research in this area has focused on developing scheduling algorithms that have as objective minimizing the infrastructure cost while meeting a deadline constraint. Few algorithms, however, have addressed the problem of minimizing the execution time of the workflow while meeting a budget constraint. This paper focuses on the latter case. We propose a budget-distribution algorithm that assigns a portion of the overall workflow budget to the individual tasks. This task-level budget then guides the dynamic scheduling process and is continuously refined to reflect any unexpected costs. When compared to the state-of-the-art algorithm, the performance evaluation results demonstrate that in 88% of the cases, our proposal achieves equal or better performance in terms of meeting the budget constraint and achieves lower execution times in 84% of the cases.","PeriodicalId":137652,"journal":{"name":"2017 IEEE 13th International Conference on e-Science (e-Science)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":"{\"title\":\"Task-Based Budget Distribution Strategies for Scientific Workflows with Coarse-Grained Billing Periods in IaaS Clouds\",\"authors\":\"M. Hilman, M. A. Rodriguez, R. Buyya\",\"doi\":\"10.1109/eScience.2017.25\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The use of cloud computing, particularly of Infrastructure as a Service clouds, for the execution of largescale scientific workflows has been a topic of interest in recent years. These environments offer on-demand access to all of the infrastructure required for the deployment of workflows, allowing users to pay only for what they use. This leads to schedulers having to find a trade-off between two conflicting quality of service requirements: time and cost. The majority of research in this area has focused on developing scheduling algorithms that have as objective minimizing the infrastructure cost while meeting a deadline constraint. Few algorithms, however, have addressed the problem of minimizing the execution time of the workflow while meeting a budget constraint. This paper focuses on the latter case. We propose a budget-distribution algorithm that assigns a portion of the overall workflow budget to the individual tasks. This task-level budget then guides the dynamic scheduling process and is continuously refined to reflect any unexpected costs. When compared to the state-of-the-art algorithm, the performance evaluation results demonstrate that in 88% of the cases, our proposal achieves equal or better performance in terms of meeting the budget constraint and achieves lower execution times in 84% of the cases.\",\"PeriodicalId\":137652,\"journal\":{\"name\":\"2017 IEEE 13th International Conference on e-Science (e-Science)\",\"volume\":\"24 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"8\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE 13th International Conference on e-Science (e-Science)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/eScience.2017.25\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE 13th International Conference on e-Science (e-Science)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/eScience.2017.25","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

摘要

近年来,使用云计算,特别是基础设施即服务云,来执行大规模的科学工作流一直是一个令人感兴趣的话题。这些环境提供了对工作流部署所需的所有基础设施的按需访问,允许用户仅为他们使用的部分付费。这导致调度器必须在两个相互冲突的服务质量需求(时间和成本)之间找到折衷。该领域的大部分研究都集中在开发调度算法,其目标是在满足期限约束的情况下使基础设施成本最小化。然而,很少有算法解决了在满足预算限制的情况下最小化工作流执行时间的问题。本文主要讨论后一种情况。我们提出了一种预算分配算法,该算法将整个工作流预算的一部分分配给各个任务。然后,这个任务级预算指导动态调度过程,并不断改进以反映任何意外成本。与最先进的算法相比,性能评估结果表明,在88%的情况下,我们的方案在满足预算约束方面达到了相同或更好的性能,在84%的情况下实现了更低的执行时间。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Task-Based Budget Distribution Strategies for Scientific Workflows with Coarse-Grained Billing Periods in IaaS Clouds
The use of cloud computing, particularly of Infrastructure as a Service clouds, for the execution of largescale scientific workflows has been a topic of interest in recent years. These environments offer on-demand access to all of the infrastructure required for the deployment of workflows, allowing users to pay only for what they use. This leads to schedulers having to find a trade-off between two conflicting quality of service requirements: time and cost. The majority of research in this area has focused on developing scheduling algorithms that have as objective minimizing the infrastructure cost while meeting a deadline constraint. Few algorithms, however, have addressed the problem of minimizing the execution time of the workflow while meeting a budget constraint. This paper focuses on the latter case. We propose a budget-distribution algorithm that assigns a portion of the overall workflow budget to the individual tasks. This task-level budget then guides the dynamic scheduling process and is continuously refined to reflect any unexpected costs. When compared to the state-of-the-art algorithm, the performance evaluation results demonstrate that in 88% of the cases, our proposal achieves equal or better performance in terms of meeting the budget constraint and achieves lower execution times in 84% of the cases.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信