Maximal Atomic irRedundant Sets: a Usage-based Dataflow Partitioning Algorithm - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2023

Maximal Atomic irRedundant Sets: a Usage-based Dataflow Partitioning Algorithm

Résumé

Programs admitting a polyhedral representation can be transformed in many ways for locality and parallelism, notably loop tiling. Data flow analysis can then compute dependence relations between iterations and between tiles. When tiling is applied, certain iteration-wise dependences cross tile boundaries, creating the need for inter-tile data communication. Previous work computes it as the flow-in and flow-out sets of iteration tiles. In this paper, we propose a partitioning of the flow-out of a tile into the maximal sets of iterations that are entirely consumed and incur no redundant storage or transfer. The computation is described as an algorithm and performed on a selection of polyhedral programs. We then suggest possible applications of this decomposition in compression and memory allocation.
Fichier principal
Vignette du fichier
paper1.pdf (951.27 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-04410835 , version 1 (23-01-2024)

Licence

Copyright (Tous droits réservés)

Identifiants

  • HAL Id : hal-04410835 , version 1

Citer

Corentin Ferry, Steven Derrien, Sanjay Rajopadhye. Maximal Atomic irRedundant Sets: a Usage-based Dataflow Partitioning Algorithm. IMPACT 2023 - 13th International Workshop on Polyhedral Compilation Techniques, Jan 2023, Toulouse, France. pp.1-9. ⟨hal-04410835⟩
7 Consultations
5 Téléchargements

Partager

Gmail Facebook X LinkedIn More