Energy-aware and Deadline-constrained Task Scheduling in Fog Computing Systems

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.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
雾计算系统中能量感知和限期约束的任务调度
在雾计算环境中,任务可以卸载到异构资源上,我们研究了一个期限约束的任务调度问题。涉及三种资源:移动设备、雾设备和云服务器。目标是以最小的能量消耗来安排所有的任务。我们开发了一种能量感知策略,并提出了一种基于关键路径的迭代算法,该算法可以在多项式时间复杂度下获得最优解。我们还讨论了不存在可行解的情况。实验结果表明,该方法对所研究的问题具有鲁棒性和有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Introduction of the new Operating System Kernel Internals for the New Metrics for the Performance Prediction on the Clouds Abnormal Event Detection in Video Based on Sparse Representation The Mechanism of Intelligent Technology Reforming Education Based on the Perspective of Embodied Cognitive Theory* Multi-integrated Reform for the Course of Data Structure Intelligent Distribution Platform of Network Shared Resources Based on Cloud Computing
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1