Tag
reduction
- Jul 21, 2026 Compensated Summation and How Summation Order Bounds Error The worst-case error of a naive sum grows with the number of terms, pairwise reduction turns that into a logarithm, and compensation removes the growth at the cost of a serial dependency. scientific computing
- Oct 21, 2025 Atomic Contention and the L2 as a Serialization Point Why a global atomic executes at the cache slice that owns its address, how a hot counter turns a parallel machine into a queue, and which reductions avoid the queue entirely. gpu computing
- Aug 28, 2025 Tree Reductions and Floating-Point Summation Order Why a pairwise tree sum is not the same number as a linear sum, how much error the tree removes, and how shuffle-based and shared-memory reduction stages compose. gpu computing
- Nov 8, 2024 Reduction Trees and What Associativity Buys Why a reduction needs an associative operator to be reordered, how tree shape changes floating-point results, and what error bounds the shapes imply. algorithms