五月婷婷丁香性爱|j久久一级免费片|久久美女福利视频|中文观看在线观看|加勒比四区三区二|亚洲裸女视频网站|超碰97AV在线69网站免费观看|有码在线免费视频|久久青青日本视频|亚洲国产AAAA

華為云存儲(chǔ)創(chuàng)新LAB實(shí)習(xí)生論文被OSDI’23接收!提出并論證Radix Tree是最適合分離式內(nèi)存架構(gòu)的范圍索引

OSDI (USENIX Symposium on Operating Systems Design and Implementation)是計(jì)算機(jī)系統(tǒng)領(lǐng)域最頂級(jí)的會(huì)議,與SOSP齊名,本屆會(huì)議共收到投稿255篇,錄用54篇,錄用率21%。華為云存儲(chǔ)創(chuàng)新Lab提出并論證Radix Tree是最適合分離式內(nèi)存架構(gòu)的范圍索引,并設(shè)計(jì)了第一個(gè)面向分離式內(nèi)存架構(gòu)的Radix Tree索引SMART。這是繼RACE (USENIX ATC’21)、FORD (FAST’22)、FUSEE (FAST’2023)、ROLEX (FAST’23)之后,我們?cè)诜蛛x式內(nèi)存系統(tǒng)方向上的又一個(gè)重要研究成果。

【論文信息】

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.

【論文簡(jiǎn)介】

       內(nèi)存分離架構(gòu)將計(jì)算資源和內(nèi)存資源解耦,使兩者通過(guò)高速網(wǎng)絡(luò)互聯(lián),以獲得高的資源利用率和靈活的彈性?,F(xiàn)有基于內(nèi)存分離架構(gòu)的范圍索引都是基于B+樹(shù)的,然而B(niǎo)+樹(shù)固有的讀寫放大問(wèn)題會(huì)消耗大量的網(wǎng)絡(luò)帶寬,導(dǎo)致低吞吐量和高訪問(wèn)時(shí)延。在這篇論文中,我們提出基數(shù)樹(shù)才是更加適合內(nèi)存分離架構(gòu)的范圍索引。這是因?yàn)橄啾扔贐+樹(shù),基數(shù)樹(shù)的讀寫放大問(wèn)題會(huì)小很多。然而,在內(nèi)存分離架構(gòu)下構(gòu)建一個(gè)基數(shù)樹(shù)索引面臨著三方面的挑戰(zhàn):昂貴的基于鎖的并發(fā)控制、有限的內(nèi)存池端IOPS和復(fù)雜的計(jì)算端緩存一致性問(wèn)題。為了解決這些挑戰(zhàn),我們?cè)O(shè)計(jì)了SMART,第一個(gè)高性能的基于內(nèi)存分離架構(gòu)的基數(shù)樹(shù)索引,并提出了一種混合式的并發(fā)控制方案來(lái)減小昂貴的鎖開(kāi)銷、一種計(jì)算端的讀代理和寫合并技術(shù)來(lái)減小冗余的網(wǎng)絡(luò)I/O、一種簡(jiǎn)單有效的反向校驗(yàn)機(jī)制來(lái)處理基數(shù)樹(shù)中計(jì)算端緩存的一致性問(wèn)題。實(shí)驗(yàn)結(jié)果顯示,相比于現(xiàn)有最優(yōu)的內(nèi)存分離架構(gòu)上的B+樹(shù)方案,SMART在寫密集負(fù)載上提升了6.1倍的吞吐量,在只讀負(fù)載上提升了2.8倍的吞吐量。該論文是由來(lái)自復(fù)旦大學(xué)的實(shí)習(xí)生羅旭川在云存儲(chǔ)創(chuàng)新LAB左鵬飛博士的指導(dǎo)下完成。


附:華為云存儲(chǔ)創(chuàng)新LAB在分離式內(nèi)存方向上的研究成果

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.