METHOD TO RETAIN CRITICAL DATA IN A CACHE IN ORDER TO INCREASE APPLICATION PERFORMANCE

• US 20080086599A1
• Filed: 10/10/2006
• Published: 04/10/2008
• Est. Priority Date: 10/10/2006
• Status: Abandoned Application

• Current Assignee: International Business Machines Corporation
• Original Assignee: International Business Machines Corporation
• Inventors: MARON, WILLIAM A., Srinivas, Mysore Sathyanarayana, Mewhinney, Greg R., Whitworth, David Blair
• Application Number:
  US11/539,894
• Publication Number:
  US 20080086599A1
• Time in Patent Office: Days
• US Class Current: 711/133
• CPC Class Codes: G06F 12/123 with age lists, e.g. queue, most recently used [MRU] list or least recently used [LRU] list
• CPC Class Codes: G06F 12/126 with special data handling, e.g. priority of data or instructions, handling errors or pinning

Abstract

A computer implemented method, apparatus, and computer usable program code for managing data in a cache. Data in the cache is identified that has been designated by an application to form identified data. The identified data is aged in the cache at a slower rate than other data in the cache that is undesignated for slower aging in response to identifying the data in the cache.

Claims

1. A computer implemented method for managing data in a cache, the computer implemented method comprising:

identifying the data in the cache that has been designated by an application to form identified data; and

responsive to identifying the data in the cache, aging the identified data in the cache at a slower rate than other data in the cache that is undesignated for slower aging.

2. The computer implemented method of claim 1, wherein the identifying step comprises:

determining whether a data address in which the data is located is associated with a cache priority level indicating the data is critical data.

3. The computer implemented method of claim 2, wherein the aging step comprises:

responsive to determining the data address is associated with the cache priority level, finding a least recently used slot in the cache; and

responsive to the cache priority level of the data address being greater than a priority level of the least recently used slot, inserting the data of the data address in the least recently used slot.

4. The computer implemented method of claim 1 further comprising:

receiving an identification of the data in the cache that has been designated by the application through execution of an instruction in the application, wherein the instruction includes a priority rating for the data.

5. The computer implemented method of claim 2, wherein the determining step further comprises:

determining whether the data address is present in a cache priority table;

responsive to determining the data address is present in the cache priority table, retrieving the cache priority level associated with the data address from the cache priority table.

6. The computer implemented method of claim 2, further comprising:

establishing the cache priority level for critical data structures and corresponding data addresses, wherein the cache priority level indicates importance of the data within the data address.

7. The computer implemented method of claim 6, wherein a cache priority subroutine establishes the critical data structures, wherein the critical data structures indicate sizes and addresses of the critical data.

8. The computer implemented method of claim 5, wherein the cache priority table specifies address, size, and starting priority of the critical data.

9. The computer implemented method of claim 1, wherein the identifying and aging steps are performed by a least recently used control.

10. The computer implemented method of claim 2, further comprising:

responsive to a determining that the data to be stored in the cache does not have a priority level, setting the cache priority level for the data equal to zero.

11. The computer implemented method of claim 1, further comprising:

responsive to determining the cache has an empty slot for the data, inserting the data in the cache and setting a cache priority field.

12. The computer implemented method of claim 2, further comprising:

responsive to the cache priority level of the data being greater than a priority level of the least recently used slot, decrementing the priority level of the least recently used slot and marking the slot as most recently used.

13. The computer implemented method of claim 2, further comprising:

aging the data of the data address proportionate to the cache priority level, wherein the data with a higher critical rating is aged more slowly than the data with a lower critical rating.

14. A caching system comprising:

a cache array for caching data, wherein;

a least recently used array, wherein the least recently used array determines whether a data address is associated with a cache priority level, finds a least recently used slot in the cache array in response to a determination that the data address is associated with the cache priority level, inserts the data of the data address in the least recently used slot of the cache array in response to the cache priority level of the data being greater than a priority level of the least recently used slot, and sets the cache priority level for the data for controlling contents of the cache based on the cache priority level.

15. The caching system of claim 14, further comprising:

a cache priority table within the least recently used array for determining the cache priority level.

16. The caching system of claim 15, wherein the least recently used array includes a logic unit for using the cache priority level to age the contents of the cache based on the cache priority level.

17. A computer program product comprising a computer usable medium including computer usable program code for managing data in a cache, the computer program product comprising:

computer usable program code for determining whether a data address is associated with a cache priority level;

computer usable program code responsive to determining the data address is associated with the cache priority level, for finding a least recently used slot in the cache;

computer usable program code responsive to the cache priority level of the data address being greater than a priority level of the least recently used slot, for inserting the data of the data address in the least recently used slot; and

computer usable program code for setting the cache priority level for the data address for controlling contents of the cache based on the cache priority level.

18. The computer program product of claim 17, further comprising:

computer usable program code responsive to determining the cache has an empty slot for the data, for inserting the data in the cache and setting a cache priority field.

19. The computer program product of claim 17, further comprising:

computer usable program code responsive to the cache priority level of the data being greater than the priority level of the least recently used slot, for decrementing the priority level of the least recently used slot and marking the least recently used slot as most recently used.

20. A computer implemented method for managing data in a cache, the computer implemented method comprising:

determining whether a data address is present in a cache priority table;

responsive to the determination that the data address is present in the cache priority table, retrieving a cache priority level from the cache priority table for the data in the data address;

finding a least recently used slot in the cache;

responsive to the cache priority level of the data being greater than a priority level of the least recently used slot, inserting the data of the data address in the least recently used slot;

setting the cache priority level for the data address for controlling contents of the cache based on the priority level; and

aging the data as a factor of the cache priority level.