Static use of locking caches vs. dynamic use of locking caches for real-time systems

Campoy, A.M.; Perles, Ángel; Rodríguez, Francisco J.; Busquets-Mataix, J.V.

doi:10.1109/ccece.2003.1226134

Cited by 20 publications

(18 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, cache-locking can either be global, where each task "owns" a specific part of the cache, or local, where each task can use the entire cache, but the cache is reloaded each time a pre-emption occurs. Although static and dynamic cache locking schemes are incomparable in general, the dynamic scheme typically performs better than the static scheme, in particular when the cache is relatively small compared to the size of the code (Campoy et al 2003;Liu et al 2012). The reloading costs for dynamic schemes give rise to pessimistic results, however.…”

Section: Cache-related Pre-emption Delays (Crpds)mentioning

confidence: 93%

Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation

et al. 2017

View full text Add to dashboard Cite

Commercial off-the-shelf programmable platforms for real-time systems typically contain a cache to bridge the gap between the processor speed and main memory speed. Because cache-related pre-emption delays (CRPD) can have a significant influence on the computation times of tasks, CRPD have been integrated in the response time analysis for fixed-priority pre-emptive scheduling (FPPS). This paper presents CRPD aware response-time analysis of sporadic tasks with arbitrary deadlines for fixed-priority pre-emption threshold scheduling (FPTS), generalizing earlier work. The analysis is complemented by an optimal (pre-emption) threshold assignment algorithm, assuming the priorities of tasks are given. We further improve upon these results by presenting an algorithm that searches for a layout of tasks in memory that makes a task set schedulable. The paper includes an extensive comparative evaluation of the schedulability ratios of FPPS and FPTS, taking CRPD into account. The practical relevance of our work stems from FPTS support in AUTOSAR, a standardized development model for the automotive industry. Keywords Fixed-priority pre-emptive scheduling · Fixed-priority scheduling with pre-emption thresholds · Cache-related pre-emption delay · Response-time analysis B Reinder J. Bril

show abstract

Section: Cache-related Pre-emption Delays (Crpds)mentioning

confidence: 93%

Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation

et al. 2017

View full text Add to dashboard Cite

show abstract

“…They use genetic algorithms for both static locking (Campoy et al 2001a(Campoy et al , 2001b and dynamic locking (Campoy et al 2007) in multi-task preemptive real-time systems. In Campoy et al (2003), they compare the static and dynamic use of I-Cache locking algorithms and conclude that static locking presents a greater degree of predictability than dynamic locking, but dynamic locking offers better performance for the majority of the cases. The genetic method in general has a high time complexity.…”

Section: Related Workmentioning

confidence: 97%

“…Most of the previous work proposes heuristic algorithms using a greedy strategy (Puaut and Decotigny 2002;Campoy et al 2005;Arnaud and Puaut 2006;Falk et al 2007;Asaduzzaman et al 2007) or highcomplexity genetic methods (Campoy et al 2001a(Campoy et al , 2001b(Campoy et al , 2003(Campoy et al , 2007Arnaud and Puaut 2006). Some work can only be applied to single-task systems (Falk et al 2007;Asaduzzaman et al 2007;Liu et al 2009b), where WCET minimization is the objective.…”

Section: Related Workmentioning

confidence: 98%

Instruction cache locking for multi-task real-time embedded systems

Liu

Xue

2011

Real-Time Syst

View full text Add to dashboard Cite

In a multi-task embedded system, a cache is shared by different tasks, which increases the complexity of cache management and the unpredictability of cache behavior. This unpredictability in turn brings an overestimation of application's worst-case execution time (WCET) and worst-case CPU utilization (WCU) which are two of the most important criteria for real-time embedded systems. Modern processors often provide cache locking capability, which can be applied statically and dynamically to manage cache in a predictable manner. The selection of instructions to be locked in the instruction cache (I-Cache) has dramatic influence on the system performance. This paper focuses on applying cache locking techniques to the shared I-Cache to minimize WCU for multi-task embedded systems. We analyze and compare three different strategies to perform I-Cache locking: static locking, semidynamic locking, and dynamic locking. Different algorithms are proposed utilizing the foreknown information of embedded applications. Experimental results show that the proposed algorithms can reduce WCU compared to previous techniques.

show abstract

“…The cache content can be locked entirely or partially for the whole system lifetime (static cache locking) or it can be changed at runtime (dynamic cache locking) [14].…”

Section: Design Choices For the Prefetch Architecturementioning

confidence: 99%

Towards a Time-Predictable Hierarchical Memory Architecture - Prefetching Options to be Explored

Cilku

Puschner

2010

2010 13th IEEE International Symposium on Object/Component/Service-Oriented Real-Time Distributed Computing Workshops

View full text Add to dashboard Cite

In this paper we explore a hierarchical memory architecture that simplifies the WCET prediction of tasks. Instead of using cache memories for speeding up code execution, we propose to use hierarchical memories that are similar to scratchpad memories. These memories are filled by explicit prefetch operations that are executed in synchrony with program execution. The instructions respectively the data that determine both the content and the timing of the operations that perform the memory transfers between the different memory levels are computed at code-generation time. The paper describes the overall system and memory architecture, and design choices for explicitely controlled timepredictable hierarchical memory architectures.

show abstract

Static use of locking caches vs. dynamic use of locking caches for real-time systems

Abstract: Abstract

Cited by 20 publications

References 4 publications

Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation

Fixed priority scheduling with pre-emption thresholds and cache-related pre-emption delays: integrated analysis and evaluation

Instruction cache locking for multi-task real-time embedded systems

Towards a Time-Predictable Hierarchical Memory Architecture - Prefetching Options to be Explored

Contact Info

Product

Resources

About