{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T08:47:27Z","timestamp":1770454047115,"version":"3.49.0"},"reference-count":33,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,11,11]],"date-time":"2018-11-11T00:00:00Z","timestamp":1541894400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2019,5]]},"DOI":"10.1007\/s11227-018-2678-x","type":"journal-article","created":{"date-parts":[[2018,11,11]],"date-time":"2018-11-11T00:09:34Z","timestamp":1541894974000},"page":"2665-2690","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Insight into tiles generated by means of a correction technique"],"prefix":"10.1007","volume":"75","author":[{"given":"Wlodzimierz","family":"Bielecki","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9105-911X","authenticated-orcid":false,"given":"Piotr","family":"Skotnicki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,11]]},"reference":[{"key":"2678_CR1","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 (2011) Coarse-grained loop parallelization: Iteration space slicing vs affine transformations. Parallel Comput 37:479\u2013497","journal-title":"Parallel Comput"},{"key":"2678_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1007\/978-3-319-03780-6_12","volume-title":"Combinatorial Optimization and Applications","author":"W Bielecki","year":"2013","unstructured":"Bielecki W (2013) Using basis dependence distance vectors to calculate the transitive closure of dependence relations by means of the Foyd-Warshall algorithm. In: Widmayer P, Xu Y, Zhu B (eds) Combinatorial Optimization and Applications. Springer International Publishing, Cham, pp 129\u2013140"},{"key":"2678_CR3","unstructured":"Bielecki W, Klimek T, Palkowski M, Beletska A (2010) An iterative algorithm of computing the transitive closure of a union of parameterized affine integer tuple relations. In: COCOA 2010: Fourth International Conference on Combinatorial Optimization and Applications. Lecture Notes in Computer Science, vol 6508\/2010, pp 104\u2013113"},{"issue":"4","key":"2678_CR4","doi-asserted-by":"publisher","first-page":"919","DOI":"10.1515\/amcs-2016-0065","volume":"26","author":"W Bielecki","year":"2016","unstructured":"Bielecki W, Palkowski M (2016) Tiling arbitrarily nested loops by means of the transitive closure of dependence graphs. Int J Appl Math Comput Sci 26(4):919\u2013939","journal-title":"Int J Appl Math Comput Sci"},{"issue":"9","key":"2678_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 (2012) Free scheduling for statement instances of parameterized arbitrarily nested affine loops. Parallel Comput 38(9):518\u2013532","journal-title":"Parallel Comput"},{"issue":"3","key":"2678_CR6","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/s00607-017-0576-3","volume":"100","author":"W Bielecki","year":"2018","unstructured":"Bielecki W, Palkowski M, Skotnicki P (2018) Generation of parallel synchronization-free tiled code. Computing 100(3):277\u2013302","journal-title":"Computing"},{"key":"2678_CR7","series-title":"Lecture notes in computer science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-540-78791-4_9","volume-title":"Compiler constructure","author":"U Bondhugula","year":"2008","unstructured":"Bondhugula U et al (2008) Automatic transformations for communication-minimized parallelization and locality optimization in the polyhedral model. In: Hendren L (ed) Compiler constructure. Lecture notes in computer science. Springer, Berlin, pp 132\u2013146"},{"issue":"6","key":"2678_CR8","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1145\/1379022.1375595","volume":"43","author":"U Bondhugula","year":"2008","unstructured":"Bondhugula U et al (2008) A practical automatic polyhedral parallelizer and locality optimizer. SIGPLAN Not 43(6):101\u2013113","journal-title":"SIGPLAN Not"},{"issue":"5","key":"2678_CR9","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/BF01407835","volume":"21","author":"P Feautrier","year":"1992","unstructured":"Feautrier P (1992) Some efficient solutions to the affine scheduling problem: I. one-dimensional time. Int J Parallel Program 21(5):313\u2013348","journal-title":"Int J Parallel Program"},{"issue":"6","key":"2678_CR10","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/BF01379404","volume":"21","author":"P Feautrier","year":"1992","unstructured":"Feautrier P (1992) Some efficient solutions to the affine scheduling problem: II. Multidimensional time. Int J Parallel Program 21(6):389\u2013420","journal-title":"Int J Parallel Program"},{"key":"2678_CR11","unstructured":"Griebl M (2004) Automatic Parallelization of Loop Programs for Distributed Memory Architectures. University of Passau. Habilitation thesis"},{"issue":"6","key":"2678_CR12","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1023\/A:1007516818651","volume":"28","author":"M Griebl","year":"2000","unstructured":"Griebl M, Feautrier P, Lengauer C (2000) Index set splitting. Int J Parallel Program 28(6):607\u2013631","journal-title":"Int J Parallel Program"},{"key":"2678_CR13","doi-asserted-by":"crossref","unstructured":"Irigoin F, Triolet R (1988) Supernode partitioning. In: Proceedings of the 15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL \u201988. ACM, New York, NY, USA, pp 319\u2013329","DOI":"10.1145\/73560.73588"},{"issue":"6","key":"2678_CR14","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1007\/BF03356760","volume":"24","author":"W Kelly","year":"1996","unstructured":"Kelly W et al (1996) Transitive closure of infinite graphs and its applications. Int J Parallel Program 24(6):579\u2013598","journal-title":"Int J Parallel Program"},{"key":"2678_CR15","doi-asserted-by":"crossref","unstructured":"Lim A et al (1999) An affine partitioning algorithm to maximize parallelism and minimize communication. In: In Proceedings of the 13th ACM SIGARCH International Conference on Supercomputing. ACM Press, pp 228\u2013237","DOI":"10.1145\/305138.305197"},{"key":"2678_CR16","unstructured":"Lim AW, Lam MS (1994) Communication-free parallelization via affine transformations. In: 24th ACM Symposium on Principles of Programming Languages. Springer, pp 92\u2013106"},{"key":"2678_CR17","unstructured":"Mullapudi RT, Bondhugula U (2014) Tiling for dynamic scheduling. In: Fourth International Workshop on Polyhedral Compilation Techniques, Viena"},{"issue":"10","key":"2678_CR18","doi-asserted-by":"publisher","first-page":"1106","DOI":"10.1089\/cmb.2018.0006","volume":"25","author":"M Palkowski","year":"2018","unstructured":"Palkowski M, Bielecki W (2018) Parallel tiled codes implementing the Smith-Waterman alignment algorithm for two and three sequences. J Comput Biol 25(10):1106\u20131119","journal-title":"J Comput Biol"},{"issue":"1","key":"2678_CR19","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1186\/s12859-018-2008-6","volume":"19","author":"M Palkowski","year":"2018","unstructured":"Palkowski M, Bielecki W (2018) Tuning iteration space slicing based tiled multi-core code implementing Nussinov\u2019s RNA folding. BMC Bioinform 19(1):12","journal-title":"BMC Bioinform"},{"key":"2678_CR20","doi-asserted-by":"crossref","unstructured":"Palkowski M, Klimek T, Bielecki W (2015) TRACO: an automatic loop nest parallelizer for numerical applications. In: Federated Conference on Computer Science and Information Systems","DOI":"10.15439\/2015F34"},{"key":"2678_CR21","unstructured":"Pouchet LN (2015) The polyhedral benchmark suite\/c4.1. \n                    http:\/\/web.cse.ohio-state.edu\/~pouchet\/software\/polybench\n                    \n                  . Accessed 28 Dec 2017"},{"key":"2678_CR22","doi-asserted-by":"crossref","unstructured":"Pugh W, Rosser E (1997) Iteration space slicing and its application to communication optimization. In: International Conference on Supercomputing, pp 221\u2013228","DOI":"10.1145\/263580.263637"},{"key":"2678_CR23","unstructured":"Pugh W, Rosser E (1999) Iteration space slicing for locality. In: International Workshop on Languages and Compilers for Parallel Computing. Springer, pp 164\u2013184"},{"issue":"2","key":"2678_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 (1992) Tiling multidimensional itertion spaces for multicomputers. J Parallel Distrib Comput 16(2):108\u2013120","journal-title":"J Parallel Distrib Comput"},{"key":"2678_CR25","doi-asserted-by":"crossref","unstructured":"Verdoolaege S et al (2011) Transitive closures of affine integer tuple relations and their overapproximations. In: Proceedings of the 18th International Conference on Static Analysis, SAS\u201911. Springer, Berlin, pp 216\u2013232","DOI":"10.1007\/978-3-642-23702-7_18"},{"key":"2678_CR26","unstructured":"Verdoolaege S (2007) barvinok: user guide. Version 0.40. \n                    http:\/\/barvinok.gforge.inria.fr\/barvinok.pdf\n                    \n                  . Accessed 28 Dec 2017"},{"key":"2678_CR27","doi-asserted-by":"crossref","unstructured":"Verdoolaege S (2010) isl: an integer set library for the polyhedralmodel. In: Mathematical software\u2014ICMS 2010. Lecture notes in computer science, vol 6327. Springer, Berlin, pp 299\u2013302","DOI":"10.1007\/978-3-642-15582-6_49"},{"issue":"4","key":"2678_CR28","first-page":"54","volume":"9","author":"S Verdoolaege","year":"2013","unstructured":"Verdoolaege S, Carlos Juega J, Cohen A, Ignacio Gomez J, Tenllado C, Catthoor F (2013) Polyhedral parallel code generation for cuda. ACM Trans Arch Code Optim 9(4):54","journal-title":"ACM Trans Arch Code Optim"},{"key":"2678_CR29","unstructured":"Verdoolaege S, Grosser T (2012) Polyhedral extraction tool. In: Proceedings of the 2nd International Workshop on Polyhedral Compilation Techniques. Paris, France"},{"key":"2678_CR30","unstructured":"Wolf ME, Lam MS (1991) A data locality optimizing algorithm. In: Proceedings of the ACM SIGPLAN 1991 Conference on Programming Language Design and Implementation, PLDI \u201991. ACM, New York, NY, USA, pp 30\u201344"},{"key":"2678_CR31","unstructured":"Wonnacott D, Jin T, Lake A (2015) Automatic tiling of \u201cmostly-tileable\u201d loop nests. In: 5th International Workshop on Polyhedral Compilation Techniques, Amsterdam"},{"issue":"4","key":"2678_CR32","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1142\/S0129626497000401","volume":"7","author":"J Xue","year":"1997","unstructured":"Xue J (1997) On tiling as a loop transformation. Parallel Process Lett 7(4):409\u2013424","journal-title":"Parallel Process Lett"},{"key":"2678_CR33","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4337-4","volume-title":"Loop tiling for parallelism","author":"J Xue","year":"2000","unstructured":"Xue J (2000) Loop tiling for parallelism. Kluwer Academic Publishers, Norwell, MA, USA"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2678-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-018-2678-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-018-2678-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,10]],"date-time":"2019-11-10T19:22:00Z","timestamp":1573413720000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-018-2678-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,11]]},"references-count":33,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,5]]}},"alternative-id":["2678"],"URL":"https:\/\/doi.org\/10.1007\/s11227-018-2678-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,11]]},"assertion":[{"value":"11 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}