Using an access increment number to control a duration during which tracks remain in cache

US10067883B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-10067883-B2
Application numberUS-201615169598-A
CountryUS
Kind codeB2
Filing dateMay 31, 2016
Priority dateMay 31, 2016
Publication dateSep 4, 2018
Grant dateSep 4, 2018

How to read this patent

A practical reading order for non-experts. Skip the full description unless you need deep technical detail.

  1. Title

    What the patent document calls the invention.

  2. Abstract

    A short plain-language summary of the technical disclosure.

  3. Assignees and inventors

    Who owns or filed the patent and who is credited as inventor.

  4. Key dates

    Filing, priority, publication, and grant dates set the timeline.

  5. First independent claim

    The legal scope of protection — read this for what is actually claimed.

  6. CPC / IPC classifications

    Technology tags used to group this patent with similar filings.

  7. Citations and related patents

    Prior art links and similar publications in this corpus.

Abstract

Official abstract text for this publication.

Provided are a computer program product, system, and method for using an access increment number to control a duration during which tracks remain in cache. Tracks in a storage in the cache are indicated in a cache list. For each of the tracks indicated in the cache list, an access value is updated when one of the tracks is accessed in the cache. An access to a track in the cache indicated in the cache list is received. A determination is made as to whether an access increment number for the accessed track, wherein the access increment number is greater than one. The access value for the accessed track is incremented by the determined access increment number in response to the track being accessed in the cache. The access value for one of the tracks is used to determine whether to initiate to demote the track from the cache.

First claim

Opening claim text (preview).

What is claimed is: 1. A computer program product for managing tracks in a storage in a cache, the computer program product comprising a computer readable storage medium having computer readable program code embodied therein that when executed performs operations, the operations comprising: indicating tracks in the storage stored in the cache in a cache list; indicating for each of the tracks indicated in the cache list an access value updated when one of the tracks is accessed in the cache; receiving an access to a track in the cache, comprising one of the tracks in the storage, indicated in the cache list; determining an access increment number for the accessed track, wherein the access increment number is greater than one; incrementing the access value for the accessed track by the determined access increment number in response to the accessed track being accessed in the cache; using an access value for a considered track to demote comprising one of the tracks to determine whether to initiate to demote the considered track from the cache; and decrementing the access value for the considered track in response to determining not to demote the considered track based on the access value. 2. The computer program product of claim 1 , wherein the initiate to demote comprises moving indication of the considered track indicated in the cache list to a demote ready list of tracks ready to demote from the cache, wherein tracks indicted in the demote ready list are demoted from the cache. 3. The computer program product of claim 2 , wherein the considered track is at a least recently used (LRU) end of the demote ready list, and wherein the using the access value to determine whether to demote the considered track from the demote ready list comprises: determining whether the access value for the considered track at the LRU end of the demote ready list exceeds a demote threshold value greater than or equal to one, wherein the determination to initiate to demote the considered track from the cache is made in response to determining that the access value does not exceed the demote threshold value; and demoting the considered track at the LRU end of the demote ready list in response to the access value for the considered track not exceeding the demote threshold value. 4. The computer program product of claim 3 , wherein the operations further comprise: indicating the considered track at the LRU end of the demote ready list at a most recently used (MRU) end of the cache list in response to the access value for the considered track at the LRU end of the demote ready list exceeding the demote threshold value, wherein the determining not to demote the considered track from the cache is made in response to determining the access value exceeds the demote threshold value. 5. The computer program product of claim 1 , wherein there are a plurality of access increment numbers used for different types of data, wherein a higher access increment number is used for a first type of data to cause the first type of data to remain in the cache longer than a second type of data for which a lower access increment number is used, wherein the lower access increment number is less than the higher access increment number. 6. The computer program product of claim 5 , wherein the first type of data comprises metadata and wherein the second type of data comprises consumer data, wherein the metadata provides metadata for multiple tracks of consumer data. 7. The computer program product of claim 1 , wherein the determining the access increment number for the accessed track comprises determining the access increment number from a request received to access the track. 8. The computer program product of claim 7 , wherein different applications provide different access numbers when submitting the request to access the track, wherein a relatively higher access number retains the accessed track in the cache and the cache list longer than a relatively lower access number included in the request. 9. The computer program product of claim 7 , wherein the operations further comprise setting the access increment number for the accessed track to the access increment number included in the request to access the track when the accessed track is staged from the storage to the cache; and setting the access increment number for the accessed track to the access increment number included in the request to access the track when the accessed track is currently stored in the cache and when the access increment number included in the request is greater than the access increment number currently indicated for the accessed track. 10. The computer program product of claim 1 , wherein the operations further comprise: indicating for each of the tracks indicated in the cache an actual access number incremented by one each time the track indicated in the cache is accessed; and in response to accessing a track of the tracks in the cache indicated in the cache list, performing: determining whether there have been N number of accesses to the accessed track since the accessed track was last indicated at a most recently used (MRU) end of the cache list; and indicating the accessed track at the MRU end of the cache list in response to determining that there have been N number of accesses to the accessed track since the accessed track was last indicated at the MRU end of the cache list. 11. The computer program product of claim 1 , wherein the operations further comprise: receiving a cache expunge request indicating to demote an indicated track from the cache; and in response to receiving the cache expunge request initiate a demote of the indicted track identified in the cache expunge request from the cache. 12. A system for managing tracks in a storage in a cache, comprising: a processor; a memory including a cache; a computer readable storage medium having computer readable program code embodied therein that when executed performs operations, the operations comprising: indicating tracks in the storage stored in the cache in a cache list; indicating for each of the tracks indicated in the cache list an access value updated when one of the tracks is accessed in the cache; receiving an access to a track in the cache, comprising one of the tracks in the storage, indicated in the cache list; determining an access increment number for the accessed track, wherein the access increment number is greater than one; incrementing the access value for the accessed track by the determined access increment number in response to the accessed track being accessed in the cache; using an access value for a considered track to demote comprising one of the tracks to determine whether to initiate to demote the considered track from the cache; and decrementing the access value for the considered track in response to determining not to demote the considered track based on the access value. 13. The system of claim 12 , wherein the initiate to demote comprises moving indication of the considered track indicated in the cache list to a demote ready list of tracks ready to demote from the cache, wherein tracks indicted in the demote ready list are demoted from the cache. 14. The system of claim 13 , wherein the considered track is at a least recently used (LRU) end of the demote ready list, and wherein the using the access value to determine whether to demote the considered track from the demote ready list comprises: determining whether the access value for the considered track at the LRU end of the demote ready list exceeds a demote threshold value greater than or equal to one, wherein the determination to ini

Assignees

Inventors

Classifications

  • Track or segment · CPC title

  • Data transfer between cache memory and other subsystems, e.g. storage devices or host systems · CPC title

  • G06F12/124Primary

    being minimized, e.g. non MRU · CPC title

  • Allocation or management of cache space · CPC title

  • In storage controller · CPC title

Patent family

Related publications grouped by family.

External sources

Frequently asked questions

Answers are generated from the same data shown on this page.

What does patent US10067883B2 cover?
Provided are a computer program product, system, and method for using an access increment number to control a duration during which tracks remain in cache. Tracks in a storage in the cache are indicated in a cache list. For each of the tracks indicated in the cache list, an access value is updated when one of the tracks is accessed in the cache. An access to a track in the cache indicated in th…
Who is the assignee on this patent?
IBM
What technology area does this patent fall under?
Primary CPC classification G06F12/124. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Sep 04 2018 00:00:00 GMT+0000 (Coordinated Universal Time) (B2). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 1 related publication on this page (citations in our corpus or others sharing the same primary CPC).