That&#x27;s interesting to hear! I took the udacity CUDA course a few years ago, and at that time they were very keen on memory access coalescing, and if a warp had two control paths they were executed sequentially.<p>As such I didn&#x27;t think I could figure out how to make use of it for my applications (merging sorted lists of integers, dijkstra&#x27;s algorithm etc) as typically you&#x27;re branching and jumping around memory all over the place.<p>Can you suggest anywhere I can learn about these advances that mean the same rules don&#x27;t apply?