DRAM & Memory Design · All levels

Address Mapping, Interleaving, and Disturb-Aware Placement: Comparison Matrix

Comparison Matrix for Address Mapping, Interleaving, and Disturb-Aware Placement.

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.

diagram
+------------------+----------------+----------------+----------------+
| 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

diagram
DRAM EVIDENCE MATRIX - Address Mapping, Interleaving, and Disturb-Aware Placement

+-------------------------------+--------------------------------+--------------------------------+---------------------------+
| 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

diagram
ARRAY ORGANIZATION VIEW

rows x columns -> mats/subarrays -> local sense amps -> global I/O
physical distance shapes timing and energy

Metric graph

diagram
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

Address Mapping, Interleaving, and Disturb-Aware Placement 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.

Physical-to-logical address mapping decides which bits select channel, rank, bank-group, bank, row, and column, thereby shaping both locality and parallelism seen by real workloads. Fine-grain interleaving can smooth bandwidth demand and improve queue-level fairness, but if mapping ignores access stride patterns it may destroy row-buffer locality and inflate ACTIVATE traffic. Coarser mapping can preserve locality yet create hotspots that worsen thermal gradients, retention stress, and disturbance susceptibility in repeatedly activated neighborhoods. Robust mapping therefore balances throughput, latency, and reliability by co-optimizing controller hash/interleave functions with DRAM physical organization, refresh policy, and row-hammer mitigation strategy. 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 Address-map efficiency measured by bank conflict rate, row-buffer hit rate, and thermal/disturb concentration (including row-hammer exposure). 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 Address-map validation package: workload conflict matrix, locality retention report, and disturb-risk hotspot map..

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.