On the Verification of Polyhedral Program Transformations - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2020

On the Verification of Polyhedral Program Transformations

Résumé

This paper presents a pragma language to specify a polyhedral program transformation directly in the code and a verification algorithm able to check the correctness of the specified transformation. Our language is general enough to specify a loop tiling by an arbitrary polyhedral tile shape (e.g., hexagons, diamonds, trapezoids), and whose size may depend on a scaling parameter (monoparametric tiling). Our verification algorithm checks the legality of the proposed transformation, and provides counterexamples of unsatisfied dependences when it is incorrect. In addition, out tool infers the domain of scaling parameters where the tiling is not legal. We developed a tool suite implementing these concepts with a verification tool (MPPCHECK) and a code generation tool (MPPCODEGEN), that are available and may be downloaded together with a rich set of examples. We evaluate the performance of the verification and the code generation on kernels from the PolyBench suite.
Fichier principal
Vignette du fichier
alias-perso.pdf (370.13 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-03106070 , version 1 (11-01-2021)

Identifiants

  • HAL Id : hal-03106070 , version 1

Citer

Christophe Alias, Guillaume Iooss, Sanjay Rajopadhye. On the Verification of Polyhedral Program Transformations. HPCS 2020 - 18th International Conference on High Performance Computing & Simulation, CADO 2020 - 3rd Special Session on Compiler Architecture, Design and Optimization, Oct 2020, Barcelona, Spain. pp.1-8. ⟨hal-03106070⟩
167 Consultations
87 Téléchargements

Partager

Gmail Facebook X LinkedIn More