ORL
2006
14 years 20 days ago
2006
We show that the greedy Highest Density First (HDF) algorithm is (1+ )-speed O(1)-competitive for the problem of minimizing the p norms of weighted flow time on m identical machin...
CORR
2010
Springer
14 years 25 days ago
2010
Springer
Due to its optimality on a single machine for the problem of minimizing average flow time, ShortestRemaining-Processing-Time (SRPT) appears to be the most natural algorithm to con...
ESA
2010
Springer
14 years 28 days ago
2010
Springer
We study online job scheduling on a processor that can vary its speed dynamically to manage its power. We attempt to extend the recent success in analyzing total unweighted flow ti...
ESA
2008
Springer
14 years 2 months ago
2008
Springer
Abstract. We study online scheduling to minimize flow time plus energy usage in the dynamic speed scaling model. We devise new speed scaling functions that depend on the number of ...
FOCS
2007
IEEE
14 years 4 months ago
2007
IEEE
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...
BIRTHDAY
2009
Springer
14 years 4 months ago
2009
Springer
We consider the problem of minimizing average flow time on multiple machines when each job can be assigned only to a specified subset of the machines. This is a special case of sc...