{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:36:17Z","timestamp":1750221377432,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":3,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,10,22]],"date-time":"2017-10-22T00:00:00Z","timestamp":1508630400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004359","name":"Vetenskapsr\u00e5det","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001729","name":"Stiftelsen f\u00f6r Strategisk Forskning","doi-asserted-by":"publisher","award":["FFL12-0051"],"award-info":[{"award-number":["FFL12-0051"]}],"id":[{"id":"10.13039\/501100001729","id-type":"DOI","asserted-by":"publisher"}]},{"name":"UPMARC"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,10,22]]},"DOI":"10.1145\/3135932.3135942","type":"proceedings-article","created":{"date-parts":[[2017,10,13]],"date-time":"2017-10-13T15:16:02Z","timestamp":1507907762000},"page":"21-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Understanding the interplay between task scheduling, memory and performance"],"prefix":"10.1145","author":[{"given":"Germ\u00e1n","family":"Ceballos","sequence":"first","affiliation":[{"name":"Uppsala University, Sweden"}]},{"given":"Erik","family":"Hagersten","sequence":"additional","affiliation":[{"name":"Uppsala University, Sweden"}]},{"given":"David","family":"Black-Schaffer","sequence":"additional","affiliation":[{"name":"Uppsala University, Sweden"}]}],"member":"320","published-online":{"date-parts":[[2017,10,22]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"89","article-title":"A statistical multiprocessor cache model","author":"Berg E.","year":"2006","journal-title":"ISPASS."},{"key":"e_1_3_2_1_2_1","first-page":"55","article-title":"StatStack: Efficient modeling of LRU caches","author":"Eklov D.","year":"2010","journal-title":"ISPASS."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1534909.1534910"}],"event":{"name":"SPLASH '17: Conference on Systems, Programming, Languages, and Applications: Software for Humanity","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages","SIGAda ACM Special Interest Group on Ada Programming Language"],"location":"Vancouver BC Canada","acronym":"SPLASH '17"},"container-title":["Proceedings Companion of the 2017 ACM SIGPLAN International Conference on Systems, Programming, Languages, and Applications: Software for Humanity"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3135932.3135942","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3135932.3135942","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:26:44Z","timestamp":1750213604000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3135932.3135942"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,10,22]]},"references-count":3,"alternative-id":["10.1145\/3135932.3135942","10.1145\/3135932"],"URL":"https:\/\/doi.org\/10.1145\/3135932.3135942","relation":{},"subject":[],"published":{"date-parts":[[2017,10,22]]},"assertion":[{"value":"2017-10-22","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}