{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T03:10:09Z","timestamp":1743649809690,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642314636"},{"type":"electronic","value":"9783642314643"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31464-3_31","type":"book-chapter","created":{"date-parts":[[2012,7,2]],"date-time":"2012-07-02T15:20:38Z","timestamp":1341242438000},"page":"307-316","source":"Crossref","is-referenced-by-count":1,"title":["Extracting Coarse\u2013Grained Parallelism for Affine Perfectly Nested Quasi\u2013uniform Loops"],"prefix":"10.1007","author":[{"given":"W\u0142odzimierz","family":"Bielecki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Krzysztof","family":"Kraska","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"31_CR1","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1109\/71.149964","volume":"3","author":"E.H. D\u2019Hollander","year":"1992","unstructured":"D\u2019Hollander, E.H.: Partitioning and Labeling of Loops by Unimodular Transformations. IEEE Transactions on Parallel and Distributed Systems\u00a03(4), 465\u2013476 (1992)","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"issue":"3-4","key":"31_CR2","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":"31_CR3","unstructured":"Griebl, M.: Automatic Parallelization of Loop Programs for Distributed Memory Achitectures. Habilitation. Fakult\u00e4t f\u00fcr Mathematik und Informatik Universit\u00e4t Passau (2004)"},{"key":"31_CR4","doi-asserted-by":"crossref","unstructured":"Beletska, A., Bielecki, W., Pietro, P.S.: Extracting Coarse-Grained Parallelism in Program Loops with the Slicing Framework. In: ISPDC, pp. 203\u2013210 (2007)","DOI":"10.1109\/ISPDC.2007.21"},{"key":"31_CR5","unstructured":"Schrijver, A.: Theory of Linear and Integer Programming. Series in Discrete Mathematics (1999)"},{"key":"31_CR6","unstructured":"Nookala, P.K.V.V., Risset, T.: A Library for \u2124\u2013Polyhedral Operations. Publication interne n.1330, Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires (2000)"},{"key":"31_CR7","unstructured":"Polylib User\u2019s Manual. The Polylib Team (2002)"},{"key":"31_CR8","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1006\/jagm.1999.1046","volume":"34","author":"F. H\u00f6fting","year":"2000","unstructured":"H\u00f6fting, F., Wanke, E.: Polynomial-Time Analysis of Toroidal Periodic Graphs. Journal of Algorithms\u00a034, 14\u201339 (2000)","journal-title":"Journal of Algorithms"},{"key":"31_CR9","unstructured":"Bondhugula, U.K.R.: Effective Automatic Parallelization and Locality Optimization Using the Polyhedral Model. Dissertation. The Ohio State University (2010)"},{"key":"31_CR10","unstructured":"Quinton, P., Rajopadhye, S., Risset, T.: On Manipulating \u2124\u2013Polyhedra. Publication interne n.1016, Institut de Recherche en Informatique et Syst\u00e8mes Al\u00e9atoires (1996)"},{"key":"31_CR11","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1090\/dimacs\/004\/10","volume":"4","author":"E. Cohen","year":"1991","unstructured":"Cohen, E., Megiddo, N.: Recognizing Properties of Periodic Graphs. DIMACS Series in Discrete Mathematics and Theoretical Computer Science\u00a04, 135\u2013146 (1991)","journal-title":"DIMACS Series in Discrete Mathematics and Theoretical Computer Science"},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Bastoul, C.: Code Generation in the Polyhedral Model Is Easier Than You Think. In: PACT\u201913 IEEE International Conference on Parallel Architecture and Compilation Techniques, pp. 7\u201316 (2004)","DOI":"10.1109\/PACT.2004.1342537"},{"key":"31_CR13","unstructured":"NASA Advanced Supercomputing Division, http:\/\/www.nas.nasa.gov"},{"key":"31_CR14","unstructured":"https:\/\/github.com\/davewathaverford\/the-omega-project"}],"container-title":["Lecture Notes in Computer Science","Parallel Processing and Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31464-3_31.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,3]],"date-time":"2025-04-03T02:29:17Z","timestamp":1743647357000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31464-3_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642314636","9783642314643"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31464-3_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}