Cache-related preemption delay computation for set-associative caches - pitfalls and solutions
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
In: 9th International Workshop on Worst-Case Execution Time Analysis (WCET'09), S. 1-11
- Bibliographic citation
-
OpenAccess Series in Informatics (OASIcs) ; 10
- Event
-
Veröffentlichung
- (where)
-
Augsburg
- (who)
-
Universität Augsburg
- (when)
-
2009
- Event
-
Veröffentlichung
- (where)
-
Dagstuhl
- (who)
-
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
- (when)
-
2009
- Creator
- Contributor
-
Holsti, Niklas
- DOI
-
10.4230/OASIcs.WCET.2009.2285
- URN
-
urn:nbn:de:bvb:384-opus4-702100
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
- 14.08.2025, 11:01 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Burguière, Claire
- Reineke, Jan
- Altmeyer, Sebastian
- Holsti, Niklas
- Universität Augsburg
- Schloss Dagstuhl - Leibniz-Zentrum für Informatik
Time of origin
- 2009
Other Objects (12)
Cache related preemption delay for set-associative caches: resilience analysis
Cache-related preemption delay via useful cache blocks: survey and redefinition
Resilience analysis: tightening the CRPD bound for set-associative caches
A Comparison between Fixed Priority and EDF Scheduling accounting for Cache Related Pre-emption Delays
A new notion of useful cache block to improve the bounds of cache-related preemption delay
Response-time analysis for fixed-priority systems with a write-back cache
Optimal task placement to improve cache performance
Analysis of probabilistic cache related pre-emption delays for systems with random cache replacement policies
Cache related pre-emption delays in hierarchical scheduling
On the effectiveness of cache partitioning in hard real-time systems
Schedulability analysis of global scheduling for multicore systems with shared caches
Static probabilistic timing analysis for real-time systems using random replacement caches
Cache related preemption delay for set-associative caches: resilience analysis
Cache-related preemption delay via useful cache blocks: survey and redefinition
Resilience analysis: tightening the CRPD bound for set-associative caches
A Comparison between Fixed Priority and EDF Scheduling accounting for Cache Related Pre-emption Delays
A new notion of useful cache block to improve the bounds of cache-related preemption delay
Response-time analysis for fixed-priority systems with a write-back cache
Optimal task placement to improve cache performance
Analysis of probabilistic cache related pre-emption delays for systems with random cache replacement policies
Cache related pre-emption delays in hierarchical scheduling
On the effectiveness of cache partitioning in hard real-time systems
Schedulability analysis of global scheduling for multicore systems with shared caches
Static probabilistic timing analysis for real-time systems using random replacement caches
Cache related preemption delay for set-associative caches: resilience analysis
Cache-related preemption delay via useful cache blocks: survey and redefinition
Resilience analysis: tightening the CRPD bound for set-associative caches
A Comparison between Fixed Priority and EDF Scheduling accounting for Cache Related Pre-emption Delays
A new notion of useful cache block to improve the bounds of cache-related preemption delay
Response-time analysis for fixed-priority systems with a write-back cache
Optimal task placement to improve cache performance
Analysis of probabilistic cache related pre-emption delays for systems with random cache replacement policies
Cache related pre-emption delays in hierarchical scheduling
On the effectiveness of cache partitioning in hard real-time systems
Schedulability analysis of global scheduling for multicore systems with shared caches