Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Reproducible Triangular Solvers for High-Performance Computing

Roman Iakymchuk 1, 2 David Defour 3 Sylvain Collange 4 Stef Graillat 2
2 PEQUAN - Performance et Qualité des Algorithmes Numériques
LIP6 - Laboratoire d'Informatique de Paris 6
3 DALI - Digits, Architectures et Logiciels Informatiques
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier, UPVD - Université de Perpignan Via Domitia
4 ALF - Amdahl's Law is Forever
Inria Rennes – Bretagne Atlantique , IRISA-D3 - ARCHITECTURE
Abstract : 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.
Complete list of metadata

Cited literature [16 references]  Display  Hide  Download
Contributor : Roman Iakymchuk <>
Submitted on : Saturday, February 14, 2015 - 5:30:54 PM
Last modification on : Friday, January 8, 2021 - 5:40:03 PM
Long-term archiving on: : Thursday, May 28, 2015 - 3:05:44 PM


Files produced by the author(s)


  • HAL Id : hal-01116588, version 2


Roman Iakymchuk, David Defour, Sylvain Collange, Stef Graillat. Reproducible Triangular Solvers for High-Performance Computing. 2015. ⟨hal-01116588v2⟩



Record views


Files downloads