Data storage backup with lessened cache pollution

US9519549B2 · US · B2

Patent metadata
FieldValue
Publication numberUS-9519549-B2
Application numberUS-201213348395-A
CountryUS
Kind codeB2
Filing dateJan 11, 2012
Priority dateJan 11, 2012
Publication dateDec 13, 2016
Grant dateDec 13, 2016

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.

Control of the discard of data from cache during backup of the data. In a computer-implemented system comprising primary data storage; cache; backup data storage; and at least one processor, the processor is configured to identify data stored in the primary data storage for backup to the backup data storage, where the identified data is placed in the cache in the form of portions of the data, and where the portions of data are to be backed up from the cache to the backup storage. Upon backup of each portion of the identified data from the cache to the backup storage, the processor marks the backed up portion of the identified data for discard from the cache. Thus, the backed up data is discarded from the cache right away, lessening cache pollution.

First claim

Opening claim text (preview).

What is claimed is: 1. A method for backing up data in a data storage system comprising primary data storage, cache, and backup data storage, the method comprising steps of: identifying, in a list, portions of data stored in the primary data storage for backup to the backup data storage, the portions of data comprising subsets of data; prefetching downward from the primary data storage the portions of data identified in the list; caching the prefetched portions of data identified in the list in the cache; backing up the prefetched portions of data identified in the list from the cache to the backup data storage; and from the list, upon backup of each of the prefetched portions of data identified in the list from the cache to the backup data storage, marking each backed up portion of the prefetched portions of data identified in the list for accelerated Least Recently Used (LRU) discard from the cache; wherein the backing up step and the marking step both comprise data blocks, and the backing up step comprises generating a backup access pattern, wherein the backup access pattern is generated from an exact pattern of access from a backup application, and the list is arranged in a same order specified by the backup access pattern such that the prefetching step prefetches, in the same order specified by the backup access pattern, data blocks of prefetched portions of data identified in the list for caching before backup to the backup storage. 2. The method of claim 1 , wherein said identifying step identifies in said list an advance subset of data stored in said data storage for backup. 3. The method of claim 1 , wherein said identifying step identifies in said list a complete set of files of data stored in said data storage for said backup. 4. The method of claim 1 , wherein said identifying step additionally comprising generating said list of physical READs of said data stored in said data storage for said prefetching step and for said marking step. 5. A data storage subsystem comprising: primary data storage; cache; backup data storage; and at least one processor configured to perform steps of: identifying, in a list, portions of data stored in the primary data storage for backup to the backup data storage, where the portions of the data comprise subsets of data, and where the portions of data identified in the list are prefetched downward from the primary data storage and cached in the cache; backing up the prefetched portions of data identified in the list from the cache to the backup data storage; and from the list, upon backup of each portion of the prefetched portions of data identified in the list from the cache to the backup data storage, marking each backed up portion of the prefetched portions of data identified in the list for accelerated Least Recently Used (LRU) discard from the cache; wherein the backing up step and the marking step both comprise data blocks, and the backing up step comprises a backup access pattern, wherein the backup access pattern is generated from an exact pattern of access from a backup application, and the list is arranged in a same order of the backup access pattern such that the prefetching step prefetches, in the same order specified by the backup access pattern, data blocks of prefetched portions of data identified in the list for caching before backup to the backup storage. 6. The data storage subsystem of claim 5 , wherein said identifying step of said processor identifies in said list an advance subset of data stored in said stat storage for backup. 7. The data storage subsystem of claim 5 , wherein said identifying step of said processor identifies in said list a complete set of files of data stored in said data storage for said backup. 8. The data storage subsystem of claim 5 , wherein said identifying step of said processor additionally comprises generating said list of physical READs of said data stored in said data storage for said prefetching step and for said marking step. 9. A computer program product for storing data with a data storage system comprising primary data storage; cache; backup data storage; and at least one computer-implemented processor, the computer program product comprising a non-transitory computer-usable storage medium having computer-usable program code embodied therein, the computer-usable program code comprising instructions to cause the processor to perform steps comprising: identifying, in a list, portions of data stored in the primary data storage for backup to the backup data storage, where the portions of the data comprise subsets of data, and where the portions of the data identified in the list are prefetched downward from the primary storage and cached in the cache; and backing up the prefetched portions of data identified in the list from the cache to the backup data storage; and from the list, upon backup of each portion of the prefetched portions of data identified in the list from the cache to the backup data storage, marking each backed up portion of the prefetched portions of data identified in the list for accelerated Least Recently Used (LRU) discard from the cache; wherein the backing up step and the marking step both comprise data blocks, and the backing up step comprises a backup access pattern, wherein the backup access pattern is generated from an exact pattern of access from a backup application, and the list is arranged in a same order of the backup access pattern such that the prefetching step prefetches, in the same order specified by the backup access pattern, data blocks of prefetched portions of data identified in the list for caching before backup to the backup storage. 10. The computer program product of claim 9 , wherein said computer-usable program code for said processor identifying step comprises code to identify in said list a complete set of files of data stored in said data storage for said backup. 11. The computer program product of claim 9 , wherein said computer-usable program code for said processor identifying step comprises code to identify in said list a complete set of files of data stored in said data storage for said backup. 12. The computer program product of claim 9 , wherein said computer-usable program code for said processor identifying step additionally comprises code to generate said list of physical READs of said data stored in said data storage for said prefetching step and for said marking step.

Assignees

Inventors

Classifications

  • Hardware arrangements for backup · CPC title

  • Prefetching based on access pattern detection, e.g. stride based prefetch · CPC title

  • History based prefetching · CPC title

  • Management of the backup or restore process · 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 US9519549B2 cover?
Control of the discard of data from cache during backup of the data. In a computer-implemented system comprising primary data storage; cache; backup data storage; and at least one processor, the processor is configured to identify data stored in the primary data storage for backup to the backup data storage, where the identified data is placed in the cache in the form of portions of the data, a…
Who is the assignee on this patent?
Blount Lawrence Carter, Fiske Rahul, Jones Carl Evan, and 2 more
What technology area does this patent fall under?
Primary CPC classification G06F11/1458. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Dec 13 2016 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 6 related publications on this page (citations in our corpus or others sharing the same primary CPC).