Hacker Newsnew | past | comments | ask | show | jobs | submitlogin
Characterizing Warp Divergence from Pascal to Blackwell (arxiv.org)
27 points by matt_d 21 days ago | hide | past | favorite | 1 comment


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




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: