{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T02:40:08Z","timestamp":1748832008754,"version":"3.41.0"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319321516"},{"type":"electronic","value":"9783319321523"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-32152-3_13","type":"book-chapter","created":{"date-parts":[[2016,4,1]],"date-time":"2016-04-01T02:10:11Z","timestamp":1459476611000},"page":"133-142","source":"Crossref","is-referenced-by-count":0,"title":["Free Scheduling of Tiles Based on the Transitive Closure of Dependence Graphs"],"prefix":"10.1007","author":[{"given":"Wlodzimierz","family":"Bielecki","sequence":"first","affiliation":[]},{"given":"Marek","family":"Palkowski","sequence":"additional","affiliation":[]},{"given":"Tomasz","family":"Klimek","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,2]]},"reference":[{"key":"13_CR1","doi-asserted-by":"crossref","unstructured":"Bastoul, C.: Code generation in the polyhedral model is easier than you think. In: PACT 2013 IEEE International Conference on Parallel Architecture and Compilation Techniques, Juan-les-Pins, pp. 7\u201316, September 2004","DOI":"10.1109\/PACT.2004.1342537"},{"key":"13_CR2","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.parco.2010.12.005","volume":"37","author":"A Beletska","year":"2011","unstructured":"Beletska, A., Bielecki, W., Cohen, A., Palkowski, M., Siedlecki, K.: Coarse-grained loop parallelization: iteration space slicing vs affine transformations. Parallel Comput. 37, 479\u2013497 (2011)","journal-title":"Parallel Comput."},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/978-3-642-11970-5_16","volume-title":"Compiler Construction","author":"M-W Benabderrahmane","year":"2010","unstructured":"Benabderrahmane, M.-W., Pouchet, L.-N., Cohen, A., Bastoul, C.: The polyhedral model is more widely applicable than you think. In: Gupta, R. (ed.) CC 2010. LNCS, vol. 6011, pp. 283\u2013303. Springer, Heidelberg (2010). http:\/\/dx.doi.org\/10.1007\/978-3-642-11970-5_16"},{"key":"13_CR4","first-page":"309","volume":"342","author":"W Bielecki","year":"2015","unstructured":"Bielecki, W., Palkowski, M.: Perfectly nested loop tiling transformations based on the transitive closure of the program dependence graph. Soft Comput. Comput. Inf. Sci. 342, 309\u2013320 (2015)","journal-title":"Soft Comput. Comput. Inf. Sci."},{"issue":"9","key":"13_CR5","doi-asserted-by":"publisher","first-page":"518","DOI":"10.1016\/j.parco.2012.06.001","volume":"38","author":"W Bielecki","year":"2012","unstructured":"Bielecki, W., Palkowski, M., Klimek, T.: Free scheduling for statement instances of parameterized arbitrarily nested affine loops. Parallel Comput. 38(9), 518\u2013532 (2012)","journal-title":"Parallel Comput."},{"issue":"6","key":"13_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/1379022.1375595","volume":"43","author":"U Bondhugula","year":"2008","unstructured":"Bondhugula, U., Hartono, A., Ramanujam, J., Sadayappan, P.: A practical automatic polyhedral parallelizer and locality optimizer. SIGPLAN Not. 43(6), 101\u2013113 (2008)","journal-title":"SIGPLAN Not."},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1142\/S0129626491000021","volume":"1","author":"A Darte","year":"1991","unstructured":"Darte, A., Khachiyan, L., Robert, Y.: Linear scheduling is nearly optimal. Parallel Process. Lett. 1(2), 73\u201381 (1991)","journal-title":"Parallel Process. Lett."},{"key":"13_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1362-8","volume-title":"Scheduling and Automatic Parallelization","author":"A Darte","year":"2000","unstructured":"Darte, A., Robert, Y., Vivien, F.: Scheduling and Automatic Parallelization. Birkhauser, New York (2000)"},{"key":"13_CR9","unstructured":"Griebl, M.: Automatic parallelization of loop programs for distributed memory architectures (2004)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Irigoin, F., Triolet, R.: Supernode partitioning. In: Proceedings of the 15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 1988, pp. 319\u2013329. ACM, New York (1988)","DOI":"10.1145\/73560.73588"},{"key":"13_CR11","unstructured":"Kelly, W., Maslov, V., Pugh, W., Rosser, E., Shpeisman, T., Wonnacott, D.: The omega library interface guide. Technical report, College Park, MD, USA (1995)"},{"issue":"6","key":"13_CR12","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1007\/BF03356760","volume":"24","author":"W Kelly","year":"1996","unstructured":"Kelly, W., Pugh, W., Rosser, E., Shpeisman, T.: Transitive closure of infinite graphs and its applications. Int. J. Parallel Program. 24(6), 579\u2013598 (1996)","journal-title":"Int. J. Parallel Program."},{"key":"13_CR13","doi-asserted-by":"crossref","unstructured":"Lim, A., Cheong, G.I., Lam, M.S.: An affine partitioning algorithm to maximize parallelism and minimize communication. In: Proceedings of the 13th ACM SIGARCH International Conference on Supercomputing, pp. 228\u2013237. ACM Press (1999)","DOI":"10.1145\/305138.305197"},{"key":"13_CR14","unstructured":"NAS benchmarks suite (2013). http:\/\/www.nas.nasa.gov"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Pugh, W., Rosser, E.: Iteration space slicing and its application to communication optimization. In: International Conference on Supercomputing, pp. 221\u2013228 (1997)","DOI":"10.1145\/263580.263637"},{"key":"13_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1007\/3-540-57659-2_31","volume-title":"Languages and Compilers for Parallel Computing","author":"W Pugh","year":"1993","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. (eds.) Languages and Compilers for Parallel Computing. LNCS, vol. 768, pp. 546\u2013566. Springer, Heidelberg (1993)"},{"key":"13_CR17","unstructured":"Verdoolaege, S.: Integer set library - manual. Technical report (2011). http:\/\/www.kotnet.org\/~skimo\/\/isl\/manual.pdf"},{"issue":"4","key":"13_CR18","doi-asserted-by":"publisher","first-page":"452","DOI":"10.1109\/71.97902","volume":"2","author":"ME Wolf","year":"1991","unstructured":"Wolf, M.E., Lam, M.S.: A loop transformation theory and an algorithm to maximize parallelism. IEEE Trans. Parallel Distrib. Syst. 2(4), 452\u2013471 (1991)","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"13_CR19","unstructured":"Wonnacott, D.G., Strout, M.M.: On the scalability of loop tiling techniques. In: Proceedings of the 3rd International Workshop on Polyhedral Compilation Techniques (IMPACT), January 2013"},{"issue":"04","key":"13_CR20","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1142\/S0129626497000401","volume":"07","author":"Jingling Xue","year":"1997","unstructured":"Xue, J.: On tiling as a loop transformation (1997)","journal-title":"Parallel Processing Letters"}],"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-319-32152-3_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,2]],"date-time":"2025-06-02T02:15:37Z","timestamp":1748830537000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-32152-3_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319321516","9783319321523"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-32152-3_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}