Group-based management of distributed file caches
- 25 June 2003
- proceedings article
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
We describe a way to manage distributed file system caches based upon groups of files that are accessed together. We use file access patterns to automatically construct dynamic groupings of files and then manage our cache by fetching groups, rather than single files. We present experimental results, based on trace-driven workloads, demonstrating that grouping improves cache performance. At the file system client, grouping can reduce LRU demand fetches by 50 to 60%. At the server cache hit rate improvements are much more pronounced, but vary widely (20 to over 1200%) depending upon the capacity of intervening caches. Our treatment includes information theoretic results that justify our approach to file grouping.Keywords
This publication has 12 references indexed in Scilit:
- The case for efficient file access pattern modelingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- On the scale and performance of cooperative Web proxy cachingPublished by Association for Computing Machinery (ACM) ,1999
- Automated hoarding for mobile computersPublished by Association for Computing Machinery (ACM) ,1997
- Long Term Distributed File Reference Tracing: Implementation and ExperienceSoftware: Practice and Experience, 1996
- Adaptive block rearrangementACM Transactions on Computer Systems, 1995
- Using speculation to reduce server load and service time on the WWWPublished by Association for Computing Machinery (ACM) ,1995
- Practical prefetching via data compressionPublished by Association for Computing Machinery (ACM) ,1993
- Disconnected operation in the Coda file systemPublished by Association for Computing Machinery (ACM) ,1991
- A fast file system for UNIXACM Transactions on Computer Systems, 1984
- Minimizing Expected Head Movement in One-Dimensional and Two-Dimensional Mass Storage SystemsACM Computing Surveys, 1980