Shuang Wang, Yibing Duan, Yamin Lei, Peng Du, Yamin Wang
{"title":"异构云中的电力成本感知多工作流调度","authors":"Shuang Wang, Yibing Duan, Yamin Lei, Peng Du, Yamin Wang","doi":"10.1007/s00607-024-01264-3","DOIUrl":null,"url":null,"abstract":"<p>Multi-workflows are commonly deployed on cloud platforms to achieve efficient computational power. Diverse task configuration requirements, the heterogeneous nature and dynamic electricity price of cloud servers impose significant challenges for economically scheduling multi-workflows. In this paper, we propose a Heuristic Electricity-cost-aware Multi-workflow Scheduling algorithm (HEMS) to search for an optimal scheduling plan which determines the optimal scheduling scheme for each task in each workflow, specifying the server to perform the task with determined resources in specific time. The objective is to minimize the total electricity cost of all servers while satisfying the deadline constraints of all workflows. The HEMS algorithm consists of five components: Workflow Scheduling Sequence Generation, Task Scheduling Sequence Initialization for each workflow, Optimal Scheduling Scheme Determination for each task, initial Task Scheduling Sequence Optimization, and Optimal Scheduling Plan Optimization. Experimental results demonstrate that HEMS consistently achieves the optimal scheduling plan with the lower total electricity cost (saving 54.5–69.1% on average) within slightly longer CPU time for various multi-workflows compared to existing three scheduling approaches.</p>","PeriodicalId":10718,"journal":{"name":"Computing","volume":"242 1","pages":""},"PeriodicalIF":3.3000,"publicationDate":"2024-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Electricity-cost-aware multi-workflow scheduling in heterogeneous cloud\",\"authors\":\"Shuang Wang, Yibing Duan, Yamin Lei, Peng Du, Yamin Wang\",\"doi\":\"10.1007/s00607-024-01264-3\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<p>Multi-workflows are commonly deployed on cloud platforms to achieve efficient computational power. Diverse task configuration requirements, the heterogeneous nature and dynamic electricity price of cloud servers impose significant challenges for economically scheduling multi-workflows. In this paper, we propose a Heuristic Electricity-cost-aware Multi-workflow Scheduling algorithm (HEMS) to search for an optimal scheduling plan which determines the optimal scheduling scheme for each task in each workflow, specifying the server to perform the task with determined resources in specific time. The objective is to minimize the total electricity cost of all servers while satisfying the deadline constraints of all workflows. The HEMS algorithm consists of five components: Workflow Scheduling Sequence Generation, Task Scheduling Sequence Initialization for each workflow, Optimal Scheduling Scheme Determination for each task, initial Task Scheduling Sequence Optimization, and Optimal Scheduling Plan Optimization. Experimental results demonstrate that HEMS consistently achieves the optimal scheduling plan with the lower total electricity cost (saving 54.5–69.1% on average) within slightly longer CPU time for various multi-workflows compared to existing three scheduling approaches.</p>\",\"PeriodicalId\":10718,\"journal\":{\"name\":\"Computing\",\"volume\":\"242 1\",\"pages\":\"\"},\"PeriodicalIF\":3.3000,\"publicationDate\":\"2024-02-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computing\",\"FirstCategoryId\":\"94\",\"ListUrlMain\":\"https://doi.org/10.1007/s00607-024-01264-3\",\"RegionNum\":3,\"RegionCategory\":\"计算机科学\",\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q2\",\"JCRName\":\"COMPUTER SCIENCE, THEORY & METHODS\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computing","FirstCategoryId":"94","ListUrlMain":"https://doi.org/10.1007/s00607-024-01264-3","RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"COMPUTER SCIENCE, THEORY & METHODS","Score":null,"Total":0}
引用次数: 0
摘要
多工作流通常部署在云平台上,以实现高效的计算能力。任务配置要求的多样性、云服务器的异构性和动态电价为经济地调度多工作流带来了巨大挑战。在本文中,我们提出了一种启发式电费感知多工作流调度算法(HEMS)来搜索最优调度方案,该方案为每个工作流中的每个任务确定最优调度方案,指定服务器在特定时间内利用确定的资源执行任务。其目标是在满足所有工作流的截止日期限制的同时,最大限度地降低所有服务器的总电费。HEMS 算法由五个部分组成:工作流调度序列生成、每个工作流的任务调度序列初始化、每个任务的最优调度方案确定、初始任务调度序列优化和最优调度计划优化。实验结果表明,与现有的三种调度方法相比,对于不同的多工作流,HEMS 可以在稍长的 CPU 时间内,以较低的总电费(平均节省 54.5-69.1%)实现最优调度方案。
Electricity-cost-aware multi-workflow scheduling in heterogeneous cloud
Multi-workflows are commonly deployed on cloud platforms to achieve efficient computational power. Diverse task configuration requirements, the heterogeneous nature and dynamic electricity price of cloud servers impose significant challenges for economically scheduling multi-workflows. In this paper, we propose a Heuristic Electricity-cost-aware Multi-workflow Scheduling algorithm (HEMS) to search for an optimal scheduling plan which determines the optimal scheduling scheme for each task in each workflow, specifying the server to perform the task with determined resources in specific time. The objective is to minimize the total electricity cost of all servers while satisfying the deadline constraints of all workflows. The HEMS algorithm consists of five components: Workflow Scheduling Sequence Generation, Task Scheduling Sequence Initialization for each workflow, Optimal Scheduling Scheme Determination for each task, initial Task Scheduling Sequence Optimization, and Optimal Scheduling Plan Optimization. Experimental results demonstrate that HEMS consistently achieves the optimal scheduling plan with the lower total electricity cost (saving 54.5–69.1% on average) within slightly longer CPU time for various multi-workflows compared to existing three scheduling approaches.
期刊介绍:
Computing publishes original papers, short communications and surveys on all fields of computing. The contributions should be written in English and may be of theoretical or applied nature, the essential criteria are computational relevance and systematic foundation of results.