Virtual machine placement algorithm for virtualized desktop infrastructure

Finding optimal placement of virtual machines on numerous physical servers is one kind of bin-packing problem, which is known as an NP-hard. We propose the use of a heuristic algorithm to solve this problem where the virtual machines play the roles of personal desktops. As we have found out that the changes in the amount of hardware resources required by a desktop often repeat a certain pattern, in the proposed algorithm, we uses the correlation between the patterns to find the group of desktops that are most suitable for sharing the same physical server. Simulation results show that the proposed algorithm can be used to reduce the number of physical servers required for hosting a certain number of virtual desktops.