Input-Stationary Dataflow: Interview Drills

Interview drills

Interview Drills for Input-Stationary Dataflow is anchored on Activation reuse factor and input-buffer read traffic per tera-operations for representative convolution and GEMM layers.. Convert measurements into mechanism-backed decisions with clear owner accountability.

PROMPT
You observe regression in Activation reuse factor and input-buffer read traffic per tera-operations for representative convolution and GEMM layers. for Input-Stationary Dataflow. Explain root cause and release decision.

STRONG ANSWER
1. Defines workload and first failing mechanism.
2. Explains mechanism: Input-stationary execution keeps activation tiles resident in local buffers or PE-adjacent storage while weights and partial sums stream through the compute fabric. This reduces repeated activation fetches from higher memory levels, which is valuable when feature-map bandwidth dominates energy. The design challenge is balancing local activation capacity with timely weight delivery and reduction routing so compute units remain occupied. Practical schedulers tune tile shape, preload depth, and multicast strategy to prevent contention that can erase expected reuse gains.
3. Requests proving artifact: Traffic decomposition sheet showing activation residency, refill cadence, and bottleneck attribution by layer.
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 Input-Stationary Dataflow names the workload symptom, explains mechanism (Input-stationary execution keeps activation tiles resident in local buffers or PE-adjacent storage while weights and partial sums stream through the compute fabric. This reduces repeated activation fetches from higher memory levels, which is valuable when feature-map bandwidth dominates energy. The design challenge is balancing local activation capacity with timely weight delivery and reduction routing so compute units remain occupied. Practical schedulers tune tile shape, preload depth, and multicast strategy to prevent contention that can erase expected reuse gains.), 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.