| 摘要 |
<p>Dynamic partitioning of cache storage into a plurality of cache pools for respective classes of competing processes is performed by step of dynamically determining adjustments to the cache partitioning using a steepest descent method. A modified steepest descent method allows unpredictable cache pool activities prior to cache repartitioning to be taken into account to avoid readjustments which would result in unacceptably small or, even worse, negative pool sizes in cases where a cache pool is extremely underutilised. <IMAGE></p> |
