J. Blieberger, T. Fahringer, B. Scholz, Symbolic cache analysis for real-time systems, Real-Time Systems 18 (2/3) (2000) 181--215. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Data-Flow Frameworks for Worst-Case Execution Time Analysis - Blieberger (2000) Self-citation (Blieberger) (Correct)
....whereas its edges represent transfers of control between basic blocks. We assume that the WCET of each basic block is fixed and can be determined at compile time, i.e. we do not consider e#ects of caching or pipelining. Cache hit miss prediction with help of symbolic evaluation is presented in [BFS00] symbolic analysis of pipelining will be treated in a forthcoming paper. Example 1. We use a running example shown in Figure 1. The corresponding control flow graph (CFG) is depicted in Figure 2. The comments added at statements in Figure 1 indicate in which node of the control flow graph they ....
....i.e. the timing behavior of a basic block does not change if it is executed several times. This excludes e#ects of caching or pipelining from our model. Some research on this subject has been conducted (cf. HBW94, HWH95, LL94, AMWH94] but these issues are out of the scope of this paper. In [BFS00] cache hit analysis is performed with help of symbolic evaluation. The data flow framework defined below will allow for estimating the overall timing behavior of a procedure by employing solution algorithms well known for classic data flow frameworks. Definition 3.1. L =# N 0 (R 0 ) ....
[Article contains additional citation context not shown here]
Johann Blieberger, Thomas Fahringer, and Bernhard Scholz, Symbolic cache analysis for real-time systems, Real-Time Systems, Special Issue on Worst-Case Execution Time Analysis 18 (2000), no. 2/3, 181--215. 3, 8, 16, 21
Data-Flow Frameworks for Worst-Case Execution Time Analysis - Blieberger (2000) Self-citation (Blieberger) (Correct)
.... is described in (Stoyenko et al. 1991) Although in the meantime it has been proved that more general loop statements can be used in real time programming languages (cf. Blieberger, 1994) and that recursion can be employed without harm in real time systems (cf. Blieberger and Lieger, 1996; Blieberger, 2000)) the concept of schedulability analysis, which is also introduced in (Halang and Stoyenko, 1991) is still very important for real time applications. One of the minor results of this paper is that goto statements can be used for implementing real time systems without prohibiting schedulability ....
....whereas its edges represent transfers of control between basic blocks. We assume that the WCET of each basic block is fixed and can be determined at compile time, i.e. we do not consider effects of caching or pipelining. Cache hit miss prediction with help of symbolic evaluation is presented in (Blieberger et al. 2000b) symbolic analysis of pipelining will be treated in a forthcoming paper. Example 1. We use a running example shown in Figure 1. The corresponding control flow graph (CFG) is depicted in Figure 2. The comments added at statements in Figure 1 indicate in which node of the control flow graph ....
[Article contains additional citation context not shown here]
Blieberger, J., T. Fahringer, and B. Scholz: 2000b, `Symbolic Cache Analysis for Real-Time Systems'. Real-Time Systems, Special Issue on Worst-Case Execution Time Analysis 18(2/3), 181--215.
Symbolic Data Flow Analysis for Detecting Deadlocks.. - Blieberger.. (2000) (5 citations) Self-citation (Blieberger Scholz) (Correct)
....program s control flow onto the values of variables and the condition under which control flow reaches a given program point. In the past symbolic evaluation has been successfully applied to the reaching definitions problem [2] to worst case execution time analysis [1] to cache hit prediction [4], to alias analysis [3] to optimization problems of High Performance Fortran [12] and to pointer analysis for detecting memory leaks [17] The underlying program representation for symbolic evaluation is the control flow graph (CFG) a directed labelled graph. Its nodes are basic blocks ....
....all nodes in the CFG, a set of symbolic equations is used to compute program contexts. The equation system is solved by an elimination algorithm for data flow analysis [16] Symbolic Deadlock Detection in Ada Tasking Programs 3 3 Symbolic Data Flow Equations for Tasking Programs In previous work [3, 17, 4, 1] we have applied symbolic analysis for sequential programs. In order to analyze Ada programs with tasks we need a new form of analysis to cope with these notions of parallelism. To get a handle on the problem a new program representation, namely the tasking control flow graph (TCFG) is introduced ....
[Article contains additional citation context not shown here]
J. Blieberger, T. Fahringer, and B. Scholz, Symbolic cache analysis for real-time systems, Real-Time Systems, Special Issue on Worst-Case Execution Time Analysis (2000), (to appear).
Symbolic Pointer Analysis for Detecting Memory Leaks - Scholz, Blieberger, Fahringer (2000) Self-citation (Blieberger Fahringer Scholz) (Correct)
No context found.
J. Blieberger, T. Fahringer, and B. Scholz. Symbolic cache analysis for real-time systems. To appear in RealTime Systems Journal., 1999.
A Compiler Tool to Predict Memory Hierarchy.. - Fraguela, Doallo, .. (2004) (3 citations) (Correct)
No context found.
J. Blieberger, T. Fahringer, B. Scholz, Symbolic cache analysis for real-time systems, Real-Time Systems 18 (2/3) (2000) 181--215.
Experimental Evaluation of Code Properties for WCET Analysis - Colin, Petters (Correct)
No context found.
J. Blieberger, T. Fahringer, and B. Scholz. Symbolic cache analysis for real--time systems. Journal of Realtime Systems, 18:181--215, 2000.
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