arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2306.09458cs.NI
收藏

一种用于边缘计算的灵活卸载DAG应用的算法

A flexible algorithm to offload DAG applications for edge computing

Gabriel F. C. de Queiroz, José F. de Rezende, Valmir C. Barbosa

AI总结:

本文研究边缘计算中DAG应用划分与卸载的NP-hard问题,提出FlexDO算法,结合贪心与排列阶段寻找最短完成时间的卸载决策,实验表明其性能显著优于基线方案且接近最优。

摘要:

多接入边缘计算(MEC)是一项关键技术,通过在网络边缘提供更快的任务处理来支持虚拟/增强现实等新型网络应用。这是通过将服务器部署得更靠近终端用户来运行网络应用而实现的。这些应用在任务处理、内存使用和通信方面通常非常密集;因此,移动设备可能需要很长时间,甚至无法高效运行它们。通过将这些应用的执行转移(卸载)到网络边缘的服务器上,可以实现更短的完成时间(makespan)并满足应用要求。然而,将多个完整应用卸载到边缘服务器可能会使其硬件和通信通道不堪重负,同时也会导致移动设备硬件的利用率不足。在本文中,网络应用被建模为有向无环图(DAGs)并划分为多个任务,仅将其中部分任务卸载到边缘服务器。这就是DAG应用划分与卸载问题,已知该问题为NP-hard问题。为了逼近其解,本文提出了FlexDO算法。FlexDO结合了贪心阶段和排列阶段来寻找一组卸载决策,然后选择其中实现最短makespan的决策。在考虑从Alibaba Cluster Trace Program提取的真实DAG应用的情况下,将FlexDO与文献中的一项提案和两个基线决策进行了比较。结果显示,在所有测试场景中,FlexDO始终仅比最优makespan高出3.9%至8.9%,这些场景包括不同级别的CPU可用性、多用户情况以及不同的通信通道传输速率。FlexDO以较大优势优于两种基线解决方案,并且比其竞争对手更接近最优makespan三倍。

英文摘要:

Multi-access Edge Computing (MEC) is an enabling technology to leverage new network applications, such as virtual/augmented reality, by providing faster task processing at the network edge. This is done by deploying servers closer to the end users to run the network applications. These applications are often intensive in terms of task processing, memory usage, and communication; thus mobile devices may take a long time or even not be able to run them efficiently. By transferring (offloading) the execution of these applications to the servers at the network edge, it is possible to achieve a lower completion time (makespan) and meet application requirements. However, offloading multiple entire applications to the edge server can overwhelm its hardware and communication channel, as well as underutilize the mobile devices' hardware. In this paper, network applications are modeled as Directed Acyclic Graphs (DAGs) and partitioned into tasks, and only part of these tasks are offloaded to the edge server. This is the DAG application partitioning and offloading problem, which is known to be NP-hard. To approximate its solution, this paper proposes the FlexDO algorithm. FlexDO combines a greedy phase with a permutation phase to find a set of offloading decisions, and then chooses the one that achieves the shortest makespan. FlexDO is compared with a proposal from the literature and two baseline decisions, considering realistic DAG applications extracted from the Alibaba Cluster Trace Program. Results show that FlexDO is consistently only 3.9% to 8.9% above the optimal makespan in all test scenarios, which include different levels of CPU availability, a multi-user case, and different communication channel transmission rates. FlexDO outperforms both baseline solutions by a wide margin, and is three times closer to the optimal makespan than its competitor.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑