155 search results - page 5 / 31 » On Schedulability Bounds of Static Priority Schedulers |
IEEEPACT
1998
IEEE
15 years 1 months ago
1998
IEEE
Compile-time scheduling is one approach to extract parallelism which has proved effective when the execution behavior is predictable. Unfortunately, the performance of most priori...
DATE
2006
IEEE
15 years 3 months ago
2006
IEEE
In this paper, we present an extension to existing approaches that capture and exploit timing-correlation between tasks for scheduling analysis in distributed systems. Previous ap...
77
Voted
DATE
2007
IEEE
15 years 3 months ago
2007
IEEE
Recently there has been considerable interest in incorporating timing effects of microarchitectural features of processors (e.g. caches and pipelines) into the schedulability anal...
JPDC
2007
14 years 9 months ago
2007
In a distributed heterogeneous computing system, the resources have different capabilities and tasks have different requirements. To maximize the performance of the system, it is ...
RTCSA
2000
IEEE
15 years 2 months ago
2000
IEEE
A number of industrial applications advocate the use of time-triggered approaches for reasons of predictability, distribution, and particular constraints such as jitter or end-to-...