How to Profile GPU Kernels to Find the Real Bottleneck

GPU profiling separates compute-bound from memory-bound kernels. Nsight Compute roofline analysis shows where a kernel sits and what would move it.

How to Profile GPU Kernels to Find the Real Bottleneck
Written by TechnoLynx Published on 22 Apr 2026

Why wall-clock timing is not profiling

A CUDA kernel takes 12 milliseconds to execute. Is that slow? The question is unanswerable without context. To use a worked example from our GPU profiling engagements: if the kernel is performing 500 billion floating-point operations and the GPU’s peak throughput is 312 TFLOPS, the theoretical minimum is 1.6 milliseconds — the kernel is achieving 13% of peak (an operational measurement, not an extrapolated benchmark), and there is significant room for improvement. If the kernel is memory-bandwidth-bound, performing element-wise operations on 4 GB of data on a GPU with 2 TB/s memory bandwidth, the theoretical minimum is 2 milliseconds — the kernel is achieving 17% of the memory bandwidth ceiling (again, an operational measurement from that worked profile), and the optimisation target is memory access patterns rather than compute efficiency.

Wall-clock timing tells you how long the kernel took. Profiling tells you why it took that long — and what specific intervention would make it faster. Without profiling, GPU optimisation is guessing. With profiling, it is engineering.

Minimum viable profiling workflow

Before optimising anything, every team should complete these steps:

  1. Capture a system-level timeline with Nsight Systems. Run the full workload under Nsight Systems to record kernel launches, memory transfers, synchronisation events, and GPU idle gaps.
  2. Identify the top 3–5 kernels by cumulative execution time. Sort the timeline by kernel duration — in our experience across GPU profiling engagements, these dominant kernels typically account for 80%+ of GPU time and are the only ones worth optimising (an observed range, not a benchmarked industry rate).
  3. Profile each dominant kernel with Nsight Compute. Collect the roofline chart, achieved occupancy, memory throughput breakdown, and warp execution efficiency for each target kernel.
  4. Classify each kernel as compute-bound or memory-bound. Use the roofline position and arithmetic intensity to determine which hardware ceiling — compute throughput or memory bandwidth — is the binding constraint.
  5. Quantify the gap between current and achievable performance. Compare the kernel’s achieved throughput against the theoretical ceiling to calculate the optimisation headroom — as a planning heuristic from our engagements (not a benchmarked industry rate), 20% of peak means up to 5× potential improvement.
  6. Select the single highest-impact optimisation per kernel. Match the identified bottleneck to a specific fix: coalescing for uncoalesced memory access, mixed-precision for tensor core underutilisation, or kernel fusion for launch overhead.
  7. Re-profile after each change to verify the improvement. GPU optimisation is iterative — fixing one bottleneck shifts the constraint, so always re-measure before applying the next intervention.

The roofline model: where does your kernel sit?

The roofline model is the foundational framework for GPU kernel performance analysis. It maps every kernel to a two-dimensional space defined by two hardware limits: compute throughput (FLOPS) and memory bandwidth (bytes/second). The kernel’s arithmetic intensity — the ratio of compute operations to memory accesses — determines which limit the kernel is constrained by.

Compute-bound kernels have high arithmetic intensity: they perform many operations per byte of data accessed. Large matrix multiplications (GEMM), convolutions with large filter sizes, and dense attention computations fall into this category. For these kernels, the optimisation target is compute efficiency: are the tensor cores being used? Is the warp execution efficient? Are there unnecessary branches or divergent execution paths?

Memory-bound kernels have low arithmetic intensity: they perform few operations per byte accessed. Element-wise operations (ReLU, sigmoid, addition), batch normalisation, and small matrix operations fall into this category. For these kernels, the optimisation target is memory throughput: are memory accesses coalesced? Is the data layout cache-friendly? Can multiple operations be fused to reuse data in registers or shared memory?

Nsight Compute generates the roofline chart automatically for any profiled kernel. The kernel appears as a point on the chart; its position relative to the compute ceiling and memory bandwidth ceiling indicates which limit is binding and how much headroom remains. In our experience reading these charts, a kernel sitting at 80% of the memory bandwidth ceiling is well-optimised for a memory-bound workload — further gains require reducing the memory access volume (through fusion or algorithmic change), not improving the access pattern. A kernel sitting at 20% of the compute ceiling is poorly optimised — there is a 5× potential improvement from better compute utilisation (an observed range across our engagements, not a guaranteed outcome).

The profiling workflow

We follow a systematic profiling methodology that moves from system-level to kernel-level analysis. This progression is important: in our experience across GPU profiling engagements, optimising an individual kernel that contributes 2% of total execution time is wasted effort if the system-level bottleneck is host-device serialisation.

Step 1: System-level timeline (Nsight Systems). Run the workload under Nsight Systems to produce a timeline of GPU activity: kernel launches, memory transfers, synchronisation events, and idle periods. The timeline reveals the macro-level performance structure. Questions this step answers: What fraction of the total execution time is the GPU active? Where are the idle gaps? Which kernels dominate the execution time? Is there host-device serialisation that could be overlapped?

Step 2: Identify the dominant kernels. Sort kernels by cumulative execution time. Typically across our engagements, 3–5 kernels account for 80% or more of the GPU execution time (an observed pattern, not a benchmarked industry rate). These are the optimisation targets. Optimising kernels that do not appear in the top contributors has negligible impact on total execution time.

Step 3: Kernel-level profiling (Nsight Compute). Profile each dominant kernel individually with Nsight Compute. The detailed analysis includes roofline positioning, achieved occupancy, memory throughput breakdown (global, shared, L1, L2), warp execution efficiency, and instruction mix. For each kernel, the profiler identifies the specific bottleneck and often suggests the relevant optimisation.

Step 4: Apply targeted optimisations. Based on the profiling data, apply the specific optimisation that addresses the identified bottleneck. For a memory-bound kernel: improve coalescing, fuse with adjacent operations, or change the data layout. For a compute-bound kernel: enable tensor core usage, reduce warp divergence, or increase ILP (instruction-level parallelism). For an occupancy-limited kernel: reduce register or shared memory usage per thread.

Step 5: Re-profile and iterate. After applying the optimisation, re-profile to verify the improvement and identify the next bottleneck. GPU optimisation is iterative — fixing one bottleneck often reveals the next. The process continues until the kernel’s performance is within acceptable distance of the theoretical ceiling, or until the dominant bottleneck shifts to a different kernel or a system-level constraint.

The GPU underutilisation patterns we encounter in production workloads are identified through this workflow. Without it, the team is optimising by intuition rather than by measurement.

Common profiling findings and their fixes

From our GPU Performance Audit engagements, the most common profiling findings are:

Uncoalesced global memory access. Threads in a warp access non-contiguous memory locations, resulting in multiple memory transactions where one would suffice. The fix: restructure the data layout (Array of Structures to Structure of Arrays conversion) or modify the access pattern to ensure consecutive threads access consecutive memory addresses. Typical improvement across our engagements: 2–4× memory throughput for the affected kernel (an observed range, not a benchmarked industry rate).

Tensor core underutilisation. The kernel performs matrix multiplications in FP32 without using tensor cores, despite running on hardware that supports them (Volta and later). The fix: convert to mixed-precision (FP16 input, FP32 accumulate) and use CUDA’s WMMA API or cuBLAS’s tensor core-enabled routines. Typical improvement across our engagements: 4–8× throughput for the matrix multiplication operations (an observed range, not a guaranteed outcome).

Excessive kernel launch overhead. Hundreds or thousands of small kernels are launched sequentially, with the CPU overhead of each launch (5–15 microseconds) exceeding the GPU execution time of the kernel. The fix: fuse small kernels into larger ones, or use CUDA graphs to batch the launch sequence into a single replayable graph. Typical improvement across our engagements: 2–10× reduction in total execution time for launch-overhead-dominated workloads (an observed range, not a benchmarked industry rate).

Register pressure causing spills. The kernel uses more registers per thread than the hardware provides, causing register spills to local memory (which is backed by global memory and is 100× slower in our experience). The fix: refactor the kernel to reduce register usage — simplify expressions, reduce loop unrolling, or split the kernel into stages that require fewer simultaneous live variables. Typical improvement across our engagements: 1.5–3× throughput recovery (an observed range, not a guaranteed outcome).

What profiling tells you that benchmarks do not

Benchmark numbers — training throughput, inference latency, images/second — tell you the current performance. Profiling tells you the achievable performance and the specific path to reach it. The gap between current and achievable is the optimisation opportunity, and its magnitude determines whether the intervention is worth the engineering investment.

We have seen profiling reveal opportunities ranging from negligible (the workload is already well-optimised, within 10% of the hardware ceiling) to transformative (the workload is at 15% of peak, with a clear path to 60% through targeted kernel optimisation and memory layout changes) — an observed range across our GPU Performance Audit engagements, not a benchmarked industry rate. The profiling data determines which situation you are in — and prevents the expensive mistake of planning GPU memory for training or procuring more hardware when the existing hardware is underutilised.

The first step is always the same: profile the workload, identify the dominant bottleneck, and quantify the gap between current and achievable performance — which is what a GPU Performance Audit delivers.

Edge AI Applications: Deployment Tradeoffs for Autonomous Systems and Industrial Use Cases

Edge AI Applications: Deployment Tradeoffs for Autonomous Systems and Industrial Use Cases

7/05/2026

Edge AI applications in autonomous vehicles, industrial inspection, and smart cameras — deployment tradeoffs for model size, latency, and connectivity.

NVIDIA vs AMD GPU Performance: Why Software Stack Matters More Than Spec Sheets

NVIDIA vs AMD GPU Performance: Why Software Stack Matters More Than Spec Sheets

7/05/2026

NVIDIA's AI lead is primarily a software ecosystem advantage. Why hardware specs alone can't predict GPU performance when comparing NVIDIA and AMD.

Data Center GPU for AI Workloads: Own vs Rent, TCO, and NVLink Architecture

Data Center GPU for AI Workloads: Own vs Rent, TCO, and NVLink Architecture

7/05/2026

Data center GPUs vs cloud GPU rentals for AI workloads: TCO analysis, NVLink multi-GPU, and when owning hardware beats renting it.

How to Benchmark Your PC for AI: A Methodology That Goes Beyond Single Scores

How to Benchmark Your PC for AI: A Methodology That Goes Beyond Single Scores

7/05/2026

The three dimensions of meaningful AI benchmarking and why leaderboard numbers don't predict your performance. A practical AI benchmarking methodology.

CUDA vs OpenCL Performance Comparison: Portability, Optimization, and When to Choose Each

CUDA vs OpenCL Performance Comparison: Portability, Optimization, and When to Choose Each

7/05/2026

CUDA vs OpenCL: performance tradeoffs, portability constraints, and a practical decision framework for GPU compute API selection.

AI TOPS and GPU Utilization: When TOPS Is the Wrong Metric for Your Workload

AI TOPS and GPU Utilization: When TOPS Is the Wrong Metric for Your Workload

7/05/2026

TOPS and GPU utilization both mislead AI capacity planning. When to measure compute vs memory bandwidth vs throughput, and how to pick the right metric.

AI Benchmark Testing: What Makes a Benchmark Meaningful

AI Benchmark Testing: What Makes a Benchmark Meaningful

7/05/2026

A meaningful AI benchmark tests what your workload actually does. The gap between standardized tests and production performance, and how to close it.

AMD vs NVIDIA for AI Inference: When the Cost-Per-Inference Calculus Shifts

AMD vs NVIDIA for AI Inference: When the Cost-Per-Inference Calculus Shifts

6/05/2026

When AMD beats NVIDIA on inference cost-per-dollar and when NVIDIA's TensorRT advantage reverses the equation.

CUDA Kernel Explained: Thread Hierarchy, Execution, and When to Write Your Own

CUDA Kernel Explained: Thread Hierarchy, Execution, and When to Write Your Own

6/05/2026

What a CUDA kernel is, how threads and blocks map to GPU hardware, and when custom kernels beat library calls.

GPU Stress Testing for AI: What Sustained Load Reveals That Benchmarks Hide

GPU Stress Testing for AI: What Sustained Load Reveals That Benchmarks Hide

6/05/2026

GPUs scoring identically on short benchmarks can differ by 15-30% under sustained load. How stress testing exposes the limits that benchmarks miss.

CUDA GPU Architecture and Programming: What Makes a GPU CUDA-Capable

CUDA GPU Architecture and Programming: What Makes a GPU CUDA-Capable

6/05/2026

What makes a GPU CUDA-capable, how CUDA compute capability tiers work, and what the architecture enables for parallel compute workloads.

GPU Benchmark Software for AI: What Each Tool Measures and What It Misses

GPU Benchmark Software for AI: What Each Tool Measures and What It Misses

6/05/2026

Consumer benchmarks measure the wrong thing for AI. AI benchmarks test the wrong workloads. What each GPU benchmark tool measures and what to use instead.

How to Check TensorFlow GPU Detection and Diagnose Common Failures

6/05/2026

How to verify TensorFlow GPU detection with tf.config.list_physical_devices, diagnose CUDA version mismatches, driver issues, and common failure modes.

Benchmark Testing: What It Measures, What It Misses, and How to Do It Right for AI

6/05/2026

Benchmark scores and real AI performance differ by 20-50%. How to test in a way that predicts actual workload behaviour rather than lab conditions.

AMD vs Intel for AI: Why Spec-Sheet Comparisons Mislead and What to Measure Instead

6/05/2026

AMD vs Intel CPU performance for AI workloads varies by up to 3x depending on model architecture and software stack. No single 'better' answer exists.

AI Inference Infrastructure: Best Practices That Go Beyond Vendor Benchmark Claims

5/05/2026

Inference infrastructure decisions should be driven by measured performance under your actual workload — vendor benchmarks rarely match production conditions.

Tensor Parallelism vs Pipeline Parallelism: Choosing the Right Strategy for Your GPU Cluster

5/05/2026

Tensor parallelism splits operations across GPUs (low latency, high bandwidth need). Pipeline parallelism splits layers (tolerates lower bandwidth, adds bubble overhead).

Choosing Efficient AI Inference Infrastructure: What to Measure Beyond Raw GPU Speed

5/05/2026

Inference efficiency is performance-per-watt and cost-per-inference, not raw FLOPS. Batch size, precision, and memory bandwidth determine throughput.

CUDA Cores vs Tensor Cores: What Actually Determines AI Performance

5/05/2026

AI inference throughput depends primarily on tensor core utilisation, not CUDA core count. Tensor core generation determines supported precision formats.

CUDA Compute Capability Explained: What the Version Number Means for AI Workloads

5/05/2026

CUDA compute capability determines which tensor core operations and precision formats a GPU supports — not just whether CUDA runs.

How to Improve GPU Performance: A Profiling-First Approach to Compute Optimization

5/05/2026

Profiling must precede GPU optimisation. Memory bandwidth fixes typically deliver 2–5× more impact than compute-bound fixes for AI workloads.

BF16 vs FP16: When Dynamic Range Beats Precision and Vice Versa

5/05/2026

BF16 trades mantissa precision for dynamic range. The choice depends on whether your workload is gradient-dominated or activation-precision-dominated.

GPU Parallel Computing Explained: How Thousands of Cores Solve Problems Differently

5/05/2026

GPU parallelism exploits thousands of simple cores for data-parallel workloads. The execution model differs fundamentally from CPU thread-level parallelism.

AI TOPS Explained: Why This Popular Spec Tells You Almost Nothing About Real Performance

4/05/2026

TOPS measures theoretical throughput at one precision. It ignores memory bandwidth, software overhead, and workload fit — making it a poor performance predictor.

A100 GPU Rental Options: What Availability and Pricing Look Like in 2026

4/05/2026

A100 rental pricing varies 2–5× between providers depending on commitment length, region, and availability. Here is what the market looks like.

Agent Framework Selection for Edge-Constrained Inference Targets

2/05/2026

Selecting an agent framework for partial on-device inference: four axes that decide whether a desktop-class framework survives the edge-target boundary.

Distillation vs Quantisation for Multi-Platform Edge Inference: How to Choose

28/04/2026

Distillation and quantisation both shrink models for edge inference, but for three-or-more platforms only distillation keeps quality consistent.

GPU-Accelerating RF Signal Propagation Simulation: From Days to Hours

28/04/2026

Naive GPU porting of sequential RF simulation delivers modest gains. Algorithmic redesign to expose parallelism turns multi-day runtimes into hours.

What Cross-Platform GPU Performance Portability Requires

26/04/2026

Source-level portability is not performance portability. Competitive speed across GPU vendors needs architecture-aware abstraction and per-target tuning.

Cloud GPU vs On-Premise AI Accelerators: A Total Cost Analysis

25/04/2026

Cloud GPU suits variable, short-term workloads. On-premise is cheaper for sustained utilisation above 60%. The break-even is calculable, not philosophical.

How to Optimise AI Inference Latency on GPU Infrastructure

24/04/2026

Inference latency optimisation targets model compilation, batching, and memory management — not hardware speed. TensorRT and quantisation are key levers.

Algorithmic Restructuring vs Kernel Tuning: Choosing the Higher-Leverage GPU Optimisation

23/04/2026

Kernel tuning improves constant factors. Algorithmic restructuring changes complexity class. Identify your bottleneck type before committing effort.

The Hidden Cost of GPU Underutilisation

21/04/2026

Most GPU workloads use 30–50% of available compute. Without profiling, the waste is invisible. Bandwidth, occupancy, and serialisation are the root causes.

CUDA vs OpenCL vs SYCL: Choosing a GPU Compute API

20/04/2026

CUDA delivers the deepest optimisation on NVIDIA hardware. OpenCL and SYCL offer portability. Choose based on lock-in tolerance and performance needs.

GPU Performance Per Dollar — Why Cost, Efficiency, and Value Are Not the Same Metric

17/04/2026

Performance per dollar. Tokens per watt. Cost per request. These sound like the same thing said differently, but they measure genuinely different dimensions of AI infrastructure economics. Conflating them leads to infrastructure decisions that optimize for the wrong objective.

Precision Is an Economic Lever in Inference Systems

17/04/2026

Precision isn't just a numerical setting — it's an economic one. Choosing FP8 over BF16, or INT8 over FP16, changes throughput, latency, memory footprint, and power draw simultaneously. For inference at scale, these changes compound into significant cost differences.

Precision Choices Are Constrained by Hardware Architecture

17/04/2026

You can't run FP8 inference on hardware that doesn't have FP8 tensor cores. Precision format decisions are conditional on the accelerator's architecture — its tensor core generation, native format support, and the efficiency penalties for unsupported formats.

Steady-State Performance, Cost, and Capacity Planning

17/04/2026

Capacity planning built on peak performance numbers over-provisions or under-delivers. Real infrastructure sizing requires steady-state throughput — the predictable, sustained output the system actually delivers over hours and days, not the number it hit in the first five minutes.

Why Benchmarks Mislead AI Hardware Procurement — and How to Use Them Correctly

16/04/2026

A benchmark result starts with full context — workload, software stack, measurement conditions. By the time it reaches a procurement deck, all that context is gone. The failure mode is not wrong benchmarks but context loss during propagation.

Building an Audit Trail: Benchmarks as Evidence for Governance and Risk

16/04/2026

High-value AI hardware decisions need traceable evidence, not slide-deck bullet points. When benchmarks are documented with methodology, assumptions, and limitations, they become auditable institutional evidence — defensible under scrutiny and revisitable when conditions change.

The Comparability Protocol: Why Benchmark Methodology Defines What You Can Compare

16/04/2026

Two benchmark scores can only be compared if they share a declared methodology — the same workload, precision, measurement protocol, and reporting conditions. Without that contract, the comparison is arithmetic on numbers of unknown provenance.

How to Choose AI Hardware and GPU for AI Workloads: A Decision Framework

16/04/2026

Hardware selection is a multivariate decision under uncertainty — not a score comparison. This framework walks through the steps: defining the decision, matching evaluation to deployment, measuring what predicts production, preserving tradeoffs, and building a repeatable process.

How Benchmarks Shape Organizations Before Anyone Reads the Score

16/04/2026

Before a benchmark score informs a purchase, it has already shaped what gets optimized, what gets reported, and what the organization considers important. Benchmarks function as decision infrastructure — and that influence deserves more scrutiny than the number itself.

Accuracy Loss from Lower Precision Is Task‑Dependent

16/04/2026

Reduced precision does not produce a uniform accuracy penalty. Sensitivity depends on the task, the metric, and the evaluation setup — and accuracy impact cannot be assumed without measurement.

Precision Is a Design Parameter, Not a Quality Compromise

16/04/2026

Numerical precision is an explicit design parameter in AI systems, not a moral downgrade in quality. This article reframes precision as a representation choice with intentional trade-offs, not a concession made reluctantly.

Mixed Precision Works by Exploiting Numerical Tolerance

16/04/2026

Not every multiplication deserves 32 bits. Mixed precision works because neural network computations have uneven numerical sensitivity — some operations tolerate aggressive precision reduction, others don't — and the performance gains come from telling them apart.

Throughput vs Latency: Choosing the Wrong Optimization Target

16/04/2026

Throughput and latency are different objectives that often compete for the same resources. This article explains the trade-off, why batch size reshapes behavior, and why percentiles matter more than averages in latency-sensitive systems.

Quantization Is Controlled Approximation, Not Model Damage

16/04/2026

When someone says 'quantize the model,' the instinct is to hear 'degrade the model.' That framing is wrong. Quantization is controlled numerical approximation — a deliberate engineering trade-off with bounded, measurable error characteristics — not an act of destruction.

Back See Blogs
arrow icon