Zhuolong Jiang

Dr. Zhuolong Jiang


Research Focus & Metrics

Academic Career Length

2Years (2025-Present)

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

Representative Publications

View All Publications
5 November 2025 in IEEE Transactions on Computers
Verified
Journal Article
Closed access
ZJZhuolong Jiang
Zhuolong Jiang
ZCZinuo Cai
Zinuo Cai
HZHongyu Zhao
Hongyu Zhao
BZBaoheng Zhang
Baoheng Zhang
TWTianqi Wu
Tianqi Wu
RBRajkumar Buyya
Rajkumar Buyya
With the rapid growth of artificial intelligence and large-scale model computing, the demand for GPUs in datacenters continues to increase, especially for large-scale training and inference tasks. Heterogeneous multi-GPU systems, which integrate GPUs with varying types and computational capabilities, have become critical computing resources. This leads to two main challenges. First, due to the differences in GPU performance and power consumption, task scheduling involves a complex multi-objective optimization to balance energy efficiency and performance. More importantly, the lack of coordinated mechanisms for multi-task sharing and energy-efficient resource management across heterogeneous GPUs can result in GPU overload or underutilization, leading to wasted resources and potential system risks. To address these challenges, we propose HeShare, an energy-aware and efficient heterogeneous GPU framework for datacenters. First, we design an energy-aware task scheduling strategy that optimizes task allocation across different GPUs to achieve a balance between energy consumption and performance. Second, we introduce a GPU sharing optimization mechanism that adaptively configures MPS and DVFS settings for each GPU, enhancing resource utilization, reducing overall energy consumption, and ensuring task performance. Compared to the state-of-the-art framework, we reduce average energy costs by 26% and improve job completion time by 31%, achieving a balance between energy efficiency and performance.

12 January 2026 in IEEE Transactions on Computational Social Systems
Verified
Journal Article
Closed access
QYQiwei Yu
Qiwei Yu
HSHongjian Shi
Hongjian Shi
ZJZhuolong Jiang
Zhuolong Jiang
YQYuhan Qiu
Yuhan Qiu
Ruhui MaRuhui Ma
Ruhui Ma
HGHaibing Guan
Haibing Guan
With the global aging population on the rise, the amount of disease data related to the elderly is also increasing. Effectively protecting personal data when analyzing and processing disease data has become crucial. Federated learning (FL), as a proven method, is widely used. In the multimodal FL for disease diagnosis, the intricate challenge of modality missing and heterogeneous data distribution across healthcare clients severely degrades model performance and generalization. Existing frameworks struggle to address these issues in scenarios with complex modality missing and data heterogeneity, particularly in privacy-sensitive medical applications. In this article, we introduce a novel framework, modal prototype and contrast for personalized federated learning, which enhances prototype-based multimodal federated learning with personalized local aggregation and enables the adaptive fusion of global prototypes and local client models during training. By leveraging the modal prototype to compensate for missing modalities and modal contrastive training to align client representations with shared prototypes, the framework mitigates global model degradation caused by modality absence. In addition, we adapt the SLAKE medical multimodal dataset into a VQAv2-style classification task, simulating realistic disease diagnosis scenarios with varying modality missing rates (10 $\sim$ 90%). Experimental results demonstrate that our approach achieves state-of-the-art performance. Compared to the baselines, our method improved inference accuracy by up to 13.7% when 90% of the modality was missing during training.

1 August 2026 in IEEE Transactions on Parallel and Distributed Systems
Verified
Journal Article
Closed access
ZJZhuolong Jiang
Zhuolong Jiang
ZCZinuo Cai
Zinuo Cai
YLYumou Liu
Yumou Liu
Ruhui MaRuhui Ma
Ruhui Ma
RBRajkumar Buyya
Rajkumar Buyya

26 June 2026 in ACM Transactions on Architecture and Code Optimization
Verified
Journal Article
Open access
ZJZhuolong Jiang
Zhuolong Jiang
ZCZinuo Cai
Zinuo Cai
YLYawen Li
Yawen Li
ZWZizong Wang
Zizong Wang
Ruhui MaRuhui Ma
Ruhui Ma
BRBuyya Rajkumar
Buyya Rajkumar
With the rapid growth of deep learning applications and their increasing demand for computational resources, GPU acceleration has become critical for supporting large-scale, compute-intensive deep learning tasks. To improve GPU utilization, emerging GPU sharing technologies such as Multi-Instance GPU (MIG) and Multi-Process Service (MPS) have been widely employed. However, MIG suffers from inefficient resource allocation while MPS introduces performance interference. Although integrating MIG with MPS further enhances GPU sharing capability, this approach still requires complex configuration and coarse-grained scheduling for dynamic workloads, making it ineffective in handling variations in resource demand for online jobs and offline jobs. To address these challenges, we propose MMK , a multi‑level GPU sharing system that integrates MIG, MPS, and kernel‑level scheduling for online and offline jobs. First, we design a hybrid scheduler to efficiently configure MIG and MPS resources for dynamic job demands. Second, we develop a kernel scheduler to implement fine‑grained scheduling strategies that dynamically optimize kernel execution, thereby improving system throughput and reducing resource contention. Extensive experiments demonstrate that compared with the state-of-the-art framework, we reduce the average job completion time and makespan by 28% and 32%, respectively, and increase system throughput by 35%.


19 January 2026 in IEEE Transactions on Consumer Electronics
Verified
Journal Article
Closed access
SWShiquan Wang
Shiquan Wang
YDyicheng di
yicheng di
JBJiayu Bao
Jiayu Bao
ZJZhuolong Jiang
Zhuolong Jiang
HSHongjian Shi
Hongjian Shi
HGHaibing Guan
Haibing Guan
Recent advances in recommendation systems have highlighted the critical importance of data quality in model performance. In this paper, we propose a reinforcement learning based data weight optimization framework, termed RLWORec, to enhance data quality for both small recommendation models and large language model (LLM) fine-tuning scenarios. By dynamically assigning continuous importance weights to training samples via a policy gradient method under the Proximal Policy Optimization (PPO) framework, our approach effectively identifies and filters noisy data while preserving informative samples. Unlike traditional data selection methods that rely on static scoring mechanisms, RLWORec adaptively learns sample importance through iterative optimization with global performance feedback. Extensive experiments on three real-world datasets demonstrate that RLWORec consistently outperforms state-of-the-art data selection baselines, achieving superior recommendation performance with significantly reduced training data. Our method enables small models to exceed full-dataset performance using only carefully selected subsets, while allowing large models to achieve comparable results with merely 2% of the original training data.