(Enter summary)
Abstract: Hard real-time systems rely on the assumption that the deadlines of tasks can be met -- otherwise the
safety of the controlled system is jeopardized. Several scheduling paradigms have been developed to support
the analysis of a task sets and determine if a schedule is feasible. These scheduling paradigms rely on the
assumption that the worst-case execution time (WCET) of hard real-time tasks be known a-priori.
In the past years, research in the static prediction of WCET has been extended from... (Update)
Context of citations to this paper: More
...of the different execution paths within the program. Today s computer architectures with superscalar processors [11] and caches [8] make the prediction of execution times even more difficult, specially in the context of concurrent programs in which cache misses are...
...are allowed. Obtaining categorizations for set associative data cache organizations can be done in a manner similar to that described in [20]. Second, recursive calls are not allowed since it would complicate the generation of unique function instances. Third, indirect calls...
Cited by: More
Integration of Static Runtime Analysis and Program Compilation - Kirner (2000)
(Correct)
Virtual Simple Architecture (VISA): Exceeding the.. - Anantaraman..
(Correct)
Run-Time Guarantees for Real-Time Systems - The USES.. - Ferdinand, Kästner.. (1999)
(Correct)
Similar documents (at the sentence level): More
64.5%: Generalizing Timing Predictions to Set-Associative Caches - Mueller (1996)
(Correct)
17.7%: Timing Analysis for Instruction Caches - Mueller (2000)
(Correct)
10.2%: Timing Analysis for Data Caches and Set-Associative.. - White, Mueller, Healy.. (1997)
(Correct)
Active bibliography (related documents): More All
0.4: Timing Analysis for Data and Wrap-Around Fill Caches - White, Mueller, al. (1999)
(Correct)
0.4: Bounding Worst-Case Data Cache Performance - White (1996)
(Correct)
0.4: Hybrid Instruction Cache Partitioning for.. - Busquets-Mataix..
(Correct)
Similar documents based on text: More All
0.4: Coyote Project: The Simulator - Vera
(Correct)
Related documents from co-citation: More All
8: Bounding worst-case instruction cache performance (context) - Arnold, Mueller et al. - 1994
8: Predicting program execution times by analyzing static and dynamic program paths (context) - Park - 1993
8: Cache modeling for real-time software: Beyond direct mapped instruction caches (context) - Li, Malik et al. - 1996
BibTeX entry: (Update)
F. Mueller. Generalizing timing predictions to setassociative caches. TR 96-66, Inst. f. Informatik, Humbolt University Berlin, July 1996. http://citeseer.ist.psu.edu/mueller96generalizing.html More
@misc{ mueller96generalizing,
author = "F. Mueller",
title = "Generalizing timing predictions to setassociative caches",
text = "F. Mueller. Generalizing timing predictions to setassociative caches. TR
96-66, Inst. f. Informatik, Humbolt University Berlin, July 1996.",
year = "1996",
url = "citeseer.ist.psu.edu/mueller96generalizing.html" }
Citations (may not include all citations):
1582
Scheduling algorithms for multiprogramming in a hard-real-ti..
- Liu, Layland - 1973 ACM DBLP
1575
Computer Architecture: A Quantitative Approach (context) - Hennessy, Patterson - 1996 ACM
1399
Compilers -- Principles (context) - Aho, Sethi et al. - 1986
167
Calculating the maximum execution time of real-time programs (context) - Puschner, Koza - 1989 DBLP
91
An accurate worst case timing analysis for RISC processors
- Lim, Bea et al. - 1994 ACM DBLP
85
Predicting program execution times by analyzing static and d.. (context) - Park - 1993 ACM DBLP
83
Bounding worst-case instruction cache performance (context) - Arnold, Mueller et al. - 1994 DBLP
83
A retargetable technique for predicting execution time
- Harmon, Baker et al. - 1992 DBLP
55
Pipelined processors and worst case execution times
- Zhang, Burns et al. - 1993 ACM DBLP
46
Efficient microarchitecture modeling and path analysis for r..
- Li, Malik et al. - 1995 ACM DBLP
42
strategic memory allocation for real-time) cache design (context) - Kirk - 1989
35
Software-based cache partitioning for real-time applications (context) - Wolfe - 1993 ACM
28
Computing maximum task execution times -- a graph-based appr..
- Puschner - 1997
24
Static Cache Simulation and its Applications
- Mueller - 1994 ACM
23
Compiler support for software-based cache partitioning
- Mueller - 1995 ACM DBLP
15
Worst case timing analysis of RISC processors: R3000/R3010 c..
- Hur, Bea et al. - 1995 DBLP
10
Zeitanalyse von Echtzeitprogrammen (context) - Puschner - 1993
9
Adding instruction cache effect to an exact schedulability a.. (context) - Busquets-Matraix - 1996
6
Bounding worst-case data cache performance
- White, Whalley et al. - 1996 ACM
5
CPU info center (context) - CS - 1996
4
The impact of extrinsic cache performance on predictability .. (context) - Busquets-Matraix - 1995 ACM
3
Worst-case timing analysis of instruction caches with wrapar.. (context) - Healy, Whalley et al. - 1996
3
Integrating the timing analysis of pipelining and caching (context) - Healy, Whalley et al. - 1995
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.informatik.hu-berlin.de/Institut/struktur/systemanalyse/preprint/gesamt.html): More
Parallel Event Detection in Active Database Systems: The.. - Jaeger, Obermaier
(Correct)
Petri Net Based Verification of Distributed Algorithms: .. - Kindler, Reisig.. (1996)
(Correct)
A Methodology for Object-Oriented Analysis and Design Using .. - Witaszek, Holz, Lau
(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