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.

PDF] Fully-Dynamic Bin Packing with Limited Repacking

On-line bin packing with restricted repacking

PDF] Fully dynamic bin packing revisited

Optimization of one-dimensional Bin Packing Problem with island parallel grouping genetic algorithms - ScienceDirect

Enhanced Virtualization-Based Dynamic Bin-Packing Optimized Energy Management Solution for Heterogeneous Clouds

Learning Physically Realizable Skills for Online Packing of General 3D Shapes

PDF] Fully dynamic bin packing revisited

An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations - ScienceDirect

PDF) Lower Bound for the Online Bin Packing Problem with Restricted Repacking

49th International Colloquium on Automata, Languages, and Programming (ICALP 2022)

PDF] Fully-Dynamic Bin Packing with Limited Repacking

de por adulto (o preço varia de acordo com o tamanho do grupo)

PDF] Fully-Dynamic Bin Packing with Limited Repacking

Sugerir pesquisas

você pode gostar