Yes, the disk cache uses an LRU algorithm to decide when to throw data out of the cache. However, the cache size is not a hard limit. It is possible to actually over-flow your cache partition before the truncation algorithm hits. In that case, you may lose data or crash AFS.
For implementation details you can look at src/afs/afs_dcache.c -- I think that's where the LRU code is. -derek Narasimhan A V <[EMAIL PROTECTED]> writes: > Hello, > what is the replacement policy used by the cache manager when the > disk cache overflows. I know that the in memory dcache entries are > maintained in a LRU queue. Is it LRU for the cached data on disk too. > If it is how is it implemented ? > > > Thanks, > Narasimhan > > > _______________________________________________ > OpenAFS-devel mailing list > [EMAIL PROTECTED] > https://lists.openafs.org/mailman/listinfo/openafs-devel -- Derek Atkins, SB '93 MIT EE, SM '95 MIT Media Laboratory Member, MIT Student Information Processing Board (SIPB) URL: http://web.mit.edu/warlord/ PP-ASEL-IA N1NWH [EMAIL PROTECTED] PGP key available _______________________________________________ OpenAFS-devel mailing list [EMAIL PROTECTED] https://lists.openafs.org/mailman/listinfo/openafs-devel
