Name
Abstract | ||
|---|---|---|
Bit-reproducibility has many advantages in the context of high-performance computing. Besides simplifying and making more accurate the process of debugging and testing the code, it can allow the deployment of applications on heterogeneous systems, maintaining the consistency of the computations. In this work we analyze the basic operations performed by scientific applications and identify the possible sources of non-reproducibility. In particular, we consider the tasks of evaluating transcendental functions and performing reductions using non-associative operators. We present a set of techniques to achieve reproducibility and we propose improvements over existing algorithms to perform reproducible computations in a portable way, at the same time obtaining good performance and accuracy. By applying these techniques to more complex tasks we show that bit-reproducibility can be achieved on a broad range of scientific applications. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/IPDPS.2014.127 | IPDPS |
Keywords | DocType | ISSN |
parallelism,parallel processing,program testing,code testing process,heterogeneous systems,bit-reproducible portable high-performance computing design,program debugging,reproducibility,nonassociative operators,code debugging process,ieee-754 standard,transcendental function evaluation,determinism,determinism, reproducibility, parallelism, ieee-754 standard | Conference | 1530-2075 |
Citations | PageRank | References |
4 | 0.45 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrea Arteaga | 1 | 4 | 0.79 |
| Oliver Fuhrer | 2 | 46 | 4.72 |
| Torsten Hoefler | 3 | 2197 | 163.64 |