By Topic

A new cache approach based on graph for Web servers

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
E. Edi ; Lab. Informatique et Distribution, ID-IMAG, Saint-Martin, France ; D. Trystram ; J. M. Vincent

This work deals with the problem of data cache for dynamic Web servers. A set of requests (which number could be large) is submitted to a server for computing. Every request is modelled by a series-parallel graph of elementary tasks. These tasks are computed and their results are submitted to be stored into a cache. Due to the limitation of the cache capacity, some strategies should be used to select the right ones. The aim of This work is to determine, in a static session, what tasks results have to be cached in order to reduce the computing time. The problem has been formalized using graphs representation whose complexity is briefly shown to be NP-hard. Then, heuristics are proposed to select the cached data. Finally some preliminary experimental results are discussed.

Published in:

Computer Science, 2004. ENC 2004. Proceedings of the Fifth Mexican International Conference in

Date of Conference:

20-24 Sept. 2004