We consider the use of cooperative caching to manage the memories of cluster-based servers. Over the last several years, a number of researchers have proposed content-aware servers that implement locality-conscious request distribution to address this memory, management problem. During this development, it has become conventional wisdom that cooperative caching cannot match the performance of these servers. Unfortunately while content-aware servers provide very high performance, their request distribution algorithms are typically bound to specific applications. The advantage of building distributed servers on top of a block-based cooperative caching layer is the generality of such a layer; it can be used as a building block for diverse services, ranging from file systems to web servers. In this paper, we reexamine the question of whether a server built on top of a generic block-based cooperative caching algorithm can perform competitively with content-aware servers. Specifically, we compare the performan ce of a cooperative caching-based web server against L2S, a highly optimized locality- and load-conscious server. Our results show that by modifying the replacement policy of traditional cooperative caching algorithms, we can achieve much of the performance provided by locality-conscious servers. Our modification increases network communication to reduce disk accesses, a reasonable trade-off considering the current trend of relative performance between LANs and disks.
|Number of pages
|IEEE International Symposium on High Performance Distributed Computing, Proceedings
|Published - 2001
|10th IEEE Interantionsl Symposium on High Performance Distributed Computing - San Francisco, CA, United States
Duration: Aug 7 2001 → Aug 9 2001
All Science Journal Classification (ASJC) codes
- Computer Networks and Communications