Dynamic cache partitioning by modified steepest descent

Details Dynamic cache partitioning by modified steepest descent Dynamic cache partitioning by modified steepest descent

1991-11-01

1994-10-18

Dixon, Joseph L.

Boots, shoes, and leggings

364DIG2, 3649674, G06F 1208

Patent

active

053576233

ABSTRACT:
Dynamic partitioning of cache storage into a plurality of local caches for respective classes of competing processes is performed by a step of dynamically determining adjustments to the cache partitioning using a steepest descent method. A modified steepest descent method allows unpredictable local cache activities prior to cache repartitioning to be taken into account to avoid readjustments which would result in unacceptably small or, even worse, negative cache sizes in cases where a local cache is extremely underutilized. The method presupposes a unimodal distribution of cache misses.

REFERENCES:
patent: 4463424 (1984-07-01), Mattson et al.
patent: 4503501 (1985-03-01), Coulson et al.
patent: 4947319 (1990-08-01), Bozman
patent: 5043885 (1991-08-01), Robinson
patent: 5075868 (1991-12-01), Andes et al.
"Allocation of Cache Memory Among Competing Processes", IBM Technical Disclosure Bulletin, vol. 31 No. 9, Feb. 1989, pp. 204-209.
Computational Structures; Ward et al.; McGraw-Hill Book Company, New York, 1990; pp. 480-482.

Affiliated with

Also associated with

Rating

Dynamic cache partitioning by modified steepest descent does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Dynamic cache partitioning by modified steepest descent, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dynamic cache partitioning by modified steepest descent will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2379086