- From: Yves Lafon <ylafon@w3.org>
- Date: Sat, 19 Jun 1999 18:59:53 +0200 (MET DST)
- To: Qiang Lv <qiang@suda.edu.cn>
- cc: www-jigsaw@w3.org
On Sat, 19 Jun 1999, Qiang Lv wrote:
> Hi Yves,
>
> Can you explain the cache policy which Jigsaw uses for me? You know it
> is hard to read source code:)
Jigsaw uses a LRU-threshold policy.
Only the resource with a size < cache_size * file_ratio are cached (if
possible, of course).
Also, when the cache is full, it tries to free the least recently used
entries. Those entries are stored in 10 "generations" and moved back to
the last one when used.
Also, we plan to implement other cache policies at some point, and other
cache related things (we currently have ICP and multicast ICP).
Regards,
/\ - Yves Lafon - World Wide Web Consortium -
/\ / \ Architecture Domain - Jigsaw Activity Leader
/ \ \/\
/ \ / \ http://www.w3.org/People/Lafon - ylafon@w3.org
Received on Saturday, 19 June 1999 13:00:29 UTC