• Licheng Chen
    Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
  • Zhipeng Wei
    Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
  • Zehan Cui
    Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
  • Mingyu Chen
    Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
  • Haiyang Pan
    Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China
  • Yungang Bao
    Institute of Computing Technology, Chinese Academy of Sciences, Beijing, China

書誌事項

タイトル別名
  • classification-based memory deduplication through page access characteristics

抄録

<jats:p>Limited main memory size is considered as one of the major bottlenecks in virtualization environments. Content-Based Page Sharing (CBPS) is an efficient memory deduplication technique to reduce server memory requirements, in which pages with same content are detected and shared into a single copy. As the widely used implementation of CBPS, Kernel Samepage Merging (KSM) maintains the whole memory pages into two global comparison trees (a stable tree and an unstable tree). To detect page sharing opportunities, each tracked page needs to be compared with pages already in these two large global trees. However since the vast majority of compared pages have different content with it, that will induce massive futility comparisons and thus heavy overhead.</jats:p> <jats:p>In this paper, we propose a lightweight page Classification-based Memory Deduplication approach named CMD to reduce futile page comparison overhead meanwhile to detect page sharing opportunities efficiently. The main innovation of CMD is that pages are grouped into different classifications based on page access characteristics. Pages with similar access characteristics are suggested to have higher possibility with same content, thus they are grouped into the same classification. In CMD, the large global comparison trees are divided into multiple small trees with dedicated local ones in each page classification. Page comparisons are performed just in the same classification, and pages from different classifications are never compared (since they probably result in futile comparisons). The experimental results show that CMD can efficiently reduce page comparisons (by about 68.5%) meanwhile detect nearly the same (by more than 98%) or even more page sharing opportunities.</jats:p>

収録刊行物

  • ACM SIGPLAN Notices

    ACM SIGPLAN Notices 49 (7), 65-76, 2014-03

    Association for Computing Machinery (ACM)

被引用文献 (1)*注記

もっと見る

詳細情報 詳細情報について

問題の指摘

ページトップへ