Abstract
This article presents a few examples of program transformation strategies in the language Pei [Vio94]. Three strategies are developed: a simplification of the communications, the introduction of broadcasts by removing recursion from data field definitions, and the introduction of a reduction operator. These transformations emphasize the relationships between several programs solving a given problem, especially in the data parallelism area.
Chapter PDF
References
L. Bougé and J.-L. Levaire. Control structures for data-parallel SIMD lan-guages: semantics and implementation. FGCS, 8:363–378, 1992.
M. Chen, Y. Choo, and J. Li. Parallel Functional Languages and Compilers. Frontier Series. ACM Press, 1991. Chapter 7.
K.M. Chandy and J. Misra. Parallel Program Design: A foundation. Addison Wesley, 1988.
Christian Lengauer. Loop parallelization in the polytope model. June 1993.
C. Mauras. Alpha: un langage équationnel pour la conception et la programmation d'architectures parallèles synchrones. PhD thesis, U. Rennes, 1989.
C. Morgan. Programming from specifications. C.A.R. Hoare. Prentice Hall Ed., Endlewood Cliffs, N.J., 1990.
Xavier Redon. Détection et exploitation des récurrences dans les programmes scientifiques en vue de leur parallélisation. PhD thesis, U. Paris 6, Jan 1995.
E. Violard. A mathematical theory and its environment for parallel programming. Parallel Processing Letters, 4(3):313–328, 1994.
E. Violard and G.-R. Perrin. Reduction in pei CONPAR'94, LNCS, 1994.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Genaud, S., Violard, E., Perrin, G.R. (1995). Transformation techniques in Pei. In: Haridi, S., Ali, K., Magnusson, P. (eds) EURO-PAR '95 Parallel Processing. Euro-Par 1995. Lecture Notes in Computer Science, vol 966. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020460
Download citation
DOI: https://doi.org/10.1007/BFb0020460
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60247-7
Online ISBN: 978-3-540-44769-6
eBook Packages: Springer Book Archive