Iterative optimization in the polyhedral model: Part II, multidimensional time

Proceedings of the ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI)

Volumn , Issue , 2008, Pages 90-100

  Pouchet, Louis Noël ^a   Bastoul, Cédric ^a   Cohen, Albert ^a   Cavazos, John ^b  

^a INRIA SACLAY   (France)

^b University of Delaware

Author keywords

Affine scheduling; Genetic algorithm; Iterative compilation; Loop transformation

Indexed keywords

AFFINE SCHEDULING; APPLICATIONS.; COMMUNICATION RESOURCES; COMPLEX CODES; COMPLEX INTERACTIONS; DEPENDENCE ANALYSIS; DIMENSIONAL SPACES; EXPERIMENTAL EVIDENCES; ITERATIVE COMPILATION; ITERATIVE OPTIMIZATIONS; LOOP NESTS; LOOP OPTIMIZATIONS; LOOP TRANSFORMATION; MEMORY ACCESSES; MODERN ARCHITECTURES; MULTIDIMENSIONAL TIMES; OPTIMIZING COMPILERS; PEAK PERFORMANCES; PERFORMANCE IMPACTS; PERFORMANCE IMPROVEMENTS; POLYHEDRAL MODELS; POLYHEDRAL REPRESENTATIONS; PROGRAM DEPENDENCES; PROGRAM TRANSFORMATIONS; SEARCH SPACES; SIMPLISTIC PERFORMANCES; STATIC CONTROLS; TARGET ARCHITECTURES; TRANSFORMATION SEQUENCES;

BENCHMARKING; C (PROGRAMMING LANGUAGE); CODES (SYMBOLS); COMPUTER SOFTWARE; COMPUTERS; DATA STORAGE EQUIPMENT; GENETIC ALGORITHMS; HEURISTIC METHODS; LINGUISTICS; MATHEMATICAL TRANSFORMATIONS; OPTIMIZATION; PROGRAM COMPILERS;

COMPUTER PROGRAMMING LANGUAGES;

EID: 57349167317     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1375581.1375594     Document Type: Conference Paper

References (47)

1. F. Agakov, E. Bonilla, J. Cavazos, B. Franke, G. Fursin, M. F. P. O'Boyle, J. Thomson, M. Toussaint, and C. K. I. Williams. Using machine learning to focus iterative optimization. In IEEE/ACM Intl. Symp. on Code Generation and Optimization (CGO'06), pages 295-305, Washington, DC, USA, 2006. IEEE Computer Society.
2. N. Ahmed, N. Mateev, and K. Pingali. Tiling imperfectly-nested loop nests. In ACM/IEEE Conf. on Supercomputing (SC'00), Dallas, TX, USA, Nov. 2000.
3. J. Allen and K. Kennedy. Optimizing Compilers for Modern Architectures. Morgan Kaufmann Publishers, 2002.
4. D. Barthou, J.-F. Collard, and P. Feautrier. Fuzzy array dataflow analysis. J. of Parallel and Distributed Computing. 40: 210-226, 1997.
5. C. Bastoul. Code generation in the polyhedral model is easier than you think. In IEEE Intl. Conf. on Parallel Architectures and Compilation Techniques (PACT'04), pages 7-16, Juan-les-Pins, France, Sept. 2004.
6. C. Bastoul and P. Feautrier. Improving data locality by chunking. In Intl. Conf. on Compiler Construction (ETAPS CC 12), volume 2622, pages 320-335, Warsaw, Poland, Apr. 2003.
7. A. Bernstein. Analysis of programs for parallel processing. IEEE Trans, on Electronic Computers, 15(5): 757-763, Oct. 1966.
8. F. Bodin, T. Kisuki, P. M. W. Knijnenburg, M. F. P. O'Boyle, and E. Rohou. Iterative compilation in a non-linear optimisation space. In W. on Profile and Feedback Directed Compilation, Paris, Oct. 1998.
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 17), Budapest, Hungary, Apr. 2008.
10. U. Bondhugula, A. Hartono, J. Rarnanujam, and P. Sadayappan. A practical automatic polyhedral parallelization and locality optimization system. In ACM SIGPLAN Conf. on Programming Languages Design and Implementation (PLDI'08), Tucson, AZ, USA, June 2008.
11. K. D. Cooper, A. Grosul, T. J. Harvey, S. Reeves, D. Subramanian, L. Torczon, and T. Waterman. ACME: adaptive compilation made efficient. In ACM SIGLPAN/SIGBED Conf. on Languages, Compilers, and Tools for Embedded Systems (LCTES'05), pages 69-77, Chicago, IL, USA, 2005. ACM Press.
12. K. D. Cooper, P. J. Schielke, and D. Subramanian. Optimizing for reduced code space using genetic algorithms. In Workshop on Languages, Compilers, and Tools for Embedded Systems, pages 1-9, Atlanta, GA, USA, July 1999. ACM Press.
13. K. D. Cooper, D. Subramanian, and L. Torczon. Adaptive optimizing compilers for the 21st century. J. Supercomputing, 23(1): 7-22, 2002.
14. A. Darte, Y. Robert, and F. Vivien. Scheduling and Automatic Parallelization. Birkhauser, 2000.
15. P. Feautrier. Parametric integer programming. RAIRO Recherche Opérationnelle, 22(3): 243-268, 1988.
16. P. Feautrier. Some efficient solutions to the affine scheduling problem, part I: one dimensional time. Intl. J. of Parallel Programming, 21(5): 313-348, Oct. 1992.
17. P. Feautrier. Some efficient solutions to the affine scheduling problem, part II: multidimensional time. Intl. J. of Parallel Programming, 21(6): 389-420, Dec. 1992.
18. 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. Intl. J. of Parallel Programming, 34(3), 2006.
19. D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison-Wesley Longman Publishing Co. Inc., Boston, MA, USA, 1989.
20. M. Haneda, P. M. W. Knijnenburg, and H. A. G. Wijshoff. Automatic selection of compiler options using non-parametric inferential statistics. In IEEE Intl. Conf. on Parallel Architectures and Compilation Techniques (PACT'05), pages 123-132, Saint Louis, MO, USA, 2005. IEEE Computer Society.
21. W. Kelly. Optimization within a Unified Transformation Framework. PhD thesis, Univ. of Maryland, 1996.
22. 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, McLean, VA, USA, Feb. 1995.
23. T. Kisuki, P. M. W. Knijnenburg, and M. E P. O'Boyle. Combined selection of tile sizes and unroll factors using iterative compilation. In IEEE Intl. Conf. on Parallel Architectures and Compilation Techniques (PACT'00), pages 237-246, Philadelphia, PA, USA, 2000. IEEE Computer Society.
24. P. A. Kulkarni, S. R. Hines, D. B. Whalley, J. D. Hiser, J. W. Davidson, and D. L. Jones. Fast and efficient searches for effective optimization-phase sequences. ACM Trans, on Architecture and Code Optimization, 2(2): 165-198, 2005.
25. M. Le Fur. Scanning parameterized polyhedron using Fourier-Motzkin elimination. Concurrency - Practice and Experience, 8(6): 445-460, 1996.
26. C. Lee. UTDSP benchmark suite, 1998. http://www.eecg.toronto.edu/ ̃corinna/DSP.
27. A. W. Lim and M. S. Lam. Maximizing parallelism and minimizing synchronization with affine transforms. In ACM Symp. on Principles of Programming Languages (PoPL'97), pages 201-214, Paris, France, 1997. ACM Press.
28. S. Long and G. Fursin. Systematic search within an optimisation space based on unified transformation framework. IJCSE Intl. J. of Computational Science and Engineering, 2006.
29. S. Long and M. O'Boyle. Adaptive Java optimisation using instance-based learning. In ACM Intl. Conf. on Supercomputing (ICS '04), pages 237-246, Saint-Malo, France, June 2004.
30. A. Nisbet. GAPS: A compiler framework for genetic algorithm (GA) optimised parallelisation. In HPCN Europe 1998: Proc. of the Intl. Conf. and Exhibition on High-Performance Computing and Networking, pages 987-989, London, UK, 1998. Springer-Verlag.
31. M. Palkovič. Enhanced Applicability of Loop Transformations. PhD thesis, T. U. Eindhoven, The Netherlands, Sept. 2007.
32. 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.
33. L.-N. Pouchet, C. Bastoul, J. Cavazos, and A. Cohen. A note on the performance distribution of affine schedules. 2nd Workshop on Statistical and Machine learning approaches to ARchitectures and compila Tion (SMART08), Goteborg, Sweden, Jan. 2008.
34. L.-N. Pouchet, C. Bastoul, A. Cohen, and N. Vasilache. Iterative optimization in the polyhedral model: Part I, one-dimensional time. In IEEE/ACM Intl. Symp. on Code Generation and Optimization (CGO'07), pages 144-156, San Jose, CA, USA, Mar. 2007.
35. W. Pugh. The Omega test: a fast and practical integer programming algorithm for dependence analysis. In ACM Intl. Conf. on Supercomputing (ICS'91), pages 4-13, Albuquerque, NM, USA, Aug. 1991.
36. M. Püschel, B. Singer, J. Xiong, J. Moura, J. Johnson, D. Padua, M. Veloso, and R. W. Johnson. SPIRAL: A generator for platform-adapted libraries of signal processing algorithms. J. of High Performance Computing and Applications, special issue on Automatic Performance Tuning, 18(1): 21-45, 2004.
37. 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.
38. L. Renganarayanan, D. Kim, S. Rajopadhye, and M. M. Strout. Parameterized tiled loops for free. SIGPLAN Notices, Proc. of the 2007 PLDI Conf., 42(6): 405-414, 2007.
39. A. Schrijver. Theory of Linear and Integer Programming. John Wiley & Sons, 1986.
40. M. Stephenson, S. Amarasinghe, M. Martin, and U.-M. O'Reilly. Meta optimization: improving compiler heuristics with machine learning. SIGPLAN Notices, 38(5): 77-90, 2003.
41. S. Triantafyllis, M. Vachharajani, and D. I. August. Compiler optimization-space exploration. In J. of Instruction-level Parallelism, volume 7, Jan. 2005.
42. N. Vasilache, C. Bastoul, and A. Cohen. Polyhedral code generation in the real world. In Proc. of the Intl. Conf. on Compiler Construction (ETAPS CC 16), volume 3923, pages 185-201, Vienna, Austria, Mar. 2006. Springer-Verlag.
43. N. Vasilache, A. Cohen, and L.-N. Pouchet. Automatic correction of loop transformations. In IEEE Intl. Conf. on Parallel Architectures and Compilation Techniques (PACT'07), pages 292-302, Brasov, Romania, Sept. 2007.
44. F. Vivien. On the optimality of Feautrier's scheduling algorithm. In Intl. Euro-Par Conf. on Parallel Processing (EURO-PAR'02), pages 299-308, London, UK, 2002. Springer-Verlag.
45. D. K. Wilde. A library for doing polyhedral operations. Technical Report 785, IRISA, Rennes, France, 1993.
46. M. Wolfe. High performance compilers for parallel computing. Addison-Wesley Publishing Company, 1995.
47. J. Xue. Transformations of nested loops with non-convex iteration spaces. Parallel Computing, 22(3): 339-368, 1996.