Abstract: The main directions of development in cloud computing systems are aimed at increasing the efficiency of using server resources and the reliability of virtual machines (VMs), as well as reducing operating costs. A common goal in such systems is to minimize the number of servers required to maintain a given set of VMs, satisfying server capacity constraints. This goal practically leads to the well-known temporal bin packing problem. This study explores a generalization of this problem by introducing a concept of fault domains, where specific sets of VMs must operate in independent domain zones. For this NP-hard problem, we developed a heuristic for calculating the upper bound, based on the First Fit algorithm. Using the structural properties of the new constraints, we propose several efficient VM sequencing algorithms for the First Fit algorithm. Preliminary computational experiments on a publicly available dataset showed that the proposed heuristic method is capable of efficiently solving both small and large scale problems in a short time.

Cite: Akentev V. , Davydov I.
Greedy Algorithms for the Temporal Bin Packing Problem with Failure Domain
In compilation Mathematical Optimization Theory and Operations Research: Recent Trends. – Springer., 2024. – Т.2239. – C.143–160. – ISBN 978-3-031-73364-2. DOI: 10.1007/978-3-031-73365-9_10 Scopus OpenAlex

Dates:

Published print:	Dec 20, 2024
Published online:	Dec 20, 2024

Identifiers:

Scopus:	2-s2.0-85214195325
OpenAlex:	W4405597740

Citing: Пока нет цитирований

Altmetrics: