Skip to content

Author

Kaihui Gao

2 papers indexed here

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Book Open access Aug 2026

PReCCL: Performant and Resilient Collective Communication via Integrated Inband Telemetry and Workload Reallocation

Modern collective communication libraries (CCLs) execute a collective communication task (CCT) by decomposing it into multiple sub-tasks, each mapped to a specific Virtual Topology (VT), which is an ordered graph of GPUs (e.g., a ring or a tree), to maximize parallelism and link utilization. As AI training scales to larger clusters, network anomalies (congestion and failures) are unavoidable, and a single straggling VT can delay the entire CCT. Existing solutions either rely on low-level transport-layer solutions which lacks a cross-sub-task perspective, or static CCL scheduling, failing to adapt to the dynamic and heterogeneous networks. We present PReCCL, a drop-in NCCL replacement that combines software inband telemetry with cross-VT workload reallocation. Unlike hardware-dependent telemetry (e.g., P4-INT), PReCCL implements in-band monitoring within the CCL. It precisely measures the stall counts of each VT, and piggybacks the telemetry meta-data on existing collective traffic. With this fine-grained visibility, PReCCL employs a dynamic cross-VT reallocation mechanism that shifts workloads from straggler VTs (suffering from congestion or faults) to healthy ones. Reallocation occurs only at CCT boundaries using an epoch-based deterministic protocol, avoiding cross-rank consistency races. We implement PReCCL in NCCL and evaluate it on a 32-GPU testbed, large-scale simulation, and a 1024-GPU production cluster. On the testbed, PReCCL improves CCT completion by up to 2.1X and end-to-end training by 1.21X, with low overhead above tuned message-size thresholds.

Zhiyong Chen, Kaihui Gao, Li Chen et al. · 0 citations
Book Open access Aug 2026

OptiFlow: Towards LLM-Driven Optimization of Collective Communication Algorithms

Training trillion-parameter models has made collective communication a dominant bottleneck in GPU clusters. Existing approaches face a fundamental tension: optimization-based synthesis techniques suffer from combinatorial complexity that can require minutes to hours, while analytic heuristics rely on rigid assumptions that often fail under production variability. To the best of our knowledge, we present OptiFlow, among the first LLM-driven frameworks for automated design of high-performance collective communication algorithms. Our key insight is a two-layer decomposition: the LLM generates compact data-movement intent expressed in a domain-specific language, while deterministic scheduling algorithms compile these programs into executable schedules. We further employ an iterative pipeline that uses real-hardware feedback to refine LLM-generated proposals, without updating model parameters or relying on manually designed search heuristics. Evaluated on a 32-GPU NVIDIA A100 cluster, OptiFlow discovers All-Gather schedules that outperform NCCL by up to 3.75 × , while it also surpasses TACCL and TE-CCL with gains up to 5.12 × and 3.28 × , and shows better optimization-time scalability.

Fei Long, Ziyue Yang, Kaihui Gao et al. · 0 citations