{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,5]],"date-time":"2026-11-05T02:37:36Z","timestamp":1793846256595,"version":"4.6.1"},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642119699","type":"print"},{"value":"9783642119705","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-11970-5_16","type":"book-chapter","created":{"date-parts":[[2010,3,7]],"date-time":"2010-03-07T19:23:33Z","timestamp":1267989813000},"page":"283-303","source":"Crossref","is-referenced-by-count":173,"title":["The Polyhedral Model Is More Widely Applicable Than You Think"],"prefix":"10.1007","author":[{"given":"Mohamed-Walid","family":"Benabderrahmane","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Louis-No\u00ebl","family":"Pouchet","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Albert","family":"Cohen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"C\u00e9dric","family":"Bastoul","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"16_CR1","volume-title":"Optimizing Compilers for Modern Architectures","author":"J. Allen","year":"2002","unstructured":"Allen, J., Kennedy, K.: Optimizing Compilers for Modern Architectures. Morgan Kaufmann Publishers, San Francisco (2002)"},{"key":"16_CR2","unstructured":"Banerjee, U.: Data dependence in ordinary programs. Master\u2019s thesis, Dept. of Computer Science, University of Illinois at Urbana-Champaign (November 1976)"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Barthou, D., Cohen, A., Collard, J.-F.: Maximal static expansion. In: ACM Symp. on Principles of Programming Languages (POPL 1998), San Diego, California (1998)","DOI":"10.1145\/268946.268955"},{"key":"16_CR4","doi-asserted-by":"crossref","unstructured":"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\u201316 (2004)","DOI":"10.1109\/PACT.2004.1342537"},{"key":"16_CR5","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/1375581.1375595"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Boulet, P., Darte, A., Silber, G.-A., Vivien, F.: Loop parallelization algorithms: From parallelism extraction to code generation. Parallel Computing (1998)","DOI":"10.1016\/S0167-8191(98)00020-9"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"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\u2013300 (2005)","DOI":"10.1109\/PACT.2005.16"},{"key":"16_CR8","unstructured":"Chen, C., Chame, J., Hall, M.: A framework for composing high-level loop transformations. Technical Report 08-897, USC Computer Science (June 2008)"},{"key":"16_CR9","doi-asserted-by":"crossref","unstructured":"Collard, J.-F.: Space-time transformation of while-loops using speculative execution. In: Proc. of the 1994 Scalable High Performance Computing Conf. (1994)","DOI":"10.1109\/SHPCC.1994.296675"},{"issue":"2","key":"16_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/BF02577789","volume":"23","author":"J.-F. Collard","year":"1995","unstructured":"Collard, J.-F.: Automatic parallelization of while-loops using speculative execution. Int. J. Parallel Program.\u00a023(2), 191\u2013219 (1995)","journal-title":"Int. J. Parallel Program."},{"key":"16_CR11","doi-asserted-by":"crossref","unstructured":"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\u2013101 (1995)","DOI":"10.1145\/209936.209947"},{"key":"16_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/BFb0017247","volume-title":"Languages and Compilers for Parallel Computing","author":"B. Creusillet","year":"1997","unstructured":"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.\u00a01239, pp. 86\u2013100. Springer, Heidelberg (1997)"},{"issue":"1","key":"16_CR13","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/BF01407931","volume":"20","author":"P. Feautrier","year":"1991","unstructured":"Feautrier, P.: Dataflow analysis of scalar and array references. Intl. Journal of Parallel Programming\u00a020(1), 23\u201353 (1991)","journal-title":"Intl. Journal of Parallel Programming"},{"issue":"5","key":"16_CR14","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF01407835","volume":"21","author":"P. Feautrier","year":"1992","unstructured":"Feautrier, P.: Some efficient solutions to the affine scheduling problem, part I: one dimensional time. Intl. J. of Parallel Programming\u00a021(5), 313\u2013348 (1992)","journal-title":"Intl. J. of Parallel Programming"},{"issue":"6","key":"16_CR15","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/BF01379404","volume":"21","author":"P. Feautrier","year":"1992","unstructured":"Feautrier, P.: Some efficient solutions to the affine scheduling problem, part II: multidimensional time. Intl. J. of Parallel Programming\u00a021(6), 389\u2013420 (1992)","journal-title":"Intl. J. of Parallel Programming"},{"key":"16_CR16","unstructured":"Franke, B., O\u2019Boyle, 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\u201338 (2003)"},{"key":"16_CR17","unstructured":"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)"},{"issue":"12","key":"16_CR18","doi-asserted-by":"publisher","first-page":"1489","DOI":"10.1016\/S0167-8191(99)00063-0","volume":"25","author":"M. Geigl","year":"1999","unstructured":"Geigl, M., Griebl, M., Lengauer, C.: Termination detection in parallel loop nests with while loops. Parallel Comput.\u00a025(12), 1489\u20131510 (1999)","journal-title":"Parallel Comput."},{"key":"16_CR19","doi-asserted-by":"crossref","unstructured":"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\u00a034(3) (2006)","DOI":"10.1007\/s10766-006-0012-3"},{"key":"16_CR20","unstructured":"Griebl, M.: Automatic parallelization of loop programs for distributed memory architectures. Habilitation thesis. FMI, universit\u00e4t Passau (2004)"},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BFb0020474","volume-title":"EURO-PAR \u201995: Parallel Processing","author":"M. Griebl","year":"1995","unstructured":"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.\u00a0966, pp. 315\u2013326. Springer, Heidelberg (1995)"},{"key":"16_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"677","DOI":"10.1007\/3-540-58430-7_59","volume-title":"Parallel Processing: CONPAR 94 - VAPP VI","author":"M. Griebl","year":"1994","unstructured":"Griebl, M., Lengauer, C.: On scanning space-time mapped while loops. In: Buchberger, B., Volkert, J. (eds.) CONPAR 1994 and VAPP 1994. LNCS, vol.\u00a0854, pp. 677\u2013688. Springer, Heidelberg (1994)"},{"issue":"3","key":"16_CR23","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1145\/321406.321418","volume":"14","author":"R. Karp","year":"1967","unstructured":"Karp, R., Miller, R., Winograd, S.: The organization of computations for uniform recurrence equations. J. ACM\u00a014(3), 563\u2013590 (1967)","journal-title":"J. ACM"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Knobe, K., Sarkar, V.: Array ssa form and its use in parallelization. In: ACM Symp. on Principles of Programming Languages (POPL 1998), California (1998)","DOI":"10.1145\/268946.268956"},{"key":"16_CR25","unstructured":"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)"},{"key":"16_CR26","unstructured":"Lim, A.: Improving Parallelism and Data Locality with Affine Partitioning. PhD thesis, Stanford University (2001)"},{"key":"16_CR27","unstructured":"Palkovi\u010d, M.: Enhanced Applicability of Loop Transformations. PhD thesis, T. U. Eindhoven, The Netherlands (September 2007)"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/1375581.1375594"},{"key":"16_CR29","unstructured":"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)"},{"key":"16_CR30","doi-asserted-by":"crossref","unstructured":"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\u201313 (1991)","DOI":"10.1145\/125826.125848"},{"key":"16_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"546","DOI":"10.1007\/3-540-57659-2_31","volume-title":"Languages and Compilers for Parallel Computing","author":"W. Pugh","year":"1994","unstructured":"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.\u00a0768, pp. 546\u2013566. Springer, Heidelberg (1994)"},{"issue":"5","key":"16_CR32","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1023\/A:1007554627716","volume":"28","author":"F. Quiller\u00e9","year":"2000","unstructured":"Quiller\u00e9, F., Rajopadhye, S., Wilde, D.: Generation of efficient nested loops from polyhedra. Intl. Journal of Parallel Programming\u00a028(5), 469\u2013498 (2000)","journal-title":"Intl. Journal of Parallel Programming"},{"key":"16_CR33","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1109\/PACT.2004.1342552"},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"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)","DOI":"10.1145\/207110.207148"},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"Rus, S., Pennings, M., Rauchwerger, L.: Sensitivity analysis for automatic parallelization on multi-cores. In: ACM Intl. Conf. Supercomputing, ICS 2007 (2007)","DOI":"10.1145\/1274971.1275008"},{"key":"16_CR36","unstructured":"Rus, S., Rauchwerger, L.: Hybrid dependence analysis for automatic parallelization. Technical report, Parasol Laboratory, Texas A&M University (2003)"},{"key":"16_CR37","doi-asserted-by":"crossref","unstructured":"Rus, S., Rauchwerger, L., Hoeflinger, J.: Hybrid analysis: Static & dynamic memory reference analysis. Intl. J. of Parallel Programming\u00a031(4) (2003)","DOI":"10.1023\/A:1024597010150"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-11970-5_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T21:45:58Z","timestamp":1606167958000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-11970-5_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642119699","9783642119705"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-11970-5_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}