15 search results - page 2 / 3 » Approximation of Worst-Case Execution Time for Preemptive Mu... |
DATE
2005
IEEE
13 years 10 months ago
2005
IEEE
A novel energy reduction strategy to maximally exploit the dynamic workload variation is proposed for the offline voltage scheduling of preemptive systems. The idea is to construc...
WADS
2001
Springer
13 years 9 months ago
2001
Springer
Abstract. Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Portions of such codes when t...
EMSOFT
2007
Springer
13 years 11 months ago
2007
Springer
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...
RTSS
2003
IEEE
13 years 10 months ago
2003
IEEE
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...
RTSS
2000
IEEE
13 years 9 months ago
2000
IEEE
The maturity of schedulabilty analysis techniquesfor fired-prioritypreemptive scheduling has enabled the consideration of timing issues at design time using a specification of the...