The Community for Technology Leaders
2015 International Conference on Parallel Architecture and Compilation (PACT) (2015)
San Francisco, CA, USA
Oct. 18, 2015 to Oct. 21, 2015
ISSN: 1089-795X
ISBN: 978-1-4673-9524-3
pp: 480-481
ABSTRACT
The Polyhedral model is a mathematical framework for programs with affine control loops that enables complex pro-gram transformations such as loop permutation and loop tiling to achieve parallelism, data locality and energy efficiency.Polyhedral schedules are widely used by popular polyhedral compilers such as AlphaZ[5] and PLuTo[2][3] to represent program execution orders. They use barriers to enforce the correct order of execution and usually synchronizations happen more than necessarily.Current research([4, 1]) reveals the merit of combining the classical polyhedral schedules and partially ordered schedules manually written by hands with highly target dependent point-wise synchronization mechanisms. However, derivation of a hybrid schedule is tedious and error-prone due to the possibility of deadlocks. Its deviation from any existing standard representation makes program verication the sole responsibility of the programmer.We propose techniques to automate the derivation, verification and code-generation of hybrid schedules. We also demonstrate the convenience and utility of such techniques in resolving the complications associated with current hybrid schedules.
INDEX TERMS
Schedules, Mathematical model, Parallel processing, Standards, Optimization, Graphics processing units, Parallel architectures
CITATION
Tian Jin, "Using Hybrid Schedules to Safely Outperform Classical Polyhedral Schedules", 2015 International Conference on Parallel Architecture and Compilation (PACT), vol. 00, no. , pp. 480-481, 2015, doi:10.1109/PACT.2015.52
91 ms
(Ver 3.3 (11022016))