Methods and applications of error-free computation
Methods and applications of error-free computation
The importance of direct dependences for automatic parallelization
ICS '88 Proceedings of the 2nd international conference on Supercomputing
ICS '88 Proceedings of the 2nd international conference on Supercomputing
Non-unimodular transformations of nested loops
Proceedings of the 1992 ACM/IEEE conference on Supercomputing
Communication-free hyperplane partitioning of nested loops
Journal of Parallel and Distributed Computing
ICS '94 Proceedings of the 8th international conference on Supercomputing
Compiler transformations for high-performance computing
ACM Computing Surveys (CSUR)
Maximizing parallelism and minimizing synchronization with affine partitions
Parallel Computing - Special issues on languages and compilers for parallel computers
Dependence Analysis for Supercomputing
Dependence Analysis for Supercomputing
High Performance Compilers for Parallel Computing
High Performance Compilers for Parallel Computing
An Efficient Data Dependence Analysis for Parallelizing Compilers
IEEE Transactions on Parallel and Distributed Systems
The Power Test for Data Dependence
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
A new method of parallel loop execution is presented. Firstly, all the loop iterations are executed in parallel. Then, the ends of pairs of dependent iterations are re-executed. The method requires no conversion of a source loop into an equivalent serial-parallel loop, involving iteration indices to be converted into new ones, that appears to be a typical requirement in the most known loop paralleling approaches such as unimodular and nonunimodular linear transformation methods. Possibilities of serial and parallel correction processes are discussed. Experimental results are considered. As follows from experiments, applying the method can be reasonable for the loops with a small fraction of dependent iterations.