Latency
How long does one request take? Crucial for voice, search, and interactive agents.
MEMORY × COMPUTE
The math is fast. Fetching the numbers is not. Chip design is the story of shrinking that wait.
Built from a conversation about Cerebras, GPUs, SRAM, model weights, and why memory keeps moving closer to compute.
Read the source chat ↗FIRST PRINCIPLE
A processor does arithmetic on values. Memory holds the instructions, model weights, pixels, and intermediate results that arithmetic needs.
The catch: storage gets larger as it moves farther from the arithmetic—but also slower and more expensive to reach. Engineers build a hierarchy instead of choosing one kind of memory.
The central trade: tiny and immediate at the top; vast and patient at the bottom.
Registers are the smallest, fastest working locations. They are not cache; they hold the values an instruction is operating on now.
THE REAL COST
Slide memory away from compute.
Short wires, little waiting, high bandwidth.
This is a conceptual model, not a benchmark. Actual latency and energy depend on architecture, process, packaging, access pattern, and workload.
FOUR ANSWERS
THE CLASSIC MODULAR COMPUTER
Separate parts are easier to manufacture, cool, replace, and scale. The price is a narrower path between them.
A wafer accumulates manufacturing defects. Cutting it into many dies lets a defect ruin one die instead of an entire wafer. Smaller chips are also easier to cool and pair with replaceable memory. Cerebras made the opposite bet possible with redundancy, routing around defects, custom cooling, and system-level design.
THE MODEL-SIZE PROBLEM
Inference needs the model’s weights available, but not necessarily on one chip.
Systems split layers or tensors across processors, reduce precision through quantization, and stream activations between devices. More memory capacity is helpful; faster movement is also helpful. Neither number alone decides the winner.
Capacity-only illustration. Real serving also needs KV cache, activations, runtime buffers, headroom, interconnect, and a workable mapping.
HOW TO COMPARE
There is only a fastest system for a specific job, scale, budget, and software stack.
How long does one request take? Crucial for voice, search, and interactive agents.
How much total work finishes per second? High throughput can coexist with slow individual responses.
How quickly can weights and activations reach compute? Especially important during token-by-token decode.
Performance per watt and per dollar determine what can run economically at scale.
How well do many chips cooperate? Interconnects and parallelism turn parts into a system.
Compilers, frameworks, libraries, operators, and developer familiarity can outweigh raw silicon.
CPU caches anticipate what comes next. Apple lets CPU and GPU share a pool. NVIDIA stacks HBM beside accelerators and links many GPUs. Groq schedules data deterministically. Cerebras keeps vast compute and SRAM on one wafer. Different tactics; the same enemy.
KEEP GOING
Vendor performance claims depend on model, precision, batch size, latency target, software, system configuration, and benchmark methodology. Use independent, workload-matched tests before purchasing or investing.
NEXT EXPLANATIONHow the internet finds a website →