Directory reference patterns in hierarchical file systems

Abstract

The authors present a brief description of data on directory reference patterns collected from a 4.2BSD UNIX system. These data are used to examine the importance of the name lookup overhead involved in opening and using files. The analysis shows that paths in the environment are relatively long and that, in the absence of caching, name resolution overhead accounts for over 70% of the disk blocks referenced to open and use files. These results confirm recent conjectures on the high level of directory activity in UNIX file systems. Directory references exhibit strong locality, though, making caches an effective way to decrease directory overhead. Simulations of a least recently used (IRU) whole directory cache show that a cache holding just ten nodes achieves an 85% hit ratio. The implications of these results on the design of both local and distributed file systems are discussed. >