Skip to Main content Skip to Navigation
Conference papers

DeLICM: Scalar Dependence Removal at Zero Memory Cost

Michael Kruse 1 Tobias Grosser 2
1 Parkas - Parallélisme de Kahn Synchrone
DI-ENS - Département d'informatique de l'École normale supérieure, CNRS - Centre National de la Recherche Scientifique, Inria de Paris
Abstract : Increasing data movement costs motivate the integration of polyhedral loop optimizers in the standard flow (-O3) of production compilers. While polyhedral optimizers have been shown to be effective when applied as source-to-source transformation, the single static assignment form used in modern compiler mid-ends makes such optimizers less effective. Scalar dependencies (dependencies carried over a single memory location) are the main obstacle preventing effective optimization. We present DeLICM, a set of transformations which, backed by a polyhedral value analysis, eliminate problematic scalar dependences by 1) relocating scalar memory references to unused array locations and by 2) forwarding computations that otherwise cause scalar dependences. Our experiments show that DeLICM effectively eliminates dependencies introduced by compiler-internal canonicalization passes, human programmers, optimizing code generators, or inlining – without the need for any additional memory allocation. As a result, polyhedral loop optimizations can be better integrated into compiler pass pipelines which is essential for metaprogramming optimization.
Document type :
Conference papers
Complete list of metadata

Cited literature [34 references]  Display  Hide  Download

https://hal.inria.fr/hal-01814183
Contributor : Michael Kruse <>
Submitted on : Thursday, February 7, 2019 - 11:30:53 PM
Last modification on : Thursday, May 27, 2021 - 1:54:06 PM
Long-term archiving on: : Wednesday, May 8, 2019 - 12:13:10 PM

File

delicm-sigplan.pdf
Files produced by the author(s)

Identifiers

Collections

Citation

Michael Kruse, Tobias Grosser. DeLICM: Scalar Dependence Removal at Zero Memory Cost. CGO'18 - International Symposium on Code Generation and Optimization, Feb 2018, Vienna, Austria. pp.241-253, ⟨10.1145/3168815⟩. ⟨hal-01814183⟩

Share

Metrics

Record views

72

Files downloads

200