AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Article Link
Collect
Submit Manuscript
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Regular Paper

Huge Page Friendly Virtualized Memory Management

School of Electronics Engineering and Computer Science, Peking University, Beijing 100871, China
Peng Cheng Laboratory, Shenzhen 518052, China
Shenzhen Key Laboratory for Cloud Computing Technology & Applications, School of Electronic and Computer Engineering, Peking University Shenzhen, Shenzhen 518000, China
Department of Computer Science, Michigan Technological University, Michigan 49246, U.S.A.
Show Author Information

Abstract

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.

Electronic Supplementary Material

Download File(s)
jcst-35-2-433-Highlights.pdf (707.2 KB)

References

【1】
【1】
 
 
Journal of Computer Science and Technology
Pages 433-452

{{item.num}}

Comments on this article

Go to comment

< Back to all reports

Review Status: {{reviewData.commendedNum}} Commended , {{reviewData.revisionRequiredNum}} Revision Required , {{reviewData.notCommendedNum}} Not Commended Under Peer Review

Review Comment

Close
Close
Cite this article:
Sha S, Hu J-Y, Luo Y-W, et al. Huge Page Friendly Virtualized Memory Management. Journal of Computer Science and Technology, 2020, 35(2): 433-452. https://doi.org/10.1007/s11390-020-9693-0

1120

Views

7

Crossref

N/A

Web of Science

8

Scopus

0

CSCD

Received: 07 May 2019
Revised: 14 October 2019
Published: 27 March 2020
©Institute of Computing Technology, Chinese Academy of Sciences 2020