319 search results - page 5 / 64 » Worst-Case Analysis of Scheduling Heuristics of Parallel Sys... |
WORDS
2002
IEEE
14 years 13 days ago
2002
IEEE
Certainly, in hard real-time systems, it is reasonable to argue that no hard real-time threads should behave in an unpredictable way and that schedulability should be guaranteed b...
WADS
2007
Springer
14 years 1 months ago
2007
Springer
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...
EMSOFT
2007
Springer
14 years 1 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...
ECRTS
2004
IEEE
13 years 11 months ago
2004
IEEE
Most previous research done in probabilistic schedulability analysis assumes a known distribution of execution times for each task of a real-time application. This is however not ...
IPPS
2008
IEEE
14 years 1 months ago
2008
IEEE
High-performance microprocessors, e.g., multithreaded and multicore processors, are being implemented in embedded real-time systems because of the increasing computational require...