Deep-Dual-Learning-Based Cotask Processing in Multiaccess Edge Computing Systems

被引:8
作者
Chiang, Yi-Han [1 ]
Chiang, Tsung-Wei [2 ]
Zhang, Tianyu [3 ]
Ji, Yusheng [3 ]
机构
[1] Osaka Prefecture Univ, Dept Elect & Informat Syst, Osaka 5998531, Japan
[2] Microsoft Inc, Microsoft Res, Redmond, WA 98052 USA
[3] Natl Inst Informat, Informat Syst Architecture Sci Res Div, Tokyo 1018430, Japan
关键词
Internet of Things; Task analysis; Processor scheduling; Optimal scheduling; Job shop scheduling; Indexes; Edge computing; Cotask processing; deep dual learning (DDL); Internet of Things (IoT); multiaccess edge computing (MEC); nonlinear programming;
D O I
10.1109/JIOT.2020.3004165
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Multiaccess edge computing (MEC) systems provide low-latency computing services for Internet of Things (IoT) applications by processing IoT data on edge servers. In the era of heterogeneous IoT environments, the success of IoT applications hinges on the processing of diversified IoT data. To leverage MEC systems to enable timely IoT services, we characterize IoT applications as cotasks, where each cotask is completed only if all its constituent subtasks (e.g., IoT data processing) are finished. Existing works have been devoted to the design of task offloading and scheduling decisions for MEC-enabled IoT applications, but they mostly neglect the cotask feature. In this article, we investigate the problem of cotask processing in MEC systems, and we formulate it as a nonlinear program (NLP) to minimize total cotask completion time (TCCT). In the light of uncertain communication latency, we transform the NLP to a parameterized and unconstrained version, based on which we propose the deep dual learning (DDL) method, where the learner keeps updating primal and dual variables based on randomly perturbed samples. Furthermore, we provide the duality gap and time complexity analyses for the DDL method. Our simulation results demonstrate that the proposed solution can gradually converge over iterations, and its TCCT performance outperforms other comparison schemes under various system settings.
引用
收藏
页码:9383 / 9398
页数:16
相关论文
共 47 条
[21]   Code-Partitioning Offloading Schemes in Mobile Edge Computing for Augmented Reality [J].
Liu, Jianhui ;
Zhang, Qi .
IEEE ACCESS, 2019, 7 :11222-11236
[22]   Offloading Schemes in Mobile Edge Computing for Ultra-Reliable Low Latency Communications [J].
Liu, Jianhui ;
Zhang, Qi .
IEEE ACCESS, 2018, 6 :12825-12837
[23]   Analysis and Visualization of Deep Neural Networks in Device-Free Wi-Fi Indoor Localization [J].
Liu, Shing-Jiuan ;
Chang, Ronald Y. ;
Chien, Feng-Tsun .
IEEE ACCESS, 2019, 7 :69379-69392
[24]   Towards Practical and Near-Optimal Coflow Scheduling for Data Center Networks [J].
Luo, Shouxi ;
Yu, Hongfang ;
Zhao, Yangming ;
Wang, Sheng ;
Yu, Shui ;
Li, Lemin .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2016, 27 (11) :3366-3380
[25]   Optimal Joint Scheduling and Cloud Offloading for Mobile Applications [J].
Mahmoodi, S. Eman ;
Uma, R. N. ;
Subbalakshmi, K. P. .
IEEE TRANSACTIONS ON CLOUD COMPUTING, 2019, 7 (02) :301-313
[26]   Survey on Multi-Access Edge Computing for Internet of Things Realization [J].
Porambage, Pawani ;
Okwuibe, Jude ;
Liyanage, Madhusanka ;
Ylianttila, Mika ;
Taleb, Tarik .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2018, 20 (04) :2961-2991
[27]   Minimizing the Total Weighted Completion Time of Coflows in Datacenter Networks [J].
Qiu, Zhen ;
Stein, Cliff ;
Zhong, Yuan .
SPAA'15: PROCEEDINGS OF THE 27TH ACM SYMPOSIUM ON PARALLELISM IN ALGORITHMS AND ARCHITECTURES, 2015, :294-303
[28]   STRUCTURE OF A SIMPLE SCHEDULING POLYHEDRON [J].
QUEYRANNE, M .
MATHEMATICAL PROGRAMMING, 1993, 58 (02) :263-285
[29]  
Susanto H, 2016, I C NETWORK PROTOCOL
[30]   On Multi-Access Edge Computing: A Survey of the Emerging 5G Network Edge Cloud Architecture and Orchestration [J].
Taleb, Tarik ;
Samdanis, Konstantinos ;
Mada, Badr ;
Flinck, Hannu ;
Dutta, Sunny ;
Sabella, Dario .
IEEE COMMUNICATIONS SURVEYS AND TUTORIALS, 2017, 19 (03) :1657-1681