155 search results - page 8 / 31 » On Schedulability Bounds of Static Priority Schedulers |
107
Voted
RTAS
2010
IEEE
14 years 8 months ago
2010
IEEE
Abstract—Recent results have shown that the feasibility problem of scheduling periodic tasks with self-suspensions is NPhard in the strong sense. We observe that a variation of t...
POPL
2011
ACM
14 years 13 days ago
2011
ACM
We consider programs for embedded real-time systems which use priority-driven preemptive scheduling with task priorities adjusted dynamically according to the immediate ceiling pr...
IPPS
2002
IEEE
15 years 2 months ago
2002
IEEE
Heterogeneous computing (HC) environments composed of interconnected machines with varied computational capabilities are well suited to meet the computational demands of large, di...
RTCSA
2005
IEEE
15 years 3 months ago
2005
IEEE
In this report, we propose an approach to integrate a hybrid garbage collection algorithm into the current response time analysis framework for real-time systems. In our approach,...
ASPDAC
2011
ACM
14 years 1 months ago
2011
ACM
– This paper concerns throughput-constrained parallel execution of synchronous data flow graphs. This paper assumes static mapping and dynamic scheduling of nodes, which has seve...