[1]GIRBAL S, VASILACHE N BASTOUL C, et al. Semiautomatic composition of loop transformations for deep parallelism and memory hierarchies[J]. International Journal of Parallel Programming, 2006,34(3):261317.
[2]SIMBüRGER A, APEL S, GRLINGER A, et al. The potential of polyhedral optimization[C]//Automated Software Engineering (ASE), IEEE International Conference. New York: IEEE, 2013:1115.
[3]ALNAELI S M, ALALI A, MALETIC J I. Empirically examining the parallelizability of open source software systems[C]//Reverse Engineering, 2012 19th Working Conference. New York: IEEE, 2012:377386.
[4]TRIFUNOVIC K, COHEN A. Enabling more optimizations in GRAPHITE: ignoring memorybased dependences[C]// Proceddings of the 8th GCC Developper’s Summit. Ottawa, Canada: GNU: 2010:129142.
[5]BAGHDADI R, COHEN A, VERDOOLAEGE S, et al. Improved loop tiling based on the removal of spurious false dependences[J]. ACM Transactions on Architecture and Code Optimization, 2013,9(4):5253.
[6]VASILACHE N, MEISTER B, HARTONO A, et al. Trading off memory for parallelism quality[C]// International Workshop on Polyhedral Compilation Techniques. Paris, France: IMPACT, ACM TACO: 2012.
[7]MIDKIFF S P. Automatic parallelization: an overview of fundamental compiler techniques[J]. Synthesis Lectures on Computer Architecture, 2012,7(1):1169.
[8]POP S, COHEN A, BASTOUl C, et al. GRAPHITE: Polyhedral analyses and optimizations for GCC[C]//Proceedings of the 2006 GCC Developers Summit, Ottawa, Canada: GNU, 2006:179197.
[9]VERDOOLAEGE S. isl: An integer set library for the polyhedral model[C]//ICMS’10 Proceedings of the Third International Congress Conference on Mathematical Software Berlin, |