返回
Task Class Partitioning for Mobile Computation Offloading
DOI:10.1109/JIOT.2023.3294887.png)
摘要
En 中文
This article introduces algorithms for static task class partitioning in mobile computation offloading (MCO). The objective is to partition a given set of task classes into two sets that are either executed locally by the mobile device (MD) or those classes that are permitted to contend for remote edge server (ES) execution. The goal is to find the task class partition that gives the minimum mean MD power consumption subject to task completion deadlines. This article generates these partitions for both soft and hard task completion deadlines. Two variations of the problem are considered. The first assumes that the wireless and computational capacities are given and the second generates both capacity assignments subject to an additional resource cost budget constraint. The proposed partitioning algorithms are based on heuristic class ordering methods. This article introduces two class ordering methods, a simpler one based on a task latency criterion, and an hierarchical version that first sorts and groups classes based on a mean power consumption criterion and then orders the task classes within each group based on a task completion time criterion. A variety of simulation results are presented that demonstrate the excellent performance of the proposed solutions for both given and optimized network resource assignments.
Keyword:
Cost budget constraints
edge computing
mobile computation offloading (MCO)
power efficiency
task completion deadlines
期刊
IF:
8.9
论文数:
1.4W
被引数:
7.8W
机构
引用论文
Joint Offloading Decision and Resource Allocation for Vehicular Fog-Edge Computing Networks: A Contract-Stackelberg Approach车载雾边缘计算网络的联合卸载决策和资源分配: 一种合同-Stackelberg方法
Joint Service Caching and Task Offloading in Multi-Access Edge Computing: A QoE-Based Utility Optimization Approach多接入边缘计算中的联合服务缓存和任务卸载: 一种基于QoE的效用优化方法
Measurement-Based Burst-Error Performance Modeling for Cooperative Intelligent Transport Systems基于测量的协同智能交通系统突发错误性能建模

