{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:04Z","timestamp":1772164024062,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":44,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,1,26]],"date-time":"2011-01-26T00:00:00Z","timestamp":1296000000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,1,26]]},"DOI":"10.1145\/1926385.1926449","type":"proceedings-article","created":{"date-parts":[[2011,1,24]],"date-time":"2011-01-24T09:58:22Z","timestamp":1295863102000},"page":"549-562","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":77,"title":["Loop transformations"],"prefix":"10.1145","author":[{"given":"Louis-No\u00ebl","family":"Pouchet","sequence":"first","affiliation":[{"name":"The Ohio State University, Columbus, OH, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uday","family":"Bondhugula","sequence":"additional","affiliation":[{"name":"IBM T.J. Watson Research Center, White Plains, OH, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C\u00e9dric","family":"Bastoul","sequence":"additional","affiliation":[{"name":"University of Paris-sud 11, Saclay, OH, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Albert","family":"Cohen","sequence":"additional","affiliation":[{"name":"INRIA, Saclay, OH, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.","family":"Ramanujam","sequence":"additional","affiliation":[{"name":"Louisiana State University, Baton Rouge, OH, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P.","family":"Sadayappan","sequence":"additional","affiliation":[{"name":"The Ohio State University, Columbus, OH, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Vasilache","sequence":"additional","affiliation":[{"name":"Reservoir Labs, Inc., New York, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,1,26]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2006.37"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1996.1261"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/1025127.1025992"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11970-5_16"},{"key":"e_1_3_2_2_5_1","volume-title":"W. on Profile and Feedback Directed Compilation","author":"Bodin F.","year":"1998","unstructured":"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 . 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."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/1788374.1788386"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1854273.1854317"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375595"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/237578.237617"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1088149.1088169"},{"key":"e_1_3_2_2_12_1","first-page":"149","volume-title":"Parallel Computing","author":"Darte A.","year":"1999","unstructured":"A. Darte . On the complexity of loop fusion . Parallel Computing , pages 149 -- 157 , 1999 . A. Darte. On the complexity of loop fusion. Parallel Computing, pages 149--157, 1999."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626497000383"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1051\/ro\/1988220302431"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407931"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407835"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF01407835"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1065010.1065048"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-006-0012-3"},{"key":"e_1_3_2_2_21_1","volume-title":"Facult\u00e4t f\u00fcr Mathematik und Informatik","author":"Griebl M.","year":"2004","unstructured":"M. Griebl . Automatic parallelization of loop programs for distributed memory architectures. Habilitation thesis . Facult\u00e4t f\u00fcr Mathematik und Informatik , Universit\u00e4t Passau , 2004 . M. Griebl. Automatic parallelization of loop programs for distributed memory architectures. Habilitation thesis. Facult\u00e4t f\u00fcr Mathematik und Informatik, Universit\u00e4t Passau, 2004."},{"key":"e_1_3_2_2_22_1","volume-title":"FDL'01","author":"Guillou A.-C.","year":"2001","unstructured":"A.-C. Guillou , F. Quiller\u00e9 , P. Quinton , S. Rajopadhye , and T. Risset . Hardware design methodology with the Alpha language . In FDL'01 , Lyon, France , Sept. 2001 . A.-C. Guillou, F. Quiller\u00e9, P. Quinton, S. Rajopadhye, and T. Risset. Hardware design methodology with the Alpha language. In FDL'01, Lyon, France, Sept. 2001."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/73560.73588"},{"key":"e_1_3_2_2_25_1","first-page":"301","volume-title":"Languages and Compilers for Parallel Computing","author":"Kennedy K.","year":"1993","unstructured":"K. Kennedy and K. McKinley . Maximizing loop parallelism and improving data locality via loop fusion and distribution . In Languages and Compilers for Parallel Computing , pages 301 -- 320 , 1993 . K. Kennedy and K. McKinley. Maximizing loop parallelism and improving data locality via loop fusion and distribution. In Languages and Compilers for Parallel Computing, pages 301--320, 1993."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/258915.258946"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375596"},{"key":"e_1_3_2_2_28_1","volume-title":"Encyclopedia of Parallel Computing","author":"Lethin R.","year":"2011","unstructured":"R. Lethin , A. Leung , B. Meister , N. Vasilache , D. Wohlford , M. Baskaran , A. Hartono , and K. Datta . In D. Padua , editor , Encyclopedia of Parallel Computing . 1 st edition., 2011 , 50 p. in 4 volumes, not available separately., hardcover edition, June 2011. R. Lethin, A. Leung, B. Meister, N. Vasilache, D. Wohlford, M. Baskaran, A. Hartono, and K. Datta. In D. Padua, editor, Encyclopedia of Parallel Computing. 1st edition., 2011, 50 p. in 4 volumes, not available separately., hardcover edition, June 2011.","edition":"1"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/233561.233564"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/258492.258520"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/645562.659704"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1375581.1375594"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2010.14"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/1183401.1183437"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1016\/0743-7315(92)90027-K"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1454115.1454155"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/1250734.1250780"},{"key":"e_1_3_2_2_39_1","volume-title":"Theory of linear and integer programming","author":"Schrijver A.","year":"1986","unstructured":"A. Schrijver . Theory of linear and integer programming . John Wiley & amp; Sons, 1986 . A. Schrijver. Theory of linear and integer programming. John Wiley & Sons, 1986."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/40.6.340"},{"key":"e_1_3_2_2_41_1","volume-title":"The On-Line Encyclopedia of Integer Sequences","author":"Sloane N. J. A.","unstructured":"N. J. A. Sloane . Sequence a000670. The On-Line Encyclopedia of Integer Sequences . N. J. A. Sloane. Sequence a000670. The On-Line Encyclopedia of Integer Sequences."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/780822.781141"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161054"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1109\/CGO.2009.33"},{"key":"e_1_3_2_2_47_1","volume-title":"Automated empirical optimization of software and the atlas project. Parallel Computing, 27(1--2):3--35","author":"Whaley R. C.","year":"2001","unstructured":"R. C. Whaley , A. Petitet , and J. J. Dongarra . Automated empirical optimization of software and the atlas project. Parallel Computing, 27(1--2):3--35 , 2001 . R. C. Whaley, A. Petitet, and J. J. Dongarra. Automated empirical optimization of software and the atlas project. Parallel Computing, 27(1--2):3--35, 2001."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.5555\/243846.243895"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/76263.76337"},{"key":"e_1_3_2_2_50_1","volume-title":"Addison-Wesley Publishing Company","author":"Wolfe M.","year":"1995","unstructured":"M. Wolfe . High performance compilers for parallel computing . Addison-Wesley Publishing Company , 1995 . M. Wolfe. High performance compilers for parallel computing. Addison-Wesley Publishing Company, 1995."}],"event":{"name":"POPL '11: The 38th Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages","location":"Austin Texas USA","acronym":"POPL '11","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1926385.1926449","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1926385.1926449","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:59:51Z","timestamp":1750229991000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1926385.1926449"}},"subtitle":["convexity, pruning and optimization"],"short-title":[],"issued":{"date-parts":[[2011,1,26]]},"references-count":44,"alternative-id":["10.1145\/1926385.1926449","10.1145\/1926385"],"URL":"https:\/\/doi.org\/10.1145\/1926385.1926449","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1925844.1926449","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,1,26]]},"assertion":[{"value":"2011-01-26","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}