QoS Classes, Priority Arbitration, and Starvation Boundaries: Inputs and Outputs

Inputs and outputs contract

Inputs and Outputs for QoS Classes, Priority Arbitration, and Starvation Boundaries focuses on Per-class latency SLA compliance (real-time, interactive, best-effort) and fairness index under stress traffic.. The purpose is to turn memory observations into mechanism-backed actions with explicit owners and release-safe validation.

Use this contract for architecture, controller firmware, PHY, and validation handoffs. Missing inputs create expensive late-stage rework and inconclusive debug loops.

INPUTS
  - workload distribution and QoS target
  - firmware revision, controller policy profile, timing registers
  - data-rate / voltage / temperature operating state
  - training snapshot and reliability policy status

OUTPUTS
  - bottleneck classification with command-level evidence
  - owner-signed mitigation proposal
  - before/after trend for latency, bandwidth, and reliability
  - regression matrix with rollback triggers

Ownership split

MEMORY OWNERSHIP LAYERS - QoS Classes, Priority Arbitration, and Starvation Boundaries

artifact area     owner
----------------  ----------------------------
architecture    memory controller architect
controller FW   SoC QoS architect
verification    NoC owner
silicon bringup firmware power/performance owner

Rule: every signoff metric has a named accountable owner.

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.

Handoff explanation

Inputs extend beyond timing registers. DRAM analysis inputs include traffic distribution, address map, queue policy, training state, SI/PI condition, thermal state, and firmware version.

Outputs must be action-ready: Per-class latency SLA compliance (real-time, interactive, best-effort) and fairness index under stress traffic., artifact packet (QoS compliance dashboard with per-class SLA miss counters, arbitration decision logs, and starvation watchdog events.), bottleneck class, owner, expected gain, and rollback scope. "Bandwidth improved" without this packet is not signoff-ready.

The safest handoff is a before/after evidence set: environment tags, traces, hypothesis, chosen fix, rejected alternatives, and regression criteria.