Reproducible Triangular Solvers for High-Performance Computing - Archive ouverte HAL Access content directly
Conference Papers Year : 2015

Reproducible Triangular Solvers for High-Performance Computing


On modern parallel architectures, floating-point computations may become non-deterministic and, therefore, non-reproducible mainly due to non-associativity of floating-point operations. We propose an algorithm to solve dense triangular systems by leveraging the standard parallel triangular solver and our, recently introduced, multi-level exact summation approach. Finally, we present implementations of the proposed fast repro-ducible triangular solver and results on recent NVIDIA GPUs.
Fichier principal
Vignette du fichier
trsv.pdf (216.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01116588 , version 1 (13-02-2015)
hal-01116588 , version 2 (14-02-2015)



Roman Iakymchuk, David Defour, Caroline Collange, Stef Graillat. Reproducible Triangular Solvers for High-Performance Computing. 2015 12th International Conference on Information Technology - New Generations, Apr 2015, Las Vegas, NV, United States. pp.353-358, ⟨10.1109/ITNG.2015.63⟩. ⟨hal-01116588v2⟩
735 View
699 Download



Gmail Facebook Twitter LinkedIn More