The algorithm for sequential analysis of variants for distribution of virtual machines in data center / Oleksandr Rolik, Maksym Bodaniuk, Valerii Kolesnik, Volodymyr Samotyy // W: Communication Papers ... więcej

The algorithm for sequential analysis of variants for distribution of virtual machines in data center / Oleksandr Rolik, Maksym Bodaniuk, Valerii Kolesnik, Volodymyr Samotyy // W: Communication Papers of the 2017 Federated Conference on Computer Science and Information Systems, September 3-6, 2017, Prague, Czech Republic [Dokument elektroniczny] / eds. Maria Ganzha, Leszek Maciaszek, Marcin Paprzycki. – Warszawa : Polskie Towarzystwo Informatyczne, 2017. – (Annals of Computer Science and Information Systems, ISSN 2300-5963 ; 13). – S. 183-187 : rys., wykr. – Tryb dostępu: https://annals-csis.org/Volume_13/drp/pdf/242.pdf. – Bibliogr. 12 poz., Abstr. – Tyt. źródła częściowo wg okł. – doi: 10.15439/2017F242. – ISBN 78-83-922646-2-0 WEB. – ISBN 78-83-922646-3-7 USB

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 ce nter . The set of tests and ... więcej

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 ce nter . 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, wh ereas heuristic and evolutionary algorithms can quickly get an effective solution. The speed of th e 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.