Generation of parallel synchronization-free tiled code
- 20 October 2017
- journal article
- research article
- Published by Springer Nature in Computing
- Vol. 100 (3) , 277-302
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Using basis dependence distance vectors in the modified Floyd–Warshall algorithmJournal of Combinatorial Optimization, 2014
- Free scheduling for statement instances of parameterized arbitrarily nested affine loopsParallel Computing, 2012
- Coarse-grained loop parallelization: Iteration Space Slicing vs affine transformationsParallel Computing, 2011
- Transitive Closures of Affine Integer Tuple Relations and Their Overapproximations2011
- isl: An Integer Set Library for the Polyhedral Model2010
- A practical automatic polyhedral parallelizer and locality optimizerACM SIGPLAN Notices, 2008
- Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model2008
- Some efficient solutions to the affine scheduling problem. Part II. Multidimensional timeInternational Journal of Parallel Programming, 1992
- Some efficient solutions to the affine scheduling problem. I. One-dimensional timeInternational Journal of Parallel Programming, 1992
- Tiling multidimensional iteration spaces for multicomputersJournal of Parallel and Distributed Computing, 1992