2018
DOI: 10.1109/tcad.2018.2857079
|View full text |Cite
|
Sign up to set email alerts
|

Analyzing Data Cache Related Preemption Delay With Multiple Preemptions

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2020
2020
2022
2022

Publication Types

Select...
3
2

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(1 citation statement)
references
References 18 publications
0
1
0
Order By: Relevance
“…Indeed, classifying CBs stored in data caches as CBs that can be hit later in the task execution requires a different kind of static analysis. For example, the authors of [17] propose a method to compute the useful data cache blocks of a task. Also, data caches bring in additional issues, like the choice of the write policy (writethrough vs. write-back) and its impact on timing and vulnerability.…”
Section: Instruction Cache and Data Cachementioning
confidence: 99%
“…Indeed, classifying CBs stored in data caches as CBs that can be hit later in the task execution requires a different kind of static analysis. For example, the authors of [17] propose a method to compute the useful data cache blocks of a task. Also, data caches bring in additional issues, like the choice of the write policy (writethrough vs. write-back) and its impact on timing and vulnerability.…”
Section: Instruction Cache and Data Cachementioning
confidence: 99%