| Texto completo | |
| Autor(es): |
de Queiroz, Gabriel F. C.
;
de Rezende, Jose F.
;
Barbosa, Valmir C.
Número total de Autores: 3
|
| Tipo de documento: | Artigo Científico |
| Fonte: | JOURNAL OF NETWORK AND COMPUTER APPLICATIONS; v. 222, p. 13-pg., 2023-11-23. |
| Resumo | |
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 solutions, considering realistic DAG applications extracted from the Alibaba Cluster Trace Program. FlexDO results are 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. It achieves up to 87% similarity with the optimal decision and does not burden the edge server. (AU) | |
| Processo FAPESP: | 21/08211-7 - PROFISSA: Programmable Future Internet for Secure Software Architectures |
| Beneficiário: | Alexandre Heideker |
| Modalidade de apoio: | Bolsas no Brasil - Programa Capacitação - Treinamento Técnico |
| Processo FAPESP: | 18/23097-3 - SFI2: fatiamento de infraestruturas de internet do futuro |
| Beneficiário: | Tereza Cristina Melo de Brito Carvalho |
| Modalidade de apoio: | Auxílio à Pesquisa - Temático |
| Processo FAPESP: | 20/05127-2 - SAMURAI: núcleo 5G inteligente e integração de múltiplas redes de acesso |
| Beneficiário: | Aldebaro Barreto da Rocha Klautau Junior |
| Modalidade de apoio: | Auxílio à Pesquisa - Temático |