A Polyhedral Approach for Scalar Promotion

Autor: Sadler, Alec, Alias, Christophe, Thievenaz, Hugo

Publikováno v: Conférence francophone d'informatique en Parallélisme, Architecture et Système (COMPAS'22)
Conférence francophone d'informatique en Parallélisme, Architecture et Système (COMPAS'22), Jul 2022, Amiens, France
[Research Report] RR-9437, Institut National de Recherche en Informatique et en Automatique (INRIA). 2021, pp.14

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 variab

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::00c78040a912ceb30b43aa2d79ecb67d
https://inria.hal.science/hal-03862223

Lightweight Array Contraction by Trace-Based Polyhedral Analysis

Autor: Thievenaz, Hugo, Kimura, Keiji, Alias, Christophe

Publikováno v: C3PO 2022-International Workshop on Compiler-assisted Correctness Checking and Performance Optimization for HPC
C3PO 2022-International Workshop on Compiler-assisted Correctness Checking and Performance Optimization for HPC, Jun 2022, Hamburg, Germany

International audience; Array contraction is a compilation optimization used to reduce memory consumption, by reducing the size of temporary arrays in a program while preserving its correctness. The usual approach to this problem is to perform a stat

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=dedup_wf_001::183723aecfc9e21e2fe1a0806b4dd5f5
https://inria.hal.science/hal-03862219/document