PDF] Fully-Dynamic Bin Packing with Limited Repacking
Por um escritor misterioso
Descrição
This work presents optimal tradeoffs between number of bins used and number of items repacked, as well as natural extensions of the latter measure, motivated by cloud storage applications. We study the classic Bin Packing problem in a fully-dynamic setting, where new items can arrive and old items may depart. We want algorithms with low asymptotic competitive ratio \emph{while repacking items sparingly} between updates. Formally, each item $i$ has a \emph{movement cost} $c_i\geq 0$, and we want to use $\alpha \cdot OPT$ bins and incur a movement cost $\gamma\cdot c_i$, either in the worst case, or in an amortized sense, for $\alpha, \gamma$ as small as possible. We call $\gamma$ the \emph{recourse} of the algorithm. This is motivated by cloud storage applications, where fully-dynamic Bin Packing models the problem of data backup to minimize the number of disks used, as well as communication incurred in moving file backups between disks. Since the set of files changes over time, we could recompute a solution periodically from scratch, but this would give a high number of disk rewrites, incurring a high energy cost and possible wear and tear of the disks. In this work, we present optimal tradeoffs between number of bins used and number of items repacked, as well as natural extensions of the latter measure.
Fully dynamic bin packing revisited
Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system
David Wajc on Fully-Dynamic Bin Packing with Limited Recourse
PDF] Fully-Dynamic Bin Packing with Limited Repacking
Temporal Bin Packing with Half-Capacity Jobs
A variable neighborhood search algorithm for the bin packing problem with compatible categories - ScienceDirect
Fully-Dynamic Bin Packing with Limited Repacking
Solving fully dynamic bin packing problem for virtual machine allocation in the cloud environment by the futuristic greedy algorithm - IOS Press
Enhanced Virtualization-Based Dynamic Bin-Packing Optimized Energy Management Solution for Heterogeneous Clouds
On-line three-dimensional packing problems: A review of off-line and on-line solution approaches - ScienceDirect
de
por adulto (o preço varia de acordo com o tamanho do grupo)