scispace - formally typeset
Proceedings ArticleDOI

Class-based cache management for dynamic Web content

H. Zhu, +1 more
- Vol. 3, pp 1215-1224
Reads0
Chats0
TLDR
The experimental results show that the proposed techniques are effective in supporting coarse-grain cache management and reducing server response times for tested applications.
Abstract
Caching dynamic pages at a server site is beneficial in reducing server resource demands and it also helps dynamic page caching at proxy sites. Previous work has used fine-grain dependence graphs among individual dynamic pages and underlying data sets to enforce result consistency. This paper proposes a complementary solution for applications that require coarse-grain cache management. The key idea is to partition dynamic pages into classes based on URL patterns so that an application can specify page identification and data dependence, and invoke invalidation for a class of dynamic pages. To make this scheme time-efficient with small space requirement, lazy invalidation is used to minimize slow disk accesses when IDs of dynamic pages are stored in memory with a digest format. Selective precomputing is further proposed to refresh stale pages and smoothen load peaks. A data structure is developed for efficient URL class searching during lazy or eager invalidation. This paper also presents design and implementation of a caching system called Cachuma which integrates the above techniques, runs in tandem with standard Web servers, and allows Web sites to add dynamic page caching capability with minimal changes. The experimental results show that the proposed techniques are effective in supporting coarse-grain cache management and reducing server response times for tested applications.

read more

Citations
More filters
Journal Article

Controlled caching of dynamic WWW pages

TL;DR: In this article, a scheme for maintaining a server-side cache of dynamically generated pages, allowing for cache consistency maintenance, without placing heavy burdens on application programmers, is presented, along with insights to architecture scalability and some results obtained from conducted experiments.
Patent

Testing speculative instruction execution with test cases placed in memory segments with non-naturally aligned data boundaries

TL;DR: Test cases for testing speculative execution of instructions are replicated into a memory with non-naturally aligned data boundaries to create a non-contiguous instruction stream to efficiently test a processor as mentioned in this paper.
Patent

Stress testing a processor memory with a link stack

TL;DR: In this article, a processor memory is stress tested with a variable link stack depth using link stack test segments with non-naturally aligned data boundaries, including branch to target, push/pop, push and pop segments.
Journal ArticleDOI

Caching personalised and database-related dynamic web pages

TL;DR: This paper proposes a caching scheme and then uses web session objects and database-related dynamic web cache to implement the dynamic web Cache system in Tomcat web server, and shows how to build the dependency between dynamic web pages and the underlying database fields and session objects.

Clustering, resource management, and replication support for scalable network services

Kai Shen, +1 more
TL;DR: This dissertation investigates techniques in building a middleware system, called Neptune, that provides clustering support for scalable network services that has been implemented on Linux and Solaris clusters and a number of applications have been successfully deployed on Neptune platforms.
References
More filters

The Art in Computer Programming

Andrew Hunt, +1 more
TL;DR: Here the authors haven’t even started the project yet, and already they’re forced to answer many questions: what will this thing be named, what directory will it be in, what type of module is it, how should it be compiled, and so on.
Proceedings ArticleDOI

Web caching and Zipf-like distributions: evidence and implications

TL;DR: This paper investigates the page request distribution seen by Web proxy caches using traces from a variety of sources and considers a simple model where the Web accesses are independent and the reference probability of the documents follows a Zipf-like distribution, suggesting that the various observed properties of hit-ratios and temporal locality are indeed inherent to Web accesse observed by proxies.
Proceedings Article

The MD5 Message-Digest Algorithm

TL;DR: This document describes the MD5 message-digest algorithm, which takes as input a message of arbitrary length and produces as output a 128-bit "fingerprint" or "message digest" of the input.
Trending Questions (1)
How do I clear my Exchange server cache?

The experimental results show that the proposed techniques are effective in supporting coarse-grain cache management and reducing server response times for tested applications.