{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T08:08:33Z","timestamp":1761898113880,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032024350","type":"print"},{"value":"9783032024367","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T00:00:00Z","timestamp":1761955200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2026]]},"DOI":"10.1007\/978-3-032-02436-7_5","type":"book-chapter","created":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T06:50:15Z","timestamp":1761893415000},"page":"64-77","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tiling Parameters Prediction Using Machine Learning Techniques"],"prefix":"10.1007","author":[{"given":"Maksim","family":"Berezov","sequence":"first","affiliation":[]},{"given":"Corinne","family":"Ancourt","sequence":"additional","affiliation":[]},{"given":"Mikhail","family":"Kashchenko","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,11,1]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Ancourt, C., Irigoin, F.: Scanning polyhedra with do loops. In: Proceedings of the third ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, pp. 39\u201350 (1991)","DOI":"10.1145\/109625.109631"},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"Ansel, J., et al.: OpenTuner: an extensible framework for program autotuning. In: Proceedings of the 23rd International Conference on Parallel Architectures and Compilation, pp. 303\u2013316 (2014)","DOI":"10.1145\/2628071.2628092"},{"key":"5_CR3","unstructured":"Berezov, M., Ancourt, C., Zawalska, J., Savchenko, M.: Cola-gen: active learning techniques for automatic code generation of benchmarks. In: 13th Workshop on Parallel Programming and Run-Time Management Techniques for Many-Core Architectures and 11th Workshop on Design Tools and Architectures for Multicore Embedded Computing Platforms (PARMA-DITAM 2022). Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"issue":"1\u20132","key":"5_CR4","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0004-3702(97)00063-5","volume":"97","author":"AL Blum","year":"1997","unstructured":"Blum, A.L., Langley, P.: Selection of relevant features and examples in machine learning. Artif. Intell. 97(1\u20132), 245\u2013271 (1997)","journal-title":"Artif. Intell."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Chame, J., Moon, S.: A tile selection algorithm for data locality and cache interference. In: Proceedings of the 13th International Conference on Supercomputing, pp. 492\u2013499 (1999)","DOI":"10.1145\/305138.305245"},{"issue":"6","key":"5_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1145\/223428.207162","volume":"30","author":"S Coleman","year":"1995","unstructured":"Coleman, S., McKinley, K.S.: Tile size selection using cache organization and data layout. ACM SIGPLAN Not. 30(6), 279\u2013290 (1995)","journal-title":"ACM SIGPLAN Not."},{"key":"5_CR7","unstructured":"Dorogush, A.V., Ershov, V., Gulin, A.: CatBoost: gradient boosting with categorical features support. arXiv preprint arXiv:1810.11363 (2018)"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Gysi, T., Grosser, T., Hoefler, T.: Absinthe: learning an analytical performance model to fuse and tile stencil codes in one shot. In: 2019 28th International Conference on Parallel Architectures and Compilation Techniques (PACT), pp. 370\u2013382. IEEE (2019)","DOI":"10.1109\/PACT.2019.00036"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Hoste, K., Eeckhout, L.: Cole: compiler optimization level exploration. In: Proceedings of the 6th Annual IEEE\/ACM International Symposium on Code Generation and Optimization, pp. 165\u2013174 (2008)","DOI":"10.1145\/1356058.1356080"},{"issue":"3","key":"5_CR10","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1023\/B:SUPE.0000011388.54204.8e","volume":"27","author":"CH Hsu","year":"2004","unstructured":"Hsu, C.H., Kremer, U.: A quantitative analysis of tile size selection algorithms. J. Supercomput. 27(3), 279\u2013294 (2004)","journal-title":"J. Supercomput."},{"key":"5_CR11","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 (1988)","DOI":"10.1145\/73560.73588"},{"issue":"2\u20133","key":"5_CR12","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1002\/cpe.773","volume":"16","author":"PM Knijnenburg","year":"2004","unstructured":"Knijnenburg, P.M., Kisuki, T., Gallivan, K., O\u2019Boyle, M.F.: The effect of cache models on iterative compilation for combined tiling and unrolling. Concurr. Comput.: Pract. Exp. 16(2\u20133), 247\u2013270 (2004)","journal-title":"Concurr. Comput.: Pract. Exp."},{"key":"5_CR13","doi-asserted-by":"crossref","unstructured":"Lam, M.D., Rothberg, E.E., Wolf, M.E.: The cache performance and optimizations of blocked algorithms. ACM SIGOPS Oper. Syst. Rev. 25(Special Issue), 63\u201374 (1991)","DOI":"10.1145\/106974.106981"},{"issue":"2","key":"5_CR14","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1145\/360827.360844","volume":"17","author":"L Lamport","year":"1974","unstructured":"Lamport, L.: The parallel execution of do loops. Commun. ACM 17(2), 83\u201393 (1974)","journal-title":"Commun. ACM"},{"key":"5_CR15","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.jpdc.2018.06.005","volume":"121","author":"S Liu","year":"2018","unstructured":"Liu, S., Cui, Y., Jiang, Q., Wang, Q., Wu, W.: An efficient tile size selection model based on machine learning. J. Parallel Distrib. Comput. 121, 27\u201341 (2018)","journal-title":"J. Parallel Distrib. Comput."},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Malik, A.M.: Optimal tile size selection problem using machine learning. In: 2012 11th International Conference on Machine Learning and Applications, vol.\u00a02, pp. 275\u2013280. IEEE (2012)","DOI":"10.1109\/ICMLA.2012.214"},{"issue":"4","key":"5_CR17","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2541228.2555292","volume":"10","author":"S Mehta","year":"2013","unstructured":"Mehta, S., Beeraka, G., Yew, P.C.: Tile size selection revisited. ACM Trans. Architect. Code Optim. (TACO) 10(4), 1\u201327 (2013)","journal-title":"ACM Trans. Architect. Code Optim. (TACO)"},{"key":"5_CR18","unstructured":"ParisTech, M.: Pips: automatic parallelizer and code transformation framework (2013)"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Pouchet, L.N., Bondhugula, U., Bastoul, C., Cohen, A., Ramanujam, J., Sadayappan, P.: Combined iterative and model-driven optimization in an automatic parallelization framework. In: SC\u201910: Proceedings of the 2010 ACM\/IEEE International Conference for High Performance Computing, Networking, Storage and Analysis, pp. 1\u201311. IEEE (2010)","DOI":"10.1109\/SC.2010.14"},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Qasem, A., Kennedy, K.: Profitable loop fusion and tiling using model-driven empirical search. In: Proceedings of the 20th Annual International Conference on Supercomputing, pp. 249\u2013258 (2006)","DOI":"10.1145\/1183401.1183437"},{"key":"5_CR21","unstructured":"Rahman, M., Pouchet, L.N., Sadayappan, P.: Neural network assisted tile size selection. In: International Workshop on Automatic Performance Tuning (IWAPT\u20192010). Springer, Berkeley (2010)"},{"key":"5_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-49051-7_12","volume-title":"Compiler Construction","author":"G Rivera","year":"1999","unstructured":"Rivera, G., Tseng, C.-W.: A comparison of compiler tiling algorithms. In: J\u00e4hnichen, S. (ed.) CC 1999. LNCS, vol. 1575, pp. 168\u2013182. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-540-49051-7_12"},{"key":"5_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1007\/978-3-642-28652-0_6","volume-title":"Compiler Construction","author":"J Shirako","year":"2012","unstructured":"Shirako, J., Sharma, K., Fauzia, N., Pouchet, L.-N., Ramanujam, J., Sadayappan, P., Sarkar, V.: Analytical bounds for optimal tile size selection. In: O\u2019Boyle, M. (ed.) CC 2012. LNCS, vol. 7210, pp. 101\u2013121. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28652-0_6"},{"key":"5_CR24","doi-asserted-by":"crossref","unstructured":"Teixeira, S.T., Ancourt, C., Padua, D., Gropp, W.: Locus: a system and a language for program optimization. In: 2019 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO), pp. 217\u2013228. IEEE (2019)","DOI":"10.1109\/CGO.2019.8661203"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"Tiwari, A., Chen, C., Chame, J., Hall, M., Hollingsworth, J.K.: A scalable auto-tuning framework for compiler optimization. In: 2009 IEEE International Symposium on Parallel & Distributed Processing, pp. 1\u201312. IEEE (2009)","DOI":"10.1109\/IPDPS.2009.5161054"},{"key":"5_CR26","unstructured":"Wright, R.E.: Logistic regression (1995)"},{"key":"5_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1007\/BFb0025880","volume-title":"Languages and Compilers for Parallel Computing","author":"Y-Q Yang","year":"1995","unstructured":"Yang, Y.-Q., Ancourt, C., Irigoin, F.: Minimal data dependence abstractions for loop transformations. In: Pingali, K., Banerjee, U., Gelernter, D., Nicolau, A., Padua, D. (eds.) LCPC 1994. LNCS, vol. 892, pp. 201\u2013216. Springer, Heidelberg (1995). https:\/\/doi.org\/10.1007\/BFb0025880"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Yotov, K., et al.: Is search really necessary to generate high-performance BLAS? Proc. IEEE 93(2), 358\u2013386 (2005)","DOI":"10.1109\/JPROC.2004.840444"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Yuki, T., Renganarayanan, L., Rajopadhye, S., Anderson, C., Eichenberger, A.E., O\u2019Brien, K.: Automatic creation of tile size selection models. In: Proceedings of the 8th Annual IEEE\/ACM International Symposium on Code Generation and Optimization, pp. 190\u2013199 (2010)","DOI":"10.1145\/1772954.1772982"}],"container-title":["Lecture Notes in Computer Science","Languages and Compilers for Parallel Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-02436-7_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:03:40Z","timestamp":1761894220000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-02436-7_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,1]]},"ISBN":["9783032024350","9783032024367"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-02436-7_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,1]]},"assertion":[{"value":"1 November 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LCPC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Languages and Compilers for Parallel Computing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lexington, KY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 October 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"lcpc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.lcpcworkshop.org\/LCPC23\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}