Name
Abstract | ||
|---|---|---|
Due to non-associativity of floating-point operations and dynamic scheduling on parallel architectures, getting a bit-wise reproducible floating-point result for multiple executions of the same code on different or even similar parallel architectures is challenging. In this paper, we address the problem of reproducibility in the context of matrix multiplication and propose an algorithm that yields both reproducible and accurate results. This algorithm is composed of two main stages: a filtering stage that uses fast vectorized floating-point expansions in conjunction with error-free transformations; an accumulation stage based on Kulisch long accumulators in a high-radix carry-save representation. Finally, we provide implementations and performance results in parallel environments like GPUs. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/978-3-319-31769-4_11 | Lecture Notes in Computer Science |
Keywords | Field | DocType |
Matrix multiplication,Reproducibility,Accuracy,Kulisch long accumulator,Error-free transformation,Floating-point expansion,Rounding-to-nearest,GPUs | Computer science,Parallel computing,Filter (signal processing),Implementation,Dynamic priority scheduling,Matrix multiplication | Conference |
Volume | ISSN | Citations |
9553 | 0302-9743 | 1 |
PageRank | References | Authors |
0.36 | 6 | 4 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roman Iakymchuk | 1 | 32 | 5.98 |
| David Defour | 2 | 131 | 18.28 |
| Sylvain Collange | 3 | 14 | 2.58 |
| Stef Graillat | 4 | 92 | 16.06 |