206 search results - page 8 / 42 » Better Bounds for Online Scheduling |
RANDOM
1999
Springer
13 years 11 months ago
1999
Springer
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...
ICCAD
1998
IEEE
13 years 11 months ago
1998
IEEE
We consider the problem of scheduling the mixed workload of both sporadic (on-line) and periodic (off-line) tasks on variable voltage processor to optimize power consumption while...
STACS
2009
Springer
14 years 2 months ago
2009
Springer
We present a unified optimal semi-online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize the makespan. This algorithm works for a...
ECRTS
2009
IEEE
13 years 5 months ago
2009
IEEE
Some applications for real-time scheduling have target demands in addition to the commonly used starttime and deadline constraints: a task should be executed at a target point in ...
EUROPAR
2006
Springer
13 years 11 months ago
2006
Springer
Abstract. We consider parallel prefix computation on processors of different and possibly changing speeds. Extending previous works on identical processors, we provide a lower boun...