904 search results - page 23 / 181 » Scheduling task graphs optimally with A |
ISPAN
1997
IEEE
14 years 25 days ago
1997
IEEE
The thesis of this research is that the task of exposing the parallelism in a given application should be left to the algorithm designer, who has intimate knowledge of the applica...
ECRTS
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract--Limited preemption scheduling has been introduced as a viable alternative to non-preemptive and fullypreemptive scheduling when reduced blocking times need to coexist wit...
RTS
2002
13 years 8 months ago
2002
A scheduling architecture for real-time control tasks is proposed. The scheduler uses feedback from execution-time measurements and feedforward from workload changes to adjust the...
PLDI
2000
ACM
14 years 1 months ago
2000
ACM
{ This paper presents a new approach to local instruction scheduling based on integer programming that produces optimal instruction schedules in a reasonable time, even for very la...
CCGRID
2008
IEEE
13 years 10 months ago
2008
IEEE
In this article, we revisit the problem of scheduling dynamically generated directed acyclic graphs (DAGs) of multi-processor tasks (M-tasks). A DAG is a basic model for expressin...