Dynamic storage allocation system for a prioritized cache
AssigneeInternational Business Machines Corporation
InventorKevin F. Smith
Life of this patent
Estimating the term…
Loading patent…
AssigneeInternational Business Machines Corporation
InventorKevin F. Smith
Estimating the term…
Methods for managing a Least Recently Used (LRU) cache in a staged storage system on a prioritized basis permitting management of data using multiple cache priorities assigned at the data set level. One method uses the signed difference between an assigned and actual hit ratio to dynamically allocate cache size to a class of data and its correlation with priority of that class. Advantageously, the hit ratio performance of a class of data can not be degraded beyond a predetermined level by a class of data having lower priority. Another method dynamically reallocates cache space among partitions asymptotically to the general equality of a weighted hit rate slope function attributable to each partition. This function is the product of the slope of a weighting factor and the partition hit rate versus partition space allocation function. Cache space is dynamically reallocated among the partitions in a direction that forces the weighted hit rate slope for each partition into equality over the entire cache. Partition space is left substantially unchanged in those partitions where the weighted hit rate slope is non-positive. Hit rate is defined as hit ratio times I/O rate.
A computer-implemented method for managing a Least Recently Used (LRU) cache having storage space occupied by data contents defined over a priority class range 1 . . . N, said cache being located in a predetermined echelon of a CPU-coupled, multi-echelon, staged data storage system, data in said cache being referenced by read and write operations in a cycle, the time rate of said read and write references to said cache data being termed the hit rate, said method comprising the steps of:
In a CPU-coupled, multi-echelon, staged data storage system, a computer-implemented method for managing a partitioned cache located at a predetermined echelon of said data storage system, said cache for storing data for immediate reference by CPU read and write operations, said method comprising the steps of:
A computer-implemented method for managing a LRU cache having data contents in a plurality of cache partitions defined over a priority class range of 1 . . . N, said cache being located in a predetermined echelon of a CPU-coupled, multi-echelon, staged storage system, data in said cache being referenced by read and write operations in a cycle, a cache partition metric termed "hit rate slope" being the ratio of a change in the time rate of said references to data located in the respective said cache partition to a corresponding change in the cache data storage space allocated to the respective said cache partition, said method comprising the steps of:
Dependencies are inferred from the claim text.