边缘计算中具有硬/软截止日期的任务的计算卸载

Xin He, Jiaqi Zheng, Qiang He, Haipeng Dai, Bowen Liu, Wanchun Dou, Guihai Chen
{"title":"边缘计算中具有硬/软截止日期的任务的计算卸载","authors":"Xin He, Jiaqi Zheng, Qiang He, Haipeng Dai, Bowen Liu, Wanchun Dou, Guihai Chen","doi":"10.1109/ICWS53863.2021.00044","DOIUrl":null,"url":null,"abstract":"Edge computing provides task offloading services to extend the computational capacity of mobile users and reduce task latency. The deadline-awareness offloading algorithm plays a key role in guaranteeing the quality of service (QoS) requirement. Prior studies mainly focus on tasks with strict deadlines. However, some tasks may not always have to be finished before hard deadlines, e.g., multimedia tasks. Tasks with soft deadlines can miss their primary deadlines, but not by too much. This has not been properly considered by existing offloading approaches. In this paper, we propose CONFECT to offload tasks with mixed deadlines. We formulate the problem and prove its hardness. Then, we propose two online algorithms with proven competitive ratios to solve the problem collectively, including an algorithm that assigns tasks to edge servers and an algorithm that adjusts the task execution order on each server. Extensive experiments show that CONFECT outperforms five baseline algorithms.","PeriodicalId":213320,"journal":{"name":"2021 IEEE International Conference on Web Services (ICWS)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"CONFECT: Computation Offloading for Tasks with Hard/Soft Deadlines in Edge Computing\",\"authors\":\"Xin He, Jiaqi Zheng, Qiang He, Haipeng Dai, Bowen Liu, Wanchun Dou, Guihai Chen\",\"doi\":\"10.1109/ICWS53863.2021.00044\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Edge computing provides task offloading services to extend the computational capacity of mobile users and reduce task latency. The deadline-awareness offloading algorithm plays a key role in guaranteeing the quality of service (QoS) requirement. Prior studies mainly focus on tasks with strict deadlines. However, some tasks may not always have to be finished before hard deadlines, e.g., multimedia tasks. Tasks with soft deadlines can miss their primary deadlines, but not by too much. This has not been properly considered by existing offloading approaches. In this paper, we propose CONFECT to offload tasks with mixed deadlines. We formulate the problem and prove its hardness. Then, we propose two online algorithms with proven competitive ratios to solve the problem collectively, including an algorithm that assigns tasks to edge servers and an algorithm that adjusts the task execution order on each server. Extensive experiments show that CONFECT outperforms five baseline algorithms.\",\"PeriodicalId\":213320,\"journal\":{\"name\":\"2021 IEEE International Conference on Web Services (ICWS)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-09-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 IEEE International Conference on Web Services (ICWS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICWS53863.2021.00044\",\"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 IEEE International Conference on Web Services (ICWS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICWS53863.2021.00044","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

边缘计算提供任务卸载服务,扩展移动用户的计算能力,降低任务延迟。截止日期感知卸载算法在保证服务质量(QoS)需求方面起着关键作用。之前的研究主要集中在有严格期限的任务上。然而,有些任务不一定要在截止日期前完成,比如多媒体任务。有软截止日期的任务可能会错过主要截止日期,但不会错过太多。现有的卸载方法没有适当地考虑到这一点。在本文中,我们提出了CONFECT来卸载具有混合截止日期的任务。我们把这个问题公式化,并证明了它的难解性。然后,我们提出了两种具有经过验证的竞争比的在线算法来共同解决问题,包括一种将任务分配给边缘服务器的算法和一种调整每个服务器上任务执行顺序的算法。大量的实验表明,CONFECT优于5种基线算法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
CONFECT: Computation Offloading for Tasks with Hard/Soft Deadlines in Edge Computing
Edge computing provides task offloading services to extend the computational capacity of mobile users and reduce task latency. The deadline-awareness offloading algorithm plays a key role in guaranteeing the quality of service (QoS) requirement. Prior studies mainly focus on tasks with strict deadlines. However, some tasks may not always have to be finished before hard deadlines, e.g., multimedia tasks. Tasks with soft deadlines can miss their primary deadlines, but not by too much. This has not been properly considered by existing offloading approaches. In this paper, we propose CONFECT to offload tasks with mixed deadlines. We formulate the problem and prove its hardness. Then, we propose two online algorithms with proven competitive ratios to solve the problem collectively, including an algorithm that assigns tasks to edge servers and an algorithm that adjusts the task execution order on each server. Extensive experiments show that CONFECT outperforms five baseline algorithms.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信