Skip to Main content Skip to Navigation
Conference papers

Automated derivation of parametric data movement lower bounds for affine programs

Abstract : Researchers and practitioners have for long worked on improving the computational complexity of algorithms, focus-ing on reducing the number of operations needed to perform a computation. However the hardware trend nowadays clearly shows a higher performance and energy cost for data movements than computations: quality algorithms have to minimize data movements as much as possible. The theoretical operational complexity of an algorithm is a function of the total number of operations that must be executed
Document type :
Conference papers
Complete list of metadata

Cited literature [35 references]  Display  Hide  Download

https://hal.inria.fr/hal-02910961
Contributor : Auguste Olivry <>
Submitted on : Monday, August 3, 2020 - 2:36:05 PM
Last modification on : Wednesday, May 26, 2021 - 3:29:20 PM
Long-term archiving on: : Monday, November 30, 2020 - 1:39:50 PM

File

main.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Auguste Olivry, Julien Langou, Louis-Noël Pouchet, P. Sadayappan, Fabrice Rastello. Automated derivation of parametric data movement lower bounds for affine programs. PLDI 2020 - 41st ACM SIGPLAN International Conference on Programming Language Design and Implementation, Jun 2020, London, United Kingdom. pp.808-822, ⟨10.1145/3385412.3385989⟩. ⟨hal-02910961⟩

Share

Metrics

Record views

110

Files downloads

347