Lin Gu

Lin Gu

Auto-generated profile, based on publicly available information

Lin Gu

Huazhong University of Science and Technology

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
28 November 2022 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Open access
HJHai Jin
Hai Jin
DBDongshan Bai
Dongshan Bai
DYDezhong Yao
Dezhong Yao
YDYutong Dai
Yutong Dai
LGLin Gu
Lin Gu
Lichao SunLichao Sun
Lichao Sun
Federated Learning (FL) is an emerging approach in edge computing for collaboratively training machine learning models among multiple devices, which aims to address limited bandwidth, system heterogeneity, and privacy issues in traditional centralized training. However, the existing federated learning methods focus on learning a shared global model for all devices, which may not always be ideal for different devices. Such situations become even worse when each edge device has its own data distribution or task. In this paper, we study personalized federated learning in which our goal is to train models to perform well for individual clients. We observe that the initialization in each communication round causes the forgetting of historical personalized knowledge. Based on this observation, we propose a novel Personalized Federated Learning (PFL) framework via self-knowledge distillation, named pFedSD. By allowing clients to distill the knowledge of previous personalized models to current local models, pFedSD accelerates the process of recalling the personalized knowledge for the latest initialized clients. Moreover, self-knowledge distillation provides different views of data in feature space to realize an implicit ensemble of local models. Extensive experiments on various datasets and settings demonstrate the effectiveness and robustness of pFedSD.

29 September 2022 in IEEE Transactions on Sustainable Computing
Verified
Journal Article
Open access
LGLin Gu
Lin Gu
WZWeiying Zhang
Weiying Zhang
ZWZhongkui Wang
Zhongkui Wang
DZDeze Zeng
Deze Zeng
HJHai Jin
Hai Jin
Edge computing has become an alternative low-latency provision of cloud computing thanks to its close-proximity to the users, and the geo-distribution nature of edge servers enables the utilization green energy from the environment on-site. To pursue the goal of low-carbon edge computing, it is desirable to minimize the operational expenditure by scheduling the computing resource and green energy according to the spatially and temporally varying user demands. In this paper, inspired by the successful application of deep reinforcement learning (DRL) in diverse domains, we propose a DRL-based edge computing management strategy which continuously explores the states and adaptively makes decisions on service management and energy scheduling, towards long-term cost minimization. Different from model-based solutions, our proposal is a model-free method, without any assumption on statistical knowledge as a priori, and therefore is practical in implementation. To speedup the agent training procedure, we further design a prioritized replay memory by utilizing the model-based solution as a guideline to set the transition priority. Extensive experiment results based on real-world traces validate that our proposed DRL-based strategy can make considerably progress compared to the one-shot greedy strategy, and it can learn the system dynamically to manage the edge computing services at runtime.

25 March 2019 in IEEE Journal on Selected Areas in Communications
Verified
Journal Article
Closed access
LGLin Gu
Lin Gu
DZDeze Zeng
Deze Zeng
STSheng Tao
Sheng Tao
SGSong Guo
Song Guo
HJHai Jin
Hai Jin
Weihua ZhuangWeihua Zhuang
Weihua Zhuang
Network Function Virtualization (NFV) decouples the traditional network functions from specific or proprietary hardware such that virtualized network functions (VNFs) can run in software form. By exploring NFV, a consecutive set of VNFs can constitute a service function chain (SFC) to provide network service. From the perspective of network service providers, how to maximize the network utility is always one of the major concerns. To this end, there are two main issues need to be considered at runtime: 1) how to handle the unpredictable network traffic burst? 2) how to fairly allocate resources among various flows to satisfy different traffic demands? In this paper, we investigate a fairness-aware flow scheduling problem for network utility maximization, with joint consideration of resource allocation and rate control. Based on a discrete time queuing model, we propose a low-complexity online distributed algorithm using Lyapunov optimization framework, which can achieve arbitrary optimal utility with different fairness levels by tuning the fairness bias parameter. We theoretically analyze the optimality of the algorithm and evaluate its efficiency by both simulation and testbed based experiments.

25 May 2020 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
LGLin Gu
Lin Gu
JHJie Hu
Jie Hu
DZDeze Zeng
Deze Zeng
SGSong Guo
Song Guo
HJHai Jin
Hai Jin
Network Function Virtualization (NFV), as an emerging solution to virtualizing network services traditionally running on proprietary, dedicated devices, can effectively reduce the cost of big data processing service providers and improve service quality by running a service chain of ordered Virtual Network Functions (VNFs) on commodity hardware. One fundamental and critical problem of big data processing with NFV is how to deploy the chained VNFs and dispatch corresponding network flows to process the big data traffics so that the service cost can be minimized with guaranteed quality of service. In this paper, we study the problem of VNF deployment and flow scheduling of distributed data centers in big data processing with joint consideration of the service requirements and the resource capacity, and prove its NP-hardness through the multilevel uncapacited facility location problem. An algorithm based on relaxation is also devised by first balancing VNF resource requirements and then selecting VNF locations with a low complexity of O(|M|^2\log_2 |M|) and an approximation ratio of K + \rho. Finally, with extensive simulation experiments, the result shows that our algorithm can efficiently reduce the total cost of VNF deployment and flow communication in various scenarios.

26 August 2020 in IEEE Transactions on Big Data
Verified
Journal Article
Closed access
BSBeibei Si
Beibei Si
YLYuxuan Liang
Yuxuan Liang
JZJin Zhao
Jin Zhao
YZYu Zhang
Yu Zhang
XLXiaoFei Liao
XiaoFei Liao
LGLin Gu
Lin Gu
Many iterative graph processing systems have recently been developed to analyze graphs. Although they are effective from different aspects, there is an important issue that has not been addressed yet. A real-world graph follows the power-law property, in which a small number of vertices have high degrees (i.e., are connected to most other vertices in the graph). These vertices are called hot-vertices and usually require more iterations to converge. In the existing solutions, these hot-vertices may be allocated to many or even all graph partitions along with other vertices that are easy to converge. As the result, the partitions with hot-vertices have to be loaded repeatedly (and consequently the system suffers from high data access cost), although perhaps only a few vertices in these partitions are active. To cope with this issue, we develop an efficient open source graph partition manager, called GGraph, which can be integrated into the existing graph processing systems to efficiently support iterative graph processing, by taking into account the power-law property of the graph structure. It uses a novel graph repartitioning scheme with low overhead to dynamically partition the hot-vertices together, so as to avoid loading the inactive vertices in the same partition as the repeatedly processed hot-vertices. By such means, it not only enables less data access cost, but also enables the privileged processing of the hot-vertices. In order to further increase the convergence speed, a scheduling algorithm is further proposed in this work to prioritize the processing of the hot-vertices with low overhead. To demonstrate the efficiency of GGraph, we plug it into four state-of-the-art graph processing systems, i.e., Gemini, GraphChi, Chaos, and GridGraph, and experimental results show that GGraph improves their performance by up to 3.2 times, 3.8 times, 3.9 times, 3.5 times, respectively.

14 December 2023 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
HYHui Yu
Hui Yu
YZYu Zhang
Yu Zhang
JZJin Zhao
Jin Zhao
YLYujian Liao
Yujian Liao
ZHZhiying Huang
Zhiying Huang
JYJianhui Yue
Jianhui Yue
Dynamic Graph Neural Network (DGNN) has recently attracted a significant amount of research attention from various domains, because most real-world graphs are inherently dynamic. Despite many research efforts, for DGNN, existing hardware/software solutions still suffer significantly from redundant computation and memory access overhead, because they need to irregularly access and recompute all graph data of each graph snapshot. To address these issues, we propose an efficient redundancy-aware accelerator, RACE , which enables energy-efficient execution of DGNN models. Specifically, we propose a redundancy-aware incremental execution approach into the accelerator design for DGNN to instantly achieve the output features of the latest graph snapshot by correctly and incrementally refining the output features of the previous graph snapshot and also enable regular accesses of vertices’ input features. Through traversing the graph on the fly, RACE identifies the vertices that are not affected by graph updates between successive snapshots to reuse these vertices’ states (i.e., their output features) of the previous snapshot for the processing of the latest snapshot. The vertices affected by graph updates are also tracked to incrementally recompute their new states using their neighbors’ input features of the latest snapshot for correctness. In this way, the processing and accessing of many graph data that are not affected by graph updates can be correctly eliminated, enabling smaller redundant computation and memory access overhead. Besides, the input features, which are accessed more frequently, are dynamically identified according to graph topology and are preferentially resident in the on-chip memory for less off-chip communications. Experimental results show that RACE achieves on average 1139× and 84.7× speedups for DGNN inference, with average 2242× and 234.2× energy savings, in comparison with the state-of-the-art software DGNN running on Intel Xeon CPU and NVIDIA A100 GPU, respectively. Moreover, for DGNN inference, RACE obtains on average 13.1×, 11.7×, 10.4×, and 7.9× speedup and 14.8×, 12.9×, 11.5×, and 8.9× energy savings over the state-of-the-art Graph Neural Network accelerators, i.e., AWB-GCN, GCNAX, ReGNN, and I-GCN, respectively.