Replication link smoothing using historical data
US-10503609-B1 · Dec 10, 2019 · US
US11151049B2 · US · B2
| Field | Value |
|---|---|
| Publication number | US-11151049-B2 |
| Application number | US-201916662772-A |
| Country | US |
| Kind code | B2 |
| Filing date | Oct 24, 2019 |
| Priority date | Oct 24, 2019 |
| Publication date | Oct 19, 2021 |
| Grant date | Oct 19, 2021 |
A practical reading order for non-experts. Skip the full description unless you need deep technical detail.
What the patent document calls the invention.
A short plain-language summary of the technical disclosure.
Who owns or filed the patent and who is credited as inventor.
Filing, priority, publication, and grant dates set the timeline.
The legal scope of protection — read this for what is actually claimed.
Technology tags used to group this patent with similar filings.
Prior art links and similar publications in this corpus.
Official abstract text for this publication.
A method, computer program product, and computer system for invalidating, by a target, all data in a first volume. A source may scan a hash to address table for a second volume to be migrated to the first volume. Data in the second volume may be migrated to be stored in the first volume by pushing information from the hash to address table to the target.
Opening claim text (preview).
What is claimed is: 1. A computer-implemented method comprising: invalidating, by a target, all data in a first volume; scanning, by a source, a hash to address table for a second volume to be migrated to the first volume; and migrating data in the second volume to be stored in the first volume by pushing information from the hash to address table to the target, wherein migrating the data in the second volume to be stored in the first volume by pushing the information from the hash to address table to the target includes matching a page in an address to hash table to the hash to address table. 2. The computer-implemented method of claim 1 wherein the information from each entry of the hash to address table includes a hash signature, a data page, and a list of addresses associated with the data page. 3. The computer-implemented method of claim 1 wherein migrating the data in the second volume to be stored in the first volume by pushing the information from the hash to address table to the target includes using a write command for each page in the hash to address table. 4. The computer-implemented method of claim 1 wherein migrating the data in the second volume to be stored in the first volume by pushing the information from the hash to address table to the target includes using a write command for each page in the hash to address table, wherein the write command includes a payload of the data page and a list of addresses where the data page is to be written. 5. The computer-implemented method of claim 1 wherein migrating the data in the second volume to be stored in the first volume by pushing the information from the hash to address table to the target includes dynamically building the hash to address table using a prefix, wherein the hash to address table only includes hash signatures that start with the prefix. 6. The computer-implemented method of claim 1 further comprising sending only content from an address to hash table to the target from the source. 7. A computer program product residing on a non-transitory computer readable storage medium having a plurality of instructions stored thereon which, when executed across one or more processors, causes at least a portion of the one or more processors to perform operations comprising: invalidating, by a target, all data in a first volume; scanning, by a source, a hash to address table for a second volume to be migrated to the first volume; and migrating data in the second volume to be stored in the first volume by pushing information from the hash to address table to the target, wherein migrating the data in the second volume to be stored in the first volume by pushing the information from the hash to address table to the target includes matching a page in an address to hash table to the hash to address table. 8. The computer program product of claim 7 wherein the information from each entry of the hash to address table includes a hash signature, a data page, and a list of addresses associated with the data page. 9. The computer program product of claim 7 wherein migrating the data in the second volume to be stored in the first volume by pushing the information from the hash to address table to the target includes using a write command for each page in the hash to address table. 10. The computer program product of claim 7 wherein migrating the data in the second volume to be stored in the first volume by pushing the information from the hash to address table to the target includes using a write command for each page in the hash to address table, wherein the write command includes a payload of the data page and a list of addresses where the data page is to be written. 11. The computer program product of claim 7 wherein migrating the data in the second volume to be stored in the first volume by pushing the information from the hash to address table to the target includes dynamically building the hash to address table using a prefix, wherein the hash to address table only includes hash signatures that start with the prefix. 12. The computer program product of claim 7 wherein the operations further comprise sending only content from an address to hash table to the target from the source. 13. A computing system including: one or more memories; and one or more processors configured to perform operations comprising: invalidating, by a target, all data in a first volume; scanning, by a source, a hash to address table for a second volume to be migrated to the first volume; and migrating data in the second volume to be stored in the first volume by pushing information from the hash to address table to the target, wherein migrating the data in the second volume to be stored in the first volume by pushing the information from the hash to address table to the target includes matching a page in an address to hash table to the hash to address table. 14. The computing system of claim 13 wherein migrating the data in the second volume to be stored in the first volume by pushing the information from the hash to address table to the target includes using a write command for each page in the hash to address table. 15. The computing system of claim 13 wherein migrating the data in the second volume to be stored in the first volume by pushing the information from the hash to address table to the target includes using a write command for each page in the hash to address table, wherein the write command includes a payload of the data page and a list of addresses where the data page is to be written. 16. The computing system of claim 13 wherein migrating the data in the second volume to be stored in the first volume by pushing the information from the hash to address table to the target includes dynamically building the hash to address table using a prefix, wherein the hash to address table only includes hash signatures that start with the prefix. 17. The computing system of claim 13 wherein the operations further comprise sending only content from an address to hash table to the target from the source. 18. A computer-implemented method comprising: invalidating, by a target, all data in a first volume; scanning, by a source, a hash to address table for a second volume to be migrated to the first volume; and migrating data in the second volume to be stored in the first volume by pushing information from the hash to address table to the target, wherein migrating the data in the second volume to be stored in the first volume by pushing the information from the hash to address table to the target includes dynamically building the hash to address table using a prefix, wherein the hash to address table only includes hash signatures that start with the prefix.
in relation to availability · CPC title
Migration mechanisms · CPC title
involving digital signatures · CPC title
Command handling arrangements, e.g. command buffers, queues, command scheduling · CPC title
Hash functions, e.g. MD5, SHA, HMAC or f9 MAC · CPC title
Related publications grouped by family.
Answers are generated from the same data shown on this page.