To improve the inefficiency of file access for massive small files in the distributed file system, prefetching the small files into the cache is the most conventional method to be adopted. As the number of cached files is proportional to time, there will be many redundant small files which occupy the cache space and haven't been read for a long time, the hit ratio will be decreased in this situation. To solve this defect, we proposed an improved LRU-W algorithm based on the file read times and the time interval of file read and designed a L2 cache optimization mechanism which can search file in the linked list with higher priority firstly and remove the files with lighter weight factor from the linked list with lower priority dynamically. The experiments and its result show that when prefetching massive small files, the proposed method in this paper can increase the hit ratio of cached files and improve the overall performance of Ceph file system.
展开▼
