Paper Info
Title
PTree: Direct Lookup with Page Table Tree for NVM File Systems.
Abstract
While the rise of fast non-volitle memory (NVM) provides a unique opportunity to re-examine storage architectures and to redesign file systems, it also highlights the inefficiency of existing system software interfaces, especially the multi-step component based name resolution mechanism within modern file systems, which contains much repetitive work and does great harm to the overall performance. We find that the overhead proportion of namespace processing increases greatly in NVM file systems, compared to that in traditional disk based ones, and makes the new bottleneck. We present PTree, a fullpath name resolution scheme designed to maximize performance of file systems on NVM architectures. PTree organizes the metadata of file systems with page table to exploit the fast random access that NVMs provide, and it significantly increases the efficiency and scalability of name resolution. PTree utilizes the same interfaces as the hash table library of the kernel, simplifying the migration of traditional file systems to within 200 lines of code. Experimental results show that file systems ported with PTree improve performance by 22% to 4.5x in throughput and 66% to 6.7x in delay.
Year
Venue
Field
2017
DASC/PiCom/DataCom/CyberSciTech
System software,Bottleneck,Computer science,Page table,Namespace,Operating system,Scalability,Random access,Source lines of code,Hash table
DocType
Citations 
PageRank 
Conference
0
0.34
References 
Authors
0
7
Name
Order
Citations
PageRank
Jianqiang Zeng100.34
Nong Xiao2649116.15
Fang Liu31188125.46
Lingyu Zhu412.71
Yang Li5659125.00
Yuxuan Xing635.10
Shuo Li752.48