PDF] Fully-Dynamic Bin Packing with Limited Repacking

Por um escritor misterioso
Last updated 20 setembro 2024
PDF] Fully-Dynamic Bin Packing with Limited Repacking
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
PDF] 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
David Wajc on Fully-Dynamic Bin Packing with Limited Recourse
PDF] Fully-Dynamic Bin Packing with Limited Repacking
On-line bin packing with restricted repacking
PDF] Fully-Dynamic Bin Packing with Limited Repacking
PDF) An Online Packing Heuristic for the Three-Dimensional Container Loading Problem in Dynamic Environments and the Physical Internet
PDF] Fully-Dynamic Bin Packing with Limited Repacking
Blocking analysis of persistent resource allocations for M2M applications in wireless systems - Brown - 2016 - Transactions on Emerging Telecommunications Technologies - Wiley Online Library
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
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
PDF) Lower Bound for the Online Bin Packing Problem with Restricted Repacking
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
Fully-Dynamic Bin Packing with Limited Repacking
PDF] Fully-Dynamic Bin Packing with Limited Repacking
Enhanced Virtualization-Based Dynamic Bin-Packing Optimized Energy Management Solution for Heterogeneous Clouds
PDF] Fully-Dynamic Bin Packing with Limited Repacking
Enhanced Virtualization-Based Dynamic Bin-Packing Optimized Energy Management Solution for Heterogeneous Clouds
PDF] Fully-Dynamic Bin Packing with Limited Repacking
Symmetry, Free Full-Text

© 2014-2024 immanuelipc.com. All rights reserved.