Javascript must be enabled to continue!
Engineering web cache consistency
View through CrossRef
Server-driven consistency protocols can reduce read latency and improve data freshness for a given network and server overhead, compared to the traditional consistency protocols that rely on client polling. Server-driven consistency protocols appear particularly attractive for large-scale dynamic Web workloads because dynamically generated data can change rapidly and unpredictably. However, there have been few reports on engineering server-driven consistency for such workloads. This article reports our experience in engineering server-driven consistency for a sporting and event Web site hosted by IBM, one of the most popular sites on the Internet for the duration of the event. We also examine an e-commerce site for a national retail store. Our study focuses on scalability and cachability of dynamic content. To assess scalability, we measure both the amount of state that a server needs to maintain to ensure consistency and the bursts of load in sending out invalidation messages when a popular object is modified. We find that server-driven protocols can cap the size of the server's state to a given amount without significant performance costs, and can smooth the bursts of load with minimal impact on the consistency guarantees. To improve performance, we systematically investigate several design issues for which prior research has suggested widely different solutions, including whether servers should send invalidations to idle clients. Finally, we quantify the performance impact of caching dynamic data with server-driven consistency protocols and the benefits of server-driven consistency protocols for large-scale dynamic Web services. We find that (i) caching dynamically generated data can increase cache hit rates by up to 10%, compared to the systems that do not cache dynamically generated data; and (ii) server-driven consistency protocols can increase cache hit rates by a factor of 1.5-3 for large-scale dynamic Web services, compared to client polling protocols. We have implemented a prototype of a server-driven consistency protocol based on our findings by augmenting the popular Squid cache.
Association for Computing Machinery (ACM)
Title: Engineering web cache consistency
Description:
Server-driven consistency protocols can reduce read latency and improve data freshness for a given network and server overhead, compared to the traditional consistency protocols that rely on client polling.
Server-driven consistency protocols appear particularly attractive for large-scale dynamic Web workloads because dynamically generated data can change rapidly and unpredictably.
However, there have been few reports on engineering server-driven consistency for such workloads.
This article reports our experience in engineering server-driven consistency for a sporting and event Web site hosted by IBM, one of the most popular sites on the Internet for the duration of the event.
We also examine an e-commerce site for a national retail store.
Our study focuses on scalability and cachability of dynamic content.
To assess scalability, we measure both the amount of state that a server needs to maintain to ensure consistency and the bursts of load in sending out invalidation messages when a popular object is modified.
We find that server-driven protocols can cap the size of the server's state to a given amount without significant performance costs, and can smooth the bursts of load with minimal impact on the consistency guarantees.
To improve performance, we systematically investigate several design issues for which prior research has suggested widely different solutions, including whether servers should send invalidations to idle clients.
Finally, we quantify the performance impact of caching dynamic data with server-driven consistency protocols and the benefits of server-driven consistency protocols for large-scale dynamic Web services.
We find that (i) caching dynamically generated data can increase cache hit rates by up to 10%, compared to the systems that do not cache dynamically generated data; and (ii) server-driven consistency protocols can increase cache hit rates by a factor of 1.
5-3 for large-scale dynamic Web services, compared to client polling protocols.
We have implemented a prototype of a server-driven consistency protocol based on our findings by augmenting the popular Squid cache.
Related Results
An Efficient Software-Managed Cache Based on Cell Broadband Engine Architecture
An Efficient Software-Managed Cache Based on Cell Broadband Engine Architecture
While the CBEA (Cell Broadband Engine Architecture) offers substantial computational power, its explicit multilevel memory hierarchy poses significant challenges to traditional pro...
Optimized content caching strategies for multi-access edge computing (MEC)-assisted future cellular networks
Optimized content caching strategies for multi-access edge computing (MEC)-assisted future cellular networks
(English) Handling the tsunami of multimedia content is a big challenge for heterogeneous cellular networks.
Serving large volumes of content from the central system to end-users,...
VISUALISASI PENGARUH ELEMEN PERANCANGAN CACHE PADA SYMMETRIC MULTIPROCESSORS
VISUALISASI PENGARUH ELEMEN PERANCANGAN CACHE PADA SYMMETRIC MULTIPROCESSORS
[Id]Cache memory merupakan salah satu pokok pembahasan penting dalam matakuliah organisasi dan arsitektur komputer. Akan tetapi, cache tidak dapat diakses dalam proses pembelajaran...
Adjustable block size coherent caches
Adjustable block size coherent caches
Several studies have shown that the performance of coherent caches depends on the relationship between the granularity of sharing and locality exhibited by the program and the cach...
Integrated Cache Scheduling Replacement Algorithm to Reduce Cache Pollution
Integrated Cache Scheduling Replacement Algorithm to Reduce Cache Pollution
Cache memory management has recently become one of the most crucial research topics in the area of high performance computing. The cache memory has gained popularity due to its cap...
A Hierarchical Cache Architecture-Oriented Cache Management Scheme for Information-Centric Networking
A Hierarchical Cache Architecture-Oriented Cache Management Scheme for Information-Centric Networking
Information-Centric Networking (ICN) typically utilizes DRAM (Dynamic Random Access Memory) to build in-network cache components due to its high data transfer rate and low latency....
Probabilistic analysis for caching
Probabilistic analysis for caching
Analyse probabiliste pour le caching
Les caches sont de petites mémoires qui accélèrent la récupération des données. L'un des objectifs des politiques de mise en ca...
A Novel Cache Replacement Policy for Web Proxy Caching System Using Web Usage Mining
A Novel Cache Replacement Policy for Web Proxy Caching System Using Web Usage Mining
Network congestion remains one of the main barriers to the continuing success of the internet and Web based services. In this background, proxy caching is one of the most successfu...

