Joint optimization of application placement and resource allocation for enhanced performance in heterogeneous multi-server systems

Abstract

Efficiently placing applications remains a critical challenge across diverse multi-server environments, including web hosting centers, cloud computing, and edge computing environments. Unfortunately, most existing studies tend to overlook the crucial aspect of resource allocation, leading to suboptimal system performance. To address this gap, there is a pressing need to holistically explore both application placement and resource allocation in a unified manner. In this paper, we introduce the place and allocate problem in heterogeneous multi-server systems, a novel approach aiming at simultaneously optimizing the placement and allocation of applications to maximize the overall utility of the heterogeneous multi-server system. Our proposed methodology harnesses the interplay between application placement and resource allocation, showcasing substantial improvements in system utility. To model individual application performance concerning their allocated resources, we employ utility functions. For concave utility functions, we present an approximation algorithm that operates efficiently with a time complexity of $O\left(m{n}^3{\left(logC\right)}^2\right)$, where $n$ represents the number of applications, $m$ is the number of servers, and $C$ denotes the maximum available resource capacity of each server. Furthermore, we extend our approach to accommodate more general scenarios that involve applications with nonconcave utility functions and using multiple types of resources. Our study includes comprehensive experimental evaluations conducted on applications with both synthetic and real-world utility functions. Results consistently showcase that our algorithms achieve over 96.9% of optimal performance on average. Additionally, comparative analysis against several practical heuristics reveal that our algorithms outperform these methods by up to 4.3 times in total utility.