Storage management in parallel programs.
Vincent Lefèbvre, Paul Feautrier · 1997
The litterature on automatic parallelization generally focuses on data dependency analysis. We have been interested in this article on the data stuctures generation as part of the polyedric technique designed in PAF (Parall'eliseur Automatique pour Fortran). The removal of dependences which are not data flows in a program is generally realized by a total memory expansion of data structures. We present a new technique which allows to reduce the memory cost by expanding carefully selected parts of code only. It consists in limiting the memory expansion process in accordance with contraints imposed by the schedule determined for the parallel program. Key words: Automatic Parallelization of static control programs, Storage Management, Array Dataflow Analysis, Scheduling. R'esum'e La litt'erature consacr'ee `a la parall'elisation automatique se focalise g'en'eralement sur l'analyse du flot de donn'ees. Nous nous int'eressons dans cet article sur la g'en'eration des structures de donn'ees ...