A greedy randomized algorithm achieving sublinear optimality gap in a dynamic packing model

We consider an infinite-server system, where multiple customers can be placed into one server for service simultaneously, subject to packing constraints. Customers are placed for service immediately upon arrival, and leave the system after service completion. A key system objective is to minimize th...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) S. 319 - 326
Hauptverfasser:	Stolyar, Alexander L., Yuan Zhong
Format:	Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	IEEE 01.09.2016
Schlagworte:	Algorithm design and analysis Cloud computing Heuristic algorithms Markov processes Servers Steady-state Virtual machining
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!