Characterizing Warp Divergence from Pascal to Blackwell

(arxiv.org)

27 points | by matt_d 6 days ago ago

1 comments

  • majke 2 days ago ago

    > 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?