Reproducible Triangular Solvers for High-Performance Computing

Roman Iakymchuk; David Defour; Sylvain Collange; Stef Graillat

Reproducible Triangular Solvers for High-Performance Computing

Roman Iakymchuk ^{1, 2} David Defour ³ Sylvain Collange ⁴ Stef Graillat ¹

1 PEQUAN - Performance et Qualité des Algorithmes Numériques

LIP6 - Laboratoire d'Informatique de Paris 6

2 ISCD - Institut des Sciences du Calcul et des Données

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 reproducible triangular solver and results on recent NVIDIA GPUs.

Document type :

Conference papers

Domain :

Computer Science [cs] / Hardware Architecture [cs.AR]

Complete list of metadatas

https://hal-lirmm.ccsd.cnrs.fr/lirmm-01206371
Contributor : David Defour <>
Submitted on : Monday, September 28, 2015 - 9:34:54 PM
Last modification on : Tuesday, October 15, 2019 - 6:02:04 PM

Reproducible Triangular Solvers for High-Performance Computing

Links full text

Identifiers

Collections

Citation

Export

Metrics

479

Contact

Reproducible Triangular Solvers for High-Performance Computing

Links full text

Identifiers

Collections

Citation

Export

Share

Metrics

479

Contact