Conference ProceedingsOPEN ACCESS

Transformation techniques in PEI

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (1995) 966 131-142
DOI: 10.1007/bfb0020460
1Citations
Citations of this article
6Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Author supplied keywords

Cite

CITATION STYLE

APA

Genaud, S., Violard, E., & Perrin, G. R. (1995). Transformation techniques in PEI. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 966, pp. 131–142). Springer Verlag. https://doi.org/10.1007/bfb0020460

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free