Concurrent File Metadata Structure Using Readers-Writer Lock

36TH ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING, SAC 2021(2021)

引用 4|浏览6
暂无评分
摘要
Linux file systems serialize threads when writing shared files. Recent studies have attempted to adopt range locks on shared files to solve this serialization problem, allowing file I/O to be executed concurrently. However, we have found that even with a range lock, I/O throughput no longer increases after a certain number of cores and decreases rapidly on a manycore server. Through extensive performance profiling, we found the cascading tree lock problem that serializes concurrent accesses to the file metadata structure. A mutex lock-based locking mechanism for each file metadata structure serializes I/O requests in modern Linux file systems such as F2FS. In this paper, we present NCACHE, a novel file metadata cache framework using readers-writer lock that allows concurrent I/O operations for the shared file. NCACHE solves the I/O scalability problem in the manycore server while ensuring consistent updates. We implemented NCACHE in F2FS and evaluated it using FxMark on a 120-core server with high-performance NVMe SSDs. Our extensive evaluations show that NCACHE achieves maximum device throughput in FxMark's shared file I/O workload. It also shows 4.1x higher throughput compared to the baseline F2FS with range locks for realistic workloads.
更多
查看译文
关键词
Operating System,File System,Concurrency
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要