GRAPHITE: Polyhedral analyses and optimizations for GCC

Proceedings of the GCC Developers' Summit 2006

Volumn , Issue , 2006, Pages 179-197

  Pop, Sebastian ^a   Cohen, Albert ^b   Bastoul, Cédric ^b   Girbal, Sylvain ^b   Silber, Georges André ^a   Vasilache, Nicolas ^b  

^a PSL RESEARCH UNIVERSITY   (France)

^b INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACT DOMAINS; ANALYSIS APPROACH; APPROXIMATED SOLUTIONS; COMPILE TIME; HIGH LEVEL LOOP TRANSFORMATION; INTERMEDIATE REPRESENTATIONS; LOOP FUSION; LOOP NESTS; LOOP OPTIMIZATIONS; POLYHEDRAL ANALYSIS; POLYHEDRAL REPRESENTATION; STRIP MINING; TRADE OFF;

ABSTRACTING; GEOMETRY; GRAPHITE; MINING ENGINEERING; OPTIMIZATION; STATIC ANALYSIS;

PROGRAM COMPILERS;

EID: 84871295761     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (72)

1. F. Agakov, E. Bonilla, J. Cavazos, B. Franke, G. Fursin, M. O'Boyle, J. Thomson, M. Toussaint, and C. Williams. Using machine learning to focus iterative optimization. In 4th Annual International Symposium on Code Generation and Optimization (CGO), Mar. 2006.
2. N. Ahmed, N. Mateev, and K. Pingali. Synthesizing transformations for locality enhancement of imperfectly-nested loop nests. In ACM Supercomputing'00, May 2000.
3. R. J. Allen and K. Kennedy. Automatic translation of FORTRAN programs to vector form. ACM Transactions on Programming Languages and Systems, 9(4):491-542, october 1987.
4. R. J. Allen and K. Kennedy. Optimizing Compilers for Modern Architectures. Morgan and Kaufman, 2002.
5. C. Ancourt and F. Irigoin. Scanning polyhedra with DO loop. In ACM Symp. on Principles and Practice of Parallel Programming (PPoPP'91), pages 39-50, June 1991.
6. Apron: Numerical program analysis. http://www.cri.ensmp.fr/apron/.
7. R. Bagnara, E. Ricci, E. Zaffanella, and P. M. Hill. Possibly not closed convex polyhedra and the parma polyhedra library. In M. V. Hermenegildo and G. Puebla, editors, Static Analysis: Proceedings of the 9th International Symposium, LNCS 2477, pages 213-229, 2002.
8. U. Banerjee. Data dependence in ordinary programs. Master's thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign, November 1976.
9. U. Banerjee. Dependence Analysis for Supercomputing. Kluwer Academic Publishers, Boston, 1988.
10. D. Barthou. Array Dataflow Analysis in Presence of Non-affine Constraints. PhD thesis, Université de Versailles, France, Feb. 1998. http://www.prism.uvsq.fr/~bad/these.html.
11. D. Barthou, A. Cohen, and J.-F. Collard. Maximal static expansion. Int. J. of Parallel Programming, 28(3):213-243, June 2000.
12. D. Barthou, J.-F. Collard, and P. Feautrier. Fuzzy array dataflow analysis. J. of Parallel and Distributed Computing, 40:210-226, 1997.
13. C. Bastoul. Code generation in the polyhedral model is easier than you think. In Parallel Architectures and Compilation Techniques (PACT'04), Antibes, France, Sept. 2004.
14. C. Bastoul and P. Feautrier. Improving data locality by chunking. In CC'12 International Conference on Compiler Construction, LNCS 2622, pages 320-335, Warsaw, april 2003.
15. D. Berlin, D. Edelsohn, and S. Pop. High-level loop optimizations for GCC. In Proceedings of the 2004 GCC Developers Summit, pages 37-54, 2004. http://www.gccsummit.org/2004.
16. F. Bodin, T. Kisuki, P. Knijnenburg, M. O'Boyle, and E. Rohou. Iterative compilation in a non-linear optimisation space. In Proc. Workshop on Profile and Feedback Directed Compilation, 1998.
17. F. Chow. Maximizing application performance through interprocedural optimization with the pathscale eko compiler suite. http://www.pathscale.com/ whitepapers.html, Aug. 2004.
18. P. Clauss and V. Loechner. Parametric Analysis of Polyhedral Iteration Spaces. In IEEE Int. Conf. on Application Specific Array Processors, ASAP'96. IEEE Computer Society, August 1996.
19. A. Cohen. Program Analysis and Transformation: from the Polytope Model to Formal Languages. PhD thesis, Université de Versailles, France, Dec. 1999.
20. A. Cohen, S. Girbal, and O. Temam. A polyhedral approach to ease the composition of program transformations. In Euro-Par'04, number 3149 in LNCS, pages 292-303, Pisa, Italy, Aug. 2004. Springer-Verlag.
21. J.-F. Collard. Automatic parallelization of while-loops using speculative execution. Int. J. of Parallel Programming, 23(2):191-219, Apr. 1995.
22. J.-F. Collard. Reasoning About Program Transformations. Springer-Verlag, 2002.
23. K. D. Cooper, D. Subramanian, and L. Torczon. Adaptive optimizing compilers for the 21st century. J. of Supercomputing, 2002.
24. thACM Symp. on Principles of Programming Languages, pages 84-96, Jan. 1978.
25. B. Creusillet. Array Region Analyses and Applications. PhD thesis, École Nationale Supérieure des Mines de Paris (ENSMP), Paris, France, Dec. 1996.
26. B. Creusillet and F. Irigoin. Interprocedural array region analyses. Int. J. of Parallel Programming, 24(6):513-546, Dec. 1996.
27. A. Darte and Y. Robert. Mapping uniform loop nests onto distributed memory architectures. Parallel Computing, 20(5):679-710, 1994.
28. C. Eisenbeis and J.-C. Sogno. A general algorithm for data dependence analysis. In ICS '92: Proceedings of the 6th international conference on Supercomputing, pages 292-302, Washington, D. C., United States, 1992. ACM Press.
29. P. Feautrier. Parametric integer programming. RAIRO Recherche Opérationnelle, 22:243-268, Sept. 1988.
30. P. Feautrier. Dataflow analysis of scalar and array references. Int. J. of Parallel Programming, 20(1):23-53, Feb. 1991.
31. P. Feautrier. Some efficient solutions to the affine scheduling problem, part II, multidimensional time. Int. J. of Parallel Programming, 21(6):389-420, Dec. 1992. See also Part I, one dimensional time, 21(5):315-348.
32. thWorkshop on Languages and Compilers for Parallel Computing, LNCS, Washington DC, July 2002. Springer-Verlag.
33. S. Ghosh, M. Martonosi, and S. Malik. Cache miss equations: a compiler framework for analyzing and tuning memory behavior. ACM Transactions on Programming Languages and Systems, 21(4):703-746, 1999.
34. S. Girbal, N. Vasilache, C. Bastoul, A. Cohen, D. Parello, M. Sigler, and O. Temam. Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies. Int. J. of Parallel Programming, 2006. 57 pages. Accepted for publication.
35. G. Goff, K. Kennedy, and C. Tseng. Practical dependence testing. In Proceedings of the ACM SIGPLAN'91 Conference on Programming Language Design and Implementation, pages 15-29, New York, june 1991.
36. M. Griebl. Automatic parallelization of loop programs for distributed memory architectures. Habilitation thesis. Facultät für Mathematik und Informatik, Universität Passau, 2004.
37. M. Griebl and J.-F. Collard. Generation of synchronous code for automatic parallelization of while loops. In S. Haridi, K. Ali, and P. Magnusson, editors, EuroPar'95, volume 966 of LNCS, pages 315-326. Springer-Verlag, 1995.
38. ndIntl. Workshop on Compilers for Parallel Computers, pages 199-212, Paris, Dec. 1990.
39. F. Irigoin, P. Jouvelot, and R. Triolet. Semantical interprocedural parallelization: An overview of the pips project. In ACM Int. Conf. on Supercomputing (ICS'91), Cologne, Germany, June 1991.
40. F. Irigoin and R. Triolet. Computing dependence direction vectors and dependence cones with linear systems. Technical Report ENSMP-CAI-87-E94, Ecole des Mines de Paris, Fontainebleau (France), 1987.
41. W. Kelly. Optimization within a unified transformation framework. Technical Report CS-TR-3725, University of Maryland, 1996.
42. W. Kelly, W. Pugh, and E. Rosser. Code generation for multiple mappings. In Frontiers'95 Symposium on the frontiers of massively parallel computation, McLean, 1995.
43. X. Kong, D. Klappholz, and K. Psarris. The i test: A new test for subscript data dependence. In ICPP'90 International Conference on Parallel Processing, pages 204-211, St. Charles, august 1990.
44. L. Lamport. The parallel execution of do loops. Communications of ACM, 17(2):83-93, 1974.
45. W. Li and K. Pingali. A singular loop transformation framework based on non-singular matrices. International Journal of Parallel Programming, 22(2):183-205, Apr. 1994.
46. thACM Symp. on Principles of Programming Languages, pages 201-214, Paris, France, jan 1997.
47. A. W. Lim, S.-W. Liao, and M. S. Lam. Blocking and array contraction across arbitrarily nested loops using affine partitioning. In ACM Symp. on Principles and Practice of Parallel Programming (PPoPP'01), pages 102-112, 2001.
48. V. Loechner, B. Meister, and P. Clauss. Precise data locality optimization of nested loops. J. of Supercomputing, 21(1):37-76, Jan. 2002.
49. D. E. Maydan, J. L. Hennessy, and M. S. Lam. Efficient and exact data dependence analysis. In PLDI '91: Proceedings of the ACM SIGPLAN 1991 conference on Programming language design and implementation, pages 1-14, New York, NY, USA, 1991.
50. A. Miné. The octagon abstract domain. In AST 2001 in WCRE 2001, IEEE, pages 310-319. IEEE CS Press, October 2001.
51. A. Miné. The octagon abstract domain. Higher-Order and Symbolic Computation, 2006. (to appear) http://www.di.ens.fr/~mine/publi/article-mine- HOSC06.pdf.
52. D. Novillo. A propagation engine for gcc. In Proceedings of the 2005 GCC Developers Summit, pages 175-184, 2005. http://www.gccsummit.org/2005.
53. D. Parello, O. Temam, A. Cohen, and J.-M. Verdun. Towards a systematic, pragmatic and architecture-aware program optimization process for complex processors. In ACM Supercomputing'04, Pittsburgh, Pennsylvania, Nov. 2004. 15 pages.
54. G.-R. Perrin and A. Darte, editors. The Data Parallel Programming Model. Number 1132 in LNCS. Springer-Verlag, 1996.
55. W. Pugh. The omega test: a fast and practical integer programming algorithm for dependence analysis. In Proceedings of the third ACM/IEEE conference on Supercomputing, pages 4-13, Albuquerque, Aug. 1991.
56. W. Pugh. The omega test: a fast and practical integer programming algorithm for dependence analysis. In Supercomputing, pages 4-13, 1991.
57. W. Pugh. Uniform techniques for loop optimization. In ACM Int. Conf. on Supercomputing (ICS'91), pages 341-352, Cologne, Germany, June 1991.
58. W. Pugh. Counting solutions to presburger formulas: How and why. In SIGPLAN Conference on Programming Language Design and Implementation, pages 121-134, 1994.
59. F. Quilleré, S. Rajopadhye, and D. Wilde. Generation of efficient nested loops from polyhedra. Intl. J. of Parallel Programming, 28(5):469-498, Oct. 2000.
60. L. Rauchwerger and D. Padua. The LRPD test: Speculative run-time parallelization of loops with privatization and reduction parallelization. IEEE Transactions on Parallel and Distributed Systems, Special Issue on Compilers and Languages for Parallel and Distributed Computers, 10(2):160-180, 1999.
61. A. Schrijver. Theory of Linear and Integer Programming. John Wiley and Sons, Chichester, UK, 1986.
62. stEuropean Symp. on Programming (ESOP'86), number 213 in LNCS, pages 210-222. Springer-Verlag, Mar. 1986.
63. thWorkshop on Languages and Compilers for Parallel Computing, number 768 in LNCS, pages 500-521, Portland, Oregon, Aug. 1993.
64. N. Vasilache, C. Bastoul, and A. Cohen. Polyhedral code generation in the real world. In Proceedings of the International Conference on Compiler Construction (ETAPS CC'06), LNCS, pages 185-201, Vienna, Austria, Mar. 2006. Springer-Verlag.
65. S. Verdoolaege, K. Woods, M. Bruynooghe, and R. Cools. Computation and manipulation of enumerators of integer projections of parametric polytopes. Technical Report CW 392, Katholieke Universiteit Leuven, Dept. of Computer Science, 2005. http://www.kotnet.org/~skimo/barvinok/.
66. H. L. Verge. A note on Chernikova's algorithm. Technical Report 635, IRISA, 1992.
67. F. Vivien. Détection de parallélisme dans les boucles imbriquées. PhD thesis, ENS - Lyon, 1997.
68. M. E. Wolf. Improving Locality and Parallelism in Nested Loops. PhD thesis, Stanford University, Aug. 1992. Published as CSL-TR-92-538.
69. M. Wolfe and U. Banerjee. Data dependence and its application to parallel processing. International Journal of Parallel Programming, 16(2):137-178, 1987.
70. M. Wolfe and C. W. Tseng. The power test for data dependence. IEEE Transactions on Parallel and Distributed Systems, 3(5):591-601, 1992.
71. M. J. Wolfe. High Performance Compilers for Parallel Computing. Addison-Wesley, 1996.
72. D. G. Wonnacott. Constraint-Based Array Dependence Analysis. PhD thesis, University of Maryland, 1995.