Abstract. In this paper, we propose a timing analysis approach for preemptive multi-tasking real-time systems with caches. The approach focuses on the cache reload overhead caused by preemptions. The Worst Case Response Time (WCRT) of each task is estimated by incorporating cache reload overhead. After acquiring the WCRT of each task, we can further analyze the schedulability of the system. Four sets of applications are used to exhibit the performance of our approach. The experimental results show that our approach can reduce the estimate of WCRT up to 44 % over prior state-of-the-art.
With the rapid growth of complex hardware features, timing analysis has become an increasingly diffi...
International audienceCache prediction for real-time systems in a preemptive scheduling context is s...
In hard real-time systems, cache partitioning is often suggested as a means of increasing the predic...
In this paper, we propose an approach to estimate the Worst Case Response Time (WCRT) of each task i...
In this paper, we propose an approach to estimate the Worst Case Response Time (WCRT) of each task i...
In this paper, we investigate the problem of inter-task cache interference in preemptive multi-taski...
Schedulability analyses for preemptive real-time systems need to take into account cache-related pre...
Cache locking improves timing predictability at the cost of performance. We explore a novel approach...
Multitasked real-time systems often employ caches to boost performance. However the unpredictable dy...
RAMAPRASAD, HARINI Analytically Bounding Data Cache Behavior for Real-Time Sys-tems. (Under the dire...
Schedulability analysis of real-time systems under preemptive scheduling may often lead to false-neg...
Cache memory is used in almost all computer systems today to bridge the ever increasing speed gap be...
Dependable real-time systems are essential to time-critical applications. The systems that run these...
International audienceA task can be preempted by several jobs of higher priority tasks during its re...
23rd IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2017, Pittsburg, PA, US...
With the rapid growth of complex hardware features, timing analysis has become an increasingly diffi...
International audienceCache prediction for real-time systems in a preemptive scheduling context is s...
In hard real-time systems, cache partitioning is often suggested as a means of increasing the predic...
In this paper, we propose an approach to estimate the Worst Case Response Time (WCRT) of each task i...
In this paper, we propose an approach to estimate the Worst Case Response Time (WCRT) of each task i...
In this paper, we investigate the problem of inter-task cache interference in preemptive multi-taski...
Schedulability analyses for preemptive real-time systems need to take into account cache-related pre...
Cache locking improves timing predictability at the cost of performance. We explore a novel approach...
Multitasked real-time systems often employ caches to boost performance. However the unpredictable dy...
RAMAPRASAD, HARINI Analytically Bounding Data Cache Behavior for Real-Time Sys-tems. (Under the dire...
Schedulability analysis of real-time systems under preemptive scheduling may often lead to false-neg...
Cache memory is used in almost all computer systems today to bridge the ever increasing speed gap be...
Dependable real-time systems are essential to time-critical applications. The systems that run these...
International audienceA task can be preempted by several jobs of higher priority tasks during its re...
23rd IEEE Real-Time and Embedded Technology and Applications Symposium, RTAS 2017, Pittsburg, PA, US...
With the rapid growth of complex hardware features, timing analysis has become an increasingly diffi...
International audienceCache prediction for real-time systems in a preemptive scheduling context is s...
In hard real-time systems, cache partitioning is often suggested as a means of increasing the predic...