A practical automatic polyhedral parallelizer and locality optimizer

ACM SIGPLAN Notices

Volumn 43, Issue 6, 2008, Pages 101-113

  Bondhugula, Uday ^a   Hartono, Albert ^a   Ramanujam, J ^b   Sadayappan, P ^a  

^a The Ohio State University   (United States)

^b Louisiana State University   (United States)

Author keywords

Affine transformations; Automatic parallelization; Locality optimization; Loop transformations; Polyhedral model; Tiling

Indexed keywords

APPLICATION PROGRAMMING INTERFACES (API); INTEGER PROGRAMMING; LINEAR PROGRAMMING; LINEAR TRANSFORMATIONS; MATHEMATICAL TRANSFORMATIONS; PROGRAM COMPILERS;

AFFINE TRANSFORMATIONS; AUTOMATIC PARALLELIZATION; LOCALITY OPTIMIZATION; LOOP TRANSFORMATION; POLYHEDRAL MODELING; TILING;

C (PROGRAMMING LANGUAGE);

EID: 67650079888     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/1379022.1375595     Document Type: Article

References (63)

1. PLuTo: A polyhedral automatic parallelizer and locality optimizer for multicores. http://pluto-compiler.sourceforge.net.
2. N. Ahmed, N. Mateev, and K. Pingali. Synthesizing transformations for locality enhancement of imperfectly-nested loops. Intl. J. of Parallel Programming, 29(5), Oct. 2001.
3. R. Allen and K. Kennedy. Automatic translation of Fortran programs to vector form. ACM Trans. on Programming Languages and Systems, 9(4):491-542, 1987.
4. C. Ancourt and F. Irigoin. Scanning polyhedra with do loops. In ACM SIGPLANPPoPP'91, pages 39-50, 1991.
5. R. Andonov, S. Balev, S. Rajopadhye, and N. Yanev. Optimal semi-oblique tiling. IEEE Trans. Par. & Dist. Sys., 14(9):944-960, 2003.
6. C. Bastoul. Code generation in the polyhedral model is easier than you think. In IEEE PACT, pages 7-16, Sept. 2004.
7. C. Bastoul and P. Feautrier. Improving data locality by chunking. In Intl. Conf. on Compiler Construction (ETAPS CC), pages 320-335, Warsaw, Apr. 2003.
8. U. Bondhugula, M. Baskaran, S. Krishnamoorthy, J. Ramanujam, A. Rountev, and P. Sadayappan. Affine transformations for communication minimal parallelization and locality optimization of arbitrarily-nested loop sequences. Technical Report OSU-CISRC-5/07-TR43, The Ohio State University, May 2007.
9. U. Bondhugula, M. Baskaran, S. Krishnamoorthy, J. Ramanujam, A. Rountev, and P. Sadayappan. Automatic transformations for communication-minimized parallelization and locality optimization in the polyhedral model. In Intl. Conf. on Compiler Construction (ETAPS CC), Apr. 2008.
10. U. Bondhugula, J. Ramanujam, and P. Sadayappan. Pluto: A practical and fully automatic polyhedral parallelizer and locality optimizer. Technical Report OSU-CISRC-10/07-TR70, The Ohio State University, Oct. 2007.
11. P. Boulet, A. Darte, T. Risset, and Y. Robert. (Pen)-ultimate tiling? Integration, the VLSIJournal, 17(1):33-51, 1994.
12. P. Boulet, A. Darte, G.-A. Silber, and F. Vivien. Loop parallelization algorithms: From parallelism extraction to code generation. Parallel Computing, 24(3-4):421-444, 1998.
13. CLooG: The Chunky Loop Generator. http://www.cloog.org.
14. A. Cohen, S. Girbal, D. Parello, M. Sigler, O. Temam, and N. Vasilache. Facilitating the search for compositions of program transformations. In ACM Intl. Conf. on Supercomputing, pages 151-160, June 2005.
15. A. Darte, Y Robert, and F. Vivien. Scheduling and Automatic Parallelization. Birkhauser Boston, 2000.
16. A. Darte, G.-A. Silber, and F. Vivien. Combining retiming and scheduling techniques for loop parallelization and loop tiling. Parallel Processing Letters, 7(4):379-392, 1997.
17. A. Darte and F. Vivien. Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs. Intl. J. Parallel Programming, 25(6):447-496, Dec. 1997.
18. P. Feautrier. Parametric integer programming. RAIRO Recherche Operationnell1é, 22(3):243-268, 1988.
19. P. Feautrier. Dataflow analysis of scalar and array references. Intl. J. of Parallel Programming, 20(1):23-53, Feb. 1991.
20. P. Feautrier. Some efficient solutions to the affine scheduling problem: I. one-dimensional time. Intl. J. of Parallel Programming, 21(5):313-348, 1992.
21. P. Feautrier. Some efficient solutions to the affine scheduling problem, part II. multidimensional time. Intl. J. of Parallel Programming, 21(6):389-420, 1992.
22. S. Girbal, N. Vasilache, C. Bastoul, A. Cohen, D. Parello, M. Sigler, and O. Temam. Semi-automatic composition of loop transformations. Intl. J. of Parallel Programming, 34(3):261-317, June 2006.
23. G. Goumas, M. Athanasaki, and N. Koziris. Code Generation Methods for Tiling Transformations. J. of Information Science and Engineering, 18(5):667-691, Sep. 2002.
24. M. Griebl. Automatic Parallelization of Loop Programs for Distributed Memory Architectures. University of Passau, 2004. Habilitation thesis.
25. M. Griebl, C. Lengauer, and S. Wetzel. Code generation in the polytope model. In IEEE PACT, pages 106-111, 1998.
26. E. Hodzic and W. Shang. On time optimal supernode shape. IEEE Trans. Par. & Dist. Sys., 13(12):1220-1233, 2002.
27. K. Hogstedt, L. Carter, and J. Ferrante. Selecting tile shape for minimal execution time. In SPAA, pages 201-211, 1999.
28. F. Irigoin and R. Triolet. Supernode partitioning. In ACM SIGPLAN PoPL, pages 319-329, 1988.
29. S. Kamil, K. Datta, S. Williams, L. Oliker, J. Shalf, and K. Yellick. Implicit and explicit optimization for stencil computations. In ACM SIGPLAN workshop on Memory Systems Perofmance and Correctness, 2006.
30. W. Kelly and W. Pugh. A unifying framework for iteration reordering transformations. Technical Report CS-TR-3430, Dept. of Computer Science, University of Maryland, College Park, 1995.
31. W. Kelly, W. Pugh, and E. Rosser. Code generation for multiple mappings. In Intl. Symp. on the frontiers of massively parallel computation, pages 332-341, Feb. 1995.
32. D. Kim, L. Renganarayanan, M. Strout, and S. Rajopadhye. Multilevel tiling: 'm' for the price of one. In Supercomputing, 2007.
33. H. LeVerge. A note on chernikova's algorithm. Technical Report Research report 635, IRIS A, Feb. 1992.
34. W. Li and K. Pingali. A singular loop transformation framework based on non-singular matrices. Intl. J. of Parallel Programming, 22(2): 183-205, 1994.
35. A. Lim, S. Liao, and M. Lam. Blocking and array contraction across arbitrarily nested loops using affine partitioning. In ACM SIGPLAN PPoPP, pages 103-112, 2001.
36. A. W. Lim, G. I. Cheong, and M. S. Lam. An affine partitioning algorithm to maximize parallelism and minimize communication. In ACM Intl. Conf. on Supercomputing, pages 228-237, 1999.
37. A. W. Lim and M. S. Lam. Maximizing parallelism and minimizing synchronization with affine partitions. Parallel Computing, 24(3-4):445-475, 1998.
38. The LooPo Project - Loop parallelization in the polytope model. http://www.fmi.uni-passau.de/loopo.
39. B. Norris, A. Hartono, and W. Gropp. Annotations for performance and productivity. 2007. Preprint ANL/MCS-P1392-0107.
40. R. Penrose. A generalized inverse for matrices. Proceedings of the Cambridge Philosophical Society, 51:406-413, 1955.
41. PIP: The Parametric Integer Programming Library. http://www.piplib.org.
42. PolyLib - A library of polyhedral functions. http://icps.u-strasbg.fr/ polylib/.
43. S. Pop, A. Cohen, C. Bastoul, S. Girbal, P. Jouvelot, G.-A. Silber, and N. Vasilache. GRAPHITE: Loop optimizations based on the polyhedral model for GCC. In Proc. of the 4th GCC Developper's summit, Ottawa, Canada, June 2006.
44. L.-N. Pouchet, C. Bastoul, J. Cavazos, and A. Cohen. Iterative optimization in the polyhedral model: Part II, multidimensional time. In PLDI'08, Tucson, Arizona, June 2008.
45. L.-N. Pouchet, C. Bastoul, A. Cohen, and N. Vasilache. Iterative optimization in the polyhedral model: Part I, one-dimensional time. In ACM CGO, Mar. 2007.
46. W. Pugh. The omega test: a fast and practical integer programming algorithm for dependence analysis. Communications of the ACM, 8:102-114, Aug. 1992.
47. F. Quillere, S. V Rajopadhye, and D. Wilde. Generation of efficient nested loops from polyhedra. Intl. J. of Parallel Programming, 28(5):469-498, 2000.
48. J. Ramanujam and P. Sadayappan. Tiling multidimensional iteration spaces for multicomputers. JPDC, 16(2): 108-230, 1992.
49. L. Renganarayana, D. Kim, S. Rajopadhye, and M. M. Strout. Parameterized tiled loops for free. In PLDI, pages 405-414, 2007.
50. R. Schreiber and J. Dongarra. Automatic blocking of nested loops. Technical report, University of Tennessee, Knoxville, TN, Aug. 1990.
51. A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, 1986.
52. Y. Song and Z. Li. New tiling techniques to improve cache temporal locality. In PLDI, pages 215-228, 1999.
53. N. Vasilache. Scalable Program Optimization Techniques in the Polyhedral Model. PhD thesis, Universite de Paris-Sud, INRIA, Futurs, Sept. 2007.
54. N. Vasilache, C. Bastoul, and A. Cohen. Polyhedral code generation in the real world. In Intl. Conf. on Compiler Construction (ETAPS CC), pages 185-201, Mar. 2006.
55. N. Vasilache, C. Bastoul, S. Girbal, and A. Cohen. Violated dependence analysis. In ACM ICS, June 2006.
56. R. Whaley, A. Petitet, and J. Dongarra. Automated Empirical Optimizations of Software and the ATLAS Project. Parallel Computing, 2000.
57. D. K. Wilde. A library for doing polyhedral operations. Technical Report RR-2157, IRIS A, 1993.
58. M. Wolf and M. S. Lam. A data locality optimizing algorithm. In ACM SIGPLAN PLDI '91, pages 30-44, 1991.
59. M. Wolf and M. S. Lam. A loop transformation theory and an algorithm to maximize parallelism. IEEE Trans. Parallel Distrib. Syst., 2(4):452-471, 1991.
60. J. Xue. Communication-minimal tiling of uniform dependence loops. JPDC, 42(1):42-59, 1997.
61. J. Xue. Loop tiling for parallelism. Kluwer Academic Publishers, Norwell, MA, USA, 2000.
62. Q. Yi, K. Kennedy, and V Adve. Transforming complex loop nests for locality. J. of Supercomputing, 27(3):219-264, 2004.
63. K. Yotov, X. Li, G. Ren, M. Cibulskis, G. DeJong, M. Garzaran, D. A. Padua, K. Pingali, P. Stodghill, and P. Wu. A comparison of empirical and model-driven optimization. In PLDI'03, pages 63-76, 2003.