904 search results - page 71 / 181 » Scheduling task graphs optimally with A |
EOR
2006
13 years 8 months ago
2006
: All information systems have to be protected. As the number of information objects and the number of users increase the task of information system's protection becomes more ...
ASAP
2000
IEEE
14 years 1 months ago
2000
IEEE
This paper explores the problem of efficiently ordering interprocessor communication operations in statically-scheduled multiprocessors for iterative dataflow graphs. In most digi...
SPAA
2005
ACM
14 years 2 months ago
2005
ACM
We describe a new class of utility-maximization scheduling problem with precedence constraints, the disconnected staged scheduling problem (DSSP). DSSP is a nonpreemptive multipro...
RTSS
2002
IEEE
14 years 1 months ago
2002
IEEE
The schedulability analysis problem for many realistic task models is intractable. Therefore known algorithms either have exponential complexity or at best can be solved in pseudo...
FLAIRS
2008
13 years 11 months ago
2008
Reasoning with conditional time-intervals representing activities or tasks that may or may not be executed in the final schedule is crucial in many scheduling applications. In Con...