Freshness-aware computation offloading has garnered great attention recently in the edge computing arena, with the aim of promptly obtaining up-to-date information and minimizing the transmission of outdated data. However, most of the existing work assumes that wireless channels are reliable and neglect the dynamics and stochasticity thereof. In addition, varying priorities of offloading tasks along with heterogeneous computing units also pose significant challenges in effective task scheduling and resource allocation. To address these challenges, we cast the freshness-aware task offloading problem as a multi-priority optimization problem, considering the unreliability of wireless channels, the heterogeneity of edge servers, and prioritized users. Based on the nonlinear fractional programming and ADMM-Consensus method, we propose a joint resource allocation and task offloading algorithm to solve the original problem iteratively. To improve communication efficiency, we further devise a distributed asynchronous variant for the proposed algorithm. We rigorously analyze the performance and convergence of the proposed algorithms and conduct extensive simulations to corroborate their efficacy and superiority over the existing baselines.

翻译：新鲜度感知的计算卸载近年来在边缘计算领域引起广泛关注，其目标是及时获取最新信息并减少过时数据的传输。然而，现有工作大多假设无线信道可靠，忽略了其动态性和随机性。此外，不同卸载任务的优先级差异以及异构计算单元也为有效的任务调度和资源分配带来了重大挑战。为应对这些挑战，我们将新鲜度感知的任务卸载问题建模为多优先级优化问题，同时考虑无线信道的不可靠性、边缘服务器的异构性以及用户的优先级差异。基于非线性分数规划与ADMM-共识方法，我们提出了一种联合资源分配与任务卸载算法，以迭代方式求解原问题。为提升通信效率，我们进一步设计了该算法的分布式异步变体。我们对所提算法的性能与收敛性进行了严格分析，并通过大量仿真验证了其相对于现有基线方法的有效性与优越性。