- The assumption that NVIDIA GPUs handle warp divergence in a fixed manner since Volta's Independent Thread Scheduling is tested across Ampere, Hopper, and Blackwell GPUs, with Pascal as a baseline.
- Divergent paths serialize linearly with path count (T(k) ≈ sk) across all tested generations, with no super-linear reconvergence penalty.
- Warp execution efficiency decreases as 32/k, the penalty is independent of occupancy, and predication eliminates serialization cost.
- The same performance cost model predates ITS, as it appears on Pascal.