Pith. sign in

REVIEW 1 cited by

GC3: An Optimizing Compiler for GPU Collective Communication

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 2201.11840 v3 pith:RREFHGT3 submitted 2022-01-27 cs.DC

classification cs.DC
keywords collectivealgorithmscommunicationapplicationsbottleneckcompilercustomefficiently
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Machine learning models made up of millions or billions of parameters are trained and served on large multi-GPU systems. As models grow in size and execute on more GPUs, the collective communications used in these applications become a bottleneck. Custom collective algorithms optimized for both particular network topologies and application specific communication patterns can alleviate this bottleneck and help these applications scale. However, correctly and efficiently implementing custom algorithms is challenging. This paper introduces GC3, a system for programmable GPU communication. GC3 provides a domain specific language for writing collective communication algorithms and an optimizing compiler for lowering them to an executable form, which can be executed efficiently and flexibly in an interpreter based runtime. We used GC3 to write novel collective algorithms for AllReduce and AllToAll that are up to $1.9\times$ and $1.3\times$ faster than hand-optimized implementations, respectively.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

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

  1. Hecate: Unlocking Efficient Sparse Model Training via Fully Sharded Sparse Data Parallelism

    cs.DC 2025-02 conditional novelty 7.0 of 10

    Fully Sharded Sparse Data Parallelism materializes expert parameters on the fly with SparseAllGather and SparseReduceScatter, avoiding the overhead of expert rearrangement in MoE training.

Pith tools