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...

Full description

Saved in:

Bibliographic Details
Published in:	2016 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton) pp. 319 - 326
Main Authors:	Stolyar, Alexander L., Yuan Zhong
Format:	Conference Proceeding
Language:	English
Published:	IEEE 01.09.2016
Subjects:	Algorithm design and analysis Cloud computing Heuristic algorithms Markov processes Servers Steady-state Virtual machining
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!