Qinghua Wu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Qinghua Wu has a total of 92 co-authors. Here are the top co-authors by number of shared publications:
- Zhenyu Li
Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China and University of Chinese Academy of Sciences, Beijing, China
14 shared publications - Gaogang Xie
Chinese Academy of Sciences
12 shared publications - Gerui Lv
Institute of Computing Technology, University of Chinese Academy of Sciences, Beijing, China
9 shared publications - Qingyue Tan
Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
4 shared publications - Ting Liu
Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
4 shared publications - Chuanqing Lin
Institute of Computing Technology, University of Chinese Academy of Sciences, Beijing, China
3 shared publications
Latest Publications
- 15 August 2026
- Published by Springer Nature
- p. 255-269
Moirai: Dependency-Impact-Based Communication Scheduling for Multi-job Distributed Deep Learning Cluster
- 15 August 2026
- Published by Springer Nature
- p. 255-269
Moirai: Dependency-Impact-Based Communication Scheduling for Multi-job Distributed Deep Learning Cluster
- Open Access
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1095-1108
GeoOrchestra: Orchestrating Heterogeneous Geo-Distributed Training with Network-Aware Scheduling
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1095-1108
Open AccessGeoOrchestra: Orchestrating Heterogeneous Geo-Distributed Training with Network-Aware Scheduling
- Open Access
- 25 June 2026
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 215
Jaca: Model-training and cluster feature based job scheduling for distributed deep learning cluster
- 25 June 2026
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 215
Open AccessJaca: Model-training and cluster feature based job scheduling for distributed deep learning cluster
- Open Access
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1604-1620
RLive: Robust Delivery System for Scaling Live Streaming Services
- 26 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 1604-1620
Open AccessRLive: Robust Delivery System for Scaling Live Streaming Services
- Open Access
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 5221-5230
Breath: Adaptive Protection Boundary in FEC Encoding for Mobile Real-Time Video Streaming
- 12 April 2026
- Published by Association for Computing Machinery (ACM)
- p. 5221-5230
Open AccessBreath: Adaptive Protection Boundary in FEC Encoding for Mobile Real-Time Video Streaming
- Open Access
- 27 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Multimedia Computing, Communications, and Applications
- Vol. 22  (3) , 1-23
Understanding and Taming the Inflated Latency in Mobile Cloud Rendering
Low-latency cloud rendering enables mobile users to experience high-quality, real-time 3D graphics but achieving low Motion-to-Photon (MTP) latency while maintaining smooth playback is a significant challenge. Our real-world measurement study identifies Receive-to-Composition (R2C) latency, caused by ineffective jitter buffer management, as the primary factor contributing to increased MTP latency. To address this, we introduce JitBright, a client-side optimization strategy that dynamically reduces MTP latency through adaptive jitter buffer management. By adjusting buffer levels based on smoothing playback probability and implementing proactive keyframe requests to mitigate frame dependency, JitBright minimizes both active and passive waiting times. Our large-scale evaluation, conducted over 591,000 sessions across diverse network conditions (WiFi, 4G, 5G) and device types, demonstrates significant improvements in user experience. JitBright reduces median R2C latency by up to 87.5%, increases the proportion of sessions meeting strict MTP latency requirements by 6%–27%, and decreases the video freeze rate from 2.4%–2.8% to 0.4%–1.0%.
- 27 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Multimedia Computing, Communications, and Applications
- Vol. 22  (3) , 1-23
Open AccessUnderstanding and Taming the Inflated Latency in Mobile Cloud Rendering
Low-latency cloud rendering enables mobile users to experience high-quality, real-time 3D graphics but achieving low Motion-to-Photon (MTP) latency while maintaining smooth playback is a significant challenge. Our real-world measurement study identifies Receive-to-Composition (R2C) latency, caused by ineffective jitter buffer management, as the primary factor contributing to increased MTP latency. To address this, we introduce JitBright, a client-side optimization strategy that dynamically reduces MTP latency through adaptive jitter buffer management. By adjusting buffer levels based on smoothing playback probability and implementing proactive keyframe requests to mitigate frame dependency, JitBright minimizes both active and passive waiting times. Our large-scale evaluation, conducted over 591,000 sessions across diverse network conditions (WiFi, 4G, 5G) and device types, demonstrates significant improvements in user experience. JitBright reduces median R2C latency by up to 87.5%, increases the proportion of sessions meeting strict MTP latency requirements by 6%–27%, and decreases the video freeze rate from 2.4%–2.8% to 0.4%–1.0%.
- Open Access
- 24 November 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 3  (CoNEXT4) , 1-26
Cost-efficient Request Mapping for Large-scale Live Streaming Services
The live streaming landscape has shifted to a crowd-sourced paradigm, resulting in highly volatile and geographically diverse viewer demand. To handle growing traffic, Content Delivery Networks (CDNs) increasingly rely on a mix of dedicated infrastructure and lower-cost, heterogeneous edge resources. Our analysis of production data reveals two emerging characteristics in modern live delivery: dynamic regional supply-demand imbalance and per-stream heterogeneity in popularity and geography. However, existing request mapping solutions fall short in this new landscape, as they assume stable regional capacity and overlook stream-level heterogeneity. This paper proposes LiveMap , a cost-efficient and latency-aware request mapping system for live CDNs. LiveMap performs online bandwidth provisioning via dual-level coordination to resolve regional supply-demand imbalances and reduce bandwidth costs. Further, LiveMap introduces an adaptive stream mapping strategy that dynamically forms per-stream delivery groups based on real-time popularity and system load. Deployed in Bilibili CDN serving crowdsourced live streaming over a year, LiveMap reduces bandwidth costs by 42.18% and access latency by 20.26%, outperforming the state-of-the-art solutions.
- 24 November 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 3  (CoNEXT4) , 1-26
Open AccessCost-efficient Request Mapping for Large-scale Live Streaming Services
The live streaming landscape has shifted to a crowd-sourced paradigm, resulting in highly volatile and geographically diverse viewer demand. To handle growing traffic, Content Delivery Networks (CDNs) increasingly rely on a mix of dedicated infrastructure and lower-cost, heterogeneous edge resources. Our analysis of production data reveals two emerging characteristics in modern live delivery: dynamic regional supply-demand imbalance and per-stream heterogeneity in popularity and geography. However, existing request mapping solutions fall short in this new landscape, as they assume stable regional capacity and overlook stream-level heterogeneity. This paper proposes LiveMap , a cost-efficient and latency-aware request mapping system for live CDNs. LiveMap performs online bandwidth provisioning via dual-level coordination to resolve regional supply-demand imbalances and reduce bandwidth costs. Further, LiveMap introduces an adaptive stream mapping strategy that dynamically forms per-stream delivery groups based on real-time popularity and system load. Deployed in Bilibili CDN serving crowdsourced live streaming over a year, LiveMap reduces bandwidth costs by 42.18% and access latency by 20.26%, outperforming the state-of-the-art solutions.
- Open Access
- 24 November 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 3  (CoNEXT4) , 1-25
Oceanus: Scheduling Traffic Flows to Achieve Cost-Efficiency under Uncertainties in Large-Scale Edge CDNs
Large-scale edge Content Delivery Networks (CDNs) provide low-latency content access services and suffer from high bandwidth costs. While previous studies have sought to optimize bandwidth costs under percentile billing, the efficacy is compromised due to the pervasive uncertainty inherent in practical systems, including traffic demand dynamics, performance-constrained scheduling bias, and systemic scheduling deviations. Such uncertainties can result in large gaps among optimal, expected, and actual utilization of massive vulnerable and heterogeneous edge nodes. To address these uncertainties, we propose Oceanus, a cost-effective traffic scheduling system for large-scale edge CDN systems. Oceanus decouples the bandwidth planning problem and performs on multiple timescales. In addition, Oceanus coordinates bandwidth planning with flow scheduling through the bidirectional feedback scheme. Oceanus further utilizes nodes with minimal marginal cost to reduce additional bandwidth cost. Extensive experiments in a trace-driven testbed and real-world deployment confirm the effectiveness of Oceanus. Compared to the state-of-the-art scheduling method, Oceanus achieves 79.4% (vs. 51.5%) of optimum cost reduction and reduces 21.4% (vs. 8.1%) bandwidth costs.
- 24 November 2025
- Published by Association for Computing Machinery (ACM) in Proceedings of the ACM on Networking
- Vol. 3  (CoNEXT4) , 1-25
Open AccessOceanus: Scheduling Traffic Flows to Achieve Cost-Efficiency under Uncertainties in Large-Scale Edge CDNs
Large-scale edge Content Delivery Networks (CDNs) provide low-latency content access services and suffer from high bandwidth costs. While previous studies have sought to optimize bandwidth costs under percentile billing, the efficacy is compromised due to the pervasive uncertainty inherent in practical systems, including traffic demand dynamics, performance-constrained scheduling bias, and systemic scheduling deviations. Such uncertainties can result in large gaps among optimal, expected, and actual utilization of massive vulnerable and heterogeneous edge nodes. To address these uncertainties, we propose Oceanus, a cost-effective traffic scheduling system for large-scale edge CDN systems. Oceanus decouples the bandwidth planning problem and performs on multiple timescales. In addition, Oceanus coordinates bandwidth planning with flow scheduling through the bidirectional feedback scheme. Oceanus further utilizes nodes with minimal marginal cost to reduce additional bandwidth cost. Extensive experiments in a trace-driven testbed and real-world deployment confirm the effectiveness of Oceanus. Compared to the state-of-the-art scheduling method, Oceanus achieves 79.4% (vs. 51.5%) of optimum cost reduction and reduces 21.4% (vs. 8.1%) bandwidth costs.
- Open Access
- 17 April 2025
- Published by MDPI AG in Machine Learning and Knowledge Extraction
- Vol. 7  (2) , 35
ADTime: Adaptive Multivariate Time Series Forecasting Using LLMs
Large language models (LLMs) have recently demonstrated notable performance, particularly in addressing the challenge of extensive data requirements when training traditional forecasting models. However, these methods encounter significant challenges when applied to high-dimensional and domain-specific datasets. These challenges primarily arise from inability to effectively model inter-variable dependencies and capture variable-specific characteristics, leading to suboptimal performance in complex forecasting scenarios. To address these limitations, we propose ADTime, an adaptive LLM-based approach for multivariate time series forecasting. ADTime employs advanced preprocessing techniques to identify latent relationships among key variables and temporal features. Additionally, it integrates temporal alignment mechanisms and prompt-based strategies to enhance the semantic understanding of forecasting tasks by LLMs. Experimental results show that ADTime outperforms state-of-the-art methods, reducing MSE by 9.5% and MAE by 6.1% on public datasets, and by 17.1% and 13.5% on domain-specific datasets. Furthermore, zero-shot experiments on real-world refinery datasets demonstrate that ADTime exhibits stronger generalization capabilities across various transfer scenarios. These findings highlight the potential of ADTime in advancing complex, domain-specific time series forecasting tasks.
- 17 April 2025
- Published by MDPI AG in Machine Learning and Knowledge Extraction
- Vol. 7  (2) , 35
Open AccessADTime: Adaptive Multivariate Time Series Forecasting Using LLMs
Large language models (LLMs) have recently demonstrated notable performance, particularly in addressing the challenge of extensive data requirements when training traditional forecasting models. However, these methods encounter significant challenges when applied to high-dimensional and domain-specific datasets. These challenges primarily arise from inability to effectively model inter-variable dependencies and capture variable-specific characteristics, leading to suboptimal performance in complex forecasting scenarios. To address these limitations, we propose ADTime, an adaptive LLM-based approach for multivariate time series forecasting. ADTime employs advanced preprocessing techniques to identify latent relationships among key variables and temporal features. Additionally, it integrates temporal alignment mechanisms and prompt-based strategies to enhance the semantic understanding of forecasting tasks by LLMs. Experimental results show that ADTime outperforms state-of-the-art methods, reducing MSE by 9.5% and MAE by 6.1% on public datasets, and by 17.1% and 13.5% on domain-specific datasets. Furthermore, zero-shot experiments on real-world refinery datasets demonstrate that ADTime exhibits stronger generalization capabilities across various transfer scenarios. These findings highlight the potential of ADTime in advancing complex, domain-specific time series forecasting tasks.
- Open Access
- 29 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 246-262
Chorus: Coordinating Mobile Multipath Scheduling and Adaptive Video Streaming
- 29 May 2024
- Published by Association for Computing Machinery (ACM)
- p. 246-262
Open AccessChorus: Coordinating Mobile Multipath Scheduling and Adaptive Video Streaming