云工作流系统的makespan优化任务级调度策略

Rui Zhang, Wenyu Shi
{"title":"云工作流系统的makespan优化任务级调度策略","authors":"Rui Zhang, Wenyu Shi","doi":"10.1109/AINIT54228.2021.00145","DOIUrl":null,"url":null,"abstract":"Cloud-based workflow systems is a platform which can be embedded in a cloud computing infrastructure. Virtual machine has the ability to run multi-tasks simultaneously and time-sharing characteristic, but cannot take advantage of VM’s benefit, therefore, the makespan of scheduling strategy in datacenter cannot be reduced availably. In this paper, we bring up a new makespan model which take advantage of VM’s time-shared characteristic to schedule cloud workflow in task-layer. Furthermore, a novel Ant Colony Optimization (ACO) scheduling strategy is designed to obtain the optimal makespan. This scheduling strategy is implemented in Swinburne Decentralized Workflow for Cloud. The results suggest that by exploiting a time-sharing characteristic of VM, our scheduling strategy offers a significant improvement over the existing approaches including the makespan optimization by scheduling strategy within a datacenter, ACO scheduling strategy can converge fast with different task sets. The makespan is smaller than its counterpart without time-sharing of VMs.","PeriodicalId":326400,"journal":{"name":"2021 2nd International Seminar on Artificial Intelligence, Networking and Information Technology (AINIT)","volume":"187 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Makespan-optimized Task-Level Scheduling Strategy for Cloud Workflow Systems\",\"authors\":\"Rui Zhang, Wenyu Shi\",\"doi\":\"10.1109/AINIT54228.2021.00145\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cloud-based workflow systems is a platform which can be embedded in a cloud computing infrastructure. Virtual machine has the ability to run multi-tasks simultaneously and time-sharing characteristic, but cannot take advantage of VM’s benefit, therefore, the makespan of scheduling strategy in datacenter cannot be reduced availably. In this paper, we bring up a new makespan model which take advantage of VM’s time-shared characteristic to schedule cloud workflow in task-layer. Furthermore, a novel Ant Colony Optimization (ACO) scheduling strategy is designed to obtain the optimal makespan. This scheduling strategy is implemented in Swinburne Decentralized Workflow for Cloud. The results suggest that by exploiting a time-sharing characteristic of VM, our scheduling strategy offers a significant improvement over the existing approaches including the makespan optimization by scheduling strategy within a datacenter, ACO scheduling strategy can converge fast with different task sets. The makespan is smaller than its counterpart without time-sharing of VMs.\",\"PeriodicalId\":326400,\"journal\":{\"name\":\"2021 2nd International Seminar on Artificial Intelligence, Networking and Information Technology (AINIT)\",\"volume\":\"187 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 2nd International Seminar on Artificial Intelligence, Networking and Information Technology (AINIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/AINIT54228.2021.00145\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 2nd International Seminar on Artificial Intelligence, Networking and Information Technology (AINIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/AINIT54228.2021.00145","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

基于云的工作流系统是一个可以嵌入到云计算基础设施中的平台。虚拟机具有同时运行多任务的能力和分时特性,但无法利用虚拟机的优势,因此无法有效地降低数据中心调度策略的makespan。本文提出了一种新的最大时间跨度模型,利用虚拟机的分时特性在任务层调度云工作流。在此基础上,设计了一种新的蚁群优化调度策略,以获得最优最大完工时间。这种调度策略在Swinburne分布式工作流中实现。结果表明,利用虚拟机的分时特性,我们的调度策略比现有的调度策略有了显著的改进,包括在数据中心内调度策略的最大跨度优化,蚁群调度策略可以快速收敛于不同的任务集。与虚拟机不分时时相比,makespan更小。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A Makespan-optimized Task-Level Scheduling Strategy for Cloud Workflow Systems
Cloud-based workflow systems is a platform which can be embedded in a cloud computing infrastructure. Virtual machine has the ability to run multi-tasks simultaneously and time-sharing characteristic, but cannot take advantage of VM’s benefit, therefore, the makespan of scheduling strategy in datacenter cannot be reduced availably. In this paper, we bring up a new makespan model which take advantage of VM’s time-shared characteristic to schedule cloud workflow in task-layer. Furthermore, a novel Ant Colony Optimization (ACO) scheduling strategy is designed to obtain the optimal makespan. This scheduling strategy is implemented in Swinburne Decentralized Workflow for Cloud. The results suggest that by exploiting a time-sharing characteristic of VM, our scheduling strategy offers a significant improvement over the existing approaches including the makespan optimization by scheduling strategy within a datacenter, ACO scheduling strategy can converge fast with different task sets. The makespan is smaller than its counterpart without time-sharing of VMs.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:481959085
Book学术官方微信