Papers for

memory system engineers

Papers whose findings have a practical use for this group, as judged from the abstract. Open a paper to read what it means in practice.

Physical causes of memory errors in DRAM explained and unified

A Unified Device-Level Physical Framework for DRAM Read Disturbance

Abstract: Read disturbance in dynamic random-access memory (DRAM) depends on both local device interactions and the electrical conditions imposed by shared array circuitry. Here, we combine DIMM-level characterization results, device measurements, and TCAD simulations to interpret RowHammer, RowPress, and ColumnDisturb within a unified device-level physical framework. We relate charge evolution at the floating storage node to three key mechanisms: trap-assisted electron migration (EM), capacitive coupling (CC), and sense-amplifier-mediated disturb (SAMD). EM is local and trap-sensitive, while CC weakens with wordline separation. SAMD extends disturbance through shared column circuitry by modifying unselected-cell leakage under rail-level bitline biases, a contribution supported by the approximately ninefold higher OFF-state leakage measured relative to retention-like conditions for a high-voltage storage state. These distinct spatial ranges account for localized RowHammer and RowPress failures and remote ColumnDisturb populations with abrupt changes at subarray boundaries. We further interpret prolonged RowPress activation as a transition from an initial RowHammer-like transient to sustained leakage driven mainly by SAMD under held wordline and bitline biases. Within this device-level framework, trap effectiveness and storage-state-dependent leakage provide an interpretation of previously puzzling failure signatures, including the earlier onset of 0-to-1 RowHammer failures despite the predominance of 1-to-0 failures at high hammer counts. The same framework explains the observed RowPress and ColumnDisturb polarities and the duration-dependent reversal of neighboring- and passing-wordline effectiveness. These results provide a physical basis for developing compact DRAM reliability models across access patterns and array configurations.

Fri 13 NovHardware Architecture
The gist
Memory chips called DRAM sometimes experience errors when certain rows are read repeatedly. The authors explain these errors by combining measurements and detailed simulations to understand how electrons move and interact inside the memory chips. They identify three main ways these disturbances happen, involving local electron traps, electrical coupling between cells, and shared circuitry effects. This unified picture helps explain various puzzling error behaviors and could guide improved reliability models for DRAM memory.
Open → 2611.17634v1

HARE speeds up detecting read disturbance faults in DRAM memory

HARE: Fast Read Disturbance Threshold Profiling in Modern DRAM Chips via Reduced Timing Constraints

Abstract: Modern DRAM chips are vulnerable to read disturbance, which manifests as bitflips in a victim row physically near an aggressor row that is repeatedly activated. State-of-the-art mitigations rely on accurate and exhaustive profiling of the read disturbance threshold (RDT), i.e., the minimum number of aggressor row activations needed to induce the first bitflip. However, RDT changes significantly and unpredictably over time, motivating online profilers that dynamically adjust a mitigation's RDT configuration. RDT profiling is costly for online profilers (e.g., hundreds of seconds for a 16-bank DDR4 module) because 1) measuring a single DRAM row's RDT requires many activations and 2) each DRAM row can have a different RDT, requiring many rows to be profiled. We introduce HARE, an online RDT profiling technique that intentionally exacerbates read disturbance to quickly profile a DRAM module. HARE's key idea is to reduce the timing constraints between consecutive DRAM commands during profiling. Doing so significantly reduces profiling time by 1) directly reducing the execution time of the profiling command sequence and 2) exacerbating read disturbance such that the first bitflip occurs at a smaller activation count than with the conventional RowHammer sequence. From our characterization of 180 real DDR4 DRAM chips from four major DRAM manufacturers, we make three observations. First, HARE measures a DRAM row's RDT 31.2% faster than the RowHammer profiler and a DRAM module's minimum RDT with an average reduction of 21.7%. Second, HARE flips more than 95% of the cells that the RowHammer pattern flips. Third, HARE preserves the RDT ranking of rows well enough such that it can exhaustively reprofile a small set of rows to improve its minimum RDT estimation. Our end-to-end evaluations show that HARE enables significant system performance improvements and outperforms the RowHammer profiler.

Wed 11 NovHardware ArchitectureCryptography and Security
The gist
DRAM memory chips can develop errors when certain nearby memory rows are accessed repeatedly, a problem called read disturbance. The authors present HARE, a new way to measure how many times a memory row can be accessed before errors happen, doing it much faster than before. HARE works by intentionally making these errors appear sooner using reduced timing delays, which helps identify vulnerable memory areas quickly. Their tests on many real DRAM chips show that HARE is faster and almost as accurate as older methods and helps improve system performance.
Open → 2611.15469v1

Capacity of single neurons and threshold functions precisely quantified

Boolean threshold functions, neuron capacity, and memory retrieval

Abstract: How much information can a single neuron remember? How many memories can neural networks retrieve without creating false memories? These questions are related to a basic question: how many Boolean threshold functions $f(x)=\operatorname{sgn}(a_0+\langle a,x\rangle)$, $x\in\{-1,1\}^n$, are there? In this paper, we show that the number $T_n$ of distinct Boolean threshold functions is \[ T_n=2\binom{2^n-1}{n}\bigl(1+O(n^{-99})\bigr). \] Equivalently, the capacity of a single threshold neuron is $n^2-\log_2(n!)+1+O(n^{-99})$ bits, improving the $O(n)$ error term in the result of Kahn--Komlós--Szemerédi to $O(n^{-99})$. To prove this, we show that, for $1\le r\le n-1$, and $v_1,\ldots,v_r$ are chosen at random from $\{-1,1\}^n$, \[ \mathbb P\!\left\{ \langle v_1,\ldots,v_r\rangle\cap\{-1,1\}^n =\{\pm v_1,\ldots,\pm v_r\} \right\} =1-O(n^{-99}). \] In the context of the Kanter--Sompolinsky Hamiltonian for memory retrieval, this identifies $r=n-1$ as a sharp threshold, at which, for almost every collection of $r$ memories, the only ground states are these memories and their negatives, confirming a weaker form of the Kalai--Linial--Odlyzko conjecture. It also settles a recent open problem posed by M. Anthony on the specification number of Boolean threshold functions. In addition, we show that, for every $1\le r\le n-1$, \[ \mathbb P\{v_1,\ldots,v_r\text{ are linearly dependent}\} =2\binom r2\,2^{-n}+O\!\left(2^{-n}e^{-cn}\right), \] confirming a conjecture of Kahn--Komlós--Szemerédi.

Thu 24 SeptDiscrete MathematicsNeural and Evolutionary Computing
The gist
This paper addresses how much a single neuron can remember and how many memories neural networks can retrieve without errors. The authors precisely count the number of Boolean threshold functions a neuron can implement, improving previous estimates with much smaller error margins. They also find a sharp boundary where collections of memories can be perfectly recalled without false states, confirming long-standing conjectures. Their work improves understanding of neuron memory capacity and helps clarify mathematical properties of neural networks.
Open → 2609.29756v1

Mamba recall capacity improves with hashing and model size

On the Recall Scaling Laws in Mamba: A Theoretical and Mechanistic Study via Hashing

Abstract: Associative Recall (AR) is the cognitive ability to learn and retrieve links between items in memory. In NLP, AR is used as a benchmark for evaluating the in-context memory capacity of architectures such as Mamba, and has been found to strongly correlate with language modeling performance. This paper explores AR from the perspective of mechanistic interpretability, aiming to reverse-engineer the exact internal algorithm used by Mamba to perform recall. Our key insight is that Mamba performs recall by implicitly learning linear hash functions, and we identify the low-level circuit that enables this behavior. Building on these findings and inspired by theoretical tools in similarity-preserving hashing, such as the Johnson-Lindenstrauss lemma, we develop a theoretical framework for analyzing AR, which we term Recall Scaling Laws. Given the vocabulary size and the number of facts in context, this framework allows us to (1) predict the embedding and state dimensions required for Mamba to achieve perfect recall, (2) predict recall success probability given the model dimensions, and (3) analyze multi-layer models and multi-head SSM patterns. Empirical results show that our theoretical findings are accurate and predictive, offering insights into how AR capacity scales with vocabulary, state, embedding size, and architecture.

Mon 7 SeptMachine LearningComputation and Language
The gist
Remembering connections between things is important for both humans and AI models. This paper studies how the AI model Mamba remembers facts by discovering it uses a kind of mathematical shortcut called linear hashing. The researchers created a theory that predicts how well Mamba can recall information based on its size and design. Their predictions matched experiments, which helps us understand how memory in AI could get better as models grow.
Open → 2609.07681v1