155 search results - page 19 / 31 » On Schedulability Bounds of Static Priority Schedulers |
GLVLSI
2002
IEEE
15 years 2 months ago
2002
IEEE
Many computation-intensive or recursive applications commonly found in digital signal processing and image processing applications can be represented by data-flow graphs (DFGs). ...
HPDC
2010
IEEE
14 years 9 months ago
2010
IEEE
Parallel computing on volatile distributed resources requires schedulers that consider job and resource characteristics. We study unconventional computing environments containing ...
88
Voted
ECRTS
1998
IEEE
15 years 1 months ago
1998
IEEE
This paper introduces improvements in partitioning schemes for multiprocessor real-time systems which allow higher processor utilization and enhanced schedulability by using exact...
SOCA
2010
IEEE
14 years 8 months ago
2010
IEEE
In asynchronous event systems, the production of an event is decoupled from its consumption via an event queue. The loose coupling of such systems allows great flexibility as to ...
ECRTS
2010
IEEE
14 years 10 months ago
2010
IEEE
Schedulability analysis for hard real-time systems requires bounds on the execution times of its tasks. To obtain useful bounds in the presence of caches, static timing analyses mu...