检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:汤晨 黄国锐 金培权[1] TANG Chen;HUANG Guorui;JIN Peiquan(School of Computer Science and Technology,University of Science and Technology of China,Hefei Anhui 230001,China;Unit 31002,Chinese People's Liberation Army,Beijing 100081,China)
机构地区:[1]中国科学技术大学计算机科学与技术学院,合肥230001 [2]中国人民解放军31002部队,北京100081
出 处:《计算机应用》2021年第3期623-629,共7页journal of Computer Applications
基 金:国家自然科学基金资助项目(61672479,62072419)。
摘 要:非易失性内存(NVM)因其大容量、持久化、按位存取和读延迟低等特性而受到人们的关注,但它同时也具有写次数有限、读写速度不均衡等缺点。针对传统线性哈希索引直接在NVM上实现时会导致大量的随机写操作这一问题,提出了一种新的NVM友好的线性哈希索引NVM-LH。NVM-LH通过存储数据时的缓存行对齐实现了缓存友好性,同时提出了无日志的数据一致性保证策略。此外,NVM-LH还通过优化分裂和删除操作来减少NVM写操作。实验结果表明,NVM-LH在空间利用率上比CCEH高30%,在NVM写次数上比CCEH减少了15%左右,表现了更好的NVM友好性。Non-Volatile Memory(NVM) attracts people’s attention because of its large capacity,persistence,bit addressability and low read latency.However,it also has some disadvantages,such as limited writes and asymmetric reading and writing speed.When the traditional linear hash index is implemented directly on NVM,it will lead to a great number of random write operations.To solve this problem,a new NVM-friendly linear hash index called NVM-LH(NVM-oriented Linear Hashing) was proposed.The cache friendliness was achieved by NVM-LH through the cache line alignment during storing data.And a log-free data consistency guaranteeing strategy was presented in NVM-LH.In addition,the split and delete operations were optimized in NVM-LH to minimize the NVM write operations.Experimental results show that NVMLH outperforms the state-of-the-art NVM-aware hash index CCEH(Cacheline-Conscious Extendible Hashing) in terms of space utilization(30% higher) and NVM write number(about 15% lower),showing better NVM-friendliness.
关 键 词:非易失性内存 动态哈希 线性哈希 缓存行友好性 数据一致性
分 类 号:TP392[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.7