S. Genaud. Techniques de tranformations d"enonc'es pei pour la productions de programmes dataparall `eles. In RenPar7, Mons, Belgium, May 1995. 8  Home/Search   Document Not in Database   Summary   Related Articles   Check

....defines an equational style framework for data parallel programming. It lies on a small but powerful set of primitives and induces a refinement calculus to design or transform programs. The PEI compiler, generating data parallel code too, makes restrictions similar to those of the Alpha compiler [24]. 6 Conclusion This preliminary work shows how memory management for parallelization of a certain class of higher order functions can be done statically in the polytope model, and how garbage collection of temporary data can be handled at compile time using scheduling and array folding. Future ....

S. Genaud. Techniques de tranformations d"enonc'es pei pour la productions de programmes dataparall `eles. In RenPar7, Mons, Belgium, May 1995. 8

....defines an equational style framework for data parallel programming. It lies on a small but powerful set of primitives and induces a refinement calculus to design or transform programs. The PEI compiler, generating data parallel code too, makes restrictions similar to those of the Alpha compiler [24]. 6 Conclusion This preliminary work shows how memory management for parallelization of a certain class of higher order functions can be done statically in the polytope model, and how garbage collection of temporary data can be handled at compile time using scheduling and array folding. Future ....

S. Genaud. Techniques de tranformations d"enonc'es pei pour la productions de programmes dataparall `eles. In RenPar7, Mons, Belgium, May 1995.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC