4.1.4 · D4Memory Technologies

Exercises — DRAM refresh and charge leakage

2,283 words10 min readBack to topic

Before we start, one shared picture of the quantities we will keep reusing. Every symbol below is earned here so you never meet it cold later.


Level 1 — Recognition

Problem L1.1

Which of these needs periodic refresh, and why: (a) a DRAM cell, (b) an SRAM cell?

Recall Solution

(a) DRAM needs refresh. Its bit is charge on a capacitor that leaks — the "dynamic" in Dynamic RAM. Left alone, decays and a stored 1 eventually looks like a 0. (b) SRAM does not. It holds its bit in a cross-coupled latch that actively drives the value from the supply rails. Nothing decays as long as power is on. See SRAM vs DRAM. Recognition test: "does the storage element passively hold charge, or actively drive?" Passive → refresh; active → none.

Problem L1.2

A cell decays as . Without computing, is the voltage after one closer to or of ?

Recall Solution

At : . So closer to . The number is the signature of "one time constant has passed" — memorise it. See RC time constant.


Level 2 — Application

Problem L2.1

A bank has rows and . Using distributed refresh, how often must a REF command fire?

Recall Solution

WHAT: we spread refreshes evenly across . WHY: distributed refresh avoids one long stall; each REF handles one row, so the gap between them is Notice: double the rows → half the interval compared to the parent's 8192-row example (). More rows in the same means firing REFs twice as often. See DDR SDRAM timing parameters.

Problem L2.2

A cell has , constant leakage , , . Using the constant-current (linear) model, how long until it crosses threshold?

Recall Solution

WHAT: find the time to remove the charge at a steady current. WHY constant current, not exponential? For a first estimate we assume the leak drains a fixed regardless of . Then charge leaves at a constant rate, so . A healthy cell survives seconds — yet the spec is . That gap exists because the weakest cells leak far worse (next levels).

Problem L2.3

Same cell, but now model the leak as a resistor (2 TΩ). Find and the retention time with .

Recall Solution

WHAT: compute the RC time constant, then the exponential retention. With , the exponential crosses threshold when : WHY : solving gives . This is below — this modelled cell would fail! It shows why weak cells force the spec.


Level 3 — Analysis

Problem L3.1

Two decay models for the same cell (, , ): a linear drain giving , and an exponential with giving . If the initial leakage current is the same, which model predicts a longer retention, and why (physically)?

Recall Solution

Match the initial current. At the exponential leak current is . Feed that same current into the linear model: So the exponential model retains longer (). WHY physically: in the resistor (exponential) model, as falls the current also falls — the drain slows down as the bucket empties. The linear model keeps draining at the full initial rate the whole way. A self-slowing leak buys extra time. This is the geometric meaning of the curve bending flatter (see figure s02).

Problem L3.2

The parent gives refresh overhead . A chip has and rows at . The next generation doubles rows to (same ) and grows to . Compute both overheads and the relative increase.

Recall Solution

Gen 1: . Overhead . Gen 2: . Overhead . WHY it explodes: overhead . Doubling and raising both multiply upward while stays pinned at . Relative increase — more than triple the lost time. This is the real "refresh wall" as DRAM density scales. See DDR SDRAM timing parameters.


Level 4 — Synthesis

Problem L4.1

The parent says leakage rises "roughly exponentially with temperature," and JEDEC halves from to above . Model retention as (higher → shorter retention). If retention halves between and , estimate the activation energy (in eV). Use .

Recall Solution

WHAT: find from a known ratio of retentions at two temperatures. WHY this tool: leakage currents follow an Arrhenius law; retention (inverse of leakage) . Taking a ratio cancels the unknown prefactor — that's why we compare two temperatures instead of solving one. Convert to kelvin: , . Retention halves as rises: . Compute the bracket: . So — a modest barrier, consistent with junction leakage dominating. This is exactly why the hot spec exists: retention roughly halves over that C span, so halving the period restores the safety margin.

Problem L4.2

Design check: you have a bank of rows. The weakest cell has measured retention . (a) Is the standard period safe? (b) Choose the largest standard-style period that is safe and compute the resulting .

Recall Solution

(a) The rule: must be less than the weakest cell's retention. Here , so is NOT safe — that cell would drop below threshold before its turn came round. (b) Pick (the hot-spec value, and with margin). WHY not just squeak in at, say, ? Real designs want margin (temperature drift, aging, voltage droop), and standard timers use round values. gives a comfortable safety factor. Retention profiling (Low-power DRAM self-refresh, RAIDR) instead refreshes strong cells rarely and only the weak few often, recovering power.


Level 5 — Mastery

Problem L5.1

An engineer proposes cutting refresh power by refreshing at instead of , arguing "reads and writes already refresh their rows, so hot rows never actually decay." Under what workload does this fail, and estimate the worst-case exposure. Assume the weakest cell has exponential decay with , .

Recall Solution

WHAT could save power: it's true a normal activate/read restores that row (the sense amps re-drive full voltage — see Sense Amplifiers). So frequently accessed rows are effectively self-refreshing. WHERE it fails: a cold row — data written once and never touched (e.g. a rarely-read lookup table). It gets no incidental refresh, so it must survive on the REF schedule alone. Worst-case exposure: that cold cell's true retention is With a period, the cell can sit past its safe window before the scheduled REF arrives — it decays below threshold and the bit is lost. Even the original is borderline here (!). So the proposal is unsafe; you'd need , or per-row retention profiling to know which rows tolerate the long period. The deep lesson: "accesses refresh rows" is true on average but useless as a guarantee — the memory controller cannot assume any row is touched, so REF must cover the worst untouched cell. See Low-power DRAM self-refresh.

Problem L5.2

Full-stack calculation. A DDR bank: rows, , . During self-refresh (idle), the chip enters low-power mode where only refresh runs. If active-mode current draw for refresh is proportional to overhead, and the chip spends of its life idle at and hot-active at , compute the time-weighted average refresh overhead.

Recall Solution

Idle (cool) overhead: ; overhead . Hot-active overhead: halves to , so ; overhead (double, because hot = twice as many REFs). Time-weighted average: WHY weight by time: overhead is a rate (fraction of each second lost); to get the lifetime average you weight each operating condition by the fraction of time spent in it. The hot mode, though only of the time, contributes disproportionately because it refreshes twice as often — this is exactly the power motivation behind Low-power DRAM self-refresh and temperature-compensated refresh.


Recall Rapid self-test (click to reveal)

One-τ voltage fraction ::: of . Retention with ::: . Refresh interval formula ::: . Refresh overhead formula ::: . Which cell sets the spec? ::: The single weakest (shortest-retention) cell on the chip. Why does exponential retain longer than linear (same )? ::: The resistive leak self-slows as drops; the linear drain never slows.


Back to the parent topic.