{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T16:14:43Z","timestamp":1762013683529,"version":"build-2065373602"},"reference-count":57,"publisher":"Springer Science and Business Media LLC","issue":"10","license":[{"start":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T00:00:00Z","timestamp":1557705600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T00:00:00Z","timestamp":1557705600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100010661","name":"Horizon 2020 Framework Programme","doi-asserted-by":"publisher","award":["H2020-ICT-20152 contract 687584"],"award-info":[{"award-number":["H2020-ICT-20152 contract 687584"]}],"id":[{"id":"10.13039\/100010661","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2019,10]]},"DOI":"10.1007\/s11227-019-02880-z","type":"journal-article","created":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T02:35:56Z","timestamp":1557801356000},"page":"6710-6745","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["A methodology correlating code optimizations with data memory accesses, execution time and energy consumption"],"prefix":"10.1007","volume":"75","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9591-913X","authenticated-orcid":false,"given":"Vasilios","family":"Kelefouras","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Karim","family":"Djemame","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,5,13]]},"reference":[{"issue":"1","key":"2880_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11265-012-0694-2","volume":"70","author":"A Art\u00e9s","year":"2013","unstructured":"Art\u00e9s A, Ayala JL, Huisken J, Catthoor F (2013) Survey of low-energy techniques for instruction memory organisations in embedded systems. Signal Process Syst 70(1):1\u201319","journal-title":"Signal Process Syst"},{"key":"2880_CR2","doi-asserted-by":"publisher","unstructured":"Ashouri AH, Bignoli A, Palermo G, Silvano C (2016) Predictive modeling methodology for compiler phase-ordering. In: Proceedings of the 7th Workshop on Parallel Programming and Run-Time Management Techniques for Many-core Architectures and the 5th Workshop on Design Tools and Architectures For Multicore Embedded Computing Platforms, PARMA-DITAM \u201916. ACM, New York, NY, USA, pp 7\u201312. \n                    https:\/\/doi.org\/10.1145\/2872421.2872424","DOI":"10.1145\/2872421.2872424"},{"issue":"3","key":"2880_CR3","doi-asserted-by":"publisher","first-page":"29:1","DOI":"10.1145\/3124452","volume":"14","author":"AH Ashouri","year":"2017","unstructured":"Ashouri AH, Bignoli A, Palermo G, Silvano C, Kulkarni S, Cavazos J (2017) Micomp: mitigating the compiler phase-ordering problem using optimization sub-sequences and machine learning. ACM Trans Archit Code Optim 14(3):29:1\u201329:28. \n                    https:\/\/doi.org\/10.1145\/3124452","journal-title":"ACM Trans Archit Code Optim"},{"issue":"5","key":"2880_CR4","doi-asserted-by":"publisher","first-page":"96:1","DOI":"10.1145\/3197978","volume":"51","author":"AH Ashouri","year":"2018","unstructured":"Ashouri AH, Killian W, Cavazos J, Palermo G, Silvano C (2018) A survey on compiler autotuning using machine learning. ACM Comput Surv 51(5):96:1\u201396:42. \n                    https:\/\/doi.org\/10.1145\/3197978","journal-title":"ACM Comput Surv"},{"issue":"2","key":"2880_CR5","doi-asserted-by":"publisher","first-page":"21:1","DOI":"10.1145\/2928270","volume":"13","author":"AH Ashouri","year":"2016","unstructured":"Ashouri AH, Mariani G, Palermo G, Park E, Cavazos J, Silvano C (2016) Cobayn: compiler autotuning framework using Bayesian networks. ACM Trans Archit Code Optim 13(2):21:1\u201321:25. \n                    https:\/\/doi.org\/10.1145\/2928270","journal-title":"ACM Trans Archit Code Optim"},{"key":"2880_CR6","doi-asserted-by":"publisher","unstructured":"Balaprakash P, Wild SM, Hovland PD (2013) An experimental study of global and local search algorithms in empirical performance tuning. In: High Performance Computing for Computational Science - VECPAR 2012, 10th International Conference, Revised Selected Papers, Lecture Notes in Computer Science. Springer, pp 261\u2013269. \n                    https:\/\/doi.org\/10.1007\/978-3-642-38718-0_26","DOI":"10.1007\/978-3-642-38718-0_26"},{"key":"2880_CR7","doi-asserted-by":"publisher","unstructured":"Bao B, Ding C (2013) Defensive loop tiling for shared cache. In: Proceedings of the 2013 IEEE\/ACM International Symposium on Code Generation and Optimization (CGO), CGO \u201913. IEEE Computer Society, Washington, DC, USA, pp 1\u201311. \n                    https:\/\/doi.org\/10.1109\/CGO.2013.6495008","DOI":"10.1109\/CGO.2013.6495008"},{"issue":"2","key":"2880_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2024716.2024718","volume":"39","author":"N Binkert","year":"2011","unstructured":"Binkert N, Beckmann B, Black G, Reinhardt SK, Saidi A, Basu A, Hestness J, Hower DR, Krishna T, Sardashti S, Sen R, Sewell K, Shoaib M, Vaish N, Hill MD, Wood DA (2011) The gem5 simulator. SIGARCH Comput Archit News 39(2):1\u20137. \n                    https:\/\/doi.org\/10.1145\/2024716.2024718","journal-title":"SIGARCH Comput Archit News"},{"issue":"6","key":"2880_CR9","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 (2008) A practical automatic polyhedral parallelizer and locality optimizer. SIGPLAN Not 43(6):101\u2013113. \n                    https:\/\/doi.org\/10.1145\/1379022.1375595","journal-title":"SIGPLAN Not"},{"key":"2880_CR10","unstructured":"Bondhugula U, Ramanujam J et\u00a0al (2008) Pluto: a practical and fully automatic polyhedral program optimization system. In: Proceedings of the ACM SIGPLAN 2008 Conference on Programming Language Design and Implementation (PLDI 2008)"},{"key":"2880_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4020-5869-1_7","volume-title":"Layer assignment techniques for low energy in multi-layered memory organizations","author":"E Brockmeyer","year":"2007","unstructured":"Brockmeyer E, Durinck B, Corporaal H, Catthoor F (2007) Layer assignment techniques for low energy in multi-layered memory organizations. Springer, Dordrecht"},{"key":"2880_CR12","doi-asserted-by":"publisher","unstructured":"Cavazos J, Fursin G, Agakov F, Bonilla E, O\u2019Boyle MFP, Temam O (2007) Rapidly selecting good compiler optimizations using performance counters. In: Proceedings of the International Symposium on Code Generation and Optimization, CGO \u201907. IEEE Computer Society, Washington, DC, USA, pp 185\u2013197. \n                    https:\/\/doi.org\/10.1109\/CGO.2007.32","DOI":"10.1109\/CGO.2007.32"},{"key":"2880_CR13","unstructured":"Chen C, Chame J, Hall M (2008) Chill: a framework for composing high-level loop transformations. Technical report"},{"key":"2880_CR14","doi-asserted-by":"crossref","unstructured":"de Mesmay F, Voronenko Y, P\u00fcschel M (2010) Offline library adaptation using automatically generated heuristics. In: International Parallel and Distributed Processing Symposium (IPDPS), pp 1\u201310","DOI":"10.1109\/IPDPS.2010.5470479"},{"key":"2880_CR15","doi-asserted-by":"publisher","unstructured":"Fursin G, O\u2019Boyle MFP, Knijnenburg PMW (2002) Evaluating iterative compilation. In: Languages and Compilers for Parallel Computing, 15th Workshop, LCPC 2002, College Park, MD, USA, July 25\u201327, 2002, Revised Papers, pp 362\u2013376. \n                    https:\/\/doi.org\/10.1007\/11596110_24","DOI":"10.1007\/11596110_24"},{"key":"2880_CR16","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626412500107","author":"T Grosser","year":"2012","unstructured":"Grosser T, Gr\u00f6\u00dflinger A, Lengauer C (2012) Polly\u2013performing polyhedral optimizations on a low-level intermediate representation. Parallel Process Lett. \n                    https:\/\/doi.org\/10.1142\/S0129626412500107","journal-title":"Parallel Process Lett"},{"key":"2880_CR17","doi-asserted-by":"publisher","unstructured":"Haneda M, Khnijnenburg PMW, Wijshoff HAG (2005) Automatic selection of compiler options using non-parametric inferential statistics. In: Proceedings of the 14th International Conference on Parallel Architectures and Compilation Techniques, PACT \u201905. IEEE Computer Society, Washington, DC, USA, pp 123\u2013132. \n                    https:\/\/doi.org\/10.1109\/PACT.2005.9","DOI":"10.1109\/PACT.2005.9"},{"key":"2880_CR18","doi-asserted-by":"crossref","unstructured":"Hartono A, Norris B, Sadayappan P (2009) Annotation-based empirical performance tuning using Orio. In: IEEE International Symposium on Parallel & Distributed Processing. IEEE, pp 1\u201311","DOI":"10.1109\/IPDPS.2009.5161004"},{"key":"2880_CR19","doi-asserted-by":"publisher","DOI":"10.1145\/1278349.1278363","author":"Q Hu","year":"2007","unstructured":"Hu Q, Kjeldsberg PG, Vandecappelle A, Palkovic M, Catthoor F (2007) Incremental hierarchical memory size estimation for steering of loop transformations. ACM Trans Des Autom Electron Syst. \n                    https:\/\/doi.org\/10.1145\/1278349.1278363","journal-title":"ACM Trans Des Autom Electron Syst"},{"key":"2880_CR20","doi-asserted-by":"publisher","unstructured":"Kandemir M, Muralidhara SP, Narayanan SHK, Zhang Y, Ozturk O (2009) Optimizing shared cache behavior of chip multiprocessors. In: MICRO 42: Proceedings of the 42nd Annual IEEE\/ACM International Symposium on Microarchitecture. ACM, New York, NY, USA, pp 505\u2013516. \n                    https:\/\/doi.org\/10.1145\/1669112.1669176","DOI":"10.1145\/1669112.1669176"},{"issue":"3","key":"2880_CR21","doi-asserted-by":"publisher","first-page":"72:1","DOI":"10.1145\/3202663","volume":"17","author":"V Kelefouras","year":"2018","unstructured":"Kelefouras V, Georgios K, Nikolaos V (2018) Combining software cache partitioning and loop tiling for effective shared cache management. ACM Trans Embed Comput Syst 17(3):72:1\u201372:25. \n                    https:\/\/doi.org\/10.1145\/3202663","journal-title":"ACM Trans Embed Comput Syst"},{"key":"2880_CR22","doi-asserted-by":"publisher","unstructured":"Kim D, Renganarayanan L, Rostron D, Rajopadhye S, Strout MM (2007) Multi-level tiling: M for the price of one. In: Proceedings of the 2007 ACM\/IEEE Conference on Supercomputing, SC \u201907. ACM, New York, NY, USA, pp 51:1\u201351:12. \n                    https:\/\/doi.org\/10.1145\/1362622.1362691","DOI":"10.1145\/1362622.1362691"},{"issue":"2\u20133","key":"2880_CR23","first-page":"247","volume":"16","author":"PMW Knijnenburg","year":"2004","unstructured":"Knijnenburg PMW, Kisuki T, Gallivan K, O\u2019Boyle MFP (2004) The effect of cache models on iterative compilation for combined tiling and unrolling. j-CCPE 16(2\u20133):247\u2013270","journal-title":"j-CCPE"},{"key":"2880_CR24","doi-asserted-by":"publisher","unstructured":"Krzikalla O, Feldhoff K, M\u00fcller-Pfefferkorn R, Nagel WE (2012) Scout: a source-to-source transformator for simd-optimizations. In: Proceedings of the 2011 International Conference on Parallel Processing\u2014vol 2, Euro-Par\u201911. Springer, pp 137\u2013145. \n                    https:\/\/doi.org\/10.1007\/978-3-642-29740-3_17","DOI":"10.1007\/978-3-642-29740-3_17"},{"issue":"6","key":"2880_CR25","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1145\/996893.996863","volume":"39","author":"P Kulkarni","year":"2004","unstructured":"Kulkarni P, Hines S, Hiser J, Whalley D, Davidson J, Jones D (2004) Fast searches for effective optimization phase sequences. SIGPLAN Not 39(6):171\u2013182. \n                    https:\/\/doi.org\/10.1145\/996893.996863","journal-title":"SIGPLAN Not"},{"issue":"1","key":"2880_CR26","doi-asserted-by":"publisher","first-page":"1:1","DOI":"10.1145\/1509864.1509865","volume":"6","author":"PA Kulkarni","year":"2009","unstructured":"Kulkarni PA, Whalley DB, Tyson GS, Davidson JW (2009) Practical exhaustive optimization phase order exploration and evaluation. ACM Trans Archit Code Optim 6(1):1:1\u20131:36. \n                    https:\/\/doi.org\/10.1145\/1509864.1509865","journal-title":"ACM Trans Archit Code Optim"},{"issue":"10","key":"2880_CR27","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1145\/2398857.2384628","volume":"47","author":"S Kulkarni","year":"2012","unstructured":"Kulkarni S, Cavazos J (2012) Mitigating the compiler optimization phase-ordering problem using machine learning. SIGPLAN Not 47(10):147\u2013162. \n                    https:\/\/doi.org\/10.1145\/2398857.2384628","journal-title":"SIGPLAN Not"},{"key":"2880_CR28","doi-asserted-by":"publisher","unstructured":"Leather H, Bonilla E, O\u2019Boyle M (2009) Automatic feature generation for machine learning based optimizing compilation. In: Proceedings of the 7th Annual IEEE\/ACM International Symposium on Code Generation and Optimization, CGO \u201909. IEEE Computer Society, Washington, DC, USA, pp 81\u201391. \n                    https:\/\/doi.org\/10.1109\/CGO.2009.21","DOI":"10.1109\/CGO.2009.21"},{"issue":"1","key":"2880_CR29","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/2536688","volume":"11","author":"H Leather","year":"2014","unstructured":"Leather H, Bonilla E, O\u2019boyle M (2014) Automatic feature generation for machine learning-based optimising compilation. ACM Trans Archit Code Optim 11(1):14:1\u201314:32. \n                    https:\/\/doi.org\/10.1145\/2536688","journal-title":"ACM Trans Archit Code Optim"},{"key":"2880_CR30","doi-asserted-by":"publisher","unstructured":"Li S, Ahn JH, Strong RD, Brockman JB, Tullsen DM, Jouppi NP (2009) Mcpat: an integrated power, area, and timing modeling framework for multicore and manycore architectures. In: Proceedings of the 42nd Annual IEEE\/ACM International Symposium on Microarchitecture, MICRO 42. ACM, New York, NY, USA, pp 469\u2013480. \n                    https:\/\/doi.org\/10.1145\/1669112.1669172","DOI":"10.1145\/1669112.1669172"},{"key":"2880_CR31","doi-asserted-by":"crossref","unstructured":"Lidman J, Quinlan DJ, Liao C, McKee SA (2012) Rose:: Fttransform-a source-to-source translation framework for exascale fault-tolerance research. In: 2012 IEEE\/IFIP 42nd International Conference on Dependable Systems and Networks Workshops (DSN-W). IEEE, pp 1\u20136","DOI":"10.1109\/DSNW.2012.6264672"},{"key":"2880_CR32","doi-asserted-by":"crossref","unstructured":"Liu J, Zhang Y, Ding W, Kandemir MT (2011) On-chip cache hierarchy-aware tile scheduling for multicore machines. In: CGO. IEEE Computer Society, pp 161\u2013170. \n                    http:\/\/dblp.uni-trier.de\/db\/conf\/cgo\/cgo2011.html","DOI":"10.1109\/CGO.2011.5764684"},{"key":"2880_CR33","doi-asserted-by":"publisher","unstructured":"Namjoshi KS, Singhania N (2016) Loopy: programmable and formally verified loop transformations. In: Static Analysis\u201423rd International Symposium, SAS 2016, Edinburgh, UK, September 8\u201310, 2016, Proceedings, pp 383\u2013402. \n                    https:\/\/doi.org\/10.1007\/978-3-662-53413-7_19","DOI":"10.1007\/978-3-662-53413-7_19"},{"key":"2880_CR34","doi-asserted-by":"publisher","unstructured":"Nobre R, Martins LGA, Cardoso JaMP (2015) Use of previously acquired positioning of optimizations for phase ordering exploration. In: Proceedings of the 18th International Workshop on Software and Compilers for Embedded Systems, SCOPES \u201915, pp 58\u201367. \n                    https:\/\/doi.org\/10.1145\/2764967.2764978","DOI":"10.1145\/2764967.2764978"},{"key":"2880_CR35","unstructured":"Nobre R, Reis L, Cardoso JMP (2016) Compiler phase ordering as an orthogonal approach for reducing energy consumption. In: Proceedings of the 19th Workshop on Compilers for Parallel Computing (CPC\u201916)"},{"key":"2880_CR36","doi-asserted-by":"crossref","unstructured":"Ogilvie WF, Petoumenos P, Wang Z, Leather H (2017) Minimizing the cost of iterative compilation with active learning. In: Proceedings of the 2017 International Symposium on Code Generation and Optimization, CGO \u201917. IEEE Press, Piscataway, NJ, USA, pp 245\u2013256. \n                    http:\/\/dl.acm.org\/citation.cfm?id=3049832.3049859","DOI":"10.1109\/CGO.2017.7863744"},{"key":"2880_CR37","doi-asserted-by":"publisher","DOI":"10.1145\/1497561.1497565","author":"M Palkovic","year":"2009","unstructured":"Palkovic M, Catthoor F, Corporaal H (2009) Trade-offs in loop transformations. ACM Trans Des Autom Electr Syst. \n                    https:\/\/doi.org\/10.1145\/1497561.1497565","journal-title":"ACM Trans Des Autom Electr Syst"},{"key":"2880_CR38","doi-asserted-by":"publisher","unstructured":"Park E, Kulkarni S, Cavazos J (2011) An evaluation of different modeling techniques for iterative compilation. In: Proceedings of the 14th International Conference on Compilers, Architectures and Synthesis for Embedded Systems, CASES \u201911. ACM, New York, NY, USA, pp 65\u201374. \n                    https:\/\/doi.org\/10.1145\/2038698.2038711","DOI":"10.1145\/2038698.2038711"},{"key":"2880_CR39","unstructured":"Pouchet LN (2012) Polybench\/c benchmark suite. \n                    http:\/\/web.cs.ucla.edu\/~pouchet\/software\/polybench\/\n                    \n                  . Accessed May 2019"},{"issue":"6","key":"2880_CR40","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/1379022.1375594","volume":"43","author":"LN Pouchet","year":"2008","unstructured":"Pouchet LN, Bastoul C, Cohen A, Cavazos J (2008) Iterative optimization in the polyhedral model: part II, multidimensional time. SIGPLAN Not 43(6):90\u2013100. \n                    https:\/\/doi.org\/10.1145\/1379022.1375594","journal-title":"SIGPLAN Not"},{"key":"2880_CR41","doi-asserted-by":"publisher","unstructured":"Pouchet LN, Bastoul C, Cohen A, Vasilache N (2007) Iterative optimization in the polyhedral model: part I, one-dimensional time. In: Proceedings of the International Symposium on Code Generation and Optimization, CGO \u201907. IEEE Computer Society, Washington, DC, USA, pp 144\u2013156. \n                    https:\/\/doi.org\/10.1109\/CGO.2007.21","DOI":"10.1109\/CGO.2007.21"},{"issue":"1","key":"2880_CR42","doi-asserted-by":"publisher","first-page":"549","DOI":"10.1145\/1925844.1926449","volume":"46","author":"LN Pouchet","year":"2011","unstructured":"Pouchet LN, Bondhugula U, Bastoul C, Cohen A, Ramanujam J, Sadayappan P, Vasilache N (2011) Loop transformations: convexity, pruning and optimization. SIGPLAN Not 46(1):549\u2013562. \n                    https:\/\/doi.org\/10.1145\/1925844.1926449","journal-title":"SIGPLAN Not"},{"issue":"4","key":"2880_CR43","doi-asserted-by":"publisher","first-page":"56:1","DOI":"10.1145\/2400682.2400715","volume":"9","author":"S Purini","year":"2013","unstructured":"Purini S, Jain L (2013) Finding good optimization sequences covering program space. ACM Trans Archit Code Optim 9(4):56:1\u201356:23. \n                    https:\/\/doi.org\/10.1145\/2400682.2400715","journal-title":"ACM Trans Archit Code Optim"},{"issue":"4","key":"2880_CR44","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1016\/j.jpdc.2007.06.014","volume":"68","author":"M Qiu","year":"2008","unstructured":"Qiu M, Sha EHM, Liu M, Lin M, Hua S, Yang LT (2008) Energy minimization with loop fusion and multi-functional-unit scheduling for multidimensional dsp. J Parallel Distrib Comput 68(4):443\u2013455. \n                    https:\/\/doi.org\/10.1016\/j.jpdc.2007.06.014","journal-title":"J Parallel Distrib Comput"},{"key":"2880_CR45","doi-asserted-by":"publisher","unstructured":"Quinlan D, Haihang Y, Qing Y, Vuduc R, Seymour K (2007) Poet: parameterized optimizations for empirical tuning. In: 2007 IEEE International Parallel and Distributed Processing Symposium 00, p 447. \n                    https:\/\/doi.org\/10.1109\/IPDPS.2007.370637","DOI":"10.1109\/IPDPS.2007.370637"},{"issue":"6","key":"2880_CR46","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1145\/1273442.1250780","volume":"42","author":"L Renganarayanan","year":"2007","unstructured":"Renganarayanan L, Kim D, Rajopadhye S, Strout MM (2007) Parameterized tiled loops for free. SIGPLAN Not 42(6):405\u2013414. \n                    https:\/\/doi.org\/10.1145\/1273442.1250780","journal-title":"SIGPLAN Not"},{"issue":"4","key":"2880_CR47","doi-asserted-by":"publisher","first-page":"67:1","DOI":"10.1145\/3293449","volume":"15","author":"Y Sato","year":"2019","unstructured":"Sato Y, Yuki T, Endo T (2019) An autotuning framework for scalable execution of tiled code via iterative polyhedral compilation. ACM Trans Archit Code Optim 15(4):67:1\u201367:23. \n                    https:\/\/doi.org\/10.1145\/3293449","journal-title":"ACM Trans Archit Code Optim"},{"issue":"3","key":"2880_CR48","doi-asserted-by":"publisher","first-page":"44:1","DOI":"10.1145\/2747875","volume":"20","author":"N Sharma","year":"2015","unstructured":"Sharma N, Panda PR, Catthoor F, Raghavan P, Aa TV (2015) Array interleaving\u2014an energy-efficient data layout transformation. ACM Trans Des Autom Electron Syst 20(3):44:1\u201344:26. \n                    https:\/\/doi.org\/10.1145\/2747875","journal-title":"ACM Trans Des Autom Electron Syst"},{"issue":"3","key":"2880_CR49","doi-asserted-by":"publisher","first-page":"14:1","DOI":"10.1145\/2512432","volume":"10","author":"G Shobaki","year":"2008","unstructured":"Shobaki G, Shawabkeh M, Rmaileh NEA (2008) Preallocation instruction scheduling with register pressure minimization using a combinatorial optimization approach. ACM Trans Archit Code Optim 10(3):14:1\u201314:31. \n                    https:\/\/doi.org\/10.1145\/2512432","journal-title":"ACM Trans Archit Code Optim"},{"key":"2880_CR50","doi-asserted-by":"publisher","unstructured":"Stephenson M, Amarasinghe S (2005) Predicting unroll factors using supervised classification. In: Proceedings of the International Symposium on Code Generation and Optimization, CGO \u201905. IEEE Computer Society, Washington, DC, USA, pp 123\u2013134. \n                    https:\/\/doi.org\/10.1109\/CGO.2005.29","DOI":"10.1109\/CGO.2005.29"},{"issue":"5","key":"2880_CR51","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1109\/MC.2013.227","volume":"47","author":"XH Sun","year":"2014","unstructured":"Sun XH, Wang D (2014) Concurrent average memory access time. Computer 47(5):74\u201380. \n                    https:\/\/doi.org\/10.1109\/MC.2013.227","journal-title":"Computer"},{"key":"2880_CR52","doi-asserted-by":"publisher","unstructured":"Sung IJ, Stratton JA, Hwu WMW (2010) Data layout transformation exploiting memory-level parallelism in structured grid many-core applications. In: Proceedings of the 19th International Conference on Parallel Architectures and Compilation Techniques, PACT \u201910. ACM, New York, NY, USA, pp 513\u2013522. \n                    https:\/\/doi.org\/10.1145\/1854273.1854336","DOI":"10.1145\/1854273.1854336"},{"key":"2880_CR53","doi-asserted-by":"publisher","unstructured":"Tartara M, Crespi\u00a0Reghizzi S (2012) Parallel iterative compilation: using MapReduce to speedup machine learning in compilers. In: Proceedings of Third International Workshop on Mapreduce and Its Applications Date, MapReduce \u201912, pp 33\u201340. \n                    https:\/\/doi.org\/10.1145\/2287016.2287023","DOI":"10.1145\/2287016.2287023"},{"issue":"4","key":"2880_CR54","doi-asserted-by":"publisher","first-page":"46:1","DOI":"10.1145\/2400682.2400705","volume":"9","author":"M Tartara","year":"2013","unstructured":"Tartara M, Crespi Reghizzi S (2013) Continuous learning of compiler heuristics. ACM Trans Archit Code Optim 9(4):46:1\u201346:25. \n                    https:\/\/doi.org\/10.1145\/2400682.2400705","journal-title":"ACM Trans Archit Code Optim"},{"key":"2880_CR55","doi-asserted-by":"publisher","unstructured":"Trifunovic K, Nuzman D, Cohen A, Zaks A, Rosen I (2009) Polyhedral-model guided loop-nest auto-vectorization. In: Proceedings of the 2009 18th International Conference on Parallel Architectures and Compilation Techniques, PACT \u201909. IEEE Computer Society, Washington, DC, USA, pp 327\u2013337. \n                    https:\/\/doi.org\/10.1109\/PACT.2009.18","DOI":"10.1109\/PACT.2009.18"},{"issue":"7","key":"2880_CR56","doi-asserted-by":"publisher","first-page":"1626","DOI":"10.1109\/TC.2013.38","volume":"63","author":"D Wang","year":"2014","unstructured":"Wang D, Sun XH (2014) Apc: a novel memory metric and measurement methodology for modern memory systems. IEEE Trans Comput 63(7):1626\u20131639. \n                    https:\/\/doi.org\/10.1109\/TC.2013.38","journal-title":"IEEE Trans Comput"},{"key":"2880_CR57","doi-asserted-by":"publisher","unstructured":"Zhou X, Giacalone JP, Garzar\u00e1n MJ, Kuhn RH, Ni Y, Padua D (2012) Hierarchical overlapped tiling. In: Proceedings of the Tenth International Symposium on Code Generation and Optimization, CGO \u201912. ACM, New York, NY, USA, pp 207\u2013218. \n                    https:\/\/doi.org\/10.1145\/2259016.2259044","DOI":"10.1145\/2259016.2259044"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-019-02880-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-019-02880-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-019-02880-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,11]],"date-time":"2020-05-11T23:24:12Z","timestamp":1589239452000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-019-02880-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,13]]},"references-count":57,"journal-issue":{"issue":"10","published-print":{"date-parts":[[2019,10]]}},"alternative-id":["2880"],"URL":"https:\/\/doi.org\/10.1007\/s11227-019-02880-z","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2019,5,13]]},"assertion":[{"value":"13 May 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}