Browse thread
Cache algorithms: implementation or library available?
[
Home
]
[ Index:
by date
|
by threads
]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
[ Message by date: previous | next ] [ Message in thread: previous | next ] [ Thread: previous | next ]
Date: | 2009-09-24 (13:14) |
From: | Hugo Ferreira <hmf@i...> |
Subject: | Re: [Caml-list] Cache algorithms: implementation or library available? |
Hello, I would like to thank Mattias Engdegård, Dario Teixeira, Gerd Stolpmann and Martin Jambon for their suggestions. I going through the code and article. Regards, Hugo F. Mattias Engdegård wrote: >>> The Weak module is never the right tool for implementing a cache. >> I'm not disputing this, but I would like you hear your thoughts on >> this topic. Why? > > Weak references go away at the whim of the GC, not when it would be > useful to flush the cache. A longer explanation and more about weak > references can be found in the Cuoq/Doligez article in last year's > workshop on ML (http://portal.acm.org/citation.cfm?id=1411308). > > _______________________________________________ > Caml-list mailing list. Subscription management: > http://yquem.inria.fr/cgi-bin/mailman/listinfo/caml-list > Archives: http://caml.inria.fr > Beginner's list: http://groups.yahoo.com/group/ocaml_beginners > Bug reports: http://caml.inria.fr/bin/caml-bugs >