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

SMO: An Integrated Approach to Intra-array and Inter-array Storage Optimization

Autor: Albert Cohen, Uday Bondhugula, Somashekaracharya G. Bhaskaracharya

Publikováno v: POPL 2016-ACM Symposium on Principles of Programming Languages
POPL 2016-ACM Symposium on Principles of Programming Languages, Jan 2016, Saint Petersburg, United States. pp.526-538, ⟨10.1145/2837614.2837636⟩
POPL

International audience; The polyhedral model provides an expressive intermediate representation that is convenient for the analysis and subsequent transformation of affine loop nests. Several heuristics exist for achieving complex program transformat

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::24de0a0a89e1c02981f08520c374aac9
https://inria.hal.science/hal-01425888/file/paper.pdf

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.

Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.