Skip to Main content Skip to Navigation
New interface
Preprints, Working Papers, ...

A Polyhedral Approach for Scalar Promotion

Alec Sadler 1 Christophe Alias 1 Hugo Thievenaz 1 
1 CASH - CASH - Compilation and Analysis, Software and Hardware
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : Memory accesses are a well known bottleneck whose impact might be mitigated by using properly the memory hierarchy until registers. In this paper, we address array scalarization, a technique to turn temporary arrays into a collection of scalar variables to be allocated to registers. We revisit array scalarization in the light of the recent advances of the polyhedral model, a general framework to design optimizing program transformations. We propose a general algorithm for array scalarization, ready to be plugged in a polyhedral compiler, among other passes. Our scalarization algorithm operates on the polyhedral intermediate representation. In particular, our scalarization algorithm is parametrized by the program schedule possibly computed by a previous compilation pass. We rely on schedule-directed array contraction and we propose a loop tiling algorithm able to reduce the footprint down to the available amount of registers on the target architecture. Experimental results con rm the e ectiveness and the e ciency of our approach.
Complete list of metadata

https://hal.inria.fr/hal-03449994
Contributor : Christophe Alias Connect in order to contact the contributor
Submitted on : Thursday, November 25, 2021 - 5:32:57 PM
Last modification on : Tuesday, October 25, 2022 - 4:25:10 PM
Long-term archiving on: : Saturday, February 26, 2022 - 9:50:41 PM

File

RR-9437.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-03449994, version 1

Citation

Alec Sadler, Christophe Alias, Hugo Thievenaz. A Polyhedral Approach for Scalar Promotion. 2021. ⟨hal-03449994⟩

Share

Metrics

Record views

192

Files downloads

110