Patrol Scrub and RAS Policy: Theory Deep Dive

Foundational theory

Patrol Scrub and RAS Policy is central to Reliability, ECC & Security. 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. Strong memory closure links observed latency, bandwidth, and reliability movement to the precise physical and scheduling mechanism causing it.

Expanded explanation for VLSI engineers

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.

Core concepts explained

• 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.

• Primary metric: scrub interval coverage, latent fault dwell time, corrected-before-failure ratio

• Primary artifact: scrub scheduler log, CE aging report, patrol coverage audit

• Owners: firmware owner, system architect, SRE / fleet reliability owner

• DRAM outcomes are shaped by command timing legality plus analog margin

• Every optimization must be proven under representative traffic and corner conditions

Mechanism narrative

The mechanism starts from traffic shape: burst size, read/write mix, locality profile, address mapping entropy, and class priority constraints. Patrol Scrub and RAS Policy is not interpretable without those workload inputs.

Inside the subsystem, requests flow through queueing, arbitration, bank-state legality checks, and PHY transfer timing. Explanations are incomplete if they stop at one layer and ignore propagated backpressure.

The practical question is: when scrub interval coverage, latent fault dwell time, corrected-before-failure ratio shifts, which repeated transition caused it? Examples include row conflicts, turnaround bubbles, refresh collisions, lane-margin drift, or protection-policy throttling.

Why this matters in shipped memory products

At product scale, Patrol Scrub and RAS Policy mistakes appear as latency tails, bandwidth collapse under contention, and reliability escapes. Reliability closure requires combining ECC telemetry, disturb mitigation, and thermal policy into one operating contract.

Mental model

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 pacing

Worked intuition

1. Classify dominant symptom: row-conflict storm, turnaround overhead, refresh interference, margin drift, or policy unfairness.

2. Open scrub interval coverage, latent fault dwell time, corrected-before-failure ratio and identify the largest sustained gap.

3. Map the gap to command legality, scheduler policy, PHY margin, or reliability controls.

4. Correlate workload shape and address mapping with bank-level evidence.

5. Collect scrub scheduler log, CE aging report, patrol coverage audit from baseline, failure, and candidate-fix runs.

6. Apply the smallest reversible fix and rerun performance + correctness + margin gates.

Common misconceptions

• Higher MT/s automatically resolves tail-latency issues.

• Row-hit rate alone predicts user-visible performance.

• A one-time training PASS implies robust production margin.

• ECC presence eliminates disturb and retention risk management needs.

Visual reinforcement

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 pacing

Latent 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 conversion

DRAM 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 recurrence

Metric 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.

Theory reinforcement

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.

Theory matters because memory inefficiency repeats at access-scale and fleet-scale. Small command or margin losses become major product cost when multiplied by traffic volume and uptime.

Translate software claims into memory-silicon questions: which banks are stressed, how often rows turn over, what command windows saturate, and which physical margin is nearest failure.