Asymptotic optimality of Best-Fit for stochastic bin packing

Javad Ghaderi, Yuan Zhong, R. Srikant

Research output: Contribution to journalConference articlepeer-review


In the static bin packing problem, items of different sizes must be packed into bins or servers with unit capacity in a way that minimizes the number of bins used, and it is well-known to be a hard combinatorial problem. Best-Fit is among the simplest online heuristics for this problem. Motivated by the problem of packing virtual machines in servers in the cloud, we consider the dynamic version of this problem, when jobs arrive randomly over time and leave the system after completion of their service. We analyze the fluid limits of the system under an asymptotic Best-Fit algorithm and show that it asymptotically minimizes the number of servers used in steady state (on the fluid scale). The significance of the result is due to the fact that Best-Fit seems to achieve the best performance in practice.

Original languageEnglish (US)
Pages (from-to)64-66
Number of pages3
JournalPerformance Evaluation Review
Issue number2
StatePublished - Sep 4 2014
Event32nd International Symposium on Computer Performance, Modeling, Measurement, and Evaluation, IFIP WG 7.3 Performance 2014 - Turin, Italy
Duration: Oct 7 2014Oct 9 2014

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Fingerprint Dive into the research topics of 'Asymptotic optimality of Best-Fit for stochastic bin packing'. Together they form a unique fingerprint.

Cite this