We use cookies to improve your experience with our site.
Sai Sha, Jing-Yuan Hu, Ying-Wei Luo, Xiao-Lin Wang, Zhenlin Wang. Huge Page Friendly Virtualized Memory Management[J]. Journal of Computer Science and Technology, 2020, 35(2): 433-452. DOI: 10.1007/s11390-020-9693-0
Citation: Sai Sha, Jing-Yuan Hu, Ying-Wei Luo, Xiao-Lin Wang, Zhenlin Wang. Huge Page Friendly Virtualized Memory Management[J]. Journal of Computer Science and Technology, 2020, 35(2): 433-452. DOI: 10.1007/s11390-020-9693-0

Huge Page Friendly Virtualized Memory Management

  • With the rapid increase of memory consumption by applications running on cloud data centers, we need more efficient memory management in a virtualized environment. Exploiting huge pages becomes more critical for a virtual machine's performance when it runs large working set size programs. Programs with large working set sizes are more sensitive to memory allocation, which requires us to quickly adjust the virtual machine's memory to accommodate memory phase changes. It would be much more efficient if we could adjust virtual machines' memory at the granularity of huge pages. However, existing virtual machine memory reallocation techniques, such as ballooning, do not support huge pages. In addition, in order to drive effective memory reallocation, we need to predict the actual memory demand of a virtual machine. We find that traditional memory demand estimation methods designed for regular pages cannot be simply ported to a system adopting huge pages. How to adjust the memory of virtual machines timely and effectively according to the periodic change of memory demand is another challenge we face. This paper proposes a dynamic huge page based memory balancing system (HPMBS) for efficient memory management in a virtualized environment. We first rebuild the ballooning mechanism in order to dispatch memory in the granularity of huge pages. We then design and implement a huge page working set size estimation mechanism which can accurately estimate a virtual machine's memory demand in huge pages environments. Combining these two mechanisms, we finally use an algorithm based on dynamic programming to achieve dynamic memory balancing. Experiments show that our system saves memory and improves overall system performance with low overhead.
  • loading

Catalog

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return