{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T14:14:02Z","timestamp":1780755242288,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540787907","type":"print"},{"value":"9783540787914","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78791-4_9","type":"book-chapter","created":{"date-parts":[[2008,4,1]],"date-time":"2008-04-01T23:13:15Z","timestamp":1207091595000},"page":"132-146","source":"Crossref","is-referenced-by-count":82,"title":["Automatic Transformations for Communication-Minimized Parallelization and Locality Optimization in the Polyhedral Model"],"prefix":"10.1007","author":[{"given":"Uday","family":"Bondhugula","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Muthu","family":"Baskaran","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sriram","family":"Krishnamoorthy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"J.","family":"Ramanujam","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Atanas","family":"Rountev","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"P.","family":"Sadayappan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Ahmed, N., Mateev, N., Pingali, K.: Synthesizing transformations for locality enhancement of imperfectly-nested loop nests. IJPP\u00a029(5) (October 2001)","DOI":"10.1145\/335231.335245"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Bastoul, C.: Code generation in the polyhedral model is easier than you think. In: IEEE PACT, pp. 7\u201316 (September 2004)","DOI":"10.1109\/PACT.2004.1342537"},{"key":"9_CR3","unstructured":"Bondhugula, U., Baskaran, M., Krishnamoorthy, S., Ramanujam, J., Rountev, A., Sadayappan, P.: Affine transformations for communication minimal parallelization and locality optimization for arbitrarily-nested loop sequences. Technical Report OSU-CISRC-5\/07-TR43, The Ohio State University (May 2007)"},{"key":"9_CR4","doi-asserted-by":"crossref","unstructured":"Bondhugula, U., Ramanujam, J., Sadayappan, P.: PLuTo: A practical and fully automatic polyhedral parallelizer and locality optimizer. Technical Report OSU-CISRC-5\/07-TR70, The Ohio State University (October 2007)","DOI":"10.1145\/1375581.1375595"},{"issue":"3\u20134","key":"9_CR5","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1016\/S0167-8191(98)00020-9","volume":"24","author":"P. Boulet","year":"1998","unstructured":"Boulet, P., Darte, A., Silber, G.-A., Vivien, F.: Loop parallelization algorithms: From parallelism extraction to code generation. Parallel Computing\u00a024(3\u20134), 421\u2013444 (1998)","journal-title":"Parallel Computing"},{"key":"9_CR6","doi-asserted-by":"crossref","unstructured":"Cohen, A., Girbal, S., David,, Parello, M.S., Temam, O., Vasilache, N.: Facilitating the search for compositions of program transformations. In: ICS, pp. 151\u2013160 (June 2005)","DOI":"10.1145\/1088149.1088169"},{"issue":"6","key":"9_CR7","first-page":"447","volume":"25","author":"A. Darte","year":"1997","unstructured":"Darte, A., Vivien, F.: Optimal fine and medium grain parallelism detection in polyhedral reduced dependence graphs. IJPP\u00a025(6), 447\u2013496 (1997)","journal-title":"IJPP"},{"issue":"3","key":"9_CR8","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1051\/ro\/1988220302431","volume":"22","author":"P. Feautrier","year":"1988","unstructured":"Feautrier, P.: Parametric integer programming. Operationnelle\/Operations Research\u00a022(3), 243\u2013268 (1988)","journal-title":"Operationnelle\/Operations Research"},{"issue":"1","key":"9_CR9","first-page":"23","volume":"20","author":"P. Feautrier","year":"1991","unstructured":"Feautrier, P.: Dataflow analysis of array and scalar references. IJPP\u00a020(1), 23\u201353 (1991)","journal-title":"IJPP"},{"issue":"5","key":"9_CR10","first-page":"313","volume":"21","author":"P. Feautrier","year":"1992","unstructured":"Feautrier, P.: Some efficient solutions to the affine scheduling problem: I. one-dimensional time. IJPP\u00a021(5), 313\u2013348 (1992)","journal-title":"IJPP"},{"issue":"6","key":"9_CR11","first-page":"389","volume":"21","author":"P. Feautrier","year":"1992","unstructured":"Feautrier, P.: Some efficient solutions to the affine scheduling problem. part II. multidimensional time. IJPP\u00a021(6), 389\u2013420 (1992)","journal-title":"IJPP"},{"issue":"3","key":"9_CR12","first-page":"261","volume":"34","author":"S. Girbal","year":"2006","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. IJPP\u00a034(3), 261\u2013317 (2006)","journal-title":"IJPP"},{"key":"9_CR13","unstructured":"Griebl, M.: Automatic Parallelization of Loop Programs for Distributed Memory Architectures. FMI, University of Passau, Habilitation Thesis (2004)"},{"key":"9_CR14","doi-asserted-by":"crossref","unstructured":"Irigoin, F., Triolet, R.: Supernode partitioning. In: POPL, pp. 319\u2013329 (1988)","DOI":"10.1145\/73560.73588"},{"key":"9_CR15","unstructured":"Kelly, W., Pugh, W.: A unifying framework for iteration reordering transformations. Technical Report CS-TR-3430, University of Maryland, College Park (1995)"},{"issue":"2","key":"9_CR16","first-page":"183","volume":"22","author":"W. Li","year":"1994","unstructured":"Li, W., Pingali, K.: A singular loop transformation framework based on non-singular matrices. IJPP\u00a022(2), 183\u2013205 (1994)","journal-title":"IJPP"},{"key":"9_CR17","doi-asserted-by":"crossref","unstructured":"Lim, A., Liao, S., Lam, M.: Blocking and array contraction across arbitrarily nested loops using affine partitioning. In: ACM SIGPLAN PPoPP, pp. 103\u2013112 (2001)","DOI":"10.1145\/379539.379586"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Lim, A.W., Cheong, G.I., Lam, M.S.: An affine partitioning algorithm to maximize parallelism and minimize communication. In: ACM ICS, pp. 228\u2013237 (1999)","DOI":"10.1145\/305138.305197"},{"issue":"3-4","key":"9_CR19","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1016\/S0167-8191(98)00021-0","volume":"24","author":"A.W. Lim","year":"1998","unstructured":"Lim, A.W., Lam, M.S.: Maximizing parallelism and minimizing synchronization with affine partitions. Parallel Computing\u00a024(3-4), 445\u2013475 (1998)","journal-title":"Parallel Computing"},{"key":"9_CR20","unstructured":"LooPo - Loop parallelization in the polytope model, http:\/\/www.fmi.uni-passau.de\/loopo"},{"key":"9_CR21","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1017\/S0305004100030401","volume":"51","author":"R. Penrose","year":"1955","unstructured":"Penrose, R.: A generalized inverse for matrices. Proceedings of the Cambridge Philosophical Society\u00a051, 406\u2013413 (1955)","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Pouchet, L.-N., Bastoul, C., Cohen, A., Vasilache, N.: Iterative optimization in the polyhedral model: Part I, one-dimensional time. In: ACM CGO (March 2007)","DOI":"10.1109\/CGO.2007.21"},{"issue":"5","key":"9_CR23","first-page":"469","volume":"28","author":"F. Quiller\u00e9","year":"2000","unstructured":"Quiller\u00e9, F., Rajopadhye, S.V., Wilde, D.: Generation of efficient nested loops from polyhedra. IJPP\u00a028(5), 469\u2013498 (2000)","journal-title":"IJPP"},{"issue":"2","key":"9_CR24","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/0743-7315(92)90027-K","volume":"16","author":"J. Ramanujam","year":"1992","unstructured":"Ramanujam, J., Sadayappan, P.: Tiling multidimensional iteration spaces for multicomputers. Journal of Parallel and Distributed Computing\u00a016(2), 108\u2013230 (1992)","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"9_CR25","unstructured":"Schreiber, R., Dongarra, J.: Automatic blocking of nested loops. Technical report, University of Tennessee, Knoxville, TN (August 1990)"},{"key":"9_CR26","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1987","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Wiley, Chichester (1987)"},{"key":"9_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1007\/11688839_16","volume-title":"Compiler Construction","author":"N. Vasilache","year":"2006","unstructured":"Vasilache, N., Bastoul, C., Cohen, A.: Polyhedral code generation in the real world. In: Mycroft, A., Zeller, A. (eds.) CC 2006. LNCS, vol.\u00a03923, pp. 185\u2013201. Springer, Heidelberg (2006)"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Vasilache, N., Bastoul, C., Girbal, S., Cohen, A.: Violated dependence analysis. In: ACM ICS (June 2006)","DOI":"10.1145\/1183401.1183448"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Wolf, M., Lam, M.S.: A data locality optimizing algorithm. In: PLDI, pp. 30\u201344 (1991)","DOI":"10.1145\/113445.113449"},{"issue":"1","key":"9_CR30","first-page":"42","volume":"42","author":"J. Xue","year":"1997","unstructured":"Xue, J.: Communication-minimal tiling of uniform dependence loops. JPDC\u00a042(1), 42\u201359 (1997)","journal-title":"JPDC"}],"container-title":["Lecture Notes in Computer Science","Compiler Construction"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78791-4_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,17]],"date-time":"2023-05-17T11:32:36Z","timestamp":1684323156000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78791-4_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540787907","9783540787914"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78791-4_9","relation":{},"subject":[]}}