{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,12]],"date-time":"2025-06-12T04:13:12Z","timestamp":1749701592010,"version":"3.41.0"},"publisher-location":"Cham","reference-count":26,"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_28","type":"book-chapter","created":{"date-parts":[[2016,10,19]],"date-time":"2016-10-19T09:32:59Z","timestamp":1476869579000},"page":"305-314","source":"Crossref","is-referenced-by-count":0,"title":["Loop Nest Tiling for Image Processing and Communication Applications"],"prefix":"10.1007","author":[{"given":"Wlodzimierz","family":"Bielecki","sequence":"first","affiliation":[]},{"given":"Marek","family":"Palkowski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,10,20]]},"reference":[{"key":"28_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, pp. 7\u201316, Juan-les-Pins, September 2004","DOI":"10.1109\/PACT.2004.1342537"},{"key":"28_CR2","doi-asserted-by":"crossref","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":"28_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). doi: 10.1007\/978-3-642-11970-5_16"},{"key":"28_CR4","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/978-3-642-16295-4_35","volume-title":"Image Processing and Communications Challenges 2","author":"W Bielecki","year":"2010","unstructured":"Bielecki, W., Palkowski, M.: Coarse-grained loop parallelization for image processing and communication applications. In: Chora\u015b, R.S. (ed.) Image Processing and Communications Challenges 2, pp. 307\u2013314. Springer, Heidelberg (2010)"},{"key":"28_CR5","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"},{"issue":"9","key":"28_CR6","doi-asserted-by":"crossref","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":"28_CR7","doi-asserted-by":"crossref","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."},{"key":"28_CR8","doi-asserted-by":"crossref","unstructured":"Chang, C.W., Chen, J.J., Kuo, T.W., Falk, H.: Real-time partitioned scheduling on multi-core systems with local and global memories. In: 2013 18th Asia and South Pacific Design Automation Conference (ASP-DAC), pp. 467\u2013472, January 2013","DOI":"10.1109\/ASPDAC.2013.6509640"},{"issue":"5","key":"28_CR9","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: I. one-dimensional time. Int. J. Parallel Program. 21(5), 313\u2013348 (1992)","journal-title":"Int. J. Parallel Program."},{"issue":"5","key":"28_CR10","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: II. multi-dimensional time. Int. J. Parallel Program. 21(5), 389\u2013420 (1992)","journal-title":"Int. J. Parallel Program."},{"key":"28_CR11","unstructured":"Griebl, M.: Automatic parallelization of loop programs for distributed memory architectures (2004)"},{"issue":"4","key":"28_CR12","doi-asserted-by":"crossref","first-page":"12:1","DOI":"10.1145\/2743016","volume":"37","author":"T Grosser","year":"2015","unstructured":"Grosser, T., Verdoolaege, S., Cohen, A.: Polyhedral AST generation is more than scanning polyhedra. ACM Trans. Program. Lang. Syst. 37(4), 12:1\u201312:50 (2015)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"28_CR13","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, pp. 319\u2013329, POPL 1988, NY, USA. ACM, New York (1988)","DOI":"10.1145\/73560.73588"},{"key":"28_CR14","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)"},{"key":"28_CR15","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"},{"issue":"4","key":"28_CR16","doi-asserted-by":"crossref","first-page":"26:1","DOI":"10.1145\/1550987.1550989","volume":"8","author":"AC Murray","year":"2009","unstructured":"Murray, A.C., Bennett, R.V., Franke, B., Topham, N.: Code transformation and instruction set extension. ACM Trans. Embed. Comput. Syst. 8(4), 26:1\u201326:31 (2009)","journal-title":"ACM Trans. Embed. Comput. Syst."},{"key":"28_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"72","DOI":"10.1007\/978-3-642-35893-7_7","volume-title":"Facing the Multicore-Challenge III","author":"M Palkowski","year":"2013","unstructured":"Palkowski, M.: Impact of variable privatization on extracting synchronization-free slices for multi-core computers. In: Keller, R., Kramer, D., Weiss, J.-P. (eds.) Facing the Multicore-Challenge III. LNCS, vol. 7686, pp. 72\u201383. Springer, Heidelberg (2013). doi: 10.1007\/978-3-642-35893-7_7"},{"key":"28_CR18","doi-asserted-by":"crossref","unstructured":"Park, E., Pouchet, L.N., Cavazos, J., Cohen, A., Sadayappan, P.: Predictive modeling in a polyhedral optimization space. In: 9th IEEE\/ACM International Symposium on Code Generation and Optimization (CGO 2011), pp. 119\u2013129. IEEE Computer Society press, Chamonix, France, April 2011","DOI":"10.1109\/CGO.2011.5764680"},{"key":"28_CR19","unstructured":"en Peng, S.H.: UTDSP: A VLIW programmable DSP processor. Thesis, University of Toronto (1999)"},{"key":"28_CR20","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 and part ii, multi-dimensional time. In: International Symposium on Code Generation and Optimization (CGO 2007), pp. 144\u2013156, March 2007","DOI":"10.1109\/CGO.2007.21"},{"key":"28_CR21","unstructured":"Pouchet, L.N., Bastoul, C., Cavazos, J., Cohen, A.: A note on the performance distribution of affine schedules. In: 2nd Workshop on Statistical and Machine Learning Approaches to Architectures and Compilation (SMART 2008), G\u00f6teborg, Sweden, January 2008"},{"key":"28_CR22","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":"1994","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.) LCPC 1993. LNCS, vol. 768, pp. 546\u2013566. Springer, Heidelberg (1994). doi: 10.1007\/3-540-57659-2_31"},{"key":"28_CR23","unstructured":"Verdoolaege, S.: Integer set library - manual. Technical report (2011). www.kotnet.org\/~skimo\/\/isl\/manual.pdf"},{"key":"28_CR24","unstructured":"Wonnacott, D.G., Strout, M.M., 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) (2013)"},{"issue":"4","key":"28_CR25","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1142\/S0129626497000401","volume":"7","author":"J Xue","year":"1997","unstructured":"Xue, J.: On tiling as a loop transformation. Parallel Process. Lett. 7(4), 409\u2013424 (1997)","journal-title":"Parallel Process. Lett."},{"key":"28_CR26","unstructured":"UTDSP benchmark suite. http:\/\/www.eecg.toronto.edu\/~corinna\/DSP\/infrastructure\/UTDSP.html"}],"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_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T17:07:00Z","timestamp":1749661620000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-48429-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,10,20]]},"ISBN":["9783319484280","9783319484297"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-48429-7_28","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]]}}}