{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,10]],"date-time":"2025-12-10T09:02:55Z","timestamp":1765357375835,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":10,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,3,27]],"date-time":"2023-03-27T00:00:00Z","timestamp":1679875200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Agencia Estatal de Investigaci\u00f3n","award":["PID2019-107255GB-C21"],"award-info":[{"award-number":["PID2019-107255GB-C21"]}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["772773"],"award-info":[{"award-number":["772773"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,3,27]]},"DOI":"10.1145\/3555776.3577793","type":"proceedings-article","created":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T17:16:29Z","timestamp":1686158189000},"page":"471-474","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["ASCOM: Affordable Sequence-aware COntention Modeling in Crossbar-based MPSoCs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5476-4354","authenticated-orcid":false,"given":"Jeremy Jens","family":"Giesen Leon","sequence":"first","affiliation":[{"name":"Computer Sciences - Operating System \/ Computer Architecture Interface, Barcelona Supercomputing Center (BSC), Barcelona, Barcelona, Spain"},{"name":"Departament d'Arquitectura de Computadors, Universitat Polit\u00e8cnica de Catalunya, Barcelona, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1886-2931","authenticated-orcid":false,"given":"Enrico","family":"Mezzetti","sequence":"additional","affiliation":[{"name":"Computer Sciences - Operating System \/ Computer Architecture Interface, Barcelona Supercomputing Center (BSC), Barcelona, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7951-4028","authenticated-orcid":false,"given":"Jaume","family":"Abella","sequence":"additional","affiliation":[{"name":"Computer Sciences - Operating System \/ Computer Architecture Interface, Barcelona Supercomputing Center (BSC), Barcelon, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3344-376X","authenticated-orcid":false,"given":"Francisco Javier","family":"Cazorla","sequence":"additional","affiliation":[{"name":"Computer Sciences - Operating System \/ Computer Architecture Interface, Barcelona Supercomputing Center (BSC), Barcelona, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,6,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Jon Perez Cerrolaza et al. 2020. Multi-Core Devices for Safety-Critical Systems: A Survey. ACM Comput. Surv. (2020).  Jon Perez Cerrolaza et al. 2020. Multi-Core Devices for Safety-Critical Systems: A Survey. ACM Comput. Surv. (2020).","DOI":"10.1145\/3398665"},{"key":"e_1_3_2_1_2_1","unstructured":"G. Fernandez et al. 2014. Contention in Multicore Hardware Shared Resources: Understanding of the State of the Art. In WCET. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik.  G. Fernandez et al. 2014. Contention in Multicore Hardware Shared Resources: Understanding of the State of the Art. In WCET. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Jeremy Giesen et al. 2020. Modeling Contention Interference in Crossbar-based Systems via Sequence-Aware Pairing (SeAP). In RTAS. IEEE.  Jeremy Giesen et al. 2020. Modeling Contention Interference in Crossbar-based Systems via Sequence-Aware Pairing (SeAP). In RTAS. IEEE.","DOI":"10.1109\/RTAS48715.2020.000-2"},{"key":"e_1_3_2_1_4_1","volume-title":"A Linear Space Algorithm for Computing Maximal Common Subsequences. Commun. ACM","author":"Daniel S.","year":"1975","unstructured":"Daniel S. Hirschberg . 1975. A Linear Space Algorithm for Computing Maximal Common Subsequences. Commun. ACM ( 1975 ). Daniel S. Hirschberg. 1975. A Linear Space Algorithm for Computing Maximal Common Subsequences. Commun. ACM (1975)."},{"key":"e_1_3_2_1_5_1","unstructured":"Infineon. 2022. AURIX TriCore TC2xx. https:\/\/www.infineon.com\/cms\/en\/product\/microcontroller\/32-bit-tricore-microcontroller\/32-bit-tricore-aurix-tc2xx\/.  Infineon. 2022. AURIX TriCore TC2xx. https:\/\/www.infineon.com\/cms\/en\/product\/microcontroller\/32-bit-tricore-microcontroller\/32-bit-tricore-aurix-tc2xx\/."},{"volume-title":"Combinatorial Pattern Matching","author":"Guy Jacobson","key":"e_1_3_2_1_6_1","unstructured":"Guy Jacobson and Kiem-Phong Vo. 1992. Heaviest increasing\/common subsequence problems . In Combinatorial Pattern Matching . Springer Berlin Heidelberg . Guy Jacobson and Kiem-Phong Vo. 1992. Heaviest increasing\/common subsequence problems. In Combinatorial Pattern Matching. Springer Berlin Heidelberg."},{"key":"e_1_3_2_1_7_1","volume-title":"A linear space algorithm for the heaviest common subsequence problem. Utilitas Mathematica 75 (03","author":"Rao Li","year":"2008","unstructured":"Rao Li . 2008. A linear space algorithm for the heaviest common subsequence problem. Utilitas Mathematica 75 (03 2008 ). Rao Li. 2008. A linear space algorithm for the heaviest common subsequence problem. Utilitas Mathematica 75 (03 2008)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Hamid Tabani et al. 2019. Assessing the Adherence of an Industrial Autonomous Driving Framework to ISO 26262 Software Guidelines. In ACM\/IEEE DAC.  Hamid Tabani et al. 2019. Assessing the Adherence of an Industrial Autonomous Driving Framework to ISO 26262 Software Guidelines. In ACM\/IEEE DAC.","DOI":"10.1145\/3316781.3317779"},{"key":"e_1_3_2_1_9_1","unstructured":"Reinhard Wilhelm. 2018. Mixed Feelings About Mixed Criticality (Invited Paper). In WCET (OASICS). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik.  Reinhard Wilhelm. 2018. Mixed Feelings About Mixed Criticality (Invited Paper). In WCET (OASICS). Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Wilhelm R. etal 2008. The worst-case execution-time problem: overview of methods and survey of tools. ACM Trans. on Embedded Comp. Systems (2008).  Wilhelm R. et al. 2008. The worst-case execution-time problem: overview of methods and survey of tools. ACM Trans. on Embedded Comp. Systems (2008).","DOI":"10.1145\/1347375.1347389"}],"event":{"name":"SAC '23: 38th ACM\/SIGAPP Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Tallinn Estonia","acronym":"SAC '23"},"container-title":["Proceedings of the 38th ACM\/SIGAPP Symposium on Applied Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3555776.3577793","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3555776.3577793","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:08:30Z","timestamp":1750183710000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3555776.3577793"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3,27]]},"references-count":10,"alternative-id":["10.1145\/3555776.3577793","10.1145\/3555776"],"URL":"https:\/\/doi.org\/10.1145\/3555776.3577793","relation":{},"subject":[],"published":{"date-parts":[[2023,3,27]]},"assertion":[{"value":"2023-06-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}