lkml.org 
[lkml]   [2002]   [Aug]   [4]   [last100]   RSS Feed
Views: [more markup]  [less markup]  [headers]  [forward] 
 
Messages in this thread
/
FromAndreas Gruenbacher <>
SubjectRe: [PATCH] Caches that shrink automatically
DateSun, 4 Aug 2002 15:11:27 +0200
On Sunday 04 August 2002 13:30, Hans Reiser wrote:
> How do you ensure that caches have their (internal) aging hands pushed
> at a speed that is proportional to their memory usage, or is your design
> susceptible to all the usual complaints the unified memory manager crowd
> has about separate caches?

That's a policy/optimization issue; it's not even desirable to shrink the 
caches with priorities proportional to their size---they would all tend to 
become equally large.

The patch shrinks all the caches equally often, with the same priorities. The 
caches can then decide themselves how they will react, depending on their 
cache size and entry size, replacement strategy, taking care of page entry 
clustering or not, etc.

The icache, dcache, and dqcache are shrunk using the same strategy (except the 
priority is a constant for some of the caches, which could be coded in the 
shrink function as well). This scheme has worked out pretty well so far, 
right?

For Extended Attributes we are currently using a very simple cache with LRU 
entry replacement, and small entries. The cache doesn't grow very big, 
either.

Regards,
Andreas.

------------------------------------------------------------------
 Andreas Gruenbacher                                SuSE Linux AG
 mailto:agruen@suse.de                     Deutschherrnstr. 15-19
 http://www.suse.de/                   D-90429 Nuernberg, Germany
-
To unsubscribe from this list: send the line "unsubscribe linux-kernel" in
the body of a message to majordomo@vger.kernel.org
More majordomo info at  http://vger.kernel.org/majordomo-info.html
Please read the FAQ at  http://www.tux.org/lkml/

\
 
 \ /
  Last update: 2005-03-22 12:27    [from the cache]
©2003-2008