Migration-aware Optimization of Virtualized Computational Resources Allocation in Complex Systems
P. Rygielski, and A. Gonczarek. ICSEng 2011: Proceedings of the 21st international conference on Systems Engineering (ICSEng 2011), page 212--216. Los Alamitos, California USA, IEEE Computer Society's Conference Publishing Services, (August 2011)
Abstract
In this paper a task of resources allocation in the complex system is considered. Novelty of the formulated task consists of assumption that the applications assigned with resources of one machine can be migrated to another machine during system lifetime. The formulated task has been solved using proposed heuristic optimization method. Due to non-convex set of valid solutions the optimization procedure has been decomposed into two stages and forms approach similar to the relax-and-round approach. Proposed decomposition approach facilitates fast algorithm convergence and guaranties that achieved solution satisfies assumed constraints
%0 Conference Paper
%1 RyGo2011-ICSEng
%A Rygielski, Piotr
%A Gonczarek, Adam
%B ICSEng 2011: Proceedings of the 21st international conference on Systems Engineering (ICSEng 2011)
%C Los Alamitos, California USA
%D 2011
%E Selvaraj, Henry
%E Zydek, Dawid
%I IEEE Computer Society's Conference Publishing Services
%K Cloud Optimization SOA Virtualization descartes t_full
%P 212--216
%T Migration-aware Optimization of Virtualized Computational Resources Allocation in Complex Systems
%X In this paper a task of resources allocation in the complex system is considered. Novelty of the formulated task consists of assumption that the applications assigned with resources of one machine can be migrated to another machine during system lifetime. The formulated task has been solved using proposed heuristic optimization method. Due to non-convex set of valid solutions the optimization procedure has been decomposed into two stages and forms approach similar to the relax-and-round approach. Proposed decomposition approach facilitates fast algorithm convergence and guaranties that achieved solution satisfies assumed constraints
@inproceedings{RyGo2011-ICSEng,
abstract = {In this paper a task of resources allocation in the complex system is considered. Novelty of the formulated task consists of assumption that the applications assigned with resources of one machine can be migrated to another machine during system lifetime. The formulated task has been solved using proposed heuristic optimization method. Due to non-convex set of valid solutions the optimization procedure has been decomposed into two stages and forms approach similar to the relax-and-round approach. Proposed decomposition approach facilitates fast algorithm convergence and guaranties that achieved solution satisfies assumed constraints},
added-at = {2020-04-05T23:15:39.000+0200},
address = {Los Alamitos, California USA},
author = {Rygielski, Piotr and Gonczarek, Adam},
biburl = {https://www.bibsonomy.org/bibtex/25f8aee5f7e4be43b35756ef00a7f3d0d/se-group},
booktitle = {ICSEng 2011: Proceedings of the 21st international conference on Systems Engineering (ICSEng 2011)},
editor = {Selvaraj, Henry and Zydek, Dawid},
interhash = {54f93a7f0519d3db883af79294a8436e},
intrahash = {5f8aee5f7e4be43b35756ef00a7f3d0d},
keywords = {Cloud Optimization SOA Virtualization descartes t_full},
month = {August},
pages = {212--216},
publisher = {IEEE Computer Society's Conference Publishing Services},
timestamp = {2020-10-07T11:39:56.000+0200},
title = {{Migration-aware Optimization of Virtualized Computational Resources Allocation in Complex Systems}},
year = 2011
}