Data compression using constant number-of-track-groups and thin provisioning clone target

US9927979B1 · US · B1

Patent metadata
FieldValue
Publication numberUS-9927979-B1
Application numberUS-201213363893-A
CountryUS
Kind codeB1
Filing dateFeb 1, 2012
Priority dateFeb 1, 2012
Publication dateMar 27, 2018
Grant dateMar 27, 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.

For a data copying operation, data compression using constant number-of-track-groups and a thinly provisioned target device facilitates incremental updates where the size of the compressed data on the target device changes. Compressed data is written to the same LBA as the beginning of the source device chunk cluster LBA (1:1 mapping of data start). A termination string or other demarking device is used to identify space freed on the target device resulting from compression. During an incremental update only changed chunk clusters are changed, and freed space is changed accordingly if necessary.

First claim

Opening claim text (preview).

What is claimed is: 1. A method comprising: for a source device characterized by a plurality of data groupings, configuring a thinly provisioned target device with corresponding data groupings; copying the source device data groupings to the target device; compressing at least some of the data groupings on the target device; and updating and compressing at least one of the data groupings on the target device independent of other data groupings on the target device. 2. The method of claim 1 including configuring the thinly provisioned target device such that for each data grouping in the source device an equivalent storage capacity in the thinly provisioned target device is provided. 3. The method of claim 2 including configuring the thinly provisioned target device such that corresponding addresses are provided for corresponding data groupings on the source and target devices. 4. The method of claim 1 including utilizing start location of each data grouping on the source device to determine a start location of the corresponding data grouping on the thinly provisioned target device. 5. The method of claim 1 wherein for at least one data grouping a space is formed on the target device where savings is realized due to data compression, and including demarking that space. 6. The method of claim 5 including allocating, deallocating, or never allocating the space. 7. The method of claim 5 including changing space size in response to a change in grouping size on the target device. 8. A computer program stored on a non-transitory medium comprising: for a source device characterized by a plurality of data groupings, logic for configuring a thinly provisioned target device with corresponding data groupings; logic for copying the source device data groupings to the target device; logic for compressing at least some of the data groupings on the target device; and logic for updating and compressing at least one of the data groupings on the target device independent of other data groupings on the target device. 9. The computer program of claim 8 including logic for configuring the thinly provisioned target device such that for each data grouping in the source device an equivalent storage capacity in the thinly provisioned target device is provided. 10. The computer program of claim 9 including logic for configuring the thinly provisioned target device such that corresponding addresses are provided for corresponding data groupings on the source and target devices. 11. The computer program of claim 8 including logic for utilizing start location of each data grouping on the source device to determine a start location of the corresponding data grouping on the thinly provisioned target device. 12. The computer program of claim 8 wherein for at least one data grouping a space is formed on the target device where savings is realized due to data compression, and including logic for demarking that space. 13. The computer program of claim 12 including logic for allocating, deallocating, or never allocating the space. 14. The computer program of claim 12 including logic for changing space size in response to a change in grouping size on the target device. 15. An apparatus comprising: a source data storage device characterized by a plurality of data groupings; a thinly provisioned target data storage device configured for corresponding data groupings; and computer program code for copying the source device data groupings to the target device, compressing at least some of the data groupings on the target device, and updating and compressing at least one of the data groupings on the target device independent of other data groupings on the target device. 16. The apparatus of claim 15 wherein the thinly provisioned target device is configured such that for each data grouping in the source device an equivalent storage capacity in the thinly provisioned target device is provided. 17. The apparatus of claim 16 wherein the thinly provisioned target device is configured such that corresponding addresses are provided for corresponding data groupings on the source and target devices. 18. The apparatus of claim 15 wherein a start location of each data grouping on the source device is used to determine a start location of the corresponding data grouping on the thinly provisioned target device. 19. The apparatus of claim 15 wherein for at least one data grouping a space is formed on the target device where savings is realized due to data compression, and wherein that space is demarked. 20. The apparatus of claim 19 wherein the space is allocated, deallocated, or never allocated. 21. The apparatus of claim 19 wherein space size is changed in response to a change in grouping size on the target device.

Assignees

Inventors

Classifications

  • G06F3/0608Primary

    Saving storage space on storage systems · CPC title

  • Reducing size or complexity of storage systems · CPC title

  • Physics · mapped topic

  • Management of blocks · CPC title

  • Plurality of storage devices · 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 US9927979B1 cover?
For a data copying operation, data compression using constant number-of-track-groups and a thinly provisioned target device facilitates incremental updates where the size of the compressed data on the target device changes. Compressed data is written to the same LBA as the beginning of the source device chunk cluster LBA (1:1 mapping of data start). A termination string or other demarking devic…
Who is the assignee on this patent?
Don Arieh, Veprinsky Alexandr, Ohare Jeremy J, and 2 more
What technology area does this patent fall under?
Primary CPC classification G06F3/0608. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Mar 27 2018 00:00:00 GMT+0000 (Coordinated Universal Time) (B1). Legal status and post-grant events are not shown on this page.
What related patents are in patentsdb?
We list 8 related publications on this page (citations in our corpus or others sharing the same primary CPC).