Dynamic bin packing for on-demand cloud resource allocation
Dynamic Bin Packing (DBP) is a variant of classical bin packing, which assumes that items
may arrive and depart at arbitrary times. Existing works on DBP generally aim to minimize …
may arrive and depart at arbitrary times. Existing works on DBP generally aim to minimize …
On dynamic bin packing for resource allocation in the cloud
Dynamic Bin Packing (DBP) is a variant of classical bin packing, which assumes that items
may arrive and depart at arbitrary times. Existing works on DBP generally aim to minimize …
may arrive and depart at arbitrary times. Existing works on DBP generally aim to minimize …
On minimizing total energy consumption in the scheduling of virtual machine reservations
This paper considers the energy-efficient scheduling of virtual machine (VM) reservations in
a Cloud Data center. Concentrating on CPU-intensive applications, the objective is to …
a Cloud Data center. Concentrating on CPU-intensive applications, the objective is to …
Online virtual machine allocation with lifetime and load predictions
N Buchbinder, Y Fairstein, K Mellou… - ACM SIGMETRICS …, 2021 - dl.acm.org
The cloud computing industry has grown rapidly over the last decade, and with this growth
there is a significant increase in demand for compute resources. Demand is manifested in …
there is a significant increase in demand for compute resources. Demand is manifested in …
On first fit bin packing for online cloud server allocation
Cloud-based systems often face the problem of dispatching a stream of jobs to run on cloud
servers in an online manner. Each job has a size that defines the resource demand for …
servers in an online manner. Each job has a size that defines the resource demand for …
Dynamic Bin Packing with Predictions
M Liu, X Tang - Proceedings of the ACM on Measurement and Analysis …, 2022 - dl.acm.org
The MinUsageTime Dynamic Bin Packing (DBP) problem aims to minimize the accumulated
bin usage time for packing a sequence of items into bins. It is often used to model job …
bin usage time for packing a sequence of items into bins. It is often used to model job …
Competitiveness of dynamic bin packing for online cloud server allocation
Cloud-based systems often face the problem of dispatching a stream of jobs to run on cloud
servers in an online manner. Each job has a size that defines the resource demand for …
servers in an online manner. Each job has a size that defines the resource demand for …
LP rounding and combinatorial algorithms for minimizing active and busy time
J Chang, S Khuller, K Mukherjee - … of the 26th ACM symposium on …, 2014 - dl.acm.org
We consider fundamental scheduling problems motivated by energy issues. In this
framework, we are given a set of jobs, each with release time, deadline and required …
framework, we are given a set of jobs, each with release time, deadline and required …
Clairvoyant dynamic bin packing for job scheduling with minimum server usage time
R Ren, X Tang - Proceedings of the 28th ACM Symposium on …, 2016 - dl.acm.org
The MinUsageTime Dynamic Bin Packing (DBP) problem targets at minimizing the
accumulated usage time of all the bins in the packing process. It models the server …
accumulated usage time of all the bins in the packing process. It models the server …
[HTML][HTML] Optimizing busy time on parallel machines
We consider the following fundamental parallel machines scheduling problem in which the
input consists of n jobs to be scheduled on a set of identical machines of bounded capacity …
input consists of n jobs to be scheduled on a set of identical machines of bounded capacity …