936 search results - page 107 / 188 » Task Graph Scheduling Using Timed Automata |
112
click to vote
AAAI
2004
15 years 2 months ago
2004
Oversubscribed scheduling problems require removing or partially satisfying tasks when enough resources are not available. For a particular oversubscribed problem, Air Force Satel...
124
click to vote
ANCS
2005
ACM
15 years 7 months ago
2005
ACM
Task to resource mapping problems are encountered during (i) hardware-software co-design and (ii) performance optimization of Network Processor systems. The goal of the first pro...
131
click to vote
OPODIS
2010
14 years 11 months ago
2010
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
134
click to vote
SOSP
2009
ACM
15 years 10 months ago
2009
ACM
This paper addresses the problem of scheduling concurrent jobs on clusters where application data is stored on the computing nodes. This setting, in which scheduling computations ...
108
click to vote
ICDCS
1997
IEEE
15 years 5 months ago
1997
IEEE
Clusters of networked, off-the-shelf workstations are currently used for computationintensive, parallel applications. However, it is hardly possible to predict the timing behaviou...