Loop distribution with arbitrary control flow
- 4 December 2002
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 15, 407-416
- https://doi.org/10.1109/superc.1990.130048
Abstract
A general and optimal algorithm for loop distribution when control flow is present is proposed. The algorithm can be used to enhance the effectiveness of vectorizers, parallelizers, and programming environments. The method performs loop distribution in the presence of control flow based on control dependencies. This algorithm is optimal in that it generates the minimum number of new arrays and tests possible. A code generation algorithm that produces code for the resulting program without replicating statements or conditions is also presentedKeywords
This publication has 13 references indexed in Scilit:
- The program dependence graph and vectorizationPublished by Association for Computing Machinery (ACM) ,1989
- The parascope editor: an interactive parallel programming toolPublished by Association for Computing Machinery (ACM) ,1989
- Generating sequential code from parallel codePublished by Association for Computing Machinery (ACM) ,1988
- A framework for determining useful parallelismPublished by Association for Computing Machinery (ACM) ,1988
- Automatic translation of FORTRAN programs to vector formACM Transactions on Programming Languages and Systems, 1987
- The program dependence graph and its use in optimizationACM Transactions on Programming Languages and Systems, 1987
- On linearizing parallel codePublished by Association for Computing Machinery (ACM) ,1985
- Conversion of control dependence to data dependencePublished by Association for Computing Machinery (ACM) ,1983
- Analysis of Programs for Parallel ProcessingIEEE Transactions on Electronic Computers, 1966
- Flow diagrams, turing machines and languages with only two formation rulesCommunications of the ACM, 1966