ACM Home Page
Please provide us with feedback. Feedback
An improved approach for set-associative instruction cache partial analysis
Full text PdfPdf (191 KB)
Source Symposium on Applied Computing archive
Proceedings of the 2008 ACM symposium on Applied computing table of contents
Fortaleza, Ceara, Brazil
SESSION: Software verification table of contents
Pages 360-367  
Year of Publication: 2008
ISBN:978-1-59593-753-7
Authors
C. Ballabriga  Université de Toulouse, Toulouse cedex
H. Casse  Université de Toulouse, Toulouse cedex
P. Sainrat  Université de Toulouse, Toulouse cedex
Sponsor
SIGAPP: ACM Special Interest Group on Applied Computing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 5,   Downloads (12 Months): 31,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1363686.1363778
What is a DOI?

ABSTRACT

The current Worst Case Execution Time (WCET) computation methods are usually applied to whole programs, this may drive to scalability limitations as the program size becomes bigger. A solution could be to split programs into components that could support separated partial analyses to decrease the computation time. The componentization is also consistent with the more and more frequent use of Component Off The Shelf (COTS). Consequently, we need algorithms to perform analyses on component-wise applications. In this paper, we focus on the partial analysis of set-associative instruction caches, based on the categorization method described by M. Alt et al. We have first evaluated A. Rakib et al.'s approach to this problem and we have shown that, while correct, this approach can be greatly improved by a better estimation of the component effect on the cache. The version we have developed addresses the identified shortcomings and the experimentation results have been evaluated according to two criteria: (1) overestimation of the WCET and (2) computation time gain against the whole program analysis approach.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
Ballabriga, C., Cassé, H., and Sainrat, P. WCET computation on software components by partial static analysis. In Junior Researcher Workshop on Real-Time Computing, Nancy, 29/03/2007-30/03/2007 (http://www.loria.fr, March 2007), LORIA, pp. 15--18.
 
3
Cassé, H., and Sainrat, P. OTAWA, a framework for experimenting WCET computations. In 3rd European Congress on Embedded Real-Time Software, Toulouse (25--27 December 2005).
 
4
Cousot, P., and Cousot, R. Static determination of dynamic properties of programs. In Proceedings of the Second International Symposium on Programming (1976), Dunod, Paris, France, pp. 106--130.
5
 
6
 
7
Ferdinand, C. A fast and efficient cache persistence analysis. Technical report, Universitat des Saarlandes (Sept. 1997).
 
8
Ferdinand, C., Martin, F., and Wilhelm, R. Applying compiler techniques to cache behavior prediction. In Proceedings of the ACM SIGPLAN Workshop on Language, Compiler and Tool Support for Real-Time Systems (1997), pp. 37--46.
 
9
 
10
 
11
Mueller, F., and Whalley, D. Fast instruction cache analysis via static cache simulation. TR 94042, Dept. of CS, Florida State University (April 1994).
12
 
13
Rakib, A., Parshin, O., Thesing, S., and Wilhelm, R. Component-wise instruction-cache behavior prediction. In Automated Technology for Verification and Analysis (2004), pp. 211--229.
 
14

Collaborative Colleagues:
C. Ballabriga: colleagues
H. Casse: colleagues
P. Sainrat: colleagues