On the analysis of random replacement caches using static probabilistic timing methods for multi-path programs
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Real-Time Systems, 54, 2, S. 307-388
- Ereignis
-
Veröffentlichung
- (wo)
-
Augsburg
- (wer)
-
Universität Augsburg
- (wann)
-
2018
- Ereignis
-
Veröffentlichung
- (wer)
-
Springer Science and Business Media LLC
- (wann)
-
2018
- Urheber
- DOI
-
10.1007/s11241-017-9295-2
- URN
-
urn:nbn:de:bvb:384-opus4-696990
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
14.08.2025, 11:01 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Lesage, Benjamin
- Griffin, David
- Altmeyer, Sebastian
- Cucu-Grosjean, Liliana
- Davis, Robert I.
- Universität Augsburg
- Springer Science and Business Media LLC
Entstanden
- 2018
Ähnliche Objekte (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