華為云存儲創(chuàng)新LAB實習生論文被OSDI’23接收！提出并論證Radix Tree是最適合分離式內存架構的范圍索引
OSDI (USENIX Symposium on Operating Systems Design and Implementation)是計算機系統(tǒng)領域最頂級的會議，與SOSP齊名，本屆會議共收到投稿255篇，錄用54篇，錄用率21%。華為云存儲創(chuàng)新Lab提出并論證Radix Tree是最適合分離式內存架構的范圍索引，并設計了第一個面向分離式內存架構的Radix Tree索引SMART。這是繼RACE (USENIX ATC’21)、FORD (FAST’22)、FUSEE (FAST’2023)、ROLEX (FAST’23)之后，我們在分離式內存系統(tǒng)方向上的又一個重要研究成果。
【論文信息】
Xuchuan Luo, Pengfei Zuo, Jiacheng Shen, Jiazhen Gu, Xin Wang, Michael Lyu, Yangfan Zhou, “SMART: A High-Performance Apative Radix Tree for Disaggregated Memory”, accepted and to appear in the 17th USENIX Symposium on Operating Systems Design and Implementation (OSDI), 2023.
【論文簡介】
內存分離架構將計算資源和內存資源解耦，使兩者通過高速網絡互聯(lián)，以獲得高的資源利用率和靈活的彈性?，F有基于內存分離架構的范圍索引都是基于B+樹的，然而B+樹固有的讀寫放大問題會消耗大量的網絡帶寬，導致低吞吐量和高訪問時延。在這篇論文中，我們提出基數樹才是更加適合內存分離架構的范圍索引。這是因為相比于B+樹，基數樹的讀寫放大問題會小很多。然而，在內存分離架構下構建一個基數樹索引面臨著三方面的挑戰(zhàn)：昂貴的基于鎖的并發(fā)控制、有限的內存池端IOPS和復雜的計算端緩存一致性問題。為了解決這些挑戰(zhàn)，我們設計了SMART，第一個高性能的基于內存分離架構的基數樹索引，并提出了一種混合式的并發(fā)控制方案來減小昂貴的鎖開銷、一種計算端的讀代理和寫合并技術來減小冗余的網絡I/O、一種簡單有效的反向校驗機制來處理基數樹中計算端緩存的一致性問題。實驗結果顯示，相比于現有最優(yōu)的內存分離架構上的B+樹方案，SMART在寫密集負載上提升了6.1倍的吞吐量，在只讀負載上提升了2.8倍的吞吐量。該論文是由來自復旦大學的實習生羅旭川在云存儲創(chuàng)新LAB左鵬飛博士的指導下完成。
附：華為云存儲創(chuàng)新LAB在分離式內存方向上的研究成果
1.Pengfei Zuo, Jiazhao Sun, Liu Yang, Shuangwu Zhang, Yu Hua, “One-sided RDMA-Conscious Extendible Hashing for Disaggregated Memory”, Proceedings of the USENIX Annual Technical Conference (USENIX ATC), 2021.
2.Ming Zhang, Yu Hua, Pengfei Zuo, Lurong Liu, “FORD: Fast One-sided RDMA-based Distributed Transactions for Disaggregated Persistent Memory”, Proceedings of the 20th USENIX Conference on File and Storage Technologies (FAST), 2022.
3.Pengfei Zuo*, Qihui Zhou*, Jiazhao Sun, Liu Yang, Shuangwu Zhang, Yu Hua, James Cheng, Rongfeng He, Huabing Yan, “RACE: One-Sided RDMA-Conscious Extendible Hashing”, ACM Transactions on Storage (TOS) 18.2 (2022): 1-29.
4.Jiacheng Shen, Pengfei Zuo, Xuchuan Luo, Tianyi Yang, Yuxin Su, Yangfan Zhou, Michael Lyu, “FUSES: A Fully Memory-Disaggregated Key-Value Store”, accepted and to appear in the 21st USENIX Conference on File and Storage Technologies (FAST), 2023.
5.Pengfei Li, Yu Hua, Pengfei Zuo, Zhangyu Chen, Jiajie Sheng, “ROLEX: A Scalable RDMA-oriented Learned Key-Value Store for Disaggregated Memory Systems”, accepted and to appear in the 21st USENIX Conference on File and Storage Technologies (FAST), 2023.
6.Xuchuan Luo, Pengfei Zuo, Jiacheng Shen, Jiazhen Gu, Xin Wang, Michael Lyu, Yangfan Zhou, “SMART: A High-Performance Apative Radix Tree for Disaggregated Memory”, accepted and to appear in the 17th USENIX Symposium on Operating Systems Design and Implementation (OSDI), 2023.