Near-Optimal Stochastic Bin-Packing in Large Service Systems with Time-Varying Item Sizes

by   Yige Hong, et al.

Motivated by the virtual machine scheduling problem in today's computing systems, we propose a new setting of stochastic bin-packing in service systems that allows the item sizes (job resource requirements) to vary over time. In this setting, items (jobs) arrive to the system, vary their sizes, and depart from the system following certain Markovian assumptions. We focus on minimizing the expected number of non-empty bins (active servers) in steady state, where the expectation in steady state is equal to the long-run time-average with probability 1 under the Markovian assumptions. Our main result is a policy that achieves an optimality gap of O(√(r)) in the objective, where the optimal objective value is Θ(r) and r is a scaling factor such that the item arrival intensity scales linearly with it. When specialized to the setting where the item sizes do not vary over time, our result improves upon the state-of-the-art o(r) optimality gap. Our technical approach highlights a novel policy conversion framework that reduces the policy design problem to that in a single-bin (single-server) system.


page 1

page 2

page 3

page 4


Online Adaptive Bin Packing with Overflow

Motivated by bursty bandwidth allocation and by the allocation of virtua...

A Theory of Auto-Scaling for Resource Reservation in Cloud Services

We consider a distributed server system consisting of a large number of ...

Minimizing Completion Times for Stochastic Jobs via Batched Free Times

We study the classic problem of minimizing the expected total completion...

Fully Dynamic Algorithms for Knapsack Problems with Polylogarithmic Update Time

Knapsack problems are among the most fundamental problems in optimizatio...

Energy-Efficient Job-Assignment Policy with Asymptotically Guaranteed Performance Deviation

We study a job-assignment problem in a large-scale server farm system wi...

On the Fault-Tolerant Online Bin Packing Problem

We study the fault-tolerant variant of the online bin packing problem. S...

Please sign up or login with your details

Forgot password? Click here to reset