{"title":"GoPro: a Low Complexity Task Allocation Algorithm for a Mobile Edge Computing System","authors":"Arghyadip Roy, Nilanjan Biswas","doi":"10.1109/NCC55593.2022.9806731","DOIUrl":null,"url":null,"abstract":"In an Internet of Things (IoT) based network, tasks arriving at individual nodes can be processed in-device or at a local Mobile Edge Computing (MEC) server. In this paper, we focus on the optimal resource allocation problem for tasks arriving in an MEC based IoT network. To address the inherent trade-off between the computation time and the power consumption, we aim to minimize the average power consumption subject to a constraint on the deadline violation probability. The problem is formulated as a Constrained Markov Decision Process (CMDP) problem. To address the high complexities of achieving optimality, we propose a low-complexity heuristic task scheduling scheme. Efficacy of our approach is demonstrated using simulations.","PeriodicalId":403870,"journal":{"name":"2022 National Conference on Communications (NCC)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2022-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2022 National Conference on Communications (NCC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NCC55593.2022.9806731","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1
Abstract
In an Internet of Things (IoT) based network, tasks arriving at individual nodes can be processed in-device or at a local Mobile Edge Computing (MEC) server. In this paper, we focus on the optimal resource allocation problem for tasks arriving in an MEC based IoT network. To address the inherent trade-off between the computation time and the power consumption, we aim to minimize the average power consumption subject to a constraint on the deadline violation probability. The problem is formulated as a Constrained Markov Decision Process (CMDP) problem. To address the high complexities of achieving optimality, we propose a low-complexity heuristic task scheduling scheme. Efficacy of our approach is demonstrated using simulations.