Sciweavers

279 search results - page 6 / 56
» Online Algorithms for Scheduling with Machine Activation Cos...
Sort
View
IPPS
2008
IEEE
14 years 2 months ago
Online scheduling in grids
This paper addresses nonclairvoyant and nonpreemptive online job scheduling in Grids. In the applied basic model, the Grid system consists of a large number of identical processor...
Uwe Schwiegelshohn, Andrei Tchernykh, Ramin Yahyap...
JDA
2008
93views more  JDA 2008»
13 years 7 months ago
On-line scheduling of parallel jobs on two machines
We study the problem of on-line scheduling of parallel jobs on two machines. The jobs are parallel in the sense that each of them specifies the number of processors, in this case ...
Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye, Guochu...
IANDC
2008
80views more  IANDC 2008»
13 years 7 months ago
Preemptive scheduling on a small number of hierarchical machines
We consider preemptive offline and online scheduling on identical machines and uniformly related machines in the hierarchical model, with the goal of minimizing the makespan. In t...
György Dósa, Leah Epstein
IPL
2006
111views more  IPL 2006»
13 years 7 months ago
A new algorithm for online uniform-machine scheduling to minimize the makespan
We consider the online scheduling problem with m - 1, m 2, uniform machines each with a processing speed of 1, and one machine with a speed of s, 1 s 2, to minimize the makespa...
T. C. Edwin Cheng, C. T. Ng, Vladimir Kotov
ESA
2006
Springer
82views Algorithms» more  ESA 2006»
13 years 11 months ago
Preemptive Online Scheduling: Optimal Algorithms for All Speeds
Our main result is an optimal online algorithm for preemptive scheduling on uniformly related machines with the objective to minimize makespan. The algorithm is deterministic, yet...
Tomás Ebenlendr, Wojciech Jawor, Jiri Sgall