Hybrid Dataflow Selection: Interview Drills

Interview drills

Interview Drills for Hybrid Dataflow Selection is anchored on End-to-end joules per inference and latency improvement from per-layer dataflow switching versus single-style baseline.. Convert measurements into mechanism-backed decisions with clear owner accountability.

PROMPT
You observe regression in End-to-end joules per inference and latency improvement from per-layer dataflow switching versus single-style baseline. for Hybrid Dataflow Selection. Explain root cause and release decision.

STRONG ANSWER
1. Defines workload and first failing mechanism.
2. Explains mechanism: Hybrid policies choose different dataflows by operator class or shape regime instead of enforcing one stationary style globally. For example, output-stationary may win on deep reductions while weight-stationary performs better on high-filter-reuse layers, and input-stationary can help bandwidth-bound feature maps. The key is selecting switch points that account for retile overhead, control complexity, and compiler/runtime transition cost. Teams usually rely on profiling-guided heuristics or cost models that include both kernel efficiency and orchestration penalty.
3. Requests proving artifact: Dataflow policy playbook with layer-wise recommendations, transition rules, and expected gains.
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 Hybrid Dataflow Selection names the workload symptom, explains mechanism (Hybrid policies choose different dataflows by operator class or shape regime instead of enforcing one stationary style globally. For example, output-stationary may win on deep reductions while weight-stationary performs better on high-filter-reuse layers, and input-stationary can help bandwidth-bound feature maps. The key is selecting switch points that account for retile overhead, control complexity, and compiler/runtime transition cost. Teams usually rely on profiling-guided heuristics or cost models that include both kernel efficiency and orchestration penalty.), 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.