The Subset Assignment Problem for Data Placement in Caches

We introduce the subset assignment problem in which items of varying sizes are placed in a set of bins with limited capacity. Items can be replicated and placed in any subset of the bins. Each (item, subset) pair has an associated cost. Not assigning an item to any of the bins is not free in general...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	arXiv.org 2016-10
Hauptverfasser:	Ghandeharizadeh, Shahram, Irani, Sandy, Lam, Jenny
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Bins Caching Knapsack problem Operations research Recovery time Time dependence
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!