CPU Design · All levels
Indirect Branch Prediction: Interview Drills
Interview Drills for Indirect Branch Prediction.
Interview drills
Interview Drills for Indirect Branch Prediction centers on indirect target accuracy, aliasing rate, and security hardening overhead. Tie every claim to a measurable artifact and an owner-controlled action.
PROMPT
You observe indirect target accuracy, aliasing rate, and security hardening overhead on Indirect Branch Prediction. Walk through root cause and release decision.
STRONG ANSWER
1. Names failing workload and first stage loss.
2. Explains mechanism: Indirect targets depend on history, call context, and pointer flow; predictor indexing and tagging must reduce aliasing while respecting security mitigations for speculative attacks.
3. Requests proving artifact: indirect branch trace corpus, target-alias map, and mitigation cost report
4. Proposes bounded fix + owner + rollback-safe validation.
WEAK ANSWER
Suggests generic optimization ideas without mechanism proof or owner accountability.Decision matrix
CPU EVIDENCE MATRIX - Indirect Branch Prediction
+---------------------------+--------------------------------+--------------------------------+---------------------------+
| Evidence | Tells you | Does not prove | Next action |
+---------------------------+--------------------------------+--------------------------------+---------------------------+
| CPI + top-down stack | broad pressure domain | exact root mechanism | inspect first failing stage |
| PMU event timeline | temporal onset and persistence | causality by itself | pair with trace and config lock |
| pipeline occupancy trace | bubble origin and spread | multicore/system interactions | correlate with LLC/NoC data |
| cache/TLB/coherence logs | memory and translation health | scheduler fairness | inspect issue/port behavior |
| thermal + power telemetry | silicon operating envelope | architectural correctness | validate bounded fixes at same corners |
+---------------------------+--------------------------------+--------------------------------+---------------------------+CPU deep dive
Speculation helps only when wrong-path cost and recovery bandwidth are tightly controlled.
Concept diagram
SPECULATION LOOP
predict direction/target -> speculative fetch/decode -> resolve -> flush/recoverMetric graph
SPECULATION COST MIX
wrong-path decode work █████
flush recovery delay ████
refill starvation ███Reports and artifacts
branch accuracy by workload
BTB/RAS pressure report
mispredict recovery timeline
bad-speculation CPI share
Mini case study
Indirect branch aliasing in one service raised wrong-path work enough to dominate total CPI despite high ALU utilization.
Debug branches
Break down mispredicts by branch family and code region
Measure flush depth and refill bandwidth separately
Validate predictor changes under security mitigation settings
Senior review question
Ask: which CPI/latency evidence proves this topic is truly closed beyond synthetic benchmarks?
Key takeaways
Always connect microarchitectural counter changes to product workload outcomes.
Lock binary, compiler, firmware, and thermal metadata before comparing CPU traces.
Common pitfalls
Treating average IPC as sufficient proof while ignoring latency tails and outliers.
Applying predictor or prefetch tweaks without first-failing-stage attribution.
Declaring closure without reproducible perf, correctness, and power gates.
Interview answer expansion
Strong interview answers for Indirect Branch Prediction begin with workload and metric framing, then explain mechanism in plain terms: Indirect targets depend on history, call context, and pointer flow; predictor indexing and tagging must reduce aliasing while respecting security mitigations for speculative attacks.
Then propose a measurement plan: CPI stack, branch quality, queue occupancy, cache/TLB behavior, and latency distribution as applicable.
Finally, present one bounded fix plus regression risk. CPU interviews reward explicit tradeoff ownership, not generic tuning advice.