{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T07:58:12Z","timestamp":1725868692773},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319484280"},{"type":"electronic","value":"9783319484297"}],"license":[{"start":{"date-parts":[[2016,10,20]],"date-time":"2016-10-20T00:00:00Z","timestamp":1476921600000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-48429-7_29","type":"book-chapter","created":{"date-parts":[[2016,10,19]],"date-time":"2016-10-19T05:32:59Z","timestamp":1476855179000},"page":"315-327","source":"Crossref","is-referenced-by-count":0,"title":["Tile Merging Technique to Generate Valid Tiled Code by Means of the Transitive Closure of a Dependence Graph"],"prefix":"10.1007","author":[{"given":"W\u0142odzimierz","family":"Bielecki","sequence":"first","affiliation":[]},{"given":"Piotr","family":"Skotnicki","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,20]]},"reference":[{"key":"29_CR1","doi-asserted-by":"crossref","first-page":"52:1","DOI":"10.1145\/2400682.2400711","volume":"9","author":"R Baghdadi","year":"2013","unstructured":"Baghdadi, R., Cohen, A., Verdoolaege, S., Trifunovi\u0107, K.: Improved loop tiling based on the removal of spurious false dependences. ACM Trans. Archit. Code Optim. 9, 52:1\u201352:26 (2013). ACM, New York","journal-title":"ACM Trans. Archit. Code Optim."},{"key":"29_CR2","series-title":"Advances in Intelligent Systems and Computing","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-319-15147-2_26","volume-title":"Soft Computing in Computer and Information Science","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. In: Wili\u0144ski, A., Fray, I., Peja\u015b, J. (eds.) Soft Computing in Computer and Information Science. AISC, vol. 342, pp. 309\u2013320. Springer, Heidelberg (2015). doi: 10.1007\/978-3-319-15147-2_26"},{"key":"29_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-30397-5_7","volume-title":"Facing the Multicore - Challenge II","author":"W Bielecki","year":"2012","unstructured":"Bielecki, W., Palkowski, M.: Using free scheduling for programming graphic cards. In: Keller, R., Kramer, D., Weiss, J.-P. (eds.) Facing the Multicore - Challenge II. LNCS, vol. 7174, pp. 72\u201383. Springer, Heidelberg (2012). doi: 10.1007\/978-3-642-30397-5_7"},{"key":"29_CR4","doi-asserted-by":"crossref","first-page":"313","DOI":"10.1007\/BF01407835","volume":"21","author":"P Feautrier","year":"1992","unstructured":"Feautrier, P.: Some efficient solutions to the affine scheduling problem. Part I. One-dimensional time. Int. J. Parallel Prog. 21, 313\u2013348 (1992). Kluwer Academic Publishers, USA","journal-title":"Int. J. Parallel Prog."},{"key":"29_CR5","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1007\/BF01379404","volume":"21","author":"P Feautrier","year":"1992","unstructured":"Feautrier, P.: Some efficient solutions to the affine scheduling problem. Part II. Multidimensional time. Int. J. Parallel Prog. 21, 389\u2013420 (1992). Kluwer Academic Publishers, USA","journal-title":"Int. J. Parallel Prog."},{"key":"29_CR6","doi-asserted-by":"crossref","unstructured":"Irigoin, F., Triolet, R.: Supernode partitioning. In: 15th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, pp. 319\u2013329. ACM, San Diego (1988)","DOI":"10.1145\/73560.73588"},{"key":"29_CR7","unstructured":"Mullapudi, R.T., Bondhugula, U.: Tiling for dynamic scheduling. In: 4th International Workshop on Polyhedral Compilation Techniques, Vienna, Austria (2014)"},{"key":"29_CR8","unstructured":"OpenMP Architecture Review Board: OpenMP Application ProgramInterface Version 3.0 (2008). http:\/\/www.openmp.org\/mp-documents\/spec30.pdf"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Pa\u0142kowski, M., Klimek, T., Bielecki, W.: TRACO: an automatic loop nest parallelizer for numerical applications. In: Federated Conference on Computer Science and Information Systems 2015, pp. 681\u2013686 (2015)","DOI":"10.15439\/2015F34"},{"key":"29_CR10","unstructured":"PolyBench\/C: The Polyhedral Benchmark suite (2015). http:\/\/web.cse.ohio-state.edu\/~pouchet\/software\/polybench"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Pugh, W., Rosser, E.: Iteration space slicing and its application to communication optimization. In: 11th International Conference on Supercomputing, pp. 221\u2013228. ACM (1997)","DOI":"10.1145\/263580.263637"},{"key":"29_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-15582-6_49","volume-title":"Mathematical Software \u2013 ICMS 2010","author":"S Verdoolaege","year":"2010","unstructured":"Verdoolaege, S.: isl: An integer set library for the polyhedral model. In: Fukuda, K., Hoeven, J., Joswig, M., Takayama, N. (eds.) ICMS 2010. LNCS, vol. 6327, pp. 299\u2013302. Springer, Heidelberg (2010). doi: 10.1007\/978-3-642-15582-6_49"},{"key":"29_CR13","unstructured":"Verdoolaege, S.: Presburger Formulas and Polyhedral Compilation, v0.02. Polly Labs and KU Leuven (2016)"},{"key":"29_CR14","unstructured":"Verdoolaege, S., Grosser, T.: Polyhedral extraction tool. In: 2nd International Workshop on Polyhedral Compilation Techniques, Paris, France (2012)"},{"key":"29_CR15","unstructured":"Wonnacott, D., Jin, T., Lake, A.: Automatic tiling of mostly-tileable loop nests. In: 5th International Workshop on Polyhedral Compilation Techniques, Amsterdam, The Netherlands (2015)"}],"container-title":["Advances in Intelligent Systems and Computing","Hard and Soft Computing for Artificial Intelligence, Multimedia and Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-48429-7_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T21:32:01Z","timestamp":1498339921000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48429-7_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,20]]},"ISBN":["9783319484280","9783319484297"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48429-7_29","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2016,10,20]]}}}