On loop transformations of nested loops with affine dependencies
From MaRDI portal
Recommendations
Cites work
- A unifying lattice-based approach for the partitioning of systolic arrays via LPGS and LSGP
- Finding quadratic schedules for affine recurrence equations via nonsmooth optimization
- scientific article; zbMATH DE number 618313 (Why is no real title available?)
- scientific article; zbMATH DE number 234026 (Why is no real title available?)
- scientific article; zbMATH DE number 3365044 (Why is no real title available?)
- Partitioning processor arrays under resource constraints
- Some efficient solutions to the affine scheduling problem. I: One- dimensional time
- Some efficient solutions to the affine scheduling problem. II: Multidimensional time
- The Organization of Computations for Uniform Recurrence Equations
- The parallel execution of DO loops
- The quickhull algorithm for convex hulls
Cited in
(24)- Loop parallelization algorithms: From parallelism extraction to code generation
- Maximizing parallelism and minimizing synchronization with affine partitions
- Automating non-unimodular loop transformations for massive parallelism
- Unimodular transformations of non-perfectly nested loops
- Plugging anti and output dependence removal techniques into loop parallelization algorithm
- Loop skewing: the wavefront method revisited
- Beyond unimodular transformations
- Mapping of affine loop nests onto independent processors
- Obtaining affine transformations to improve locality of loop nests
- Volume driven selection of loop and data transformations for cache-coherent parallel processors
- EFFECTIVE PARALLELIZATION TECHNIQUES FOR LOOP NESTS WITH NON-UNIFORM DEPENDENCES
- On parallelization of UET/UET-UCT loops
- Coordinate transformations of multidimensional loops
- Program parallelization using synchronized pipelining
- Eigenvectors-based parallelisation of nested loops with affine dependences
- scientific article; zbMATH DE number 1946645 (Why is no real title available?)
- scientific article; zbMATH DE number 2079651 (Why is no real title available?)
- scientific article; zbMATH DE number 1460534 (Why is no real title available?)
- Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs
- Languages and Compilers for Parallel Computing
- Fine-grain parallelization of imperfectly nested loops
- Distributing and parallelizing non-canonical loops
- Synthesizing transformations for locality enhancement of imperfectly-nested loop nests
- Parallel execution of program loops
This page was built for publication: On loop transformations of nested loops with affine dependencies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5950531)
