Write a reduction, then explain why the naive one is slow

A reduction has reuse of one, so its ceiling is the bandwidth floor and every version is judged by its distance from it. The naive versions fail for three separate reasons: serialisation on one address, barrier-bound trees, and too few bytes in flight. The warp, block, grid shape is the template.

18 MIN · PREMIUM