Jidong Ge

Dr. Jidong Ge

State Key Laboratory for Novel Software and Technology, Software Institute, Nanjing University, Nanjing 210093, China

Research Focus & Metrics

Academic Career Length

18Years (2009-Present)

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

Representative Publications

View All Publications
1 January 2024
Verified
Conference Paper
Open access
PDF file
ZFZhiwei Fei
Zhiwei Fei
XSXiaoyu Shen
Xiaoyu Shen
DZDawei Zhu
Dawei Zhu
FZFengzhe Zhou
Fengzhe Zhou
ZHZhuo Han
Zhuo Han
VNVincent Ng
Vincent Ng
Zhiwei Fei, Xiaoyu Shen, Dawei Zhu, Fengzhe Zhou, Zhuo Han, Alan Huang, Songyang Zhang, Kai Chen, Zhixin Yin, Zongwen Shen, Jidong Ge, Vincent Ng. Proceedings of the 2024 Conference on Empirical Methods in Natural Language Processing. 2024.

10 May 2022 in IEEE Transactions on Software Engineering
Verified
Journal Article
Closed access
SWSimin Wang
Simin Wang
LHLiguo Huang
Liguo Huang
AGAmiao Gao
Amiao Gao
JGJidong Ge
Jidong Ge
TZTengfei Zhang
Tengfei Zhang
VNVincent Ng
Vincent Ng
Since 2009, the deep learning revolution --- which was triggered by the introduction of ImageNet --- has stimulated the synergy between Software Engineering (SE) and Machine Learning (ML)/Deep Learning (DL). Meanwhile, critical reviews have emerged that suggest that ML/DL should be used cautiously. To improve the applicability and generalizability of ML/DL-related SE studies, we conducted a 12-year Systematic Literature Review (SLR) on 1,428 ML/DL-related SE papers published between 2009 and 2020. Our trend analysis demonstrated the impacts that ML/DL brought to SE. We examined the complexity of applying ML/DL solutions to SE problems and how such complexity led to issues concerning the reproducibility and replicability of ML/DL studies in SE. Specifically, we investigated how ML and DL differ in data preprocessing, model training, and evaluation when applied to SE tasks, and what details need to be provided with respect to ensure that a study can be reproduced or replicated. By categorizing the rationales behind the selection of ML/DL techniques into five themes, we analyzed how model performance, robustness, interpretability, complexity, and data simplicity affected choices of ML/DL models.

1 December 2016 in Future Generation Computer Systems
Verified
Journal Article
Closed access
ZLZhongjin Li
Zhongjin Li
JGJidong Ge
Jidong Ge
HYHongji Yang
Hongji Yang
LHLiguo Huang
Liguo Huang
HHHaiyang Hu
Haiyang Hu
BLBin Luo
Bin Luo

2 December 2020 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
HDHamza Djigal
Hamza Djigal
Jun FengJun Feng
Jun Feng
JLJiamin Lu
Jiamin Lu
JGJidong Ge
Jidong Ge
Efficient scheduling algorithms are key for attaining high performance in heterogeneous computing systems. In this paper, we propose a new list scheduling algorithm for assigning task graphs to fully connected heterogeneous processors with an aim to minimize the scheduling length. The proposed algorithm, called Improved Predict Priority Task Scheduling (IPPTS) algorithm has two phases: task prioritization phase, which gives priority to tasks, and processor selection phase, which selects a processor for a task. The IPPTS algorithm has a quadratic time complexity as the related algorithms for the same goal, that is O(t 2 x p), for t tasks and p processors. Our algorithm reduces the scheduling length significantly by looking ahead in both task prioritization phase and processor selection phase. In this way, the algorithm is looking ahead to schedule a task and its heaviest successor task to the optimistic processor, i.e., the processor that minimizes their computation and communication costs. The experiments based on both randomly generated graphs and graphs of real-world applications show that the IPPTS algorithm significantly outperforms previous list scheduling algorithms in terms of makespan, speedup, makespan standard deviation, efficiency, and frequency of best results.

11 April 2023 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
YFYe Fan
Ye Fan
JGJidong Ge
Jidong Ge
Sheng ZhangSheng Zhang
Sheng Zhang
JWJie Wu
Jie Wu
BLBin Luo
Bin Luo
Mobile Edge Computing (MEC) is a promising solution to enhance the computing capability of resource-limited networks. A fundamental problem in MEC is efficiently offloading tasks from user devices to edge servers. However, there still exists a gap to deploy in real-world environments: 1) traditional centralized approaches needs complete information of edge network, ignoring the communication costs generated by synchronization, 2) previous works do not consider concurrent computation on edge servers, which may cause dynamic changes in the environment, and 3) the scheduling algorithm should deliver individualized decisions for different users independently and with high efficiency To solve this mismatch, we studied a multi-user task offloading problem where user devices make offloading decisions independently. We consider the concurrent execution of tasks and formulate a non-divisible and delay-aware task offloading problem to jointly minimize the dropped task ratio and long-term latency. We propose a decentralized task scheduling algorithm based on DRL that makes offloading decisions without knowing the information of other user devices. We employ Double-DQN, Dueling-DQN, Prioritized Replay Memory, and Recurrent Neural Network (RNN) techniques to improve the algorithm's performance. The results of simulation experiments show that our method can significantly reduce the long-term latency and dropped task ratio compared to the baseline algorithms.

14 October 2021 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
YCYu Chen
Yu Chen
Sheng ZhangSheng Zhang
Sheng Zhang
YJYibo Jin
Yibo Jin
ZQZhuzhong Qian
Zhuzhong Qian
MXMingjun Xiao
Mingjun Xiao
SLSanglu Lu
Sanglu Lu
In the multi-access edge computing environment, app vendors deploy their services and applications at the network edges, and edge users offload their computation tasks to edge servers. We study the user-perceived delay-aware service placement and user-allocation problem in edge environment. We model the MEC-enabled network, where the user-perceived delay consists of computing delay and transmission delay. The total cost in the offloading system is defined as the sum of service placement, edge server usage and energy consumption cost, and we need to minimize the total cost by determining the overall service-placing decision and user-allocation decision, while guaranteeing that the user-perceived delay requirement of each user is fulfilled. Our considered problem is formulated as a Mixed Integer Linear Programming problem, and we prove its NP-hardness. Due to the intractability of the considered problem, we propose a LOCal-search based algorithm for USer-perceived delay-aware service placement and user-allocation in edge environment, named LOCUS, which starts with a feasible solution and then repeatedly reduces the total cost by performing local-search steps. After that, we analyze the time complexity of LOCUS and prove that it achieves provable guaranteed performance. Finally, we compare LOCUS with other existing methods and show its good performance through experiments.