| Abstract |
|---|
| The automatic parallelization of ``regular'' programs has encountereda fair amount of success due to the use of the polytope model. However,since most programs are not regular, or are regular only in parts, there is a need for a parallelization theory for other kinds of programs. This paper explore the suggestion that {\sl some} ``irregular''programs are in fact regular on other data and control structures. We adduce as an example the {\sl recursive tree programs}, for which we build a parallelization model and a dependence test. |
| Contact |
| Paul Feautrier Laboratoire PRiSM,Universit'e de Versailles,45 Avenue des Etats-Unis,F-78035 VERSAILLES CEDEX FRANCE, Paul.Feautrier@prism.uvsq.fr |