Affine Parallelization of Loops with Run-Time Dependent Bounds from Binaries
Abstract elided by the publisher.
Related papers
- A polyhedral compilation framework for loops with dynamic data-dependent bounds CC 2018
- Lazy Array Data-Flow Dependence Analysis POPL 1994
- Compiler-assisted dynamic scheduling for effective parallelization of loop nests on multicore processors PPoPP 2009
- Maximizing Parallelism and Minimizing Synchronization with Affine Transforms POPL 1997
- Lazy binary-splitting: a run-time adaptive work-stealing scheduler PPoPP 2010
- Constraint-Based Array Dependence Analysis TOPLAS 1998
- The Pluto+ Algorithm: A Practical Approach for Parallelization and Locality Optimization of Affine Loop Nests TOPLAS 2016
- The LRPD Test: Speculative Run-Time Parallelization of Loops with Privatization and Reduction Parallelization PLDI 1995