Borui Wan

Borui Wan

Auto-generated profile, based on publicly available information

Borui Wan

The University of Hong Kong, Hong Kong, Hong Kong

Research Focus & Metrics

Academic Career Length

3Years (2024-Present)

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

Representative Publications

View All Publications
20 February 2024
Verified
Conference Paper
Open access
JZJuntao Zhao
Juntao Zhao
BWBorui Wan
Borui Wan
CWChuan Wu
Chuan Wu
YPYanghua Peng
Yanghua Peng
HLHaibin Lin
Haibin Lin
The immense sizes of Large-scale language models (LLMs) have led to high resource demand and cost for running the models. Though the models are largely served using uniform high-caliber GPUs nowadays, utilizing a heterogeneous cluster with a mix of available high- and low-capacity GPUs can potentially substantially reduce the serving cost. This paper proposes LLM-PQ, a system that advocates adaptive model quantization and phase-aware partition to improve LLM serving efficiency on heterogeneous GPU clusters. Extensive experiments on production inference workloads demonstrate throughput improvement in inference, showing great advantages over state-of-the-art works.

12 October 2025
Verified
Conference Paper
Open access
BWBorui Wan
Borui Wan
GLGaohong Liu
Gaohong Liu
ZSZuquan Song
Zuquan Song
JWJun Wang
Jun Wang
YZYun Zhang
Yun Zhang
LXLiang Xiang
Liang Xiang

26 April 2026
Verified
Conference Paper
Open access
GSGuangming Sheng
Guangming Sheng
YTYuxuan Tong
Yuxuan Tong
BWBorui Wan
Borui Wan
WZWang Zhang
Wang Zhang
CJChaobo Jia
Chaobo Jia
CWChuan Wu
Chuan Wu
Reinforcement learning (RL) post-training for Large Language Models (LLMs) is now scaling to large clusters and running for extended durations to enhance model reasoning performance. However, the scalability of existing RL frameworks is limited, as extreme long-tail skewness in RL trajectory generation causes severe GPU underutilization. Current asynchronous RL systems attempt to mitigate this, but they rely on global weight synchronization between the actor and all rollouts, which creates a rigid model update schedule. This global synchronization is ill-suited for the highly skewed and evolving distribution of trajectory generation latency in RL training, crippling training efficiency. Our key insight is that efficient scaling requires breaking this lockstep through trajectory-level asynchrony, which generates and consumes each trajectory independently. We propose Laminar, a scalable and robust RL post-training system built on a fully decoupled architecture. First, we replace global updates with a tier of relay workers acting as a distributed parameter service. This enables asynchronous and fine-grained weight synchronization, allowing rollouts to pull the latest weight anytime without stalling the actor's training loop. Second, a dynamic repack mechanism consolidates long-tail trajectories onto a few dedicated rollouts, maximizing generation throughput. The fully decoupled design also isolates failures, ensuring robustness for long-running jobs. Our evaluation on a 1024–GPU cluster shows that Laminar achieves up to 5.48X training throughput speedup over state-of-the-art systems, while reducing model convergence time.

26 April 2026
Verified
Conference Paper
Open access
JZJuntao Zhao
Juntao Zhao
QLQi Lu
Qi Lu
WJWei Jia
Wei Jia
BWBorui Wan
Borui Wan
LZLei Zuo
Lei Zuo
CWChuan Wu
Chuan Wu
Modern frameworks for training large foundation models (LFMs) employ dataloaders in a data-parallel manner, with each loader processing a disjoint subset of training data. When preparing data for LFM training that originates from multiple, distinct sources, two fundamental challenges arise. First, due to the quadratic computational complexity of the attention operator, the non-uniform sample distribution over data-parallel ranks leads to significant workload imbalance among dataloaders, degrading the training efficiency. Second, supporting diverse data sources requires per-dataset file access states that are redundantly replicated across parallel loaders, consuming excessive memory. This also hinders dynamic data mixing (e.g., curriculum learning) and causes redundant access/memory overhead in hybrid parallelism. We present MegaScale-Data, an industrial-grade distributed data loading architecture for multisource LFMs training, with three key innovations: (1) Disaggregated data preprocessing via role-specific actors (Source Loaders/Data Constructors) to eliminate source and parallelism redundant data access and ensure multisource scalability. (2) Centralized and declarative data plane for load-time multisource orchestration, such as long-short context, multimodality, and curriculum learning. (3) Multi-level auto-partitioning and scaling mechanism for source loaders under heterogeneous preprocessing costs. We also contribute our designs and operational experience in deployment and fault tolerance. MegaScale-Data achieves up to: (1) 4.5X end-to-end training throughput improvement, and (2) 13.5X reduction in CPU memory usage.