6 citations · 6 across the 1 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2011
Scalably Scheduling Power-Heterogeneous Processors
Anupam Gupta, Ravishankar Krishnaswamy, Kirk Pruhs
We show that a natural online algorithm for scheduling jobs on a heterogeneous multiprocessor, with arbitrary power functions, is scalable for the objective function of weighted fl…
cs.DS2009★ 6 cited
Nonclairvoyant Speed Scaling for Flow and Energy
Ho-Leung Chan, Jeff Edmonds, Tak-Wah Lam +3
We study online nonclairvoyant speed scaling to minimize total flow time plus energy. We first consider the traditional model where the power function is P (s) = s\^\propto. We giv…