期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
An efficient wear-leveling-aware multi-grained allocator for persistent memory file systems
1
作者 zhiwang yu Runyu ZHANG +2 位作者 Chaoshu YANG Shun NIE Duo LIU 《Frontiers of Information Technology & Electronic Engineering》 SCIE EI CSCD 2023年第5期688-702,共15页
Persistent memory(PM)file systems have been developed to achieve high performance by exploiting the advanced features of PMs,including nonvolatility,byte addressability,and dynamic random access memory(DRAM)like perfo... Persistent memory(PM)file systems have been developed to achieve high performance by exploiting the advanced features of PMs,including nonvolatility,byte addressability,and dynamic random access memory(DRAM)like performance.Unfortunately,these PMs suffer from limited write endurance.Existing space management strategies of PM file systems can induce a severely unbalanced wear problem,which can damage the underlying PMs quickly.In this paper,we propose a Wear-leveling-aware Multi-grained Allocator,called WMAlloc,to achieve the wear leveling of PMs while improving the performance of file systems.WMAlloc adopts multiple min-heaps to manage the unused space of PMs.Each heap represents an allocation granularity.Then,WMAlloc allocates less-worn blocks from the corresponding min-heap for allocation requests.Moreover,to avoid recursive split and inefficient heap locations in WMAlloc,we further propose a bitmap-based multi-heap tree(BMT)to enhance WMAlloc,namely,WMAlloc-BMT.We implement WMAlloc and WMAlloc-BMT in the Linux kernel based on NOVA,a typical PM file system.Experimental results show that,compared with the original NOVA and dynamic wear-aware range management(DWARM),which is the state-of-the-art wear-leveling-aware allocator of PM file systems,WMAlloc can,respectively,achieve 4.11×and 1.81×maximum write number reduction and 1.02×and 1.64×performance with four workloads on average.Furthermore,WMAlloc-BMT outperforms WMAlloc with 1.08×performance and achieves 1.17×maximum write number reduction with four workloads on average. 展开更多
关键词 File system Persistent memory Wear-leveling Multi-grained allocator
原文传递
Elliptic genera of level N for complete intersections
2
作者 Jianbo WANG yuyu WANG zhiwang yu 《Frontiers of Mathematics in China》 SCIE CSCD 2021年第4期1043-1062,共20页
We focus on the elliptic genera of level N at the cusps of a congruence subgroup for any complete intersection.Writing the first Chern class of a complete intersection as a product of an integral coefficient c1 and a ... We focus on the elliptic genera of level N at the cusps of a congruence subgroup for any complete intersection.Writing the first Chern class of a complete intersection as a product of an integral coefficient c1 and a generator of the 2nd integral cohomology group,we mainly discuss the values of the elliptic genera of level N for the complete intersection in the cases of c_(1)>,=,or<0.In particular,the values about the Todd genus,Â-genus,and A_(k)-genus can be derived from the elliptic genera of level N. 展开更多
关键词 Complete intersection elliptic genera of level N Todd genus A_(k)-genus
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部