With the explosion of mobile smart devices, many computation intensive applications have emerged, such as interactive gaming and augmented reality. Mobile-edge computing (EC) is put forward, as an extension of cloud computing, to meet the low-latency requirements of the applications. In this article, we consider an EC system built in an ultradense network with numerous base stations. Heterogeneous computation tasks are successively generated on a smart device moving in the network. An optimal task offloading strategy, as well as optimal CPU frequency and transmit power scheduling, is desired by the device user to minimize both task completion latency and energy consumption in a long term. However, due to the stochastic task generation and dynamic network conditions, the problem is particularly difficult to solve. Inspired by reinforcement learning, we transform the problem into a Markov decision process. Then, we propose an attention-based double deep Q network (DDQN) approach, in which two neural networks are employed to estimate the cumulative latency and energy rewards achieved by each action. Moreover, a context-aware attention mechanism is designed to adaptively assign different weights to the values of each action. We also conduct extensive simulations to compare the performance of our proposed approach with several heuristic and DDQN-based baselines.

Due to the explosion of mobile devices and the evolution of wireless communication technologies, novel applications with intensive computation demands and low-latency requirements have arisen. Edge computing has been proposed as an extension of cloud computing, which moves computation workloads from remote cloud to network edge. Cooperating edge computing and cloud computing can significantly reduce the latency of computation tasks. However, considering the heterogeneity and stochastic arrivals of tasks and the limited computation and communication resources on the edge, task offloading and resource allocation are two joint crucial problems in an edge-cloud orchestrated computing system. In this paper, we propose an online task offloading and resource allocation approach for edge-cloud orchestrated computing, with the aim to minimize the average latency of tasks over time. We first build system models to analyze the latency and energy consumption incurred under different computing modes and formally formulate the joint problem as a mixed-integer optimal decision problem. Then, we employ Lyapunov optimization and duality theory to decompose the problem into a set of subproblems, which can be solved in a semi-decentralized way. We also formally analyze that our approach can achieve near-optimal performance. Extensive simulations are conducted to verify the superiority of our approach.

The Graph Attention Networks (GATs) exhibit outstanding performance in multiple authoritative node classification benchmark tests (including transductive and inductive). The purpose of this research is to implement an FPGA-based accelerator called FPGAN for graph attention networks that achieves significant improvement on performance and energy efficiency without losing accuracy compared with PyTorch baseline. It eliminates the dependence on digital signal processors (DSPs) and large amounts of on-chip memory and can even work well on low-end FPGA devices. We design FPGAN with software and hardware co-optimization across the full stack from algorithm through architecture. Specifically, we compress model to reduce the model size, quantify features to perform fixed-point calculation, replace multiplication addition cell (MAC) with shift addition units (SAUs) to eliminate the dependence on DSPs, and design an efficient algorithm to approximate SoftMax function. We also adjust the activation functions and fuse operations to further reduce the computation requirement. Moreover, all data is vectorized and aligned for scalable vector computation and efficient memory access. All the above optimizations are integrated into a universal hardware pipeline for various structures of GATs. We evaluate our design on an Inspur F10A board with an Intel Arria 10 GX1150 and 16 GB DDR3 memory. Experimental results show that FPGAN can achieve 7.34 times speedup over Nvidia Tesla V100 and 593 times over Xeon CPU Gold 5115 while maintaining accuracy, and 48 times and 2400 times on energy efficiency respectively.

Federated learning (FL) is an attractive industrial paradigm to accomplish distributed artificial intelligence (AI) training collaboratively in a data privacy-preserving manner. Most existing designs for FL systems assume that industrial user equipments (UEs) participate voluntarily in FL training. However, since both AI model training and transmission consume considerable energy, UEs are reluctant to participate without economic rewards. Hence, the lack of proper economic reward incentive mechanism results in low UE utility and frustrates UEs' enthusiasm for participating in training. To address the above challenge, in this article, we propose a two-phase energy-aware reward incentive mechanism for the edge-cloud-assisted hierarchical federated learning (HFL) system to optimize the overall UE utility, thereby, incentivizing UEs to participate more actively. Specifically, at the cloud server phase, we design an energy quantity-aware incentive mechanism for reasonably distributing rewards to its sub-edge-assisted FL systems. Subsequently, at the edge server phase, based on the quantitative analysis for the optimal reward allocation solution, we develop an energy-aware water filling-based reward incentive mechanism to adapt to individual needs of UEs and maximize the overall UE utility. Experiments verify that, compared to well-known benchmarks, our incentive mechanism can improve the overall UE utility by up to 55.94% and better incentivize UEs to participate in training.