基于深度q网络的MEC系统中依赖感知任务的卸载策略

Rui Yuan, Wei Jiang, Jing Hu, Tiecheng Song
{"title":"基于深度q网络的MEC系统中依赖感知任务的卸载策略","authors":"Rui Yuan, Wei Jiang, Jing Hu, Tiecheng Song","doi":"10.1117/12.2685767","DOIUrl":null,"url":null,"abstract":"Task offloading strategy is one of the promising methods in mobile edge computing (MEC) to reschedule computing resources. Scheduling for computationally intensive tasks was mainly focused on and the dependency restriction between tasks was generally ignored. In this paper, an End-to-Edge collaborative resource allocation model is established. Firstly, in order to improve the unrealistic assumption raised in previous studies that tasks can be offloaded to MEC servers with arbitrary proportion and order, we establish the directed acyclic graphs to describe the dependency relationship within tasks. And then, system time cost including execution time, transmission delay and waiting latency are considered, and the task offloading problem is transformed into an optimization model to minimize time consumption. To manage the non-convex problem, an offloading strategy under dependency constraints based on deep Q-network (DQN) is proposed. Simulations prove that the proposed algorithm can obtain smaller time cost by comparing with other baseline algorithms.","PeriodicalId":305812,"journal":{"name":"International Conference on Electronic Information Technology","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2023-08-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Offloading strategy for dependency-aware tasks in MEC system based on deep Q-network\",\"authors\":\"Rui Yuan, Wei Jiang, Jing Hu, Tiecheng Song\",\"doi\":\"10.1117/12.2685767\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Task offloading strategy is one of the promising methods in mobile edge computing (MEC) to reschedule computing resources. Scheduling for computationally intensive tasks was mainly focused on and the dependency restriction between tasks was generally ignored. In this paper, an End-to-Edge collaborative resource allocation model is established. Firstly, in order to improve the unrealistic assumption raised in previous studies that tasks can be offloaded to MEC servers with arbitrary proportion and order, we establish the directed acyclic graphs to describe the dependency relationship within tasks. And then, system time cost including execution time, transmission delay and waiting latency are considered, and the task offloading problem is transformed into an optimization model to minimize time consumption. To manage the non-convex problem, an offloading strategy under dependency constraints based on deep Q-network (DQN) is proposed. Simulations prove that the proposed algorithm can obtain smaller time cost by comparing with other baseline algorithms.\",\"PeriodicalId\":305812,\"journal\":{\"name\":\"International Conference on Electronic Information Technology\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2023-08-15\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International Conference on Electronic Information Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1117/12.2685767\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Electronic Information Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1117/12.2685767","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

任务卸载策略是移动边缘计算(MEC)中很有前途的计算资源重新调度方法之一。计算密集型任务的调度主要关注于计算密集型任务的调度,而忽略了任务间的依赖限制。本文建立了一个端到端的协同资源分配模型。首先,为了改进以往研究中提出的任务可以任意比例和顺序卸载到MEC服务器的不切实际假设,我们建立了任务间依赖关系的有向无环图。然后考虑系统时间成本,包括执行时间、传输延迟和等待延迟,将任务卸载问题转化为最小化时间消耗的优化模型。为了解决非凸问题,提出了一种基于深度q网络(deep Q-network, DQN)的依赖约束卸载策略。仿真结果表明,与其他基准算法相比,该算法可以获得更小的时间开销。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Offloading strategy for dependency-aware tasks in MEC system based on deep Q-network
Task offloading strategy is one of the promising methods in mobile edge computing (MEC) to reschedule computing resources. Scheduling for computationally intensive tasks was mainly focused on and the dependency restriction between tasks was generally ignored. In this paper, an End-to-Edge collaborative resource allocation model is established. Firstly, in order to improve the unrealistic assumption raised in previous studies that tasks can be offloaded to MEC servers with arbitrary proportion and order, we establish the directed acyclic graphs to describe the dependency relationship within tasks. And then, system time cost including execution time, transmission delay and waiting latency are considered, and the task offloading problem is transformed into an optimization model to minimize time consumption. To manage the non-convex problem, an offloading strategy under dependency constraints based on deep Q-network (DQN) is proposed. Simulations prove that the proposed algorithm can obtain smaller time cost by comparing with other 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学术文献互助群
群 号:481959085
Book学术官方微信