Minimising the Execution of Unknown Bag-of-Task Jobs with Deadlines on the Cloud

Long Thai, B. Varghese, A. Barker
{"title":"Minimising the Execution of Unknown Bag-of-Task Jobs with Deadlines on the Cloud","authors":"Long Thai, B. Varghese, A. Barker","doi":"10.1145/2912152.2912153","DOIUrl":null,"url":null,"abstract":"Scheduling jobs with deadlines, each of which defines the latest time that a job must be completed, can be challenging on the cloud due to the incurred costs and unpredictable performance. This problem is further complicated when there is not enough information to effectively schedule a job such that its deadline is satisfied, and the cost is minimised. In this paper, we present an approach to schedule jobs, whose performance are unknown before execution, with deadlines on the cloud. By performing a sampling phase to collect the necessary information about those jobs, our approach is able to deliver the scheduling decision within 10% cost and 16% violation rate when compared to the ideal setting, which has complete knowledge about each of the jobs from the beginning. Finally, our proposed algorithm outperforms existing approaches, which use a fixed amount of resources by reducing the violation cost by at least two times.","PeriodicalId":443897,"journal":{"name":"Proceedings of the ACM International Workshop on Data-Intensive Distributed Computing","volume":"31 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the ACM International Workshop on Data-Intensive Distributed Computing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2912152.2912153","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

Scheduling jobs with deadlines, each of which defines the latest time that a job must be completed, can be challenging on the cloud due to the incurred costs and unpredictable performance. This problem is further complicated when there is not enough information to effectively schedule a job such that its deadline is satisfied, and the cost is minimised. In this paper, we present an approach to schedule jobs, whose performance are unknown before execution, with deadlines on the cloud. By performing a sampling phase to collect the necessary information about those jobs, our approach is able to deliver the scheduling decision within 10% cost and 16% violation rate when compared to the ideal setting, which has complete knowledge about each of the jobs from the beginning. Finally, our proposed algorithm outperforms existing approaches, which use a fixed amount of resources by reducing the violation cost by at least two times.
最大限度地减少在云中执行具有最后期限的未知任务袋作业
调度带有截止日期的作业(每个截止日期定义了作业必须完成的最晚时间)在云中可能具有挑战性,因为会产生成本和不可预测的性能。当没有足够的信息来有效地安排作业以满足其截止日期和最小化成本时,这个问题会变得更加复杂。在本文中,我们提出了一种调度作业的方法,这些作业在执行前的性能是未知的,并且具有云上的截止日期。通过执行采样阶段来收集有关这些作业的必要信息,与从一开始就完全了解每个作业的理想设置相比,我们的方法能够在10%的成本和16%的违规率内提供调度决策。最后,我们提出的算法通过将违规成本降低至少两倍,优于使用固定资源的现有方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信