Pith. sign in

REVIEW 2 cited by

ATP: Adaptive Tensor Parallelism for Foundation Models

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 2301.08658 v1 pith:PILO62OP submitted 2023-01-20 cs.DC

classification cs.DC
keywords parallelismtensorfoundationmodelstrainingcommunicationmodelperformance
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

Foundation models have impressive performance and generalization capabilities across a wide range of applications. The increasing size of the models introduces great challenges for the training. Tensor parallelism is a critical technique that is currently used in almost all foundation model training and has a significant impact on overall training performance. However, current tensor parallelism in machine learning frameworks misses optimization opportunities in fitting various interconnection topologies. In this work, we present ATP, an adaptive tensor parallelism framework for foundation models, which can automatically select the optimal parallel strategy on different interconnections. We propose column- and row-first tensor parallelism based on 2D device meshes and construct a search space. Combined with the hierarchical communication matrix, ATP can identify the optimal strategy in the search space. We also propose chunk-based overlapping to reduce communication overhead. Our evaluations show ATP consistently outperforms the state-of-the-art approaches for various model sizes and interconnects, achieving end-to-end training performance improvements of up to 37-64% on specific interconnects. Based on our theoretical model, the communication overhead of ATP decreases with scaling, indicating a qualitative leap forward.

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. Cascade: Exploiting SLO-Aware latency budget for fair and high goodput LLM inference serving

    cs.DC 2026-08 conditional novelty 6.0 of 10

    Cascade coordinates request scheduling and multi-tier KV-cache movement through a single per-request latency budget, improving SLO-satisfied goodput by up to 2.4x in simulation.

  2. EcoServe: Enabling Cost-effective LLM Serving with Proactive Intra- and Inter-Instance Orchestration

    cs.DC 2025-04 conditional novelty 4.0 of 10

    A time-sliced, cyclically staggered scheduling strategy, partial disaggregation, is shown to improve SLO-aware goodput for 30B to 72B LLMs on commodity-interconnect clusters relative to co-located and fully disaggrega...

Pith tools