DRAM & Memory Design · All levels
Patrol Scrub and RAS Policy: Mechanism
Mechanism for Patrol Scrub and RAS Policy.
Mechanism to understand
Mechanism for Patrol Scrub and RAS Policy focuses on scrub interval coverage, latent fault dwell time, corrected-before-failure ratio. The purpose is to turn memory observations into mechanism-backed actions with explicit owners and release-safe validation.
Patrol scrub proactively reads and rewrites DRAM lines so single-bit faults are corrected before accumulating into multi-bit uncorrectable events; RAS policy balances scrub aggressiveness against bandwidth and power overhead. Treat this as a DRAM service pipeline, not an isolated block behavior. Traffic shape, command legality, queue policy, and margin dynamics all contribute to final latency and throughput.
A strong mechanism explanation names the first repeated transition that creates loss, then explains why that transition persists under the current workload and policy constraints.
Name the first failing transition and where it appears in timeline.
Separate symptom counters from causal mechanism evidence.
Assign owner who can apply smallest reversible fix.
Cell and sensing lens
DRAM CELL DIAGRAM - Patrol Scrub and RAS Policy
bitline (BL)
|
+--------+--------+
wordline --| access transistor|-- storage capacitor (Ccell)
+--------+--------+
|
ground
Read: BL precharge -> WL on -> tiny delta-V -> sense amp amplifies
Write: drive BL -> WL on -> charge/discharge Ccell -> WL off
Focus: sense, restore, and retention limits
Metric tracked: scrub interval coverage, latent fault dwell time, corrected-before-failure ratioArray and bank lens
ARRAY HIERARCHY MAP - Patrol Scrub and RAS Policy
[Channel]
|
[DIMM/Package]
|
[Rank]
|
[Bank Group]
|
[Bank]
|
[Subarray]
|
[Row + Column Decode]
|
[Cell Mat + Sense Amps]
Lens: map locality decisions to activate/precharge cost.Patrol scrub wheel scheduler
PATROL SCRUB SCHEDULER
address space ring:
[0x0000] -> [0x1000] -> [0x2000] -> ... -> [end] -> wrap
| | |
read+ecc read+ecc read+ecc
| | |
rewrite if corrected bit observed
policy knobs:
- scrub interval
- bandwidth cap
- thermal-aware pacingLatent fault accumulation timeline
LATENT FAULT TIMELINE
t0 t1 t2 t3
|-------|-------|-------|
bit flip A bit flip B (same word)
without scrub:
A stays latent until access -> may become UE at t3
with scrub:
A corrected before B arrives -> avoid UE conversionDRAM deep dive
Reliability closure combines ECC policy, scrub cadence, and disturbance mitigation like row-hammer controls.
Concept diagram
RELIABILITY LOOP
error detect -> ECC correct/report -> scrub/retire policy -> monitor recurrenceMetric graph
ERROR MANAGEMENT TREND
correctable events ███████
silent-data-risk ██
unrecoverable events █Reports and artifacts
correctable/uncorrectable error trend
scrub interval effectiveness report
row-hammer monitor log
fault-injection coverage summary
Mini case study
Relaxed scrub interval improved bandwidth in test but allowed burst correctables to cluster into service-visible latency spikes.
Debug branches
Segment ECC events by bank, rank, and temperature
Tune scrub cadence with workload-aware idle windows
Verify row-hammer mitigation using adversarial patterns
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.
Mechanism deep dive
Patrol Scrub and RAS 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.
Patrol scrub proactively reads and rewrites DRAM lines so single-bit faults are corrected before accumulating into multi-bit uncorrectable events; RAS policy balances scrub aggressiveness against bandwidth and power overhead. 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 scrub interval coverage, latent fault dwell time, corrected-before-failure ratio 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 scrub scheduler log, CE aging report, patrol coverage audit.
Reliability closure requires combining ECC telemetry, disturb mitigation, and thermal policy into one operating contract. Senior review quality comes from proving a complete chain: request pattern -> memory-state transition -> bottleneck mechanism -> smallest owner fix -> regression-safe validation.
Mechanism detail: Patrol scrub proactively reads and rewrites DRAM lines so single-bit faults are corrected before accumulating into multi-bit uncorrectable events; RAS policy balances scrub aggressiveness against bandwidth and power overhead.
Read Patrol Scrub and RAS Policy as a loop: requests enter arbitration, transform into legal command streams, interact with bank/row state, and return as latency and reliability outcomes visible to software.
Frequent failure pattern: local improvement with global regression. A row-hit win can still hurt QoS if fairness collapses; tighter timing can still fail if margin is consumed by SI or thermal drift.