534 search results - page 71 / 107 » On Scheduling Parallel Tasks at Twilight |
114
click to vote
OPODIS
2010
14 years 7 months ago
2010
We consider the problem of scheduling dependent real-time tasks for overloads on a multiprocessor system, yielding best-effort timing assurance. The application/scheduling model in...
112
click to vote
HPDC
2000
IEEE
15 years 2 months ago
2000
IEEE
Large distributed systems such as Computational Grids require a large amount of monitoring data be collected for a variety of tasks such as fault detection, performance analysis, ...
106
click to vote
HIPC
2000
Springer
15 years 1 months ago
2000
Springer
Heterogeneous computing environments have become attractive platforms to schedule computationally intensive jobs. We consider the problem of mapping independent tasks onto machines...
HPDC
2010
IEEE
14 years 10 months ago
2010
IEEE
Scientists increasingly rely on the execution of workflows in grids to obtain results from complex mixtures of applications. However, the inherently dynamic nature of grid workflo...
OPODIS
2010
14 years 7 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...