Sciweavers

346 search results - page 3 / 70
» Worst-case execution time analysis for a Java processor
Sort
View
ISOLA
2010
Springer
15 years 19 days ago
Worst-Case Analysis of Heap Allocations
In object oriented languages, dynamic memory allocation is a fundamental concept. When using such a language in hard real-time systems, it becomes important to bound both the worst...
Wolfgang Puffitsch, Benedikt Huber, Martin Schoebe...
164
Voted
RTAS
1996
IEEE
15 years 6 months ago
Efficient worst case timing analysis of data caching
Recent progress in worst case timing analysis of programs has made it possible to perform accurate timing analysis of pipelined execution and instruction caching, which is necessa...
Sung-Kwan Kim, Sang Lyul Min, Rhan Ha
OTM
2004
Springer
15 years 7 months ago
A Time Predictable Instruction Cache for a Java Processor
Cache memories are mandatory to bridge the growing gap between CPU speed and main memory access time. Standard cache organizations improve the average execution time but are diffi...
Martin Schoeberl
128
Voted
RTAS
2005
IEEE
15 years 7 months ago
Bounding Worst-Case Data Cache Behavior by Analytically Deriving Cache Reference Patterns
While caches have become invaluable for higher-end architectures due to their ability to hide, in part, the gap between processor speed and memory access times, caches (and partic...
Harini Ramaprasad, Frank Mueller
135
Voted
WCET
2008
15 years 3 months ago
TuBound - A Conceptually New Tool for Worst-Case Execution Time Analysis
TUBOUND is a conceptually new tool for the worst-case execution time (WCET) analysis of programs. A distinctive feature of TUBOUND is the seamless integration of a WCET analysis c...
Adrian Prantl, Markus Schordan, Jens Knoop