Hexiang Tan, Wen‐Jinn Chen, Libing Qin, Jie Zhu, Haiping Huang
{"title":"Energy-aware and Deadline-constrained Task Scheduling in Fog Computing Systems","authors":"Hexiang Tan, Wen‐Jinn Chen, Libing Qin, Jie Zhu, Haiping Huang","doi":"10.1109/ICCSE49874.2020.9201710","DOIUrl":null,"url":null,"abstract":"We investigate a deadline-constrained task scheduling problem in the fog computing environments where tasks can be offloaded to heterogeneous resources. Three kinds of resources are involved: mobile device, fog device and cloud server. The objective is to schedule all the tasks with minimum energy consumption. We develop an energy-aware strategy and propose a critical path based iterative algorithm which can obtain the optimal solution in polynomial time complexity. We also discuss the cases when no feasible solution exists. Experimental results show that the proposal is robust and effective for the problems under study.","PeriodicalId":350703,"journal":{"name":"2020 15th International Conference on Computer Science & Education (ICCSE)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 15th International Conference on Computer Science & Education (ICCSE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCSE49874.2020.9201710","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
We investigate a deadline-constrained task scheduling problem in the fog computing environments where tasks can be offloaded to heterogeneous resources. Three kinds of resources are involved: mobile device, fog device and cloud server. The objective is to schedule all the tasks with minimum energy consumption. We develop an energy-aware strategy and propose a critical path based iterative algorithm which can obtain the optimal solution in polynomial time complexity. We also discuss the cases when no feasible solution exists. Experimental results show that the proposal is robust and effective for the problems under study.