Introduces Probabilistic k-Bins Packing (PkBP) and the CloseRadiusFit algorithm for online VM scheduling that protects physical machines from hotspots with probability α and achieves 1.6-3.1% gaps to optimal bounds.
Chance-constrained op- timization under limited distributional information: A review of reformulations based on sampling and distri- butional robustness
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
citation-role summary
background 1
citation-polarity summary
fields
cs.DC 1years
2026 1verdicts
UNVERDICTED 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Hotspot-Aware Scheduling of Virtual Machines with Overcommitment for Ultimate Utilization in Cloud Datacenters
Introduces Probabilistic k-Bins Packing (PkBP) and the CloseRadiusFit algorithm for online VM scheduling that protects physical machines from hotspots with probability α and achieves 1.6-3.1% gaps to optimal bounds.