Maximizing parallelism and minimizing synchronization with affine partitions
Parallel Computing - Special issues on languages and compilers for parallel computers
Polynomial-time analysis of toroidal periodic graphs
Journal of Algorithms
Partitioning and Labeling of Loops by Unimodular Transformations
IEEE Transactions on Parallel and Distributed Systems
Code Generation in the Polyhedral Model Is Easier Than You Think
Proceedings of the 13th International Conference on Parallel Architectures and Compilation Techniques
Extracting Coarse-Grained Parallelism in Program Loops with the Slicing Framework
ISPDC '07 Proceedings of the Sixth International Symposium on Parallel and Distributed Computing
Effective automatic parallelization and locality optimization using the polyhedral model
Effective automatic parallelization and locality optimization using the polyhedral model
Hi-index | 0.00 |
This paper presents a new approach for the extraction of coarse---grained parallelism available in program loops. The approach permits for extracting parallelism for both uniform and quasi---uniform perfectly nested parameterized loops, where the loop bounds and data accesses are affine functions of loop indices and symbolic parameters. It extracts a set of synchronization---free code fragments. The procedure has a polynomial time complexity except for one step of calculations. The effectiveness and time complexity of the approach are evaluated by means of loops of the NAS Parallel Benchmark suite.