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
The rectangular two-dimensional strip packing problem real-life practical constraints: A bibliometric overview - ScienceDirect
PDF] Fully-Dynamic Bin Packing with Limited Repacking
Fully dynamic bin packing revisited
PDF] 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
PDF] Fully-Dynamic Bin Packing with Limited Repacking
Ortmann [2010] Heuristics for Offline Rectangular Packing Problems
PDF] Fully-Dynamic Bin Packing with Limited Repacking
PDF) Lower Bound for the Online Bin Packing Problem with Restricted Repacking
PDF] Fully-Dynamic Bin Packing with Limited Repacking
PDF] Fully-Dynamic Bin Packing with Limited Repacking
PDF] Fully-Dynamic Bin Packing with Limited Repacking
PDF] Fully-Dynamic Bin Packing with Limited Repacking
PDF] Fully-Dynamic Bin Packing with Limited Repacking
Learning Physically Realizable Skills for Online Packing of General 3D Shapes
PDF] Fully-Dynamic Bin Packing with Limited Repacking
A combined forecasting and packing model for air cargo loading: A risk-averse framework - ScienceDirect
PDF] Fully-Dynamic Bin Packing with Limited Repacking
1-D bin packing problem.
PDF] Fully-Dynamic Bin Packing with Limited Repacking
Metaheuristic algorithms for one-dimensional bin-packing problems: A survey of recent advances and applications
PDF] Fully-Dynamic Bin Packing with Limited Repacking
PDF] Fully dynamic bin packing revisited
PDF] Fully-Dynamic Bin Packing with Limited Repacking
PDF] Fully-Dynamic Bin Packing with Limited Repacking
PDF] Fully-Dynamic Bin Packing with Limited Repacking
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
de por adulto (o preço varia de acordo com o tamanho do grupo)