FR-FCFS, Row-Buffer Locality, and Page Policy Control

What this topic teaches

FR-FCFS, Row-Buffer Locality, and Page Policy Control turns DRAM theory into production-grade review decisions. 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.

The main objective is to identify where the first loss starts in the memory service path, prove it with reproducible traces, and close with the smallest owner-controlled fix.

Senior DRAM work is less about isolated register tuning and more about cross-layer causality: traffic shape, command stream legality, bank behavior, PHY margin, and field reliability must agree before signoff.

Senior-engineer framing question

When Row-hit rate, effective command efficiency, and average activate/precharge overhead per request. regresses, can you prove whether the first failure is locality collapse, timing-window pressure, scheduler fairness loss, lane-margin drift, or reliability policy overhead?

DRAM CELL DIAGRAM - FR-FCFS, Row-Buffer Locality, and Page Policy Control

                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: link physical state changes to service-level latency and bandwidth outcomes
Metric tracked: Row-hit rate, effective command efficiency, and average activate/precharge overhead per request.

Architecture and timing visuals

Draw the mechanism before tuning knobs. These visuals are optimized for design reviews, bring-up triage, and interview whiteboards.

Scheduler queue pipeline (Fr Fcfs And Page Policy)

MEMORY CONTROLLER REQUEST PIPELINE

Ingress -> classify(addr,map,dir,class) -> enqueue -> pick -> command issue
              |                              |
              |                              +-- reorder window (N entries)
              |
              +-- queues:
                    [HiPri RQ]  [BestEffort RQ]  [WriteQ]
                         |             |           |
                         +------ arbitration ------+
                                       |
                               legal-if timing wheel passes

FR-FCFS selection with bank states (Fr Fcfs And Page Policy)

FR-FCFS DECISION VIEW (simplified)

Bank state table:
Bank0: open row 120  ready-for-CAS at t=42
Bank1: open row 087  row-miss for reqX (needs PRE+ACT)
Bank2: idle          can ACT at t=40

Queue head candidates:
reqA -> Bank1 row-miss (oldest)
reqB -> Bank0 row-hit  (younger, ready now)
reqC -> Bank2 row-miss

Pick rule:
1) First-ready wins (reqB now)
2) Among ready ties, oldest first
3) Aging/QoS guard prevents indefinite starvation

QoS + refresh-aware arbitration (Fr Fcfs And Page Policy)

ARBITRATION TIMELINE WITH REFRESH

time ---> --------------------------------------------------------------->
HiPri class     H1 ---- H2 -- H3 ----------- H4 ----
BestEffort      B1 - B2 ---- B3 ---- B4 ---- B5 ----
Refresh need          r_due..................(deadline)
Scheduler       serve H, then opportunistic B, insert REF before violation

Policy layers:
1) Hard safety: refresh/retention deadlines always met.
2) SLA tiering: critical traffic latency bounds.
3) Fairness/aging: lower classes eventually drain.

Array hierarchy context

ARRAY HIERARCHY MAP - FR-FCFS, Row-Buffer Locality, and Page Policy Control

[Channel]
   |
[DIMM/Package]
   |
[Rank]
   |
[Bank Group]
   |
[Bank]
   |
[Subarray]
   |
[Row + Column Decode]
   |
[Cell Mat + Sense Amps]

Lens: map locality decisions to activate/precharge cost.

Command timing context

COMMAND TIMING DIAGRAM - FR-FCFS, Row-Buffer Locality, and Page Policy Control

time --->    t0      t1      t2      t3      t4      t5
cmd bus   |  ACT  |   RD  |   WR  |  PRE  |  REF  |  ACT
row state | open  | open  | open  | close | all   | open

key checks:
- ACT->RD >= tRCD
- RD data return >= CL
- WR->PRE >= tWR
- PRE->ACT >= tRP

Controller queue context

CONTROLLER QUEUE VIEW - FR-FCFS, Row-Buffer Locality, and Page Policy Control

read queue : [R12 bank0 row88] [R13 bank2 row88] [R14 bank0 row12]
write queue: [W44 bank3 row90] [W45 bank3 row90]

scheduler tick:
1) prioritize ready row hits
2) cap write-drain burst
3) age outstanding reads

issue stream:
cycle 40 -> RD bank0 row88 (hit)
cycle 41 -> RD bank2 row88 (parallel bank group)
cycle 42 -> ACT bank0 row12 (miss prepare)

Ownership layers

MEMORY OWNERSHIP LAYERS - FR-FCFS, Row-Buffer Locality, and Page Policy Control

artifact area     owner
----------------  ----------------------------
architecture    memory controller architect
controller FW   DDR protocol owner
verification    performance modeling owner
silicon bringup firmware QoS owner

Rule: every signoff metric has a named accountable owner.

Evidence to collect before changing knobs

Fast closure comes from complete evidence packets, not from isolated counter wins. Every recommendation should carry a metric, artifact, owner, and rollback-safe validation plan.

• Primary metric: Row-hit rate, effective command efficiency, and average activate/precharge overhead per request..

• Primary artifact: Row-buffer analytics report: FR-FCFS issue decisions, row-hit/miss timeline, and adaptive page-policy state transitions..

• Owners to include: memory controller architect, DDR protocol owner, performance modeling owner, firmware QoS owner, silicon validation owner.

• One reproducible failing traffic slice plus one stable comparator capture.

• One command legality timeline that isolates first failing transition.

• One margin or reliability packet when PHY or RAS behavior is implicated.

Bandwidth-latency operating lens

BANDWIDTH vs LATENCY CURVE - FR-FCFS, Row-Buffer Locality, and Page Policy Control

latency
  ^
  |  low-load region
  |      *
  |        *
  |          *
  |            *         knee
  |              *      *
  |                *   *
  |                  ***
  +----------------------------------------------> bandwidth demand
     stable QoS          queue growth / saturation

Use the knee to set safe operating headroom.

Root-cause decision tree

ROOT CAUSE TREE - FR-FCFS, Row-Buffer Locality, and Page Policy Control

Row-hit rate, effective command efficiency, and average activate/precharge overhead per request. regressed
        |
reproducible with fixed seed?
      /               \
    no                 yes
    |                   |
testbench noise    localize bottleneck
                    /              \
               command path       data path
                 |                  |
             scheduler/FSM      PHY/timing/noise
                 |                  |
             timing limits      training/calibration

Stop at first failing mechanism, then patch and re-measure.

Key takeaways

• Prove first failing transition before touching broad tuning policies.

• Tie command-level behavior to application-visible QoS outcomes.

• Close with accountable owner, rollback criteria, and corner validation.

Common pitfalls

• Optimizing average GB/s while p99 latency and fairness degrade.

• Comparing traces without fixed firmware, timing profile, and thermal tags.

• Declaring closure without reliability and retrain robustness checks.

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 update

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