Code generation for partially vectorizable loops in the vectorizing Pascal-XT compiler

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Automatic vectorization of loops by investigation of data access dependences is known from literature. But the algorithms almost only describe the vectorization of fully vectorizable loops. A loop is judged to be nonvectorizable, if some data access dependences form a cycle. However, practical programs often contain loops with cyclic data access dependences where not all variables are included in the cyclic dependence. If cyclic dependences can be isolated, variables not encountered in the cyclic dependence are vectorizable. Thus, in vectorizing compilers not only full loop vectorization but also partial vectorization should be done. Here, the code generation for partially vectorizable loops is described for the vectorizing Pascal-XT compiler. The effect is compared to the vectorizing Fortran compilers of CDC, Cray and Fujitsu.

Cite

CITATION STYLE

APA

Hammer, C., & Raebel, G. (1986). Code generation for partially vectorizable loops in the vectorizing Pascal-XT compiler. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 237 LNCS, pp. 295–302). Springer Verlag. https://doi.org/10.1007/3-540-16811-7_183

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