Overcommitment in cloud services: Bin packing with chance constraints

Overcommitment in cloud services: Bin packing with chance constraints

This paper considers a traditional problem of resource allocation: scheduling jobs on machines. One such recent application is cloud computing; jobs arrive in an online fashion with capacity requirements and need to be immediately scheduled on physical machines in data centers. It is often observed...

Full description

Bibliographic Details
Main Authors: Cohen, M.C (Author), Keller, P.W (Author), Mirrokni, V. (Author), Zadimoghaddam, M. (Author)
Format: Article
Language:English
Published: INFORMS Inst.for Operations Res.and the Management Sciences 2019
Subjects:
Approximation algorithms
Bin packing
Capacity constraints
Capacity requirement
Chance constraint
Cloud computing
Constant factors
Cost benefit analysis
Cost reduction
Distributed database systems
On-line algorithms
Overcommitment
Risk assessment
Scheduling
Submodular functions
Web services
Online Access:View Fulltext in Publisher

Internet

View Fulltext in Publisher

Similar Items