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
- (when)
-
2018
- Event
-
Veröffentlichung
- (who)
-
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
-
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
- 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)
On the analysis of random replacement caches using static probabilistic timing methods for multi-path programs
Static probabilistic timing analysis for multi-path programs
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
Progress on static probabilistic timing analysis for systems with random cache replacement policies
A Comparison between Fixed Priority and EDF Scheduling accounting for Cache Related Pre-emption Delays
Analysis of probabilistic cache related pre-emption delays for systems with random cache replacement policies
Analysis of probabilistic cache related pre-emption delays
Response-time analysis for fixed-priority systems with a write-back cache
On the correctness, optimality and precision of Static Probabilistic Timing Analysis
A new notion of useful cache block to improve the bounds of cache-related preemption delay
On the analysis of random replacement caches using static probabilistic timing methods for multi-path programs
Static probabilistic timing analysis for multi-path programs
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
Progress on static probabilistic timing analysis for systems with random cache replacement policies
A Comparison between Fixed Priority and EDF Scheduling accounting for Cache Related Pre-emption Delays
Analysis of probabilistic cache related pre-emption delays for systems with random cache replacement policies
Analysis of probabilistic cache related pre-emption delays
Response-time analysis for fixed-priority systems with a write-back cache
On the correctness, optimality and precision of Static Probabilistic Timing Analysis
A new notion of useful cache block to improve the bounds of cache-related preemption delay
On the analysis of random replacement caches using static probabilistic timing methods for multi-path programs
Static probabilistic timing analysis for multi-path programs
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
Progress on static probabilistic timing analysis for systems with random cache replacement policies
A Comparison between Fixed Priority and EDF Scheduling accounting for Cache Related Pre-emption Delays
Analysis of probabilistic cache related pre-emption delays for systems with random cache replacement policies
Analysis of probabilistic cache related pre-emption delays
Response-time analysis for fixed-priority systems with a write-back cache
On the correctness, optimality and precision of Static Probabilistic Timing Analysis