MATRYOSHKA:通过事务性页面迁移实现非排他性内存分层

Lingfeng Xiang, Zhen Lin, Weishu Deng, Hui Lu, Jia Rao, Yifan Yuan, Ren Wang
{"title":"MATRYOSHKA:通过事务性页面迁移实现非排他性内存分层","authors":"Lingfeng Xiang, Zhen Lin, Weishu Deng, Hui Lu, Jia Rao, Yifan Yuan, Ren Wang","doi":"arxiv-2401.13154","DOIUrl":null,"url":null,"abstract":"With the advent of byte-addressable memory devices, such as CXL memory,\npersistent memory, and storage-class memory, tiered memory systems have become\na reality. Page migration is the de facto method within operating systems for\nmanaging tiered memory. It aims to bring hot data whenever possible into fast\nmemory to optimize the performance of data accesses while using slow memory to\naccommodate data spilled from fast memory. While the existing research has\ndemonstrated the effectiveness of various optimizations on page migration, it\nfalls short of addressing a fundamental question: Is exclusive memory tiering,\nin which a page is either present in fast memory or slow memory, but not both\nsimultaneously, the optimal strategy for tiered memory management? We demonstrate that page migration-based exclusive memory tiering suffers\nsignificant performance degradation when fast memory is under pressure. In this\npaper, we propose non-exclusive memory tiering, a page management strategy that\nretains a copy of pages recently promoted from slow memory to fast memory to\nmitigate memory thrashing. To enable non-exclusive memory tiering, we develop\nMATRYOSHKA, a new mechanism that features transactional page migration and page\nshadowing. MATRYOSHKA removes page migration off the program's critical path\nand makes migration asynchronous. Evaluations with microbenchmarks and\nrealworld applications show that MATRYOSHKA achieves 6x performance improvement\nover the state-of-the-art transparent page placement (TPP) approach under\nmemory pressure. We also compare MATRYOSHKA with a recently proposed\nsampling-based migration approach and demonstrate MATRYOSHKA's strengths and\npotential weaknesses in various scenarios. Through the evaluations, we discover\na serious issue facing all tested approaches, unfortunately including\nMATRYOSHKA, and call for further research on tiered memory-aware memory\nallocation.","PeriodicalId":501333,"journal":{"name":"arXiv - CS - Operating Systems","volume":"2019 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2024-01-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"MATRYOSHKA: Non-Exclusive Memory Tiering via Transactional Page Migration\",\"authors\":\"Lingfeng Xiang, Zhen Lin, Weishu Deng, Hui Lu, Jia Rao, Yifan Yuan, Ren Wang\",\"doi\":\"arxiv-2401.13154\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"With the advent of byte-addressable memory devices, such as CXL memory,\\npersistent memory, and storage-class memory, tiered memory systems have become\\na reality. Page migration is the de facto method within operating systems for\\nmanaging tiered memory. It aims to bring hot data whenever possible into fast\\nmemory to optimize the performance of data accesses while using slow memory to\\naccommodate data spilled from fast memory. While the existing research has\\ndemonstrated the effectiveness of various optimizations on page migration, it\\nfalls short of addressing a fundamental question: Is exclusive memory tiering,\\nin which a page is either present in fast memory or slow memory, but not both\\nsimultaneously, the optimal strategy for tiered memory management? We demonstrate that page migration-based exclusive memory tiering suffers\\nsignificant performance degradation when fast memory is under pressure. In this\\npaper, we propose non-exclusive memory tiering, a page management strategy that\\nretains a copy of pages recently promoted from slow memory to fast memory to\\nmitigate memory thrashing. To enable non-exclusive memory tiering, we develop\\nMATRYOSHKA, a new mechanism that features transactional page migration and page\\nshadowing. MATRYOSHKA removes page migration off the program's critical path\\nand makes migration asynchronous. Evaluations with microbenchmarks and\\nrealworld applications show that MATRYOSHKA achieves 6x performance improvement\\nover the state-of-the-art transparent page placement (TPP) approach under\\nmemory pressure. We also compare MATRYOSHKA with a recently proposed\\nsampling-based migration approach and demonstrate MATRYOSHKA's strengths and\\npotential weaknesses in various scenarios. Through the evaluations, we discover\\na serious issue facing all tested approaches, unfortunately including\\nMATRYOSHKA, and call for further research on tiered memory-aware memory\\nallocation.\",\"PeriodicalId\":501333,\"journal\":{\"name\":\"arXiv - CS - Operating Systems\",\"volume\":\"2019 1\",\"pages\":\"\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-01-24\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"arXiv - CS - Operating Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/arxiv-2401.13154\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Operating Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2401.13154","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

随着字节可寻址内存设备(如 CXL 内存、持久内存和存储级内存)的出现,分层内存系统已成为现实。页迁移是操作系统管理分层内存的实际方法。其目的是尽可能将热数据带入快速内存,以优化数据访问性能,同时使用慢速内存来容纳从快速内存溢出的数据。虽然现有研究已经证明了页面迁移中各种优化的有效性,但还不足以解决一个根本问题:在排他性内存分层中,页面要么存在于快内存中,要么存在于慢内存中,但不能同时存在于快内存和慢内存中,这是否是分层内存管理的最佳策略?我们证明,当快速内存受到压力时,基于页面迁移的排他性内存分层会导致明显的性能下降。在本文中,我们提出了非排他性内存分层,这是一种页面管理策略,它保留了最近从慢速内存提升到快速内存的页面副本,以减少内存冲击。为了实现非独占内存分层,我们开发了MATRYOSHKA,这是一种具有事务性页面迁移和页面阴影功能的新机制。MATRYOSHKA 将页面迁移从程序的关键路径中移除,并使迁移异步化。微基准测试和现实世界应用的评估表明,在内存压力下,MATRYOSHKA 的性能比最先进的透明页面放置(TPP)方法提高了 6 倍。我们还将 MATRYOSHKA 与最近提出的基于采样的迁移方法进行了比较,并展示了 MATRYOSHKA 在各种情况下的优势和潜在弱点。通过评估,我们发现所有测试方法(不幸的是包括 MATRYOSHKA)都面临一个严重问题,并呼吁进一步研究分层内存感知内存分配。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
MATRYOSHKA: Non-Exclusive Memory Tiering via Transactional Page Migration
With the advent of byte-addressable memory devices, such as CXL memory, persistent memory, and storage-class memory, tiered memory systems have become a reality. Page migration is the de facto method within operating systems for managing tiered memory. It aims to bring hot data whenever possible into fast memory to optimize the performance of data accesses while using slow memory to accommodate data spilled from fast memory. While the existing research has demonstrated the effectiveness of various optimizations on page migration, it falls short of addressing a fundamental question: Is exclusive memory tiering, in which a page is either present in fast memory or slow memory, but not both simultaneously, the optimal strategy for tiered memory management? We demonstrate that page migration-based exclusive memory tiering suffers significant performance degradation when fast memory is under pressure. In this paper, we propose non-exclusive memory tiering, a page management strategy that retains a copy of pages recently promoted from slow memory to fast memory to mitigate memory thrashing. To enable non-exclusive memory tiering, we develop MATRYOSHKA, a new mechanism that features transactional page migration and page shadowing. MATRYOSHKA removes page migration off the program's critical path and makes migration asynchronous. Evaluations with microbenchmarks and realworld applications show that MATRYOSHKA achieves 6x performance improvement over the state-of-the-art transparent page placement (TPP) approach under memory pressure. We also compare MATRYOSHKA with a recently proposed sampling-based migration approach and demonstrate MATRYOSHKA's strengths and potential weaknesses in various scenarios. Through the evaluations, we discover a serious issue facing all tested approaches, unfortunately including MATRYOSHKA, and call for further research on tiered memory-aware memory allocation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Analysis of Synchronization Mechanisms in Operating Systems Skip TLB flushes for reused pages within mmap's eBPF-mm: Userspace-guided memory management in Linux with eBPF BULKHEAD: Secure, Scalable, and Efficient Kernel Compartmentalization with PKS Rethinking Programmed I/O for Fast Devices, Cheap Cores, and Coherent Interconnects
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1