UC Berkeley · 1994 · 505 citations · 24 references
ComputingComputer ScienceComputer SystemsComputer NetworksDistributed SystemsStorage SystemsCachingCaching StrategiesFile SystemsCooperative CachingData AccessFile System CachingFile System PerformanceResponse Time
Emerging high‑speed networks enable remote data access nearly as fast as local access, motivating the coordination of file caches across LAN machines to form a more effective overall cache. The study examines four cooperative caching algorithms using a trace‑driven simulation. The authors evaluate these algorithms via trace‑driven simulation to assess their impact on disk access and read latency. Simulations show cooperative caching can halve disk accesses and improve read response time by up to 73 %, with relatively simple algorithms realizing most of the performance gain.
Emerging high-speed networks will allow machines to access remote data nearly as quickly as they can access local data. This trend motivates the use of cooperative caching: coordinating the file caches of many machines distributed on a LAN to form a more effective overall file cache. In this paper we examine four cooperative caching algorithms using a trace-driven simulation study. These simulations indicate that for the systems studied cooperative caching can halve the number of disk accesses, improving file system read response time by as much as 73%. Based on these simulations we conclude that cooperative caching can significantly improve file system read response time and that relatively simple cooperative caching algorithms are sufficient to realize most of the potential performance gain.
24
Scale and performance in a distributed file system
John H. Howard, Michael L. Kazar, Sherri G. Menees et al. · ACM Transactions on Computer Systems · 1988 · 1.4K citations
Thorsten von Eicken, David Culler, Seth Copen Goldstein et al. · 1992 · 1.4K citations
Measurements of a distributed file system
Mary G. Baker, John H. Hartman, Michael D. Kupfer et al. · 1991 · 535 citations