Publication
Tightening the CRPD Bound for Multilevel non- Inclusive Caches
| dc.contributor.author | Syed Aftab, Rashid | |
| dc.contributor.author | Nelissen, Geoffrey | |
| dc.contributor.author | Tovar, Eduardo | |
| dc.date.accessioned | 2022-10-03T15:18:00Z | |
| dc.date.available | 2022-10-03T15:18:00Z | |
| dc.date.issued | 2021-12-30 | |
| dc.description.abstract | Tasks running on microprocessors with cache memories are often subjected to cache related preemption delays (CRPDs). CRPDs may significantly increase task execution times, thereby, affecting their schedulability. Schedulability analysis accounting for the impact of CRPD has been extensively studied over the past two decades for systems with a single level of cache. Yet, the literature on CRPD for multilevel non-inclusive caches is relatively scarce. Two main challenges exist when analyzing multilevel caches: (1) characterization of the indirect effect of preemption, i.e., capturing the increase in cache interference at lower cache levels (e.g., L2 cache) due to the evictions of cache content from a higher cache level (e.g., L1 cache), and (2) upper bounding the maximum CRPD suffered by tasks at lower cache levels (e.g., L2 cache), i.e., determining the cache content of tasks that can be evicted from lower cache levels in case of preemptions. Existing analysis that focus on bounding CRPD for multilevel non-inclusive caches overestimate the values of (1) and (2) leading to pessimistic worst-case response time (WCRT) estimations. In this work, we reduce the excessive pessimism of the state-of-the-art CRPD analysis for multilevel non-inclusive caches by (i) introducing the notion of multi-level useful cache blocks, i.e., cache blocks that can cause CRPD at different cache levels, and use it to compute a tighter bound on the indirect effect of preemption of tasks; and (ii) deriving a new analysis to compute tighter bounds on the CRPD of tasks at lower cache levels (e.g., L2 cache). We performed a thorough experimental evaluation using benchmarks to compare the performance of our proposed CRPD analysis against the state-of-the-art CRPD analysis. Experimental results show that our proposed CRPD analysis dominates the existing analysis and improves task set schedulability by up to 20% percentage points | pt_PT |
| dc.description.sponsorship | This work was partially supported by National Funds through FCT/MCTES (Portuguese Foundation for Science and Technology), within the CISTER Research Unit (UIDP/UIDB/04234/2020); also by the Operational Competitiveness Programme and Internationalization (COMPETE 2020) under the PT2020 Partnership Agreement, through the European Regional Development Fund (ERDF), and by national funds through the FCT, within project PREFECT (POCI-01-0145-FEDER-029119); also by the European Union’s Horizon 2020 - The EU Framework Programme for Research and Innovation 2014-2020, under grant agreement No. 732505. Project ”TEC4Growth - Pervasive Intelligence, Enhancers and Proofs of Concept with Industrial Impact/NORTE-01- 0145-FEDER000020” financed by the North Portugal Regional Operational Programme (NORTE 2020), under the PORTUGAL 2020 Partnership Agreement. | pt_PT |
| dc.description.version | info:eu-repo/semantics/publishedVersion | pt_PT |
| dc.identifier.doi | 10.1016/j.sysarc.2021.102340 | pt_PT |
| dc.identifier.uri | http://hdl.handle.net/10400.22/20905 | |
| dc.language.iso | eng | pt_PT |
| dc.publisher | Elsevier | pt_PT |
| dc.relation | UIDP/UIDB/04234/2020 | pt_PT |
| dc.relation | POCI-01-0145-FEDER-029119 | pt_PT |
| dc.relation | Lightweight Computation for Networks at the Edge | |
| dc.rights.uri | http://creativecommons.org/licenses/by-nc-nd/4.0/ | pt_PT |
| dc.subject | Cache analysis | pt_PT |
| dc.subject | Timing analysis | pt_PT |
| dc.subject | Preemptive systems | pt_PT |
| dc.subject | Scheduling | pt_PT |
| dc.subject | Cache overheads | pt_PT |
| dc.subject | Cache Related Preemption Delay (CRPD) | pt_PT |
| dc.subject | Multi-level caches | pt_PT |
| dc.title | Tightening the CRPD Bound for Multilevel non- Inclusive Caches | pt_PT |
| dc.title.alternative | 211009 | pt_PT |
| dc.type | journal article | |
| dspace.entity.type | Publication | |
| oaire.awardTitle | Lightweight Computation for Networks at the Edge | |
| oaire.awardURI | info:eu-repo/grantAgreement/EC/H2020/732505/EU | |
| oaire.citation.title | Journal of Systems Architecture | pt_PT |
| oaire.fundingStream | H2020 | |
| person.familyName | Tovar | |
| person.givenName | Eduardo | |
| person.identifier.ciencia-id | 6017-8881-11E8 | |
| person.identifier.orcid | 0000-0001-8979-3876 | |
| person.identifier.scopus-author-id | 7006312557 | |
| project.funder.identifier | http://doi.org/10.13039/501100008530 | |
| project.funder.name | European Commission | |
| rcaap.rights | openAccess | pt_PT |
| rcaap.type | article | pt_PT |
| relation.isAuthorOfPublication | 80b63d8a-2e6d-484e-af3c-55849d0cb65e | |
| relation.isAuthorOfPublication.latestForDiscovery | 80b63d8a-2e6d-484e-af3c-55849d0cb65e | |
| relation.isProjectOfPublication | 53ade512-30d8-4f8c-a0a4-9e38aee21e55 | |
| relation.isProjectOfPublication.latestForDiscovery | 53ade512-30d8-4f8c-a0a4-9e38aee21e55 |