Free Scheduling of Tiles Based on the Transitive Closure of Dependence Graphs
- 2 April 2016
- book chapter
- Published by Springer Nature
- p. 133-142
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- 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
- The Polyhedral Model Is More Widely Applicable Than You Think2010
- A practical automatic polyhedral parallelizer and locality optimizerACM SIGPLAN Notices, 2008
- Scheduling and Automatic Parallelization2000
- An affine partitioning algorithm to maximize parallelism and minimize communication1999
- Iteration space slicing and its application to communication optimization1997
- Transitive Closure of Infinite Graphs and Its ApplicationsInternational Journal of Parallel Programming, 1996
- LINEAR SCHEDULING IS NEARLY OPTIMALParallel Processing Letters, 1991
- Supernode partitioning1988