Minimal Cost Server Configuration for Meeting Time-Varying Resource Demands in Cloud Centers

We consider the minimal cost server configuration for meeting resource demands over multiple time slots. Specifically, there are some heterogeneous servers. Each server is specified by a cost, certain amounts of several resources, and an active interval, i.e., the time interval that the server is pl...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on parallel and distributed systems Jg. 29; H. 11; S. 2503 - 2513
Hauptverfasser:	Liu, Chubo, Li, Kenli, Li, Keqin
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York IEEE 01.11.2018 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Schlagworte:	Algorithms Approximation Approximation algorithms Bandwidth Cloud computing Configurations Cost engineering Cost minimization Knapsack problem Mathematical analysis meeting resource demands Minimization Optimization randomized approximation algorithm Resource management Rounding server configuration Servers varied Chernoff bound
ISSN:	1045-9219, 1558-2183
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!