Overcommitment in cloud services : bin packing with chance constraints
Year of publication: |
2019
|
---|---|
Authors: | Cohen, Maxime C. ; Keller, Philipp W. ; Mirrokni, Vahab ; Zadimoghaddam, Morteza |
Published in: |
Management science : journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : INFORMS, ISSN 0025-1909, ZDB-ID 206345-1. - Vol. 65.2019, 7, p. 3255-3271
|
Subject: | bin packing | approximation algorithms | cloud computing | overcommitment | Theorie | Theory | Cloud Computing | Cloud computing | Algorithmus | Algorithm | Mathematische Optimierung | Mathematical programming |
-
Cost-effective privacy preserving of intermediate data using group search optimisation algorithm
Jaikrishna, G., (2020)
-
Dynamic resource allocation in the cloud with near-optimal efficiency
Perez-Salazar, Sebastian, (2022)
-
A mathematical network model and a solution algorithm for IaaS cloud computing
Colajanni, Gabriella, (2022)
- More ...
-
Overcommitment in Cloud Services - Bin Packing with Chance Constraints
Cohen, Maxime C., (2018)
-
Precup, Doina, (2006)
-
Scheduling to minimize gaps and power consumption
Demaine, Erik D., (2013)
- More ...