Value based caching

• US 20040034740A1
• Filed: 08/13/2002
• Published: 02/19/2004
• Est. Priority Date: 08/13/2002
• Status: Active Grant

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: Rajaraman, Bala, Devine, Wesley McMillan, Stagg, Arthur James, Huynh, Lap Thiet, Britton, Edward Glen
• Granted Patent: US 6,944,715 B2
• Time in Patent Office: Days
• US Class Current: 711/129
• CPC Class Codes: G06F 12/126 with special data handling, e.g. priority of data or instructions, handling errors or pinning

Abstract

A value-based caching system and method. A value based cache method can include partitioning a cache into different value-based partitions. Data to be stored in the cache can be valued and the valued data can be cached in individual ones of the value-based partitions. Subsequently, cache entries can be evicted from the value-based partitions. Finally, the caching and evicting can be managed according to the valuing step. In this regard, the cache and eviction management step can ensure greater cache responsiveness for data having a greater value relative to other valued data.

Claims

1. A value based cache method comprising the steps of:

partitioning a cache into a plurality of different value-based partitions;

valuing data to be stored in said cache and caching said valued data in individual ones of said value-based partitions;

evicting cache entries from said value-based partitions; and

,

managing said caching and evicting according to said valuing, said cache and eviction management ensuring greater cache responsiveness for data having a greater value relative to other valued data.

2. The method of claim 1, wherein said managing step comprises the steps of:

assigning a guaranteed partition size to at least one of said value-based partitions;

permitting other ones of said value-based partitions to change to accommodate cache requests for data having a value which differs from said value-based partition having said guaranteed partition size; and

,

caching only data of like value in said value-based partition having said guaranteed partition size.

3. The method of claim 1, wherein said managing step comprises the steps of:

assigning different cache aging processes to entries in said cache, each cache entry of like value sharing a particular one of said different cache aging processes, said aging processes providing for progressively longer eviction intervals for data having a higher value than other data in said cache; and

,

evicting cache entries of particular values according to corresponding ones of said aging processes.

4. The method of claim 1, wherein said managing step comprises the steps of:

assigning a guaranteed partition size to at least one of said value-based partitions;

further assigning different cache aging processes to entries in said cache, each cache entry of like value sharing a particular one of said different cache aging processes, said aging processes providing for progressively longer eviction intervals for data having a higher value than other data in said cache;

caching data of like value in said value-based partition having said guaranteed partition size;

further caching data of disparate value in vacant space in said value-based partition having said guaranteed partition size;

evicting cache entries of particular values according to corresponding ones of said aging processes; and

,

further evicting cache entries previously stored in said vacant space in said value-based partition having said guaranteed partition size where no vacancies exist in said value-based partition having said guaranteed partition size which can accommodate said caching of said data of like value in said value-based partition having said guaranteed partition size

5. A machine readable storage having stored thereon a computer program value based caching, said computer program comprising a routine set of instructions for causing the machine to perform the steps of:

partitioning a cache into a plurality of different value-based partitions;

valuing data to be stored in said cache and caching said valued data in individual ones of said value-based partitions;

evicting cache entries from said value-based partitions; and

,

managing said caching and evicting according to said valuing, said cache and eviction management ensuring greater cache responsiveness for data having a greater value relative to other valued data.

6. The machine readable storage of claim 5, wherein said managing step comprises the steps of:

assigning a guaranteed partition size to at least one of said value-based partitions;

permitting other ones of said value-based partitions to change to accommodate cache requests for data having a value which differs from said value-based partition having said guaranteed partition size; and

,

caching only data of like value in said value-based partition having said guaranteed partition size.

7. The machine readable storage of claim 5, wherein said managing step comprises the steps of:

assigning different cache aging processes to entries in said cache, each cache entry of like value sharing a particular one of said different cache aging processes, said aging processes providing for progressively longer eviction intervals for data having a higher value than other data in said cache; and

,

evicting cache entries of particular values according to corresponding ones of said aging processes.

8. The machine readable storage of claim 5, wherein said managing step comprises the steps of:

assigning a guaranteed partition size to at least one of said value-based partitions;

further assigning different cache aging processes to entries in said cache, each cache entry of like value sharing a particular one of said different cache aging processes, said aging processes providing for progressively longer eviction intervals for data having a higher value than other data in said cache;

caching data of like value in said value-based partition having said guaranteed partition size;

further caching data of disparate value in vacant space in said value-based partition having said guaranteed partition size;

evicting cache entries of particular values according to corresponding ones of said aging processes; and

,

further evicting cache entries previously stored in said vacant space in said value-based partition having said guaranteed partition size where no vacancies exist in said value-based partition having said guaranteed partition size which can accommodate said caching of said data of like value in said value-based partition having said guaranteed partition size.

9. A value-based caching system, comprising:

a cache manager; and

,

at least one cache agent controlled by said cache manager;

said cache manager communicating value metrics to said at least one cache agent, each one of said at least one cache agents caching data and evicting cache entries according to measured values of said data and cache entries and said value metrics provided by said cache manager.

10. The value-based caching system of claim 9, further comprising:

a plurality of cache sub-agents disposed in varying media types and controlled by at least one of said at least one cache agents;

said value metrics specifying Quality of Access for said varying media types, said cache agents assigning individual ones of said controlled cache sub-agents to handle cache requests.

11. The value-based caching system of claim 10, wherein said plurality of cache sub-agents and said controlling at least one cache agent are disposed in a storage area network (SAN).