Sciweavers

33 search results - page 4 / 7
» Complete worst-case execution time analysis of straight-line...
Sort
View
JSA
2000
175views more  JSA 2000»
13 years 7 months ago
Complete worst-case execution time analysis of straight-line hard real-time programs
In this article, the problem of finding a tight estimate on the worst-case execution time (WCET) of a real-time program is addressed. The analysis is focused on straight-line code...
Friedhelm Stappert, Peter Altenbernd
RTSS
2003
IEEE
14 years 25 days ago
Data Caches in Multitasking Hard Real-Time Systems
Data caches are essential in modern processors, bridging the widening gap between main memory and processor speeds. However, they yield very complex performance models, which make...
Xavier Vera, Björn Lisper, Jingling Xue
EMSOFT
2007
Springer
14 years 1 months ago
WCET estimation for executables in the presence of data caches
This paper describes techniques to estimate the worst case execution time of executable code on architectures with data caches. The underlying mechanism is Abstract Interpretation...
Rathijit Sen, Y. N. Srikant
IANDC
2007
107views more  IANDC 2007»
13 years 7 months ago
Task automata: Schedulability, decidability and undecidability
We present a model, task automata, for real time systems with non-uniformly recurring computation tasks. It is an extended version of timed automata with asynchronous processes th...
Elena Fersman, Pavel Krcál, Paul Pettersson...
CASES
2001
ACM
13 years 11 months ago
Efficient longest executable path search for programs with complex flows and pipeline effects
Current development tools for embedded real-time systems do not efficiently support the timing aspect. The most important timing parameter for scheduling and system analysis is th...
Friedhelm Stappert, Andreas Ermedahl, Jakob Engblo...