The proliferation of IoT applications has pushed the horizon of edge computing, which provides processing ability at the edge of networks. Task offloading is one of the most important issues in edge computing and has attracted continuous research attention in recent years. With task offloading, end devices can offload the entire task or only subtasks to the edge servers to meet the delay and energy requirements. Most existing offloading schemes are limited by the increasing complexity of task topologies, as considerable time is wasted for local/edge subtasks to wait for their precedent subtasks being executed at the edge/local device. This problem becomes even worse when the dependencies among subtasks become complex and the number of end-users increases. To address this problem, our key methodology is to exploit subtask duplications to reduce the inter-subtask delay and shorten the task completion time. Based on this, we propose a Duplication-based and Energy-aware Task Offloading scheme (DETO), which duplicates critical subtasks that have a large impact on the completion time and thus enhances the parallelism between local and edge computing. In addition, among numerous choices of subtask duplications, DETO evaluates the gain/cost ratio for each possible duplication and chooses the most efficient ones. As a result, the extra resource for duplications is greatly reduced. We also design a distributed DETO algorithm to support multi-user, multi-server edge computing. Extensive evaluation results show that DETO can effectively reduce the task completion time (by 12.22%) and improve the resource utilization (by 15.17%), in particular for multi-user edge computing networks.

Social media popularity prediction of multimodal user-generated content (UGC) is a crucial task for many real-world applications. However, existing efforts are often limited by missing inter-instance correlations and UGC temporal patterns. To address these issues, we propose a novel time-aware hypergraph Transformer framework, THGFormer. It fully represents inter-instance and intra-instance relations by hypergraphs, captures the temporal dependencies with a time encoder, and enhances UGC's representations via a neighborhood knowledge aggregation. Extensive experiments conducted on two real-world datasets demonstrate that THGFormer outperforms state-of-the-art popularity prediction models across several settings.

D2D edge computing is a promising solution to address the conflict between limited network capacity and increasing application demands, where mobile devices can offload their tasks to other peer devices/servers for better performance. Task offloading is critical to the performance of D2D edge computing. Most existing works on task offloading assume the task processing time is known or can be accurately estimated. However, the processing time is often uncertain until it is finished. Moreover, the same task can have largely different execution times under different scenarios, which leads to inaccurate offloading decisions and degraded performance. To address this problem, we propose a game-based probabilistic task offloading scheme with an uncertain processing time in D2D edge networks. First, we characterize the uncertainty of the task processing time using a probabilistic model. Second, we incorporate the proposed probabilistic model into an offloading decision game. We also analyze the structural properties of the game and prove that it can reach a Nash equilibrium. We evaluate the proposed work using real-world applications and datasets. The experimental results show that the proposed probabilistic model can accurately characterize the uncertainty of completion time, and the offloading algorithm can effectively improve the overall task completion rate in D2D networks.