GPU Design · All levels

Bandwidth & Latency Bottlenecks: Comparison Matrix

Comparison Matrix for Bandwidth & Latency Bottlenecks.

Comparison matrix

Crossbar, NoC, and chiplet fabrics trade peak bandwidth, latency determinism, and scalability.

Use the matrix as a decision aid, not as a scoring shortcut. GPU design choices are strongly workload-dependent: the same policy can be correct for dense regular compute, wrong for sparse or divergent kernels, and dangerous for mixed graphics+compute scenes.

diagram
+------------------+----------------+----------------+----------------+
| Approach         | Strength       | Weakness       | Best when      |
+------------------+----------------+----------------+----------------+
| Conservative     | stable closure | lower peak     | new product    |
| Balanced         | good efficiency | needs profiling | broad mix      |
| Aggressive       | max throughput | sensitive tails | premium SKU    |
| Refactor         | scales cleaner | longer cycle   | chronic stalls |
+------------------+----------------+----------------+----------------+

When to choose each approach

  • Choose architecture and tuning policy from measured bottleneck mix and product phase

Interview traps

  • Copying tactics across unrelated workloads

  • Ignoring inter-stage coupling in graphics+compute paths

Evidence comparison

diagram
GPU EVIDENCE MATRIX - Bandwidth & Latency Bottlenecks

+---------------------------+--------------------------------+--------------------------------+---------------------------+
| Evidence                  | Tells you                      | Does not prove                 | Next action               |
+---------------------------+--------------------------------+--------------------------------+---------------------------+
| occupancy + issue report  | warp residency and issue shape | memory transaction quality     | inspect coalescing        |
| cache + bandwidth counters| hierarchy pressure             | scheduler fairness causes      | profile warp arbitration  |
| lane-mask / branch trace  | divergence and reconvergence   | thermal or voltage stability   | pair with power telemetry |
| NoC/controller snapshots  | congestion and queue hotspots  | source-level mapping quality   | correlate with kernel map |
| release benchmark matrix  | end-to-end workload behavior   | root cause depth               | run focused reproducer    |
+---------------------------+--------------------------------+--------------------------------+---------------------------+

GPU deep dive

Fabric and memory-controller behavior decides scaling long before peak ALU utilization is reached.

Concept diagram

diagram
COMPUTE FABRIC

SM clusters <-> NoC <-> L2 <-> memory controllers <-> HBM

Metric graph

diagram
SCALING EFFICIENCY

single GPU        ███████████ 100%
with heavy NoC    ████████
with tuned QoS    █████████

Reports and artifacts

  • NoC congestion map

  • HBM controller queue stats

  • PCIe/DMA overlap timeline

  • roofline position report

Mini case study

Crossbar arbitration favored bulk traffic and starved latency-sensitive queues, collapsing tail performance.

Debug branches

  • Track per-link hotspots, not only aggregate BW

  • Inspect controller page-hit and queue depth behavior

  • Validate host-device overlap during peak traffic windows

Senior review question

Ask: which metric and benchmark pairing proves this topic is truly closed in production context?

Key takeaways

  • Always pair micro-kernel metrics with end-to-end workload impact.

  • Lock toolchain, driver, and launch metadata before comparing performance results.

Common pitfalls

  • Optimizing occupancy without checking memory-system saturation.

  • Comparing profiler captures from different driver or compiler builds.

  • Declaring wins without reproducible accuracy and performance gates.

Principal GPU review addendum

Bandwidth & Latency Bottlenecks is not just a definition to memorize. In a real GPU program it becomes an interaction between software shape, compiler mapping, warp execution, memory movement, interconnect policy, and physical limits. The first senior move is to name which layer is being exercised before interpreting a counter.

Performance collapses when any stage (SM issue, cache, NoC, controller, link) saturates; bottleneck localization needs cross-stack correlation. This mechanism matters because GPUs are throughput machines: a small inefficiency repeated across lanes, warps, SMs, frames, or dispatches can dominate product performance even when a unit-level diagram looks balanced.

Use roofline position, p99 memory latency, and throughput saturation point as an entry point, not as the conclusion. A metric shift only becomes actionable after it is tied to a workload slice, a profiler capture, an architectural path, and a reproducible artifact such as roofline plot, bottleneck decision tree, and counter correlation dashboard.

Interconnect architecture decides whether multi-SM and multi-die resources behave as one system. The review posture is therefore evidence-first: explain what the kernel or graphics workload asked for, how the GPU mapped it onto hardware, where useful work stopped, and which owner can change the smallest boundary safely.

In review, insist on a concrete chain from workload to hardware behavior: workload shape -> compiler/runtime mapping -> warp or pipeline behavior -> memory/fabric pressure -> measured product impact. That chain prevents generic GPU tuning advice from replacing engineering evidence.