DRAM & Memory Design · All levels
FR-FCFS, Row-Buffer Locality, and Page Policy Control: Comparison Matrix
Comparison Matrix for FR-FCFS, Row-Buffer Locality, and Page Policy Control.
Comparison matrix
Row-hit favoritism and fairness control must be co-tuned; maximizing immediate readiness alone can violate tail-latency SLAs.
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 - FR-FCFS, Row-Buffer Locality, and Page Policy Control
+-------------------------------+--------------------------------+--------------------------------+---------------------------+
| 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
Controller policy decides whether DRAM serves locality, fairness, and QoS targets simultaneously.
Concept diagram
CONTROLLER SCHEDULING LOOP
request queues -> row-policy + priority -> command issue -> bank state updateMetric graph
QUEUE PRESSURE MIX
row-hit preference bias ██████
aging/fairness pressure █████
QoS override cost ███Reports and artifacts
scheduler policy comparison
queue age distribution
starvation/fairness incident report
QoS latency percentile dashboard
Mini case study
FR-FCFS tuning improved bulk throughput but starved latency-critical traffic until age caps and class quotas were added.
Debug branches
Measure queue age tails by traffic class
Separate row-hit gains from fairness regressions
Stress policy under mixed burst and random streams
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
FR-FCFS, Row-Buffer Locality, and Page Policy Control 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.
FR-FCFS (First-Ready, First-Come-First-Serve) prioritizes commands that are timing-ready now, and among those typically prefers older arrivals; in practice this strongly favors row hits because an open-row access can issue quickly while a row miss requires PRECHARGE plus ACTIVATE latency. The policy boosts throughput by harvesting row-buffer locality, but can also bias service toward hot rows and penalize streams that repeatedly miss. Page policy selection (open-page, close-page, or adaptive hybrids) determines whether the controller keeps a row open after service or proactively closes it to reduce future conflict cost. Open-page favors bursty locality workloads, while close-page limits row-conflict penalties and can stabilize latency under random access. Adaptive implementations monitor hit/miss patterns, bank-level contention, and command bus pressure, then adjust close timing or row-retention heuristics per bank. The controller must reconcile this with timing constraints such as tRAS minimum, tFAW power windows, and bank-group turnaround rules, because aggressive row management can improve one metric while degrading global fairness or power integrity. 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 rate, effective command efficiency, and average activate/precharge overhead per request. 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 Row-buffer analytics report: FR-FCFS issue decisions, row-hit/miss timeline, and adaptive page-policy state transitions..
Memory-controller quality is measured by throughput and tail predictability under mixed traffic, not average bandwidth alone. 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.