<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/"><channel><title>Profiling on Sanketh's Blog</title><link>https://sankethbk.github.io/blog/tags/profiling/</link><description>Recent content in Profiling on Sanketh's Blog</description><generator>Hugo -- 0.166.0</generator><language>en-us</language><lastBuildDate>Fri, 04 Sep 2026 00:00:00 +0000</lastBuildDate><atom:link href="https://sankethbk.github.io/blog/tags/profiling/index.xml" rel="self" type="application/rss+xml"/><item><title>CUDA Profiling and Performance Measurement</title><link>https://sankethbk.github.io/blog/posts/gpu/2026-09-04-2-cuda-profiling/</link><pubDate>Fri, 04 Sep 2026 00:00:00 +0000</pubDate><guid>https://sankethbk.github.io/blog/posts/gpu/2026-09-04-2-cuda-profiling/</guid><description>&lt;h1 id="cuda-profiling-and-performance-measurement"&gt;CUDA Profiling and Performance Measurement&lt;/h1&gt;
&lt;p&gt;The notes up to this point covered what makes CUDA kernels fast in theory: coalescing, tiling, occupancy, and asynchronous execution. This note covers how to &lt;strong&gt;measure&lt;/strong&gt; whether a kernel is actually fast and how to find the bottleneck when it is not.&lt;/p&gt;
&lt;p&gt;Profiling is what separates guessing from optimization. Without it, you can apply every best practice and still be slower than a simpler implementation.&lt;/p&gt;</description></item></channel></rss>