16 citations · 16 across the 1 of their papers we have counts for
2 papers
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.DS2011★ 16 cited
Approximation Algorithms for Correlated Knapsacks and Non-Martingale Bandits
Anupam Gupta, Ravishankar Krishnaswamy, Marco Molinaro +1
In the stochastic knapsack problem, we are given a knapsack of size B, and a set of jobs whose sizes and rewards are drawn from a known probability distribution. However, we know t…