On the analysis of random replacement caches using static probabilistic timing methods for multi-path programs
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Real-Time Systems, 54, 2, S. 307-388
- Event
-
Veröffentlichung
- (where)
-
Augsburg
- (who)
-
Universität Augsburg, Springer Science and Business Media LLC
- (when)
-
2018
- Creator
- DOI
-
10.1007/s11241-017-9295-2
- URN
-
urn:nbn:de:bvb:384-opus4-696990
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:51 PM CET
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
- Lesage, Benjamin
- Griffin, David
- Altmeyer, Sebastian
- Cucu-Grosjean, Liliana
- Davis, Robert I.
- Universität Augsburg, Springer Science and Business Media LLC
Time of origin
- 2018
Other Objects (12)
Static probabilistic timing analysis for real-time systems using random replacement caches
Progress on static probabilistic timing analysis for systems with random cache replacement policies
Analysis of probabilistic cache related pre-emption delays for systems with random cache replacement policies
Cache related preemption delay for set-associative caches: resilience analysis
Cache-related preemption delay via useful cache blocks: survey and redefinition
Analysis of probabilistic cache related pre-emption delays
On the correctness, optimality and precision of Static Probabilistic Timing Analysis
Static probabilistic timing analysis for multi-path programs
A new notion of useful cache block to improve the bounds of cache-related preemption delay
Cache-related preemption delay computation for set-associative caches - pitfalls and solutions
On the application of static probabilistic timing analysis to memory hierarchies
Resilience analysis: tightening the CRPD bound for set-associative caches
Static probabilistic timing analysis for real-time systems using random replacement caches
Progress on static probabilistic timing analysis for systems with random cache replacement policies
Analysis of probabilistic cache related pre-emption delays for systems with random cache replacement policies
Cache related preemption delay for set-associative caches: resilience analysis
Cache-related preemption delay via useful cache blocks: survey and redefinition
Analysis of probabilistic cache related pre-emption delays
On the correctness, optimality and precision of Static Probabilistic Timing Analysis
Static probabilistic timing analysis for multi-path programs
A new notion of useful cache block to improve the bounds of cache-related preemption delay
Cache-related preemption delay computation for set-associative caches - pitfalls and solutions
On the application of static probabilistic timing analysis to memory hierarchies
Resilience analysis: tightening the CRPD bound for set-associative caches
Static probabilistic timing analysis for real-time systems using random replacement caches
Progress on static probabilistic timing analysis for systems with random cache replacement policies
Analysis of probabilistic cache related pre-emption delays for systems with random cache replacement policies
Cache related preemption delay for set-associative caches: resilience analysis
Cache-related preemption delay via useful cache blocks: survey and redefinition
Analysis of probabilistic cache related pre-emption delays
On the correctness, optimality and precision of Static Probabilistic Timing Analysis
Static probabilistic timing analysis for multi-path programs
A new notion of useful cache block to improve the bounds of cache-related preemption delay
Cache-related preemption delay computation for set-associative caches - pitfalls and solutions
On the application of static probabilistic timing analysis to memory hierarchies