DRAM & Memory Design · All levels
Row Buffer Locality and Page Policy: Comparison Matrix
Comparison Matrix for Row Buffer Locality and Page Policy.
Comparison matrix
Row size, bank count, and mapping policy trade row-buffer locality against conflict and disturb risk.
Use the matrix as a reasoning aid, not as a simplistic scorecard. DRAM choices are workload-sensitive: the same policy can be right for bandwidth-oriented streaming, wrong for latency-critical bursts, and risky for long-haul reliability.
+------------------+----------------+----------------+----------------+
| Approach | Strength | Weakness | Best when |
+------------------+----------------+----------------+----------------+
| Conservative | high robustness | lower peak | new platform |
| Balanced | good efficiency | needs telemetry | mixed workloads |
| Aggressive | max throughput | tail sensitivity | bounded SKUs |
| Hardening | field resilience | overhead cost | safety-critical |
+------------------+----------------+----------------+----------------+When to choose each approach
Choose policy from measured conflict profile, SLA targets, and reliability budget
Interview traps
Copying scheduler recipes across unrelated traffic mixes
Ignoring coupling between turnaround control, refresh policy, and fairness
Comparison reference
DRAM EVIDENCE MATRIX - Row Buffer Locality and Page Policy
+-------------------------------+--------------------------------+--------------------------------+---------------------------+
| Evidence | Tells you | Does not prove | Next action |
+-------------------------------+--------------------------------+--------------------------------+---------------------------+
| row-hit/miss + ACT/PRE mix | locality and row-state cost | lane-level capture integrity | inspect training margins |
| queue age + class breakdown | fairness and starvation risk | command legality details | parse command timeline |
| JEDEC legality + bus timeline | timing-window pressure | root cause by itself | correlate with traffic map|
| eye / Vref / skew snapshots | PHY margin and drift behavior | controller policy quality | pair with schedule logs |
| CE/UE + scrub telemetry | reliability trajectory | immediate perf bottleneck only | map to hotspot addresses |
+-------------------------------+--------------------------------+--------------------------------+---------------------------+DRAM deep dive
Cell-array and subarray organization determines bitline delay, sensing margin, and locality-sensitive energy cost.
Concept diagram
ARRAY ORGANIZATION VIEW
rows x columns -> mats/subarrays -> local sense amps -> global I/O
physical distance shapes timing and energyMetric graph
ARRAY ACCESS COST SHARE
bitline settle delay ██████
sense/restore time █████
global routing overhead ███Reports and artifacts
subarray toggle heatmap
sense-amplifier utilization report
bitline RC delay audit
wordline coupling checklist
Mini case study
A dense address remap increased long-bitline activations, creating extra tRCD guardband and persistent tail-latency drift.
Debug branches
Map hot addresses to mats and subarray boundaries
Inspect sense-margin behavior under temperature corners
Evaluate row-mapping changes before voltage retuning
Senior review question
Ask: which latency, bandwidth, and reliability evidence proves this DRAM topic is closed under real traffic?
Key takeaways
Always tie controller and PHY counter shifts to application latency and throughput outcomes.
Lock firmware timing profile, thermal condition, and DIMM state before comparing DRAM captures.
Common pitfalls
Chasing peak bandwidth while ignoring p99 latency and fairness tails.
Changing timing guardbands without separating SI noise from scheduling issues.
Declaring closure without reliability gates, fault injection, and regression replay.
Principal DRAM review addendum
Row Buffer Locality and Page Policy should be read as an end-to-end memory behavior, not as a single block definition. A production DRAM subsystem reflects interactions between array physics, command legality, scheduler policy, PHY margin, and reliability controls before software experiences final latency or bandwidth.
Each open row behaves as a row buffer: column commands to that same row avoid a new ACTIVATE and can return data at much lower latency/energy than row misses. When access streams exhibit strong locality, open-page policy preserves row state and amortizes activate cost; when locality is weak or adversarial, leaving rows open increases conflict probability and can hurt tail latency. Closed-page policy reduces future conflict uncertainty but pays activation overhead more frequently. The optimal policy is workload- and topology-dependent because row-buffer behavior couples directly to bank-level contention and refresh/maintenance windows. Controller design must combine address mapping, request reordering, and fairness constraints to harvest locality without starving latency-critical traffic. DRAM inefficiency is multiplicative: one extra ACTIVATE, one unnecessary turnaround, one weak lane margin, or one refresh collision repeated across billions of accesses can dominate product tail latency and power.
Use Row-hit ratio, average service latency, and ACTIVATE/PRECHARGE energy per request for target workloads. as the opening signal, not the conclusion. A metric move only becomes actionable when paired with workload context, command traces, training telemetry, and evidence artifacts such as Page-policy tuning dossier: row-hit histograms, tail-latency impact, and energy-per-access breakdown..
Array organization sets the geometry of latency, bandwidth, and power before scheduler policy is even considered. Senior review quality comes from proving a complete chain: request pattern -> memory-state transition -> bottleneck mechanism -> smallest owner fix -> regression-safe validation.
Review discipline should enforce a single causal chain: traffic pattern -> command-level behavior -> array/PHY effect -> measured product impact. That chain prevents tuning folklore from replacing evidence.