6 citations · 25 across the 31 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013
An Experimental Comparison of Speed Scaling Algorithms with Deadline Feasibility Constraints
Ahmed Abousamra, David P. Bunde, Kirk Pruhs
We consider the first, and most well studied, speed scaling problem in the algorithmic literature: where the scheduling quality of service measure is a deadline feasibility constra…
cs.DS2013★ 1 cited
The Complexity of Scheduling for p-norms of Flow and Stretch
Benjamin Moseley, Kirk Pruhs, Cliff Stein
We consider computing optimal k-norm preemptive schedules of jobs that arrive over time. In particular, we show that computing the optimal k-norm of flow schedule, is strongly NP-h…