PDF] Fully-Dynamic Bin Packing with Limited Repacking
Por um escritor misterioso
Last updated 04 outubro 2024
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.
Cardinality Constrained Scheduling in Online Models
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 revisited
Solving fully dynamic bin packing problem for virtual machine allocation in the cloud environment by the futuristic greedy algorithm - IOS Press
A comprehensive list of bin packing algorithm for better packing
Fully-Dynamic Bin Packing with Limited Repacking
Fully Dynamic Bin Packing Revisited
Optimization of one-dimensional Bin Packing Problem with island parallel grouping genetic algorithms - ScienceDirect
Solving fully dynamic bin packing problem for virtual machine allocation in the cloud environment by the futuristic greedy algorithm - IOS Press
PDF] Online Strip Packing with Polynomial Migration
PDF] Fully-Dynamic Bin Packing with Limited Repacking
Fully dynamic bin packing revisited
Recomendado para você
-
Solved The principal value of Ln(1 - iV3)4 is Select one: 2704 outubro 2024
-
Solved 5. Find the first derivative of X-1/X (FROM FIRST04 outubro 2024
-
Solved s. Find the first derivative of X - 1/X2 (FROM FIRST04 outubro 2024
-
Integrate the function : e5 log x e4 log xe3 log x e2 log x04 outubro 2024
-
Mathematics Ncert Exemplar class 12th, Chapter Integrals04 outubro 2024
-
a) 2.7 (c) 2.2 198. If x' e' + 4 log x=0 then e'2x² + 4 +8x04 outubro 2024
-
Misc 8 - Integrate e5 log x - e4 log x / e3 log x - e2 log x04 outubro 2024
-
Futsal Itatiba04 outubro 2024
-
Polarization plot for Substrate04 outubro 2024
-
Phylogenetic Approach Reveals That Virus Genotype Largely Determines HIV Set-Point Viral Load04 outubro 2024
você pode gostar
-
Start today Weight loss Herbalife flyer Template04 outubro 2024
-
opening - How do you analyze this position holistically? - Chess Stack Exchange04 outubro 2024
-
ONE PUNCH MAN 3 TEMPORADA DATA DE LANÇAMENTO04 outubro 2024
-
List of Pokémon by Hoenn Pokédex number (Generation VI04 outubro 2024
-
Donatella Versace Cannot Get Enough Diamonds04 outubro 2024
-
Mew V - SWSH03: Darkness Ablaze - Pokemon04 outubro 2024
-
Há quatro jogos sem vencer, Pouso Alegre recebe o confiança às 18h no Manduzão04 outubro 2024
-
Qual é o seu personagem masculino e feminino favoritos em Boku no Hero Academia? - Quora04 outubro 2024
-
KonoSuba Aqua and Staff cursor – Custom Cursor04 outubro 2024
-
The Last of Us: com morte inesperada, segundo episódio guia o tom da série04 outubro 2024