We consider the problem of distribution of loops with control dependences, involving if and do control structures. More precisely, we study how to control the number of temporary arrays that have to be introduced to store conditionals. We show that the traditional superposition of the data dependence graph and of the control dependence graph is not adequate, and we introduce a new representation, the mixed dependence graph. This allows us to develop a distribution algorithm that is parameterized by the maximal allowed dimensions of temporary arrays.
CITATION STYLE
Darte, A., & Silber, G. A. (2000). Temporary arrays for distribution of loops with control dependences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1900, pp. 357–367). Springer Verlag. https://doi.org/10.1007/3-540-44520-x_47
Mendeley helps you to discover research relevant for your work.