{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T15:49:32Z","timestamp":1778860172152,"version":"3.51.4"},"publisher-location":"Cham","reference-count":38,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031998539","type":"print"},{"value":"9783031998546","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T00:00:00Z","timestamp":1756252800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,8,27]],"date-time":"2025-08-27T00:00:00Z","timestamp":1756252800000},"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-031-99854-6_16","type":"book-chapter","created":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T05:09:46Z","timestamp":1756184986000},"page":"233-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["WAPA: A Workload-Agnostic CPI-Based Thread-to-Core Allocation Policy"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4334-460X","authenticated-orcid":false,"given":"Marta","family":"Navarro","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4352-2741","authenticated-orcid":false,"given":"Vicent","family":"Pallard\u00f3-Juli\u00e0","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2426-4134","authenticated-orcid":false,"given":"Salvador","family":"Petit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1466-4118","authenticated-orcid":false,"given":"Mar\u00eda\u00a0E.","family":"G\u00f3mez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8630-4846","authenticated-orcid":false,"given":"Julio","family":"Sahuquillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,8,27]]},"reference":[{"key":"16_CR1","unstructured":"Cascade Lake - Microarchitectures - Intel. https:\/\/en.wikichip.org\/wiki\/intel\/microarchitectures\/cascade_lake. Accessed 12 Mar 2025"},{"key":"16_CR2","unstructured":"Intel Xeon Silver 4210R. https:\/\/en.wikichip.org\/wiki\/intel\/xeon_silver\/4210r. Accessed 12 Mar 2025"},{"key":"16_CR3","unstructured":"Lightspeed computation of optimal transport (2013)"},{"key":"16_CR4","unstructured":"Perf: Linux profiling with performance counters (2023). https:\/\/perf.wiki.kernel.org\/index.php\/Main_Page. Accessed 12 Mar 2025"},{"key":"16_CR5","unstructured":"sched_seaffinity(2) - Linux manual page (2023). https:\/\/man7.org\/linux\/man-pages\/man2\/sched_setaffinity.2.html. Accessed 12 Mar 2025"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Ambrosio, L., Gigli, N.: Modelling and Optimisation of Flows on Networks, chap. Springer, A User\u2019s Guide to Optimal Transport (2013)","DOI":"10.1007\/978-3-642-32160-3_1"},{"issue":"1","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2140\/pjm.1966.16.1","volume":"16","author":"L Armijo","year":"1966","unstructured":"Armijo, L.: Minimization of functions having lipschitz continuous first partial derivatives. Pacific J. Math. 16(1), 1\u20133 (1966)","journal-title":"Pacific J. Math."},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Balaram, B., et\u00a0al.: IBM POWER8 processor core microarchitecture. IBM J. Res. Dev. 59(1), 2:1\u20132:21 (2015)","DOI":"10.1147\/JRD.2014.2376112"},{"issue":"6","key":"16_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2070781.2024192","volume":"30","author":"N Bonneel","year":"2011","unstructured":"Bonneel, N., et al.: Displacement interpolation using lagrangian mass transport. ACM Trans. Graph. 30(6), 1\u201312 (2011)","journal-title":"ACM Trans. Graph."},{"issue":"4","key":"16_CR10","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1002\/cpa.3160440402","volume":"44","author":"Y Brenier","year":"1991","unstructured":"Brenier, Y.: Polar factorization and monotone rearrangement of vector-valued functions. Commun. Pure Appl. Math. 44(4), 375\u2013417 (1991)","journal-title":"Commun. Pure Appl. Math."},{"issue":"4","key":"16_CR11","doi-asserted-by":"publisher","first-page":"A1961","DOI":"10.1137\/17M1132665","volume":"40","author":"M Essid","year":"2018","unstructured":"Essid, M., Solomon, J.: Quadratically regularized optimal transport on graphs. SIAM J. Sci. Comput. 40(4), A1961\u2013A1986 (2018)","journal-title":"SIAM J. Sci. Comput."},{"key":"16_CR12","doi-asserted-by":"crossref","unstructured":"Eyerman, S., Eeckhout, L.: Probabilistic job symbiosis modeling for SMT processor scheduling. In: ASPLOS, pp. 91\u2013102 (2010)","DOI":"10.1145\/1736020.1736033"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Feliu, J., et\u00a0al.: Understanding cache hierarchy contention in CMPS to improve job scheduling. In: IEEE 26th IPDPS, pp. 508\u2013519 (2012)","DOI":"10.1109\/IPDPS.2012.54"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Feliu, J., et\u00a0al.: L1-bandwidth aware thread allocation in multicore SMT processors. In: Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques, pp. 123\u2013132 (2013)","DOI":"10.1109\/PACT.2013.6618803"},{"key":"16_CR15","doi-asserted-by":"crossref","unstructured":"Feliu, J., et\u00a0al.: Symbiotic job scheduling on the IBM POWER8. In: HPCA, pp. 669\u2013680 (2016)","DOI":"10.1109\/HPCA.2016.7446103"},{"issue":"10","key":"16_CR16","first-page":"2838","volume":"28","author":"J Feliu","year":"2017","unstructured":"Feliu, J., et al.: Improving IBM POWER8 performance through symbiotic job scheduling. IEEE TPDS 28(10), 2838\u20132851 (2017)","journal-title":"IEEE TPDS"},{"issue":"3","key":"16_CR17","doi-asserted-by":"publisher","first-page":"1853","DOI":"10.1137\/130929886","volume":"7","author":"S Ferradans","year":"2014","unstructured":"Ferradans, S., et al.: Regularized discrete optimal transport. SIAM J. Imaging Sci. 7(3), 1853\u20131882 (2014)","journal-title":"SIAM J. Imaging Sci."},{"issue":"1","key":"16_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1002\/nav.3800030109","volume":"3","author":"M Frank","year":"1956","unstructured":"Frank, M., Wolfe, P.: An algorithm for quadratic programming. Nav. Res. Logist. Q. 3(1), 95\u2013110 (1956)","journal-title":"Nav. Res. Logist. Q."},{"issue":"2","key":"16_CR19","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/BF02392620","volume":"177","author":"W Gangbo","year":"1996","unstructured":"Gangbo, W., McCann, R.J.: The geometry of optimal transportation. Acta Math. 177(2), 113\u2013161 (1996)","journal-title":"Acta Math."},{"issue":"4","key":"16_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1186736.1186737","volume":"34","author":"JL Henning","year":"2006","unstructured":"Henning, J.L.: SPEC CPU2006 benchmark descriptions. ACM SIGARCH Comput. Arch. News 34(4), 1\u201317 (2006)","journal-title":"ACM SIGARCH Comput. Arch. News"},{"issue":"2","key":"16_CR21","doi-asserted-by":"publisher","first-page":"920","DOI":"10.1109\/TIP.2015.2509419","volume":"25","author":"S Kolouri","year":"2016","unstructured":"Kolouri, S., et al.: The radon cumulative distribution transform and its application to image classification. IEEE Trans. Image Process. 25(2), 920\u2013934 (2016)","journal-title":"IEEE Trans. Image Process."},{"issue":"4","key":"16_CR22","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1109\/MSP.2017.2695801","volume":"34","author":"S Kolouri","year":"2017","unstructured":"Kolouri, S., et al.: Optimal mass transport: signal processing and machine-learning applications. IEEE Signal Process. Mag. 34(4), 43\u201359 (2017)","journal-title":"IEEE Signal Process. Mag."},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Li, P., et\u00a0al.: A novel earth mover\u2019s distance methodology for image matching with gaussian mixture models. In: Proceedings of the IEEE International Conference on Computer Vision, pp. 1689\u20131696 (2013)","DOI":"10.1109\/ICCV.2013.212"},{"key":"16_CR24","doi-asserted-by":"crossref","unstructured":"Limaye, A., et\u00a0al.: A workload characterization of the spec cpu2017 benchmark suite. In: ISPASS, pp. 149\u2013158 (2018)","DOI":"10.1109\/ISPASS.2018.00028"},{"key":"16_CR25","doi-asserted-by":"publisher","first-page":"1919","DOI":"10.1007\/s00245-019-09614-w","volume":"33","author":"DA Lorenz","year":"2021","unstructured":"Lorenz, D.A., et al.: Quadratically regularized optimal transport. Appl. Math. Optim. 33, 1919\u20131949 (2021)","journal-title":"Appl. Math. Optim."},{"key":"16_CR26","unstructured":"Monge, G.: M\u00e9moire sur la th\u00e9orie des d\u00e9blais et des remblais. Mem. Math. Phys. Acad. Royale Sci. 666\u2013704 (1781)"},{"key":"16_CR27","unstructured":"Montesuma, E.F., et\u00a0al.: Recent advances in optimal transport for machine learning. arXiv preprint arXiv:2306.16156 (2023). https:\/\/arxiv.org\/abs\/2306.16156"},{"key":"16_CR28","doi-asserted-by":"crossref","unstructured":"Moseley, T., et\u00a0al.: Methods for modeling resource contention on simultaneous multithreading processors. In: International Conference on Computer Design: VLSI in Computers and Processors, pp. 373\u2013380 (2005)","DOI":"10.1109\/ICCD.2005.74"},{"key":"16_CR29","doi-asserted-by":"crossref","unstructured":"Navarro, M., et\u00a0al.: SYNPA: SMT performance analysis and allocation of threads to cores in ARM processors. In: IPDPS, pp. 705\u2013715 (2024)","DOI":"10.1109\/IPDPS57955.2024.00068"},{"key":"16_CR30","doi-asserted-by":"crossref","unstructured":"Nesterov, Y., Nemirovskii, A.: Interior-point polynomial methods in convex programming. SIAM Stud. Appl. Math., vol.\u00a013. SIAM (1994)","DOI":"10.1137\/1.9781611970791"},{"key":"16_CR31","doi-asserted-by":"publisher","first-page":"743","DOI":"10.1088\/0266-5611\/3\/4\/017","volume":"3","author":"VI Oliker","year":"1987","unstructured":"Oliker, V.I.: Near radially symmetric solutions of an inverse problem in geometric optics. Inverse Prob. 3, 743\u2013756 (1987)","journal-title":"Inverse Prob."},{"key":"16_CR32","unstructured":"Papadimitriou, C.H., Steiglitz, K.: Combinatorial Optimization, Algorithms and Complexity. Prentice Hall (1982)"},{"issue":"5\u20136","key":"16_CR33","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1561\/2200000073","volume":"11","author":"G Peyr\u00e9","year":"2019","unstructured":"Peyr\u00e9, G., Cuturi, M.: Computational optimal transport: with applications to data science. Found. Trends Mach. Learn. 11(5\u20136), 355\u2013607 (2019)","journal-title":"Found. Trends Mach. Learn."},{"key":"16_CR34","doi-asserted-by":"crossref","unstructured":"Radojkovi\u0107, P., et\u00a0al.: Optimal task assignment in multithreaded processors: a statistical approach. In: International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS), pp. 235\u2013248 (2012)","DOI":"10.1145\/2150976.2151002"},{"key":"16_CR35","doi-asserted-by":"crossref","unstructured":"Santambrogio, F.: Optimal transport for applied mathematicians, vol.\u00a055. Birkh\u00e4user Cham (2015)","DOI":"10.1007\/978-3-319-20828-2"},{"key":"16_CR36","doi-asserted-by":"crossref","unstructured":"Tullsen, D.M., et\u00a0al.: Simultaneous multithreading: maximizing on-chip parallelism. In: ISCA \u201995, p. 392\u2013403 (1995)","DOI":"10.1145\/223982.224449"},{"key":"16_CR37","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1088\/0266-5611\/12\/3\/013","volume":"12","author":"XJ Wang","year":"1996","unstructured":"Wang, X.J.: On the design of a reflector antenna. Inverse Prob. 12, 351\u2013375 (1996)","journal-title":"Inverse Prob."},{"key":"16_CR38","doi-asserted-by":"publisher","first-page":"2227","DOI":"10.1109\/TPAMI.2008.245","volume":"31","author":"M Zaslavskiy","year":"2009","unstructured":"Zaslavskiy, M., et al.: A path following algorithm for the graph matching problem. IEEE Trans. Pattern Anal. Mach. Intell. 31, 2227\u20132242 (2009)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2025: Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-99854-6_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T00:36:07Z","timestamp":1757464567000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-99854-6_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,8,27]]},"ISBN":["9783031998539","9783031998546"],"references-count":38,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-99854-6_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,8,27]]},"assertion":[{"value":"27 August 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Euro-Par","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"European Conference on Parallel Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dresden","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 August 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"europar2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2025.euro-par.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}