904 search results - page 23 / 181 » Scheduling task graphs optimally with A |
134
click to vote
ISPAN
1997
IEEE
15 years 6 months 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...
115
click to vote
ECRTS
2010
IEEE
15 years 3 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...
102
click to vote
RTS
2002
15 years 1 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...
102
click to vote
PLDI
2000
ACM
15 years 6 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...
148
Voted
CCGRID
2008
IEEE
15 years 4 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...