PDF] Fully-Dynamic Bin Packing with Limited Repacking
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.
![PDF] Fully-Dynamic Bin Packing with Limited Repacking](https://d3i71xaburhd42.cloudfront.net/6528ee9361d612db6c821aa0303e80bf94a525d0/15-Figure4-1.png)
PDF] Fully-Dynamic Bin Packing with Limited Repacking
![PDF] Fully-Dynamic Bin Packing with Limited Repacking](https://i1.rgstatic.net/ii/profile.image/273755901526021-1442279901502_Q64/Matthias-Feldotto.jpg)
Fully Dynamic Bin Packing Revisited
![PDF] Fully-Dynamic Bin Packing with Limited Repacking](https://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs10107-018-1325-x/MediaObjects/10107_2018_1325_Figc_HTML.png)
Fully dynamic bin packing revisited
![PDF] Fully-Dynamic Bin Packing with Limited Repacking](https://i.ytimg.com/vi/z98iOc3OgGY/sddefault.jpg)
David Wajc on Fully-Dynamic Bin Packing with Limited Recourse
![PDF] Fully-Dynamic Bin Packing with Limited Repacking](https://d3i71xaburhd42.cloudfront.net/6528ee9361d612db6c821aa0303e80bf94a525d0/14-Table1-1.png)
PDF] Fully-Dynamic Bin Packing with Limited Repacking
![PDF] Fully-Dynamic Bin Packing with Limited Repacking](https://ars.els-cdn.com/content/image/1-s2.0-S0305054821002847-gr1.jpg)
An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations - ScienceDirect
![PDF] Fully-Dynamic Bin Packing with Limited Repacking](https://ars.els-cdn.com/content/image/1-s2.0-S1366554521003367-gr3.jpg)
A combined forecasting and packing model for air cargo loading: A risk-averse framework - ScienceDirect
![PDF] Fully-Dynamic Bin Packing with Limited Repacking](https://media.springernature.com/lw685/springer-static/image/art%3A10.1007%2Fs00291-021-00628-x/MediaObjects/291_2021_628_Fig1_HTML.png)
Bin packing with lexicographic objectives for loading weight- and volume-constrained trucks in a direct-shipping system
![PDF] Fully-Dynamic Bin Packing with Limited Repacking](https://ars.els-cdn.com/content/image/1-s2.0-S037722170700567X-gr10.jpg)
On solving multiobjective bin packing problems using evolutionary particle swarm optimization - ScienceDirect
![PDF] Fully-Dynamic Bin Packing with Limited Repacking](https://content.iospress.com/media/ifs/2021/40-3/ifs-40-3-ifs201581/ifs-40-ifs201581-g006.jpg)
Solving fully dynamic bin packing problem for virtual machine allocation in the cloud environment by the futuristic greedy algorithm - IOS Press
de
por adulto (o preço varia de acordo com o tamanho do grupo)