Weight-Stationary Deep Dive: Interview Drills

Interview drills

Interview Drills for Weight-Stationary Deep Dive is anchored on Off-array weight bandwidth per inference and achieved weight reuse across batch and sequence profiles.. Convert measurements into mechanism-backed decisions with clear owner accountability.

PROMPT
You observe regression in Off-array weight bandwidth per inference and achieved weight reuse across batch and sequence profiles. for Weight-Stationary Deep Dive. Explain root cause and release decision.

STRONG ANSWER
1. Defines workload and first failing mechanism.
2. Explains mechanism: Weight-stationary dataflow pins filters or matrix fragments in PEs for many cycles while activations stream across compute lanes, reducing costly weight movement from SRAM or DRAM. It is often effective when model parameters are reused across many input windows or batched requests. The tradeoff is increased pressure on activation distribution and partial-sum routing networks, which can become limiting at larger mesh sizes. Effective implementations coordinate filter blocking, preload overlap, and activation tiling so stationary weights are not stranded by feeder stalls.
3. Requests proving artifact: Reuse-and-bandwidth report mapping layer classes to weight residency and feeder utilization.
4. Proposes bounded fix + owner + rollback-safe validation.

WEAK ANSWER
Gives generic optimization ideas without mechanism proof or ownership.

AI accelerator deep dive

Dataflow choices are durable architecture decisions that shape memory and scheduling cost.

Concept diagram

DATAFLOW DECISION

input/output/weight stationary
  -> locality pattern
  -> movement cost
  -> throughput and power

Metric graph

DATAFLOW COST MIX

activation traffic   ███████
weight traffic       █████
partial-sum traffic  ██████

Metrics and artifacts to collect

• reuse factor map

• buffer pressure profile

• NoC traffic mix

• shape sensitivity analysis

Mini case study

A dataflow that won for convolution lost on attention-heavy batches due to activation movement pressure.

Debug branches

• Segment by model family

• Compare reuse vs movement

• Re-check mapping assumptions under batch variance

Senior review question

Ask: which first-principles bottleneck class explains the symptom, and what artifact proves it reproducibly?

Key takeaways

• Tie every accelerator claim to a reproducible workload slice and one primary metric trend.

• Prefer bounded fixes with clear owner and rollback boundary over broad tuning bundles.

Common pitfalls

• Optimizing synthetic kernels without production-shape validation.

• Reading average latency while ignoring p95 and p99 behavior.

• Declaring sparse or precision wins without fallback and quality evidence.

Interview answer expansion

A strong answer on Weight-Stationary Deep Dive names the workload symptom, explains mechanism (Weight-stationary dataflow pins filters or matrix fragments in PEs for many cycles while activations stream across compute lanes, reducing costly weight movement from SRAM or DRAM. It is often effective when model parameters are reused across many input windows or batched requests. The tradeoff is increased pressure on activation distribution and partial-sum routing networks, which can become limiting at larger mesh sizes. Effective implementations coordinate filter blocking, preload overlap, and activation tiling so stationary weights are not stranded by feeder stalls.), and proposes one measurable validation plan.

Then it identifies owner and fallback action if the proposed fix under-delivers.

The goal is practical engineering reasoning, not keyword listing.