Pith. sign in

REVIEW 2 cited by

Optimizing Distributed ML Communication with Fused Computation-Collective Operations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2305.06942 v2 pith:WDXMR5BA submitted 2023-05-11 cs.DC cs.AR

classification cs.DCcs.AR
keywords communicationcomputationall-to-allapproachexecutionfusedtimecollective
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In order to satisfy their ever increasing capacity and compute requirements, machine learning models are distributed across multiple nodes using numerous parallelism strategies. As a result, collective communications are often on the critical path, and hiding their latency by overlapping kernel-granular communication and computation is difficult due to the absence of independent computation. In this work, we propose fusing computation with dependent collective communication by leveraging GPUs' massive parallelism and GPU-initiated communication. We have developed self-contained GPU kernels where workgroups (WGs) immediately communicate their results to remote GPUs when they complete their computation. Meanwhile, other WGs within the same kernel perform overlapping computation, maintaining high ALU utilization. We demonstrate our approach by creating three prototype fused operators (embedding + All-to-All, GEMV + AllReduce, and GEMM + All-to-All) to address the pervasive communication overheads observed in DLRM, Transformers and MoE model architectures. In order to demonstrate that our approach can be integrated into ML frameworks for wide adoption in production environments, we expose our fused operators as new PyTorch operators as well as extend the Triton framework to enable them. Our evaluations show that our approach can effectively overlap communication with computations, subsequently reducing their combined execution time than the current collective library-based approaches. Our scale-up GEMV + AllReduce and GEMM + All-to-All implementations achieve up to 22% and 20% lower execution time, while our fused embedding + All-to-All reduces execution time by 20% and 31% for intra-node and inter-node configurations. Large scale-out simulations indicate that our approach reduces DLRM execution time by 21% for 128 node system.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Triton-distributed: Programming Overlapping Kernels on Distributed AI Systems with the Triton Compiler

    cs.DC 2025-04 conditional novelty 6.0 of 10

    Triton-distributed adds OpenSHMEM-compatible communication primitives to the Triton compiler, enabling Python-level distributed kernels with fine-grained computation-communication overlap that match or beat hand-writt...

  2. Optimizing ML Concurrent Computation and Communication with GPU DMA Engines

    cs.AR 2024-12 conditional novelty 6.0 of 10

    Using DMA engines for collectives (ConCCL) lifts concurrent compute-communication speedup on MI300X from 21% to 72% of ideal.

Pith tools