Abstract
Several parallelizing or general-purpose compilers have been using intermediate representations based on some form of single-assignment. Extending these representations to arrays has been done in two ways: Array SA, and Array SSA, the extension of the widely-used Static Single Assignment (SSA).We formally define and compare Array SA and Array SSA, and show that (1) They both need instance-wise reaching-definition analyses to (a) be streamlined and (b) allow a parallelizing compiler to choose the most appropriate form, (2) The “same name -same value” property holds for Array SSA in a restricted way only.
Cite
CITATION STYLE
Collard, J. F. (1999). The advantages of instance-wise reaching definition analyses in array (S)SA. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1656, pp. 338–352). Springer Verlag. https://doi.org/10.1007/3-540-48319-5_22
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
