Processing-in-Memory (PIM)

Cross-cuts: Compute
last updated 2026-08-31 · +3 sources in last 30d
Assessment draft · unreviewed
Viability
3/5
Drivers
4/5
Novelty
3/5
Diffusion
2/5
Impact
4/5

Timing Soon (2-5yr) · Read Fairly rated

In-Memory Computing In-Memory Computing Memcapacitor Memcapacitor SRAM Compute-in-Memory SRAM Compute-in-Mem… Charge-Domain Compute Charge-Domain Compu… HBM (High-Bandwidth Memory) HBM (High-Bandwidth… 3D DRAM 3D DRAM Processin…

Processing-in-Memory puts arithmetic and logic inside or immediately beside the memory arrays so that memory-bound workloads such as LLM decoding, graph traversal and vector search stop paying for data movement; the physics is sound and simulated speedups are large, but real PIM silicon remains scarce and almost every published number is a simulator number.

Summary

The parameters that decide whether a PIM design wins are consistent across the papers. First, kernel arithmetic intensity: LLM decoding is dominated by memory-bound GEMV or flat GEMM and is therefore the canonical target. Second, the area cost of putting processing elements inside DRAM, which reduces usable memory capacity, and the weakness of logic that can be built in a DRAM process at all. Third, communication inside the memory: prior transformer PIM designs suffered costly inter-bank traffic and could not scale past bank capacity, and PIM units have small local memory, expensive inter-unit communication and relatively weak compute. Fourth, for non-volatile PIM, device reliability and thermal noise, which perturb stored weights and degrade inference accuracy. Fifth, the host interface: how a CPU or GPU shares address space and bus with the PIM device without bank conflicts and bus congestion eating the gain.

The response to those constraints in 2025-2026 work is architectural rather than device-level: decouple logic and memory into chiplets built in different process nodes and connect them over an interposer, then attach the module over CXL; mix substrates so each kernel lands on the device that suits it, for example SRAM-PIM for latency-critical attention and HBM-PIM for weight-heavy GEMV, or a matrix tile plus a traversal tile in one 2.5D package; and add a scheduler that decides at runtime what goes to PIM and what stays on the host.

A separate strand treats content-addressable memory as the PIM primitive rather than arithmetic. Reformulating Insert, Search, Update and Delete as in-situ content-addressable operations turns indexing itself into a memory operation, and a hardware-first graph database model has been specified around a small content-addressable instruction set (CAR, CAR2, AAR) with a dually-addressable memory implemented in ordinary FPGA block RAM rather than exotic devices.

Evidence base

Open questions


Assessment drafted 2026-08-31 from up to 18 KB sources using the technology-scorecard framework; scores are a draft read pending review.

Recent mentions

Related concepts

Frontier questions