1050 search results - page 15 / 210 » Online scheduling in grids |
117
click to vote
JCM
2007
14 years 11 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,...
107
click to vote
APPROX
2000
Springer
15 years 4 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 ...
127
click to vote
ECRTS
2006
IEEE
15 years 5 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...
118
click to vote
ICS
2007
Tsinghua U.
15 years 5 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
15 years 25 days ago
2008
Springer
