Communication Dans Un Congrès Année : 2003

Instancewise Array Dependence Test for Recursive Programs

Résumé

Starting from a generalization of induction variables, we present a dependence test framework for recursive programs. For a restricted class of programs, a statically computable function maps every run-time instance of a program statement to the data-structure elements it accesses. Statement instances and data structure layouts are described through formal language tools. This framework is applied to the automatic detection of data and control parallelism. We extend the concept of instancewise data dependences to recursive programs and we further investigate a dependence test for recursive programs operating on arrays. This test is interpreted as a flow problem in a directed graph with weighted edges; and the problem is shown to be NP-complete. We provide an exponential but efficient algorithm based on integer linear programming and explore simple examples.

Fichier principal
Vignette du fichier
ACF03.pdf (156.28 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence
Loading...

Dates et versions

hal-01257308 , version 1 (17-01-2016)

Licence

Identifiants

  • HAL Id : hal-01257308 , version 1

Citer

Pierre Amiranoff, Albert Cohen, Paul Feautrier. Instancewise Array Dependence Test for Recursive Programs. Workshop on Compilers for Parallel Computers (CPC), 2003, Amsterdam, Netherlands. ⟨hal-01257308⟩
175 Consultations
132 Téléchargements

Partager

  • More