Abstract
We present results demonstrating the usefulness of monolithic program analysis and optimization prior to scalarization. In particular, models are developed for studying nonmaterialization in basic blocks consisting of a sequence of assignment statements involving array– valued variables. We use these models to analyze the problem of minimizing the number of materializations in a basic block, and to develop an efficient algorithm for minimizing the number of materializations in certain cases.
Cite
CITATION STYLE
Rosenkrantz, D. J., Mullin, L. R., & Hunt, H. B. (2001). On materializations of array-valued temporaries. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2017, pp. 127–141). Springer Verlag. https://doi.org/10.1007/3-540-45574-4_9
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
