Method for managing a cache hierarchy having a least recently used (LRU) global cache and a plurality of LRU destaging local caches containing counterpart datatype partitions

• US 5,717,893 A
• Filed: 05/20/1991
• Issued: 02/10/1998
• Est. Priority Date: 03/22/1989
• Status: Expired due to Term

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Mattson, Richard Lewis
• Primary Examiner(s): Gossage, Glenn
• Application Number:
  US07/703,309
• Time in Patent Office: 2,458 Days
• Field of Search: 395/425, 395/600, 395/456, 395/446, 395/447, 395/457, 395/497.04, 395/463, 395/487, 395/449, 395/621, 395/480
• US Class Current: 711/129
• CPC Class Codes: G06F 12/084 with a shared cache
• CPC Class Codes: G06F 12/0862 with prefetch
• CPC Class Codes: G06F 12/0871 Allocation or management of cache space
• CPC Class Codes: G06F 12/0873 Mapping of cache memory to specific storage devices or parts thereof
• CPC Class Codes: G06F 12/0897 with two or more cache hierarchy levels with multilevel cache hierarchies G06F12/0811
• CPC Class Codes: G06F 12/128 adapted to multidimensional cache systems, e.g. set-associative, multicache, multiset or multilevel
• CPC Class Codes: G06F 2212/282 Partitioned cache
• CPC Class Codes: G06F 2212/311 In host system

Abstract

A method for managing a cache hierarchy having a fixed total storage capacity is disclosed. The cache hierarchy is logically partitioned to form a least recently used (LRU) global cache and a plurality of LRU destaging local caches. The global cache stores objects of all types and maintains them in LRU order. In contrast, each local cache is bound to objects having a unique data type T(i), where i is indicative of a DataType. Read and write accesses by referencing processors or central processing units (CPU'"'"'s) are made to the global cache. Data not available in the global cache is staged thereto either from one of the local caches or from external storage. When a cache full condition is reached, placement of the most recently used (MRU) data element to the top of the global cache results in an LRU data element of type T(i) being destaged from the global cache to a corresponding one of the local caches storing type T(i) data. Likewise, when a cache full condition is reached in any one or more of the local caches, the local caches in turn will destage their LRU data elements to external storage. The parameters defining the partitions are externally supplied.

Claims

1. A method for managing a cache hierarchy having a fixed total storage capacity, said cache hierarchy being sited in a data path coupling a processor to an external storage subsystem, comprising the steps of:

(a) logically partitioning said cache hierarchy to form a least recently used (LRU) global cache and a plurality of LRU destaging local caches, each local cache i being bound to objects having a unique data type T(i), i being an identifier designating one of the plurality of local caches and T(i) being an identifier designating the unique data type resident in cache i;

(b) responsive to access commands from said processor, storing objects of all types in said global cache and maintaining them in said global cache in LRU order, objects being staged to the global cache either from one of the local caches or from the external storage subsystem if not present in said local caches;

(c) upon the global cache attaining a cache full condition, destaging an LRU object of type T(i) from the global cache to the local cache storing type T(i) data, a cache full condition under an LRU global or local cache being one where the storage of an additional object in a cache results in the destaging of at least one object in LRU order; and

(d) upon any one or more of the local caches attaining a cache full condition, destaging an LRU object from said one or more local caches to the external storage subsystem.