Computation vs. Communication Scaling for Future Transformers on Future Hardware
Not on the map. Why?
Abstract (arXiv)
Scaling neural network models has delivered dramatic quality gains across ML problems. However, this scaling has increased the reliance on efficient distributed training techniques. Accordingly, as with other distributed computing scenarios, it is important to understand how will compute and communication scale relative to one another as models scale and hardware evolves? A careful study which answers this question can better guide the design of future systems which can efficiently train future large models. Accordingly, this work provides a comprehensive multi-axial (algorithmic, empirical, hardware evolution) analysis of compute vs. communication (Comp-vs.-Comm) scaling for future Transformer models on future hardware. First, our algorithmic analysis shows that compute generally enjoys an edge over communication as models scale. However, since memory capacity scales slower than compute, these trends are being stressed. Next, we quantify this edge by empirically studying how Comp-vs.-Comm scales for future models on future hardware. To avoid profiling numerous Transformer models across many setups, we extract execution regions and project costs using operator models. This allows a spectrum (hundreds) of future model/hardware scenarios to be accurately studied (<15% error), and reduces profiling costs by 2100×. Our experiments show that communication will be a significant portion (40-75%) of runtime as models and hardware evolve. Moreover, communication which is hidden by overlapped computation in today's models often cannot be hidden in future, larger models. Overall, this work highlights the increasingly large role communication will play as models scale and discusses techniques and upcoming technologies that can help address it.
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 6 Feb 2023.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2023: 2; 2024: 0; 2025: 4; 2026: 1.
7 papers.
- 2025PonderLM: Pretraining Language Models to Ponder in Continuous Spacecited by 44
- 2025PonderLM-2: Pretraining LLM with Latent Thoughts in Continuous Spacecited by 16
- 2023MAD Max Beyond Single-Node: Enabling Large Machine Learning Model Acceleration on Distributed Systemscited by 14
- 2025MeSH: Memory-as-State-Highways for Recursive Transformerscited by 8
- 2025Tensor-Parallelism with Partially Synchronized Activationscited by 4
- 2026Pretraining with Token-Level Adaptive Latent Chain-of-Thoughtcited by 4
- 2023Just-in-time Quantization with Processing-In-Memory for Efficient ML Trainingcited by 1
- 2026Pretraining with Token-Level Adaptive Latent Chain-of-Thought9 Feb 2026
- 2025MeSH: Memory-as-State-Highways for Recursive Transformers9 Oct 2025
- 2025PonderLM-2: Pretraining LLM with Latent Thoughts in Continuous Space27 Sep 2025
- 2025Tensor-Parallelism with Partially Synchronized Activations24 Jun 2025
- 2025PonderLM: Pretraining Language Models to Ponder in Continuous Space27 May 2025
- 2023Just-in-time Quantization with Processing-In-Memory for Efficient ML Training8 Nov 2023
- 2023MAD Max Beyond Single-Node: Enabling Large Machine Learning Model Acceleration on Distributed Systems4 Oct 2023