{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T07:38:55Z","timestamp":1740123535163,"version":"3.37.3"},"reference-count":22,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T00:00:00Z","timestamp":1563840000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T00:00:00Z","timestamp":1563840000000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2020,6]]},"DOI":"10.1007\/s11227-019-02950-2","type":"journal-article","created":{"date-parts":[[2019,7,23]],"date-time":"2019-07-23T06:02:41Z","timestamp":1563861761000},"page":"4666-4681","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["InKS: a programming model to decouple algorithm from optimization in HPC codes"],"prefix":"10.1007","volume":"76","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5225-4868","authenticated-orcid":false,"given":"Ksander","family":"Ejjaaouani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Olivier","family":"Aumage","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julien","family":"Bigot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michel","family":"M\u00e9hrenberger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hitoshi","family":"Murai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masahiro","family":"Nakao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mitsuhisa","family":"Sato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,7,23]]},"reference":[{"issue":"2","key":"2950_CR1","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1002\/cpe.1631","volume":"23","author":"C Augonnet","year":"2011","unstructured":"Augonnet C, Thibault S, Namyst R, Wacrenier PA (2011) StarPU: a unified platform for task scheduling on heterogeneous multicore architectures. Concurr Comput Pract Exper 23(2):187\u2013198. \nhttps:\/\/doi.org\/10.1002\/cpe.1631","journal-title":"Concurr Comput Pract Exper"},{"key":"2950_CR2","unstructured":"Aumage O, Bigot J, Ejjaaouani K, Mehrenberger M (2017) InKS, a programming model to decouple performance from semantics in simulation codes. Technical report, Inria"},{"issue":"3","key":"2950_CR3","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1177\/109434209100500306","volume":"5","author":"DH Bailey","year":"1991","unstructured":"Bailey DH, Barszcz E, Barton JT, Browning DS, Carter RL, Dagum L, Fatoohi RA, Frederickson PO, Lasinski TA, Schreiber RS, Simon HD, Venkatakrishnan V, Weeratunga SK (1991) The NAS parallel benchmarks. Int J Supercomput Appl 5(3):63\u201373. \nhttps:\/\/doi.org\/10.1177\/109434209100500306","journal-title":"Int J Supercomput Appl"},{"key":"2950_CR5","volume-title":"Parallel programming in OpenMP","author":"R Chandra","year":"2001","unstructured":"Chandra R, Dagum L, Kohr D, Maydan D, McDonald J, Menon R (2001) Parallel programming in OpenMP. Morgan Kaufmann, Los Altos"},{"key":"2950_CR6","doi-asserted-by":"publisher","unstructured":"Christen M, Schenk O, Burkhart H (2011) PATUS: a code generation and autotuning framework for parallel iterative stencil computations on modern microarchitectures. In: Parallel and distributed processing symposium (IPDPS) 2011, IEEE. \nhttps:\/\/doi.org\/10.1109\/ipdps.2011.70","DOI":"10.1109\/ipdps.2011.70"},{"issue":"3","key":"2950_CR7","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1006\/jpdc.1999.1566","volume":"58","author":"M Cosnard","year":"1999","unstructured":"Cosnard M, Jeannot E (1999) Compact dag representation and its dynamic scheduling. J Parallel Distrib Comput 58(3):487\u2013514. \nhttps:\/\/doi.org\/10.1006\/jpdc.1999.1566","journal-title":"J Parallel Distrib Comput"},{"key":"2950_CR8","doi-asserted-by":"publisher","unstructured":"Danelutto M, Garc\u00eda J, Miguel Sanchez L, Sotomayor R, Torquati M (2016) Introducing parallelism by using REPARA C++11 attributes. pp 354\u2013358. \nhttps:\/\/doi.org\/10.1109\/PDP.2016.115","DOI":"10.1109\/PDP.2016.115"},{"issue":"12","key":"2950_CR4","doi-asserted-by":"publisher","first-page":"3202","DOI":"10.1016\/j.jpdc.2014.07.003","volume":"74","author":"HC Edwards","year":"2014","unstructured":"Edwards HC, Trott CR, Sunderland D (2014) Kokkos. J Parallel Distrib Comput 74(12):3202\u20133216. \nhttps:\/\/doi.org\/10.1016\/j.jpdc.2014.07.003","journal-title":"J Parallel Distrib Comput"},{"key":"2950_CR9","doi-asserted-by":"publisher","DOI":"10.1002\/0471478369","volume-title":"UPC: distributed shared memory programming","author":"T El-Ghazawi","year":"2005","unstructured":"El-Ghazawi T, Carlson W, Sterling T, Yelick K (2005) UPC: distributed shared memory programming. Wiley, London"},{"key":"2950_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09766-4_502","volume-title":"Polyhedron model","author":"P Feautrier","year":"2011","unstructured":"Feautrier P, Lengauer C (2011) Polyhedron model. Springer, London. \nhttps:\/\/doi.org\/10.1007\/978-0-387-09766-4_502"},{"key":"2950_CR11","doi-asserted-by":"publisher","unstructured":"Griebler D, Loff J, Mencagli G, Danelutto M, Fernandes LG (2018) Efficient NAS benchmark kernels with c++ parallel programming. In: 2018 26th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP). \nhttps:\/\/doi.org\/10.1109\/PDP2018.2018.00120","DOI":"10.1109\/PDP2018.2018.00120"},{"key":"2950_CR12","doi-asserted-by":"crossref","unstructured":"Hoque R, Herault T, Bosilca G, Dongarra J (2017) Dynamic task discovery in PaRSEC: a data-flow task-based runtime. In: 8th workshop on latest advances in scalable algorithms for large-scale systems, ACM","DOI":"10.1145\/3148226.3148233"},{"key":"2950_CR13","doi-asserted-by":"crossref","unstructured":"H\u00f6hnerbach M, Ismail AE, Bientinesi P (2016) The vectorization of the Tersoff multi-body potential: an exercise in performance portability. In: International Conference for High Performance Computing, Networking, Storage and Analysis, IEEE","DOI":"10.1109\/SC.2016.6"},{"key":"2950_CR14","unstructured":"Isoard A (2016) Extending polyhedral techniques towards parallel specifications and approximations. Ph.D. thesis, \u00c9cole doctorale en Informatique et Math\u00e9matiques de Lyon"},{"key":"2950_CR15","unstructured":"Kamil S (2012) StencilProbe: a microbenchmark for stencil applications. Accessed 25 Aug 2017"},{"key":"2950_CR16","doi-asserted-by":"publisher","DOI":"10.1177\/1094342019834644","author":"K Kormann","year":"2019","unstructured":"Kormann K, Reuter K, Rampp M (2019) A massively parallel semi-Lagrangian solver for the six-dimensional Vlasov\u2013Poisson equation. Int J High Perform Comput Appl. \nhttps:\/\/doi.org\/10.1177\/1094342019834644","journal-title":"Int J High Perform Comput Appl"},{"key":"2950_CR17","doi-asserted-by":"crossref","unstructured":"Lee J, Sato M (2010) Implementation and performance evaluation of XcalableMP: a parallel programming language for distributed memory systems. In: International Conference on Parallel Processing Workshops","DOI":"10.1109\/ICPPW.2010.62"},{"key":"2950_CR18","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1051\/proc\/201343003","volume":"43","author":"M. Mehrenberger","year":"2013","unstructured":"Mehrenberger M, Steiner C, Marradi L, Crouseilles N, Sonnendrucker E, Afeyan B (2013) Vlasov on GPU (VOG project). In: ESAIM: Proceedings of 43. \nhttps:\/\/doi.org\/10.1051\/proc\/201343003","journal-title":"ESAIM: Proceedings"},{"key":"2950_CR19","doi-asserted-by":"crossref","unstructured":"Steuwer M, Remmelg T, Dubach C (2017) LIFT: a functional data-parallel IR for high-performance GPU code generation. In: 2017 IEEE\/ACM international symposium on code generation and optimization (CGO)","DOI":"10.1109\/CGO.2017.7863730"},{"key":"2950_CR20","doi-asserted-by":"publisher","unstructured":"Tang Y, Chowdhury RA, Kuszmaul BC, Luk CK, Leiserson CE (2011) The Pochoir stencil compiler. In: 23rd symposium on parallelism in algorithms and architectures, ACM, SPAA \u201911. \nhttps:\/\/doi.org\/10.1145\/1989493.1989508","DOI":"10.1145\/1989493.1989508"},{"key":"2950_CR21","doi-asserted-by":"publisher","first-page":"666","DOI":"10.1007\/978-3-642-03869-3_63","volume-title":"Lecture Notes in Computer Science","author":"Haruto Tanno","year":"2009","unstructured":"Tanno H, Iwasaki H (2009) Parallel skeletons for variable-length lists in SkeTo skeleton library. In: Proceedings of the 15th International Euro-Par Conference on Parallel Processing, Springer, Euro-Par \u201909. \nhttps:\/\/doi.org\/10.1007\/978-3-642-03869-3_63"},{"key":"2950_CR22","volume-title":"Mathematical software\u2014ICMS 2010","author":"S Verdoolaege","year":"2010","unstructured":"Verdoolaege S (2010) isl: an integer set library for the polyhedral model. In: Fukuda K, Hoeven J, Joswig M, Takayama N (eds) Mathematical software\u2014ICMS 2010. Springer, New York"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-019-02950-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-019-02950-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-019-02950-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,21]],"date-time":"2020-07-21T23:24:44Z","timestamp":1595373884000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-019-02950-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,7,23]]},"references-count":22,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["2950"],"URL":"https:\/\/doi.org\/10.1007\/s11227-019-02950-2","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"type":"print","value":"0920-8542"},{"type":"electronic","value":"1573-0484"}],"subject":[],"published":{"date-parts":[[2019,7,23]]},"assertion":[{"value":"23 July 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}