Please use this identifier to cite or link to this item:
Title: Accurate Estimation of Cache-Related Preemption Delay
Authors: Negi, H.S.
Mitra, T. 
Roychoudhury, A. 
Keywords: Caches
Formal Analysis
Issue Date: 2003
Citation: Negi, H.S.,Mitra, T.,Roychoudhury, A. (2003). Accurate Estimation of Cache-Related Preemption Delay. Hardware/Software Codesign - Proceedings of the International Workshop : 201-206. ScholarBank@NUS Repository.
Abstract: Multitasked real-time systems often employ caches to boost performance. However the unpredictable dynamic behavior of caches makes schedulability analysis of such systems difficult. In particular, the effect of caches needs to be considered for estimating the inter-task interference. As the memory blocks of different tasks can map to the same cache blocks, preemption of a task may introduce additional cache misses. The time penalty introduced by these misses is called the Cache-Related Preemption Delay (CRPD). In this paper, we provide a program path analysis technique to estimate CRPD. Our technique performs path analysis of both the preempted and the preempting tasks. Furthermore, we improve the accuracy of the analysis by estimating the possible states of the entire cache at each possible preemption point rather than estimating the states of each cache block independently. To avoid incurring high space requirements, the cache states can be maintained symbolically as a Binary Decision Diagram. Experimental results indicate that we obtain tight CRPD estimates for realistic benchmarks.
Source Title: Hardware/Software Codesign - Proceedings of the International Workshop
DOI: 10.1145/944645.944698
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.


checked on Jun 16, 2019

Page view(s)

checked on Jun 14, 2019

Google ScholarTM



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.