155 search results - page 6 / 31 » Online Scheduling of Equal-Length Jobs on Parallel Machines |
COCOA
2008
Springer
13 years 8 months ago
2008
Springer
We consider the problem of minimizing the total weighted completion time on identical parallel machines when jobs have stochastic processing times and may arrive over time. We give...
ESA
2000
Springer
13 years 10 months ago
2000
Springer
We consider the problem of preemptively scheduling a set of n jobs on m (identical, uniformly related, or unrelated) parallel machines. The scheduler may reject a subset of the job...
CCGRID
2002
IEEE
13 years 12 months ago
2002
IEEE
Malleable jobs are parallel programs that can change the number of processors on which they are executing at run time in response to an external command. One of the advantages of ...
APPROX
2000
Springer
13 years 11 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 ...
PDP
2010
IEEE
13 years 11 months ago
2010
IEEE
—The emergence of multi-core computers has led to explosive development of parallel applications and hence the need of efficient schedulers for parallel jobs. Adaptive online sc...