Numerical reproducibility for the parallel reduction on multi- and many-core architectures
A parallel algorithm to compute correctly-rounded floating-point sums Highly-optimized implementations for modern CPUs, GPUs and Xeon Phi As fast as memory bandwidth allows for large sums with moderate dynamic range Scales well with the problem size and resources used on a cluster of compute nodes
reproducibility multi- and many-core architectures parallel floating-point summation accuracy long accumulator error-free transformations