{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T19:10:09Z","timestamp":1751829009541,"version":"3.41.0"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"5-6","license":[{"start":{"date-parts":[[2018,8,31]],"date-time":"2018-08-31T00:00:00Z","timestamp":1535673600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["LE912\/14","AP 206\/4"],"award-info":[{"award-number":["LE912\/14","AP 206\/4"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"crossref","award":["AP 206\/6"],"award-info":[{"award-number":["AP 206\/6"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s10766-018-0597-3","type":"journal-article","created":{"date-parts":[[2018,8,31]],"date-time":"2018-08-31T10:43:30Z","timestamp":1535712210000},"page":"874-906","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["PolyJIT: Polyhedral Optimization Just in Time"],"prefix":"10.1007","volume":"47","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9966-148X","authenticated-orcid":false,"given":"Andreas","family":"Simb\u00fcrger","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sven","family":"Apel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Armin","family":"Gr\u00f6\u00dflinger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Lengauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,31]]},"reference":[{"key":"597_CR1","unstructured":"Android Developers: Art and Dalvik (2016). https:\/\/source.android.com\/devices\/tech\/dalvik\/ . Accessed 25 Feb 2018"},{"key":"597_CR2","first-page":"1068","volume-title":"Encyclopedia of Parallel Computing","author":"U Banerjee","year":"2011","unstructured":"Banerjee, U.: Loop nest parallelization. In: Padua, D., et al. (eds.) Encyclopedia of Parallel Computing, vol. 2, pp. 1068\u20131079. Springer, Berlin (2011)"},{"key":"597_CR3","doi-asserted-by":"crossref","unstructured":"Bastoul, C.: Code generation in the polyhedral model is easier than you think. In: Proceedings of 13th International Conference on Parallel Architectures and Compilation Techniques (PACT), pp. 7\u201316. IEEE Computer Society (2004)","DOI":"10.1109\/PACT.2004.1342537"},{"key":"597_CR4","unstructured":"Bondhugula, U., Baskaran, M., Krishnamoorthy, S., Ramanujam, J., Rountev, A., Sadayappan, P.: Automatic transformations for communication-minimized parallelization and locality optimization in the polyhedral model. In: Proceedings of 17th International Conference on Compiler Construction (CC). Springer (2008)"},{"key":"597_CR5","unstructured":"Bondhugula, U., Hartono, A., Ramanujam, J., Sadayappan, P.: A practical automatic polyhedral program optimization system. In: Proceedings of 29th ACM SIGPLAN Conference on Programming Language Design and Implementation (PLDI). ACM (2008)"},{"issue":"15","key":"597_CR6","first-page":"4192:1","volume":"29","author":"JMM Caama\u00f1o","year":"2016","unstructured":"Caama\u00f1o, J.M.M., Selva, M., Clauss, P., Baloian, A., Wolff, W.: Full runtime polyhedral optimizing loop transformations with the generation, instantiation, and scheduling of code-bones. Concurr. Comput. Pract. Exp. 29(15), 4192:1\u20134192:16 (2016). (Special Issue on Euro-Par 2016)","journal-title":"Concurr. Comput. Pract. Exp."},{"key":"597_CR7","doi-asserted-by":"crossref","unstructured":"Che, S., Boyer, M., Meng, J., Tarjan, D., Sheaffer, J.W., Lee, S.H., Skadron, K.: Rodinia: A benchmark suite for heterogeneous computing. In: Proceedings of IEEE International Symposium on Workload Characterization (IISWC), pp. 44\u201354. IEEE Computer Society (2009)","DOI":"10.1109\/IISWC.2009.5306797"},{"key":"597_CR8","unstructured":"Cook, S.: CUDA Programming: A Developer\u2019s Guide to Parallel Computing with GPUs. Morgan Kaufmann (2013)"},{"issue":"3","key":"597_CR9","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1080\/00029890.1973.11993265","volume":"80","author":"M Davis","year":"1973","unstructured":"Davis, M.: Hilbert\u2019s tenth problem is unsolvable. Am. Math. Mon. 80(3), 233\u2013269 (1973)","journal-title":"Am. Math. Mon."},{"key":"597_CR10","unstructured":"FFmpeg Developers: FFmpeg Automated Testing Environment (2016). https:\/\/www.ffmpeg.org\/fate.html . Accessed 25 Feb 2018"},{"key":"597_CR11","doi-asserted-by":"crossref","unstructured":"Duran, A., Teruel, X., Ferrer, R., Martorell, X., Ayguade, E.: Barcelona OpenMP tasks suite: a set of benchmarks targeting the exploitation of task parallelism in OpenMP. In: International Conference on Parallel Processing (ICPP), pp. 124\u2013131 (2009)","DOI":"10.1109\/ICPP.2009.64"},{"key":"597_CR12","first-page":"1581","volume-title":"Encyclopedia of Parallel Computing","author":"P Feautrier","year":"2011","unstructured":"Feautrier, P., Lengauer, C.: Polyhedron model. In: Padua, D., et al. (eds.) Encyclopedia of Parallel Computing, vol. 4, pp. 1581\u20131592. Springer, Berlin (2011)"},{"key":"597_CR13","doi-asserted-by":"crossref","unstructured":"Grosser, T., Cohen, A., Holewinski, J., Sadayappan, P., Verdoolaege, S.: Hybrid hexagonal\/classical tiling for GPUs. In: Proceedings of 12th International Symposium on Code Generation and Optimization (CGO). ACM (2014). (Article 66, 10 pp)","DOI":"10.1145\/2581122.2544160"},{"issue":"04","key":"597_CR14","doi-asserted-by":"publisher","first-page":"1250010","DOI":"10.1142\/S0129626412500107","volume":"22","author":"TOBIAS GROSSER","year":"2012","unstructured":"Grosser, T., Gr\u00f6\u00dflinger, A., Lengauer, C.: Polly-Performing polyhedral optimizations on a low-level intermediate representation. Parallel Processing Letters (PPL) 22(4) 1250010:1-1250010:28 (2012)","journal-title":"Parallel Processing Letters"},{"key":"597_CR15","doi-asserted-by":"crossref","unstructured":"Grosser, T., Ramanujam, J., Pouchet, L.N., Sadayappan, P., Pop, S.: Optimistic delinearization of parametrically sized arrays. In: Proceedings of 29th ACM International Conference on Supercomputing (ICS), pp. 351\u2013360. ACM (2015)","DOI":"10.1145\/2751205.2751248"},{"key":"597_CR16","unstructured":"Grosser, T., Zheng, H., Alor, R., Simb\u00fcrger, A., Gr\u00f6\u00dflinger, A., Pouchet, L.N.: Polly\u2014polyhedral optimization in LLVM. In: Alias, C., Bastoul, C. (eds.) Proceedings of First International Workshop on Polyhedral Compilation Techniques (IMPACT). INRIA Grenoble Rh\u00f4ne-Alpes (2011)"},{"key":"597_CR17","unstructured":"Gr\u00f6\u00dflinger, A.: The challenges of non-linear parameters and variables in automatic loop parallelisation. Doctoral thesis, Department of Computer Science and Mathematics, University of Passau (2009)"},{"issue":"2","key":"597_CR18","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1080\/00031305.1998.10480559","volume":"52","author":"JL Hintze","year":"1998","unstructured":"Hintze, J.L., Nelson, R.D.: Violin plots: a box plot-density trace synergism. Am. Stat. 52(2), 181\u2013184 (1998)","journal-title":"Am. Stat."},{"key":"597_CR19","first-page":"2041","volume-title":"Encyclopedia of Parallel Computing","author":"F Irigoin","year":"2011","unstructured":"Irigoin, F.: Tiling. In: Padua, D., et al. (eds.) Encyclopedia of Parallel Computing, vol. 4, pp. 2041\u20132049. Springer, Berlin (2011)"},{"key":"597_CR20","unstructured":"Jimborean, A.: Adapting the polytope model for dynamic and speculative parallelization. Doctoral thesis, Image Sciences, Computer Sciences and Remote Sensing Laboratory, University of Strasbourg (2012)"},{"key":"597_CR21","unstructured":"Jimborean, A., Loechner, V., Clauss, P.: Handling multi-versioning in LLVM: Code tracking and cloning. In: Proceedings of International Workshop on Intermediate Representations (WIR). IEEE Computer Society (2011)"},{"key":"597_CR22","doi-asserted-by":"crossref","unstructured":"Lattner, C., Adve, V.: LLVM: A compilation framework for lifelong program analysis & transformation. In: Proceedings of Second International Symposium on Code Generation and Optimization (CGO), pp. 75\u201386. IEEE Computer Society (2004)","DOI":"10.1109\/CGO.2004.1281665"},{"issue":"4","key":"597_CR23","first-page":"35:1","volume":"10","author":"S Mehta","year":"2013","unstructured":"Mehta, S., Beeraka, G., Yew, P.: Tile size selection revisited. ACM Trans. Archit. Code Optim. (TACO) 10(4), 35:1\u201335:27 (2013)","journal-title":"ACM Trans. Archit. Code Optim. (TACO)"},{"key":"597_CR24","unstructured":"Paleczny, M., Vick, C., Click, C.: The Java Hotspot server compiler. In: Proceedings of 1st Symposium on Java Virtual Machine Research and Technology (JVM). USENIX Association (2001)"},{"key":"597_CR25","unstructured":"Pozo, R., Miller, B.R.: SciMark2 (2017). http:\/\/math.nist.gov\/scimark2 . Accessed 25 Feb 2018"},{"key":"597_CR26","doi-asserted-by":"crossref","unstructured":"Simb\u00fcrger, A., Apel, S., Gr\u00f6\u00dflinger, A., Lengauer, C.: The potential of polyhedral optimization: An empirical study. In: Proceedings of 28th IEEE\/ACM International Conference on Automated Software Engineering (ASE), pp. 508\u2013518. IEEE Computer Society (2013)","DOI":"10.1109\/ASE.2013.6693108"},{"key":"597_CR27","unstructured":"Simb\u00fcrger, A., Gr\u00f6\u00dflinger, A.: On the variety of static control parts in real-world programs: from affine via multi-dimensional to polynomial and just-in-time. In: Proceedings of 4th International Workshop on Polyhedral Compilation Techniques (IMPACT) (2014)"},{"key":"597_CR28","unstructured":"Simb\u00fcrger, A., Sattler, F., Gr\u00f6\u00dflinger, A., Lengauer, C.: BenchBuild: A large-scale empirical-research toolkit. Technical Report MIP-1602, Faculty of Computer Science and Mathematics, University of Passau (2016)"},{"key":"597_CR29","doi-asserted-by":"crossref","unstructured":"Stojanov, A., Toskov, I., Rompf, T., P\u00fcschel, M.: SIMD intrinsics on managed language runtimes. In: Proceedings of 15th International Symposium on Code Generation and Optimization (CGO), pp. 2\u201315. ACM (2018)","DOI":"10.1145\/3168810"},{"issue":"3","key":"597_CR30","first-page":"66","volume":"12","author":"JE Stone","year":"2010","unstructured":"Stone, J.E., Gohara, D., Shi, G.: OpenCL: a parallel programming standard for heterogeneous computing systems. IEEE Des. Test 12(3), 66\u201373 (2010)","journal-title":"IEEE Des. Test"},{"key":"597_CR31","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-642-28652-0_13","volume-title":"Proceedings of 21st International Conference on Compiler Construction (CC)","author":"K Streit","year":"2012","unstructured":"Streit, K., Hammacher, C., Zeller, A., Hack, S.: Sambamba: a runtime system for online adaptive parallelization. In: Franke, B. (ed.) Proceedings of 21st International Conference on Compiler Construction (CC), pp. 240\u2013243. Springer, Berlin (2012)"},{"key":"597_CR32","doi-asserted-by":"crossref","unstructured":"Strzodka, R., Shaheen, M., Pajak, D., Seidel, H.P.: Cache accurate time skewing in iterative stencil computations. In: Proceedings of International Conference on Parallel Processing (ICPP), pp. 571\u2013581. IEEE Computer Society (2011)","DOI":"10.1109\/ICPP.2011.47"},{"key":"597_CR33","doi-asserted-by":"crossref","unstructured":"Tavarageri, S., Pouchet, L., Ramanujam, J., Rountev, A., Sadayappan, P.: Dynamic selection of tile sizes. In: Proceedings of 18th International Conference on High Performance Computing (HiPC), pp. 1\u201310 (2011)","DOI":"10.1109\/HiPC.2011.6152742"},{"key":"597_CR34","unstructured":"Trifunovic, K., Cohen, A., Edelsohn, D., Li, F., Grosser, T., Jagasia, H., Ladelsky, R., Pop, S., Sj\u00f6din, J., Upadrasta, R.: GRAPHITE two years after: first lessons learned from real-world polyhedral compilation. In: Proceedings of International Workshop on GCC Research Opportunities (GROW), pp. 1\u201313 (2010). http:\/\/ctuning.org\/workshop-grow10 . Accessed 25 Feb 2018"},{"issue":"9","key":"597_CR35","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1016\/j.datak.2009.02.015","volume":"68","author":"J Vanhatalo","year":"2009","unstructured":"Vanhatalo, J., V\u00f6lzer, H., Koehler, J.: The refined process structure tree. Data Knowl. Eng. 68(9), 793\u2013818 (2009)","journal-title":"Data Knowl. Eng."},{"key":"597_CR36","volume-title":"Loop Tiling for Parallelism","author":"J Xue","year":"2012","unstructured":"Xue, J.: Loop Tiling for Parallelism, vol. 575. Springer, Berlin (2012)"},{"key":"597_CR37","doi-asserted-by":"crossref","unstructured":"Yuki, T., Renganarayanan, L., Rajopadhye, S.V., Anderson, C., Eichenberger, A.E., O\u2019Brien, K.: Automatic creation of tile size selection models. In: Proceedings of 8th International Symposium on Code Generation and Optimization (CGO), pp. 190\u2013199 (2010)","DOI":"10.1145\/1772954.1772982"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-018-0597-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10766-018-0597-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10766-018-0597-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T18:50:20Z","timestamp":1751827820000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10766-018-0597-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8,31]]},"references-count":37,"journal-issue":{"issue":"5-6","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["597"],"URL":"https:\/\/doi.org\/10.1007\/s10766-018-0597-3","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[2018,8,31]]},"assertion":[{"value":"27 February 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 August 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"31 August 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}