Data Gravity and the Energy Limits of Computation
Wonsuk Lee, Jehoshua Bruck

TL;DR
This paper introduces the concept of data gravity and an energy measure to analyze how data movement impacts the energy efficiency and scaling limits of computation, especially in AI and large language models.
Contribution
It proposes a new framework with the operation-operand disjunction constant and data gravity metaphor to quantify and optimize data placement for energy efficiency.
Findings
Bringing computation closer to data reduces energy consumption significantly.
High data gravity values threaten to limit the growth of large language models.
The framework aligns with measurements across various processor technologies and architectures.
Abstract
Unlike the von Neumann architecture, which separates computation from memory, the brain tightly integrates them, an organization that large language models increasingly resemble. The crucial difference lies in the ratio of energy spent on computation versus data access: in the brain, most energy fuels compute, while in von Neumann architectures, data movement dominates. To capture this imbalance, we introduce the \emph{operation-operand disjunction constant} , a dimensionless measure of the energy required for data transport relative to computation. As part of this framework, we propose the metaphor of \emph{data gravity}: just as mass exerts gravitational pull, large and frequently accessed data sets attract computation. We develop expressions for optimal computation placement and show that bringing the computation closer to the data can reduce energy consumption by a factor of…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
