pith. sign in

arxiv: 2411.13055 · v2 · pith:V4ACOPCXnew · submitted 2024-11-20 · 💻 cs.LG · cs.DC

Hardware Scaling Trends and Diminishing Returns in Large-Scale Distributed Training

classification 💻 cs.LG cs.DC
keywords traininghardwaremodeldistributedlargeparallelizationscalingstrategies
0
0 comments X
read the original abstract

Dramatic increases in the capabilities of neural network models in recent years are driven by scaling model size, training data, and corresponding computational resources. To develop the exceedingly large networks required in modern applications, such as large language models (LLMs), model training is distributed across tens of thousands of hardware accelerators (e.g. GPUs), requiring orchestration of computation and communication across large computing clusters. In this work, we demonstrate that careful consideration of hardware configuration and parallelization strategy is critical for effective (i.e. compute- and cost-efficient) scaling of model size, training data, and total computation. We conduct an extensive empirical study of the performance of large-scale LLM training workloads across model size, hardware configurations, and distributed parallelization strategies. We demonstrate that: (1) beyond certain scales, overhead incurred from certain distributed communication strategies leads parallelization strategies previously thought to be sub-optimal in fact become preferable; and (2) scaling the total number of accelerators for large model training quickly yields diminishing returns even when hardware and parallelization strategies are properly optimized, implying poor marginal performance per additional unit of power or GPU-hour.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

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

  1. Dynamic Core Allocation for Malleable Jobs with Unknown Speed-up Parameters

    math.OC 2026-06 unverdicted novelty 5.0

    Iterative estimation of unknown speed-up parameters via MLE combined with MDP-based policy updates for dynamic core allocation to malleable jobs.