1. Automatic parallelization of loop programs for distributed memory architectures;Griebl,2004
2. Supernode partitioning;Irigoin,1988
3. R.T. Mullapudi, U. Bondhugula, Tiling for Dynamic Scheduling, in: S. Rajopadhye, S. Verdoolaege (Eds.), Proceedings of the 4th International Workshop on Polyhedral Compilation Techniques, Vienna, Austria, 2014.
4. D. Wonnacott, T. Jin, A. Lake, Automatic tiling of “mostly-tileable” loop nests, in: IMPACT 2015: 5th International Workshop on Polyhedral Compilation Techniques, Amsterdam, The Netherlands, 2015.
5. Transitive closure of infinite graphs and its applications;Kelly;Int. J. Parallel Program.,1996