logoalt Hacker News

Characterizing Warp Divergence from Pascal to Blackwell

22 pointsby matt_dlast Thursday at 6:56 PM1 commentview on HN

Comments

majketoday at 2:15 PM

> Across all tested generations, divergent paths serialize linearly with the number of paths k, following T(k)≈sk with no super-linear reconvergence penalty. Warp execution efficiency falls as 32/k, the penalty is independent of occupancy, and predication removes the serialization cost

So... Nvidia did a good job?