CoChat

Code generation in the polyhedral model is easier than you think

Open access
Bastoul, C. · 2004 · Proceedings. 13th International Conference on Parallel Architecture and Compilation Techniques, 2004. PACT 2004.

The DOI matches its Crossref record; 28 of the 30 references it cites were found in a registry or an index.

Abstract

Many advances in automatic parallelization and optimization have been achieved through the polyhedral model. It has been extensively shown that this computational model provides convenient abstractions to reason about and apply program transformations. Nevertheless, the complexity of code generation has long been a deterrent for using polyhedral representation in optimizing compilers. First, code generators have a hard time coping with generated code size and control overhead that may spoil theoretical benefits achieved by the transformations. Second, this step is usually time consuming, hampering the integration of the polyhedral framework in production compilers or feedback-directed, iterative optimization schemes. Moreover, current code generation algorithms only cover a restrictive set of possible transformation functions. This paper discusses a general transformation framework able to deal with nonunimodular, noninvertible, nonintegral or even nonuniform functions. It presents several improvements to a state-of-the-art code generation algorithm. Two directions are explored: generated code size and code generator efficiency. Experimental evidence proves the ability of the improved method to handle real-life problems.

Overview

Integrity signals

Registry

Crossref · 10.1109/pact.2004.1342537

Cites

28 of 28 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Citations

Cites

Show all 28 references

Research works printed but not linked: 2

  1. le fur, 1994, Parcours de polye?dres parame?tre?s avec l'e?limination de Fourier-Motzkin, Technical Report, 2358
  2. slama, 2000, Vers l'extension du mode?le polye?drique aux transformations irre?gulie?res, CARI'5 International Conference on African Research in Computer Science

Cited by

See all 457

Metadata

Authors
Bastoul, C.
Affiliations
Université de Versailles Saint-Quentin-en-Yvelines (FR)
Corresponding author
Bastoul, C.
Venue
Proceedings. 13th International Conference on Parallel Architecture and Compilation Techniques, 2004. PACT 2004.
Publisher
IEEE
Published
2004-11-08
Pages
7-16
ISSN
1089-795X (ISSN-L)
OpenAlex
W2076485607
Cited by
447
References
30
Citations by year
2026: 2 · 2025: 4 · 2024: 4 · 2023: 5 · 2022: 6 · 2021: 20 · 2020: 12 · 2019: 19 · 2018: 18 · 2017: 34 · 2016: 39 · 2015: 43 · 2014: 37 · 2013: 33 · 2012: 39
FWCI
5.84
Type
conference paper
Language
en
Open access
Licence
other-oa
Locations
  • International Conference on Parallel Architectures and Compilation Techniques (PACT) (publishedVersion)
  • HAL (submittedVersion, other-oa)
Topics
  • Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
  • Physical Sciences › Computer Science › Hardware and Architecture › Embedded Systems Design Techniques
  • Physical Sciences › Computer Science › Software › Logic, programming, and type systems
Keywords
polyhedral models, code generation, program transformation, automatic parallelization, program size, optimizing compilers, feedback-directed optimization

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.