Abstract
High-performance computing in the cloud environment uses ample virtual resources, which in turn require physical infrastructures provided by cloud service providers (CSPs). Naturally, CSPs would like to place virtual machines (VM) in a cost-effective way satisfying the resource requirement of the VMs and the capacity constraints of the hosts. Such consideration has led to the well known virtual machine placement (VMP) problem. In this paper, we consider a variant of the VMP, taking into account the communication among the VMs. We introduce the concept of Virtual Cluster, made up of VMs communicating among themselves. It is desirable to place the VMs of a cluster close to each other and thus reduce the communication cost. The objective for the Virtual Cluster Placement (VCP) problem is to reduce the communication cost. For this, we have to consider the network topology of the data center. In this paper, we have proposed some heuristics for both kinds of placement problems (VMP as well as VCP) and given Integer Linear Programming (ILP) formulations. We have also presented algorithms based on Semidefinite Programming (SDP) and meta-heuristic based on Genetic Algorithms. We have compared the performance of proposed heuristics with other existing works and the optimal solutions obtained from ILPs.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
