(Enter summary)
Abstract: Caches impose a major problem for predicting execution times of real-time systems since the cache behavior depends on the history of previous memory references. Too pessimistic assumptions on cache hits can result in worst-case execution time estimates that are prohibitive for real-time systems. This paper presents a novel approach for deriving a highly accurate analytical cache hit function for programs at compile-time based on the assumption that no external cache interference (e.g. process... (Update)
Context of citations to this paper: More
.... 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...
.... (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...
Cited by: More
A Compiler Tool to Predict Memory Hierarchy.. - Fraguela, Doallo, .. (2004)
(Correct)
Experimental Evaluation of Code Properties for WCET Analysis - Colin, Petters
(Correct)
Data-Flow Frameworks for Worst-Case Execution Time Analysis - Blieberger (2000)
(Correct)
Similar documents (at the sentence level):
61.5%: Symbolic Cache Analysis for Real-Time Systems - Blieberger, Fahringer, Scholz (1999)
(Correct)
Active bibliography (related documents): More All
0.4: Symbolic Data Flow Analysis for Detecting Deadlocks.. - Blieberger.. (2000)
(Correct)
0.4: Interprocedural Symbolic Evaluation of Ada Programs with .. - Blieberger.. (1999)
(Correct)
0.3: PłT+: A Performance Estimator for Distributed and Parallel.. - Pozgaj, Fahringer (2000)
(Correct)
Similar documents based on text: More All
0.6: On the Tree Width of Ada Programs - Burgstaller, Blieberger, Scholz
(Correct)
0.4: Symbolic Data Flow Analysis for Detecting - Deadlocks In Ada
(Correct)
0.3: P³T+: A Performance Estimator for Distributed and.. - Fahringer, Pozgaj (2001)
(Correct)
Related documents from co-citation: More All
4: Interprocedural Symbolic Evaluation of Ada Programs with Aliases
- Blieberger, Burgstaller et al. - 1999
4: Symbolic Evaluation for Parallelizing Compilers
- Fahringer, Scholz - 1997
3: Elimination algorithms for data flow analysis (context) - Ryder, Paull - 1986
BibTeX entry: (Update)
J. Blieberger, T. Fahringer, and B. Scholz. Symbolic cache analysis for real-time systems. To appear in RealTime Systems Journal., 1999. http://citeseer.ist.psu.edu/article/blieberger99symbolic.html More
@article{ blieberger00symbolic,
author = "Johann Blieberger and Thomas Fahringer and Bernhard Scholz",
title = "Symbolic Cache Analysis for Real-Time Systems",
journal = "Real-Time Systems",
volume = "18",
number = "2/3",
pages = "181-215",
year = "2000",
url = "citeseer.ist.psu.edu/article/blieberger99symbolic.html" }
Citations (may not include all citations):
1575
Computer Architecture - A Quantitative Approach (context) - Hennessy, Patterson - 1990
652
A discipline of programming (context) - Dijkstra - 1976
376
The Cache Performance and Optimization of Blocked Algorithms (context) - Lam, Rothberg et al. - 1991
234
Cache Memories (context) - Smith - 1982
109
Cache Profiling and the SPEC Benchmarks: A Case Study
- Lebeck, Wood - 1994
85
Predicting Program Execution Times by Analyzing Static and D.. (context) - Park - 1993
83
Bounding Worst-Case Instruction Cache Performance (context) - Arnold, Mueller et al. - 1994 DBLP
82
On estimating and enhancing cache effectiveness (context) - Ferrante, Sarkar et al. - 1991
77
Cache Miss Equations: An Analytical Representation of Cache ..
- Ghosh, Martonosi et al. - 1997
68
Beyond Induction Variables: Detecting and Classifying Sequen..
- Gerlek, Stoltz et al. - 1995
61
Integrating the Timing Analysis of Pipelining and Instructio.. (context) - Healy, Whalley et al. - 1995 ACM DBLP
59
Cache Interference Phenomena
- Temam, Fricker et al. - 1994 ACM DBLP
49
Symbolic Execution and Program Testing (context) - King - 1976 ACM DBLP
49
Cache Modeling for Real-Time Software: Beyond Direct Mapped .. (context) - Li, Malik et al. - 1996
48
Bounding Pipeline and Instruction Cache Performance (context) - Healy, Arnold et al. - 1999 ACM DBLP
47
the False Path Problem in Hard Real-Time Programs
- Altenbernd - 1996
42
Symbolic Analysis for Parallelizing Compilers
- Haghighat, Polychronopoulos - 1996 ACM DBLP
42
Performance Estimation of Embedded Software with Instruction..
- Li, Malik et al. - 1995
31
Worst Case Execution Time Analysis for Modern Hardware Archi..
- Ottosson, Sjoedin - 1997
31
An Accurate Worst Case Timing Analysis Technique for RISC Pr..
- Lim, Bae et al. - 1994
30
Performance Debugging Shared Memory Multiprocessor Programs .. (context) - Goldberg, Hennessy - 1991
23
PDATS Lossless Address Trace Compression For Reducing File S..
- Johnson, Ha - 1994
23
Facilitating Worst-Case Execution Times Analysis for Optimiz..
- Engblom, Altenbernd et al. - 1998
21
Combining Abstract Interpretation and ILP for Microarchitect.. (context) - Theiling, Ferdinand - 1998
20
Symbolic Evaluation for Parallelizing Compilers
- Fahringer, Scholz - 1997
18
Static Analysis of Cache Performance for Real-Time Programmi.. (context) - Rawat - 1993
16
Symbolic Evaluation and the Analysis of Programs (context) - Cheatham, Holloway et al. - 1979
15
Efficient Symbolic Analysis for Parallelizing Compilers and ..
- Fahringer
13
Combining Static Worst-Case Timing Analysis and Program Proo.. (context) - Chapman, Burns et al. - 1996
13
Deterministic Upperbounds of the Worst-Case Execution Times .. (context) - Liu, Lee - 1994
11
Analyzing and Visualizing Performance of Memory Hierachies (context) - Callahan, Kennedy et al. - 1990
11
Generalizing Timing Predictions to Set-Associative Caches
- Mueller - 1997
10
Some Techniques for Solving Recurrences (context) - Lueker - 1980
9
Interfacing Mathematica from the Vienna Fortran Compilation .. (context) - Scheibl, Celic et al. - 1996
9
Discrete Loops and Worst Case Performance
- Blieberger - 1994
9
Worst-Case Space and Time Complexity of Recursive Procedures
- Blieberger, Lieger - 1996 ACM DBLP
9
Worst-Case Execution Time Analysis on Modern Processors
- Nilsen, Rygg - 1995
8
Estimating Cache Performance for Sequential and Data Paralle..
- Fahringer - 1997 ACM DBLP
8
Symbolic Reaching Definitions Analysis of Ada Programs
- Blieberger, Burgstaller - 1998
7
Cache Behaviour Prediction by Abstract Interpretation (context) - Alt, Ferdinand et al. - 1996
5
A Unified Symbolic Evaluation Framework for Parallelizing Co..
- Fahringer, Scholz - 1999
5
Data-Flow Frameworks for Worst-Case Execution Time Analysis
- Blieberger - 1997
4
Acme Cache Simulator (context) - Hunt - 1997
1
Interprocedural Symbolic Analysis of Ada Programs with Alias.. (context) - Blieberger, Burgstaller et al. - 1999
1
Automatic Performance Prediction of Parallel Programs (context) - Analysis, Systems - 1996
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.auto.tuwien.ac.at/~blieb/papers.html): More
Multi-Staged Discrete Loops for Real-Time Systems - Lieger, Blieberger
(Correct)
Worst-Case Space and Time Complexity of Recursive Procedures - Blieberger, LIEGER (1996)
(Correct)
Symbolic Pointer Analysis for Detecting Memory Leaks - Scholz, Blieberger, Fahringer (2000)
(Correct)
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