Dependency-Aware Hybrid Task Offloading in Mobile Edge Computing Networks

Zhao Ming, Xiuhua Li, Chuan Sun, Qilin Fan, Xiaofei Wang, Victor C. M. Leung
{"title":"Dependency-Aware Hybrid Task Offloading in Mobile Edge Computing Networks","authors":"Zhao Ming, Xiuhua Li, Chuan Sun, Qilin Fan, Xiaofei Wang, Victor C. M. Leung","doi":"10.1109/ICPADS53394.2021.00034","DOIUrl":null,"url":null,"abstract":"With the rapid increase of data in mobile edge computing (MEC) networks, mobile devices (MDs) have been generating many computation-latency-sensitive tasks. As the MDs are limited by resources in terms of storage, computation, and bandwidth, part of tasks have to be offloaded to the edge of mobile networks or the remote cloud for more efficient processing. Hence, task offloading plays a vital role in this scene. Existing works about task offloading mainly aim at one-shot task offloading and rarely consider the dependencies of tasks. In this paper, we focus on minimizing the maximum delay of processing a series of tasks with dependencies in MEC networks, which supports device-to-device communications. Specifically, we consider task offloading under a hybrid scenario with a small base station (SBS) deployed with an edge server (ES) and several MDs which generate several tasks with dependencies. Then we model the tasks to a weighted directed acyclic graph (DAG) and formulate the optimization problem as minimizing the critical path of the weighted DAG. To tackle this NP-hard problem, we propose a heuristic scheme to iteratively optimize the delay of paths of the weighted DAG under the constraints of the ES. To evaluate the proposed scheme, we perform numerical experiments with different numbers of tasks. Simulation results demonstrate that the proposed scheme outperforms other schemes in terms of reducing the system delay and saving the energy consumption of the MDs.","PeriodicalId":309508,"journal":{"name":"2021 IEEE 27th International Conference on Parallel and Distributed Systems (ICPADS)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2021-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 IEEE 27th International Conference on Parallel and Distributed Systems (ICPADS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPADS53394.2021.00034","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

With the rapid increase of data in mobile edge computing (MEC) networks, mobile devices (MDs) have been generating many computation-latency-sensitive tasks. As the MDs are limited by resources in terms of storage, computation, and bandwidth, part of tasks have to be offloaded to the edge of mobile networks or the remote cloud for more efficient processing. Hence, task offloading plays a vital role in this scene. Existing works about task offloading mainly aim at one-shot task offloading and rarely consider the dependencies of tasks. In this paper, we focus on minimizing the maximum delay of processing a series of tasks with dependencies in MEC networks, which supports device-to-device communications. Specifically, we consider task offloading under a hybrid scenario with a small base station (SBS) deployed with an edge server (ES) and several MDs which generate several tasks with dependencies. Then we model the tasks to a weighted directed acyclic graph (DAG) and formulate the optimization problem as minimizing the critical path of the weighted DAG. To tackle this NP-hard problem, we propose a heuristic scheme to iteratively optimize the delay of paths of the weighted DAG under the constraints of the ES. To evaluate the proposed scheme, we perform numerical experiments with different numbers of tasks. Simulation results demonstrate that the proposed scheme outperforms other schemes in terms of reducing the system delay and saving the energy consumption of the MDs.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
移动边缘计算网络中依赖感知混合任务卸载
随着移动边缘计算(MEC)网络中数据的快速增长,移动设备(MDs)产生了许多对计算延迟敏感的任务。由于MDs在存储、计算和带宽等方面受到资源的限制,因此需要将部分任务卸载到移动网络边缘或远程云上,以提高处理效率。因此,任务卸载在此场景中起着至关重要的作用。现有的任务卸载研究主要针对一次性任务卸载,很少考虑任务之间的依赖关系。在本文中,我们的重点是最小化MEC网络中处理一系列具有依赖关系的任务的最大延迟,该网络支持设备到设备通信。具体来说,我们考虑在混合场景下的任务卸载,该场景中部署了带有边缘服务器(ES)的小型基站(SBS)和几个MDs,这些MDs生成具有依赖关系的多个任务。然后将任务建模为一个加权有向无环图(DAG),并将优化问题表述为最小化加权DAG的关键路径。为了解决这一np困难问题,我们提出了一种启发式方案,在ES约束下迭代优化加权DAG的路径延迟。为了评估所提出的方案,我们对不同数量的任务进行了数值实验。仿真结果表明,该方案在降低系统延迟和节省MDs能耗方面优于其他方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Choosing Appropriate AI-enabled Edge Devices, Not the Costly Ones Collaborative Transmission over Intermediate Links in Duty-Cycle WSNs Efficient Asynchronous GCN Training on a GPU Cluster A Forecasting Method of Dual Traffic Condition Indicators Based on Ensemble Learning Simple yet Efficient Deployment of Scientific Applications in the Cloud
×
引用
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