The polyhedral model is more widely applicable than you think

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 6011 LNCS, Issue , 2010, Pages 283-303

  Benabderrahmane, Mohamed Walid ^a   Pouchet, Louis Noël ^a   Cohen, Albert ^a   Bastoul, Cédric ^a  

^a INRIA SACLAY   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGEBRAIC REPRESENTATIONS; AUTOMATIC OPTIMIZATION; CODE GENERATION; COMPLEX SEQUENCES; CONTROL-FLOW; EXPERIMENTAL EVIDENCE; PARALLELIZATIONS; PERFORMANCE IMPROVEMENTS; POLYHEDRAL MODELS; PROGRAM ANALYSIS; PROGRAM OPTIMIZATION;

ALGEBRA; COMPUTER SOFTWARE; NETWORK COMPONENTS; STRUCTURED PROGRAMMING;

PROGRAM COMPILERS;

EID: 77951599594     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-11970-5_16     Document Type: Conference Paper

References (37)

1. Allen, J., Kennedy, K.: Optimizing Compilers for Modern Architectures. Morgan Kaufmann Publishers, San Francisco (2002)
2. Banerjee, U.: Data dependence in ordinary programs. Master's thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign (November 1976)
3. Barthou, D., Cohen, A., Collard, J.-F.: Maximal static expansion. In: ACM Symp. on Principles of Programming Languages (POPL 1998), San Diego, California (1998)
4. Bastoul, C.: Code generation in the polyhedral model is easier than you think. In: IEEE Intl. Conf. on Parallel Architectures and Compilation Techniques (PACT 2004), Juan-les-Pins, September 2004, pp. 7-16 (2004)
5. Bondhugula, U., Hartono, A., Ramanujam, J., Sadayappan, P.: A practical automatic polyhedral parallelizer and locality optimizer. In: Proc. of the 2008 ACM Conf. on Programming language design and implementation (PLDI 2008), Tucson, AZ, USA (June 2008)
6. Boulet, P., Darte, A., Silber, G.-A., Vivien, F.: Loop parallelization algorithms: From parallelism extraction to code generation. Parallel Computing (1998) (Pubitemid 128413646)
7. Carribault, P., Cohen, A., Jalby, W.: Deep Jam: Conversion of coarse-grain parallelism to instruction-level and vector parallelism for irregular applications. In: Intl. Conf. on Parallel Architectures and Compilation Techniques (PACT 2005), pp. 291-300 (2005)
8. Chen, C., Chame, J., Hall, M.: A framework for composing high-level loop transformations. Technical Report 08-897, USC Computer Science (June 2008)
9. Collard, J.-F.: Space-time transformation of while-loops using speculative execution. In: Proc. of the 1994 Scalable High Performance Computing Conf. (1994)
10. Collard, J.-F.: Automatic parallelization of while-loops using speculative execution. Int. J. Parallel Program. 23(2), 191-219 (1995)
11. Collard, J.-F., Barthou, D., Feautrier, P.: Fuzzy array dataflow analysis. In: ACM Symp. on Principles and practice of parallel programming (PPOPP 1995), Santa Barbara, California, pp. 92-101 (1995)
12. Creusillet, B., Irigoin, F.: Exact versus approximate array region analyses. In: Sehr, D., Banerjee, U., Gelernter, D., Nicolau, A., Padua, D.A. (eds.) LCPC 1996. LNCS, vol. 1239, pp. 86-100. Springer, Heidelberg (1997)
13. Feautrier, P.: Dataflow analysis of scalar and array references. Intl. Journal of Parallel Programming 20(1), 23-53 (1991)
14. Feautrier, P.: Some efficient solutions to the affine scheduling problem, part I: one dimensional time. Intl. J. of Parallel Programming 21(5), 313-348 (1992)
15. Feautrier, P.: Some efficient solutions to the affine scheduling problem, part II: multidimensional time. Intl. J. of Parallel Programming 21(6), 389-420 (1992)
16. Franke, B., O'Boyle, M.: Array recovery and high level transformations for dsp applications. In: CPC 10 Intl. Workshop on Compilers for Parallel Computers, Amsterdam, January 2003, pp. 29-38 (2003)
17. Geigl, M., Griebl, M., Lengauer, C.: A scheme for detecting the termination of a parallel loop nest. In: Proc. GI/ITG FG PARS 1998 (1998)
18. Geigl, M., Griebl, M., Lengauer, C.: Termination detection in parallel loop nests with while loops. Parallel Comput. 25(12), 1489-1510 (1999) (Pubitemid 30509209)
19. Girbal, S., Vasilache, N., Bastoul, C., Cohen, A., Parello, D., Sigler, M., Temam, O.: Semi-automatic composition of loop transformations for deep parallelism and memory hierarchies. Intl. J. of Parallel Programming 34(3) (2006) (Pubitemid 44147210)
20. Griebl, M.: Automatic parallelization of loop programs for distributed memory architectures. Habilitation thesis. FMI, universität Passau (2004)
21. Griebl, M., Collard, J.-F.: Generation of synchronous code for automatic parallelization of while loops. In: Haridi, S., Ali, K., Magnusson, P. (eds.) Euro-Par 1995. LNCS, vol. 966, pp. 315-326. Springer, Heidelberg (1995)
22. Griebl, M., Lengauer, C.: On scanning space-time mapped while loops. In: Buchberger, B., Volkert, J. (eds.) CONPAR 1994 and VAPP 1994. LNCS, vol. 854, pp. 677-688. Springer, Heidelberg (1994)
23. Karp, R., Miller, R., Winograd, S.: The organization of computations for uniform recurrence equations. J. ACM 14(3), 563-590 (1967)
24. Knobe, K., Sarkar, V.: Array ssa form and its use in parallelization. In: ACM Symp. on Principles of Programming Languages (POPL 1998), California (1998)
25. Kong, X., Klappholz, D., Psarris, K.: The i test: A new test for subscript data dependence. In: ICPP 1990 Intl. Conf. on Parallel Processing (August 1990)
26. Lim, A.: Improving Parallelism and Data Locality with Affine Partitioning. PhD thesis, Stanford University (2001)
27. Palkovič, M.: Enhanced Applicability of Loop Transformations. PhD thesis, T. U. Eindhoven, The Netherlands (September 2007)
28. Pouchet, L.-N., Bastoul, C., Cohen, A., Cavazos, S.: Iterative optimization in the polyhedral model: Part II, multidimensional time. In: ACM Conf. on Programming Language Design and Implementation (PLDI 2008), Tucson, Arizona (June 2008)
29. Pouchet, L.-N., Bondhugula, U., Bastoul, C., Cohen, A., Ramanujam, J., Sadayappan, P.: Hybrid iterative and model-driven optimization in the polyhedral model. Technical Report 6962, INRIA Research Report (June 2009)
30. Pugh, W.: The omega test: a fast and practical integer programming algorithm for dependence analysis. In: Proc. of the ACM/IEEE Conf. on Supercomputing (SC 1991), pp. 4-13 (1991)
31. Pugh, W., Wonnacott, D.: An exact method for analysis of value-based array data dependences. In: Banerjee, U., Gelernter, D., Nicolau, A., Padua, D.A. (eds.) LCPC 1993. LNCS, vol. 768, pp. 546-566. Springer, Heidelberg (1994)
32. Quilleré, F., Rajopadhye, S., Wilde, D.: Generation of efficient nested loops from polyhedra. Intl. Journal of Parallel Programming 28(5), 469-498 (2000)
33. Rangan, R., Vachharajani, N., Vachharajani, M., August, D.I.: Decoupled software pipelining with the synchronization array. In: Intl. Conf. on Parallel Architectures and Compilation Techniques (PACT 2004) (September 2004)
34. Rauchwerger, L., Padua, D.A.: The LRPD test: Speculative run-time parallelization of loops with privatization and reduction parallelization. In: ACM Conf. on Programming Language Design and Implementation (PLDI 1995) (June 1995)
35. Rus, S., Pennings, M., Rauchwerger, L.: Sensitivity analysis for automatic parallelization on multi-cores. In: ACM Intl. Conf. Supercomputing, ICS 2007 (2007)
36. Rus, S., Rauchwerger, L.: Hybrid dependence analysis for automatic parallelization. Technical report, Parasol Laboratory, Texas A&M University (2003)
37. Rus, S., Rauchwerger, L., Hoeflinger, J.: Hybrid analysis: Static & dynamic memory reference analysis. Intl. J. of Parallel Programming 31(4) (2003) (Pubitemid 35040006)