License: 
Creative Commons Attribution 3.0 Unported license (CC BY 3.0)
When quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2018.51
URN: urn:nbn:de:0030-drops-90556
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2018/9055/
Feldkord, Björn ;
Feldotto, Matthias ;
Gupta, Anupam ;
Guruganesh, Guru ;
Kumar, Amit ;
Riechers, Sören ;
Wajc, David
Fully-Dynamic Bin Packing with Little Repacking
Abstract
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 while repacking items sparingly between updates. Formally, each item i has a movement cost c_i >= 0, and we want to use alpha * OPT bins and incur a movement cost gamma * c_i, either in the worst case, or in an amortized sense, for alpha, gamma as small as possible. We call gamma the 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.
BibTeX - Entry
@InProceedings{feldkord_et_al:LIPIcs:2018:9055,
author = {Bj{\"o}rn Feldkord and Matthias Feldotto and Anupam Gupta and Guru Guruganesh and Amit Kumar and S{\"o}ren Riechers and David Wajc},
title = {{Fully-Dynamic Bin Packing with Little Repacking}},
booktitle = {45th International Colloquium on Automata, Languages, and Programming (ICALP 2018)},
pages = {51:1--51:24},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-076-7},
ISSN = {1868-8969},
year = {2018},
volume = {107},
editor = {Ioannis Chatzigiannakis and Christos Kaklamanis and D{\'a}niel Marx and Donald Sannella},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2018/9055},
URN = {urn:nbn:de:0030-drops-90556},
doi = {10.4230/LIPIcs.ICALP.2018.51},
annote = {Keywords: Bin Packing, Fully Dynamic, Recourse, Tradeoffs}
}
|
Keywords: |
|
Bin Packing, Fully Dynamic, Recourse, Tradeoffs |
|
Collection: |
|
45th International Colloquium on Automata, Languages, and Programming (ICALP 2018) |
|
Issue Date: |
|
2018 |
|
Date of publication: |
|
04.07.2018 |
