Sciweavers

ORL
2006
116views more  ORL 2006»
13 years 11 months ago
Greedy multiprocessor server scheduling
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...
Carl Bussema, Eric Torng