M. Alt, C. Ferdinand, F. Martin, and R. Wilhelm. Cache behaviour prediction by abstract interpretation. In Proceedings of Static Analysis Symposium (SAS'96), Lecture Notes in Computer Science (LNCS) 1145, pages 52--66. SpringerVerlag, Sep. 1996.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....power than accesses to larger or o# chip memories. Frameworks of WCET prediction are used to ensure that deadlines of tasks can be met. While the computation of WCET in presence of instruction caches has progressed in such a way that makes it possible to obtain an accurate estimate of the WCET [1, 2, 14], there has not been much progress with the presence of data caches. The main problem when dealing with data caches is that each load store instruction may access multiple memory locations (such as those that implement array or pointer accesses) Cache locking allows some or all of the contents ....

....a tight analysis of the WCMP at static time. In order to keep a high performance, load instructions are added when necessary. Later, the actual computation of the WCMP estimate is performed. We present results for a collection of programs drawn from several related papers in the real time area [1, 18, 33]. This collection includes both kernels operating on http: www.arm.com aboutarm 4X8JJ6 File ARM966E.pdf arrays and scalar programs, such as SQRT or FIBONACCI. We have also used FFT to show the feasibility of our approach for typical DSP codes. For the sake of concreteness, we present results ....

[Article contains additional citation context not shown here]

M. Alt, C. Ferdinand, F. Martin, and R. Wilhelm. Cache behaviour prediction by abstract interpretation. In Proceedings of SAS'96, Static Analysis Symposium, Lecture Notes in Computer Science (LNCS) 1145, pages 52--66. Springer-Verlag, September 1996.

....than accesses to larger or o# chip memories. Frameworks of WCET prediction are used to ensure that deadlines of tasks can be met. While the computation of WCET in the presence of instruction caches has progressed in such a way that makes it possible to obtain an accurate estimate of the WCET [1, 2, 13], there has not been much progress with the presence of data caches. The main problem when dealing with data caches is that each load store instruction may access multiple memory locations (such as those that implement array or pointer accesses) Cache locking allows some or all of the contents ....

....a tight analysis of the WCMP at static time. In order to keep a high performance, load instructions are added when necessary. Later, the actual computation of the WCMP estimate is performed. We present results for a collection of programs drawn from several related papers in the real time area [1, 17, 33]. This collection includes kernels operating on both arrays and scalars, such as SQRT or FIBONACCI. We have also used FFT to show the feasibility of our approach for typical DSP codes. For the sake of concreteness, we present results for a directmapped and a set associative cache with di#erent ....

[Article contains additional citation context not shown here]

M. Alt, C. Ferdinand, F. Martin, and R. Wilhelm. Cache behaviour prediction by abstract interpretation. In Proceedings of Static Analysis Symposium (SAS'96), Lecture Notes in Computer Science (LNCS) 1145, pages 52--66. Springer-Verlag, September 1996.

....of the WCMP, and thus for the WCET as well. Frameworks of WCET prediction are used to ensure that deadlines of tasks can be met. While the computation of WCET in the presence of instruction caches has progressed in such a way that makes it possible to obtain an accurate estimate of the WCET [1, 2, 8], there has not been much # email: xavier.vera mdh.se 1 progress with the presence of data caches. The main problem when dealing with data caches is that each load store instruction may access multiple memory locations (such as those that implement array or pointer accesses) 1.1 Coyote ....

M. Alt, C. Ferdinand, F. Martin, and R. Wilhelm. Cache behaviour prediction by abstract interpretation. In Proceedings of Static Analysis Symposium (SAS'96), Lecture Notes in Computer Science (LNCS) 1145, pages 52--66. Springer-Verlag, September 1996.

....its response time. This effect, called cache refill penalty or cache related preemption delay must be considered in the schedulability analysis, because increases the task execution time over the precalculated WCET. Several solutions have been proposed to use cache memories in real time systems. [1,2,3,4] analyse the cache behaviour to estimate the task execution time considering the intra task interference. 5,6,7] analyse the cache behaviour to estimate the task response time considering the inter task interference, using a precalculated cached WCET. 8,9,10,11] use hardware and software ....

M. Alt, C. Ferdinand, F. Martin, R. Wilhelm. "Cache Behaviour Prediction by Abstract Interpretation" In Static Analysis Symposium, 1996

....can be further classified. A cache that holds only instructions is called instruction cache. A cache that holds only data is called data cache. A cache that can hold instructions and data is called a mixed or unified cache. Cache design has been extensively studied. Good surveys can be found in (Alt et al. 1996; Mueller, 1997; Ottosson and Sjoedin, 1997; Li et al. 1996; Li et al. 1995; Healy et al. 1995; Arnold et al. 1994; Nilsen and Rygg, 1995; Liu and Lee, 1994; Hennessy and Patterson, 1990) 3. Symbolic Evaluation Symbolic evaluation 3 (Cheatham et al. 1979; Ploedereder, 1980; Fahringer and ....

....derives all necessary information from the program s code 6 and it does not restrict program structure such as (Ghosh et al. 1997) A major component of the framework described in (Arnold et al. 1994) is a static cache simulator (Mueller, 1997) realized as a data flow analysis framework. In (Alt et al. 1996) an alternate formalization which relies on the technique of abstract interpretation is presented. Both of these approaches are based on data flow analysis but do not klufront.tex; 27 09 1999; 12:56; p.36 Symbolic Cache Analysis for Real Time Systems 37 properly model control flow. Among others, ....

[Article contains additional citation context not shown here]

Alt, M., C. Ferdinand, F. Martin, and R. Wilhelm: 1996, `Cache Behaviour Prediction by Abstract Interpretation'. In: Proc. of Static Analysis Symposium. pp. 52--66.

No context found.

M. Alt, C. Ferdinand, F. Martin, and R. Wilhelm. Cache behaviour prediction by abstract interpretation. In Proc. of Static Analysis Symposium 1996, number 1145, pages 52--66. Lecture Notes in Computer Science, 1996.

No context found.

M. Alt, C. Ferdinand, F. Martin, and R. Wilhelm. Cache behaviour prediction by abstract interpretation. In Proceedings of Static Analysis Symposium (SAS'96), Lecture Notes in Computer Science (LNCS) 1145, pages 52--66. SpringerVerlag, Sep. 1996.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC