The Algorithm for Sequential Analysis of Variants for Distribution of Virtual Machines in Data Center

Abstract

Abstract-this work proposes an algorithm of sequential analysis of variants (SAV) to solve the distributional problem of allocation of virtual machines to physical servers in a data center. The set of tests and rules of the SAV algorithm is defined. The experimental results for problems of different dimensions are given. The comparison of the proposed algorithm with heuristic and genetic algorithms is accomplished. The time of finding solution required by the SAV algorithm depending on the dimension of the problem is evaluated. The recommendations for using the SAV algorithm are given. For tasks requiring high precision distribution it is better to use the SAV algorithm as it finds the optimal solution, whereas heuristic and evolutionary algorithms can quickly get an effective solution. The speed of the heuristic and evolutionary algorithms is not significantly dependent on the problem's size, but the quality of their solutions is worse than equivalent solution received with the SAV algorithm.

Автоматизація Управління Ресурсами В Інформаційних Системах На Основі Реактивного Вертикального Масштабування

“…Due to the popularity of the containerization paradigm today, a large number of orchestrators such as Kubernetes, ECS, Nomad have emerged and are widely used to manage containerized applications. These solutions allow us to manage QoS (quality of service) by maintaining it at the agreed level and with minimal use of DC resources [3]. Analysis of management methods and algorithms used by orchestrators allows us to determine the expediency of using these methods and algorithms or the necessity of their modernization.…”