Live memory migration with matrix bitmap algorithm

Live migration of OS instance, a powerful instrument to facilitate system maintenance, load balancing, fault tolerance, has become the central issue of virtualization, while the memory Migration has always been the bottleneck. However, exiting algorithms suffer two problems. First, when facing those frequently modified pages, the performance would degrade profoundly. Second, though they do perform more preferable through some certain algorithms, the accessional resources are requisite, which might extraordinary scarce under heavy load conditions. These imperfections will lead to striking performance degradation of virtual machine services. Therefore, based on the “Program Locality Principle”, this paper presents the “matrix bitmap algorithm” that collects the dirty page information for many times before deciding whether to transfer the page or not. It provides a more reasonable approach to obtain the determination. Experiments demonstrate that when under heavy load conditions, if sufficient dirty page information is collected, the decrease in total migration time will achieve 50% without increasing the system burden of the original domain.