How to Get More Value From Your File System Directory Cache

Applications frequently request file system operations that traverse the file system directory tree, such as opening a file or reading a file’s metadata. As a result, caching file system directory structure and metadata in memory is an important performance optimization for an OS kernel. This paper identifies several design principles that can substantially improve hit rate and reduce hit cost transpar-ently to applications and file systems. Specifically, our di-rectory cache design can look up a directory in a constant number of hash table operations, separates finding paths from permission checking, memoizes the results of access con-trol checks, uses signatures to accelerate lookup, and re-duces miss rates through caching directory completeness. This design can meet a range of idiosyncratic requirements imposed by POSIX, Linux Security Modules, namespaces, and mount aliases. These optimizations are a significant net improvement for real-world applications, such as improving the throughput of the Dovecot IMAP server by up to 12 % and the updatedb utility by up to 29%. 1