Supercompilers for parallel and vector computers
Supercompilers for parallel and vector computers
Efficient and exact data dependence analysis
PLDI '91 Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation
A general algorithm for data dependence analysis
ICS '92 Proceedings of the 6th international conference on Supercomputing
Evolutionary algorithms in theory and practice: evolution strategies, evolutionary programming, genetic algorithms
Loop Transformations for Restructuring Compilers: The Foundations
Loop Transformations for Restructuring Compilers: The Foundations
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms
On the Parallel Execution Time of Tiled Loops
IEEE Transactions on Parallel and Distributed Systems
A Technique for Variable Dependence Driven Loop Peeling
ICA3PP '02 Proceedings of the Fifth International Conference on Algorithms and Architectures for Parallel Processing
(R) Estimating Parallel Execution Time of Loops with Loop - Carried Dependence
ICPP '96 Proceedings of the Proceedings of the 1996 International Conference on Parallel Processing - Volume 3
| Hi-index | 0.00 |
Loop parallelization is an important issue in the acceleration of the execution of scientific programs. To exploit parallelism in loops a system of equations representing the dependencies between the loop iterations and a system of non-equations indicating the loop boundary conditions has to be solved. This is a NP-Complete problem. Our major contribution in this paper has been to apply genetic algorithm to solve system of equation and non-equation resulted from loop dependency analysis techniques to find two dependent loop iterations. We use distance vector to find the rest of dependencies.