Von Neumann Bottleneck
Updated 2026-08-08
INTRODUCTION
English translation pending.
CORE DEFINITION
Named after John von Neumann's stored-program architecture, the bottleneck describes how a single bus carrying both instructions and data forces the processor to idle while waiting for memory. Because computation has grown far faster than memory bandwidth, the gap, often called the memory wall, limits throughput regardless of how capable the arithmetic units are. Caching, prefetching, and near-memory computing are the standard responses.
SCAFFOLDING EFFECT
Reduce cognitive load
- Find the bus: ask who is waiting on whose data rather than who is smartest in the room - Move the work: push computation to where the data already sits instead of shipping data to the decider - Cut the traffic: cache, batch, and prefetch to reduce how often the slow channel is used
Anchor fast decisions
Instructions and data share one channel, so every operation requires at least one trip to memory. As processors accelerated, memory latency did not keep pace, and the transfer time now dominates execution. Adding faster arithmetic therefore yields little, while reducing data movement or relocating computation near the data attacks the actual constraint.
MINIMUM ACTION
In progress 0/1Practice this model in one real situation:
account_treeGenealogyexpand_more
menu_bookReferencesexpand_more
Source support: Explicit
- en.wikipedia.orghttps://en.wikipedia.org/wiki/Von_Neumann_architectureverified
PRIVATE NOTES · Only visible to you
SAVED Q&A
ENTRY Q&A · Private saving available
Ask with a clear boundary
thinkingmodels answers from published entry context only.
Your question is sent to thinkingmodels. The answer uses public entry context only.
RELATED MODELS