Please use this identifier to cite or link to this item:
doi:10.22028/D291-25822
Title: | A fast and efficient cache persistence analysis |
Author(s): | Ferdinand, Christian |
Language: | English |
Year of Publication: | 1997 |
SWD key words: | Technische Informatik |
Free key words: | cache persistence analysis |
DDC notations: | 004 Computer science, internet |
Publikation type: | Report |
Abstract: | In this paper, abstract interpretation is applied to the problem of predicting the cache behavior of programs. The goal of our analysis is to apporximate the set of all cache states for each program point, i.e., the collecting of semantics. We take a two step approach: First, we define an auxiliary semantics of machine programs called the cache semantics that determines the contents of caches. Then, from the cache semantics one simple analysis by abstract interpretation is deleloped that allowes to determine memory blocks that will be persistent in the cache. This is in contrast to former approaches [1, 6] that required two different analyses and specific interprocedural analysis methods. The persistence analysis is designed generic with the cache logic as parameter. Experimental results are presented that demonstrate the applicability of the analysis. |
Link to this record: | urn:nbn:de:bsz:291-scidok-3836 hdl:20.500.11880/25878 http://dx.doi.org/10.22028/D291-25822 |
Date of registration: | 23-Jun-2005 |
Faculty: | MI - Fakultät für Mathematik und Informatik |
Department: | MI - Informatik |
Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
File | Description | Size | Format | |
---|---|---|---|---|
SFB-124_10-97.pdf | 3,07 MB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.