1050 search results - page 15 / 210 » Online scheduling in grids |
JCM
2007
13 years 7 months ago
2007
—Divisible loads are those workloads that can be partitioned by a scheduler into any arbitrary chunks. The problem of scheduling divisible loads has been defined for a long time,...
APPROX
2000
Springer
13 years 12 months ago
2000
Springer
In this paper, we derive bounds on performance guarantees of online algorithms for real-time preemptive scheduling of jobs with deadlines on K machines when jobs are characterized ...
ECRTS
2006
IEEE
14 years 1 months ago
2006
IEEE
We study the problem of dynamically scheduling a set of state-feedback control tasks controlling a set of linear plants. We consider an on-line non-preemptive scheduling policy th...
ICS
2007
Tsinghua U.
14 years 1 months ago
2007
Tsinghua U.
Grid Workflows are emerging as practical programming models for solving large e-scientific problems on the Grid. However, it is typically assumed that the workflow components eith...
GECON
2008
Springer
13 years 8 months ago
2008
Springer
