Correlating storage rings

US9733863B1 · US · B1

Patent metadata
FieldValue
Publication numberUS-9733863-B1
Application numberUS-201615239883-A
CountryUS
Kind codeB1
Filing dateAug 18, 2016
Priority dateAug 18, 2016
Publication dateAug 15, 2017
Grant dateAug 15, 2017

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.

Correlating two storage rings based on an access rate for an object. A correlative dual hash ring includes a first ring of storage drives and a second ring of storage drives. Objects and replicas are allocated to either a first ring or a second ring.

First claim

Opening claim text (preview).

What is claimed is: 1. A method comprising: identifying a first set of storage drives; organizing the first set of storage drives into a first ring, wherein the first ring is a hash ring; identifying a second set of storage drives; organizing the second set of storage drives into a second ring, wherein the second ring is a hash ring; correlating the first ring and the second ring, wherein correlating the first ring and the second ring includes: identifying a first set of replica data files and a second set of replica data files; allocating each replica data file in the first set of replica data files to a storage drive in the first ring, based on an access rate for each replica data file in the first set of replica data files being below a predetermined threshold; and allocating each replica data file in the second set of replica data files to a storage drive in the second ring, based on an access rate for each replica data file in the second set of replica data files being above the predetermined threshold; comparing current access rates for each replica data file in the second set of replica data files stored on the second ring; moving, to the first ring, a first subset of replica data files in the second set of replica data files, wherein the first subset of replica data files has a lowest access rate; creating a shadow replica for each replica data file in the first subset of replica data files, wherein: each shadow replica is added to a lookup table; each shadow replica is a point-in-time copy of a replica data file previously stored on the second ring; and each shadow replica does not utilize any storage space on the second ring; wherein: at least correlating the first ring and the second ring is performed by computer software running on computer hardware. 2. The method of claim 1 , wherein the first set of storage drives includes at least a first set of low performance storage drives. 3. The method of claim 1 , wherein the second set of storage drives includes at least a first set of high performance storage drives. 4. The method of claim 1 , further comprising checking a storage capacity of the second ring. 5. The method of claim 1 , further comprising: allocating each replica data file in the first set of replica data files to a storage drive in the first ring based on one or more predetermined rules; and allocating each replica data file in the second set of replica data files to a storage drive in the second ring based on the one or more predetermined rules. 6. The method of claim 1 , wherein comparing current access rates for each replica data file in the second set of replica data files stored on the second ring is based on receiving a notification that at least one of a timer option and an object update option is triggered. 7. A computer program product for the computer program product comprising: a computer readable storage medium having stored thereon: first instructions executable by a device to cause the device to identify a first set of storage drives; second instructions executable by a device to cause the device to organize the first set of storage drives into a first ring, wherein the first ring is a hash ring; third instructions executable by a device to cause the device to identify a second set of storage drives; fourth instructions executable by a device to cause the device to organize the second set of storage drives into a second ring, wherein the second ring is a hash ring; fifth instructions executable by a device to cause the device to correlate the first ring and the second ring, wherein correlating the first ring and the second ring includes: instructions to identify a first set of replica data files and a second set of replica data files; instructions to allocate each replica data file in the first set of replica data files to a storage drive in the first ring, based on an access rate for each replica data file in the first set of replica data files being below a predetermined threshold; and instructions to allocate each replica data file in the second set of replica data files to a storage drive in the second ring, based on an access rate for each replica data file in the second set of replica data files being above the predetermined threshold; sixth program instructions executable by a device to cause the device to compare current access rates for each replica data file in the second set of replica data files stored on the second ring; seventh program instructions executable by a device to cause the device to move, to the first ring, a first subset of replica data files in the second set of replica data files, wherein the first subset of replica data files has a lowest access rate; eighth program instructions executable by a device to cause the device to create a shadow replica for each replica data file in the first subset of replica data files, wherein: each shadow replica is added to a lookup table; each shadow replica is a point-in-time copy of a replica data file previously stored on the second ring; and each shadow replica does not utilize any storage space on the second ring. 8. The computer program product of claim 7 , wherein the first set of storage drives includes at least a first set of low performance storage drives. 9. The computer program product of claim 7 , wherein the second set of storage drives includes at least a first set of high performance storage drives. 10. The computer program product of claim 7 , further comprising ninth program instructions executable by a device to cause the device to check a storage capacity of the second ring. 11. The computer program product of claim 7 , further comprising: tenth program instructions executable by a device to cause the device to allocate each replica data file in the first set of replica data files to a storage drive in the first ring based on one or more predetermined rules; and eleventh program instructions executable by a device to cause the device to allocate each replica data file in the second set of replica data files to a storage drive in the second ring based on the one or more predetermined rules. 12. The computer program product of claim 7 , wherein the sixth instructions to compare current access rates for each replica data file in the second set of replica data files stored on the second ring is based on receiving a notification that at least one of a timer option and an object update option is triggered. 13. A computer system comprising: a processor set; and a computer readable storage medium; wherein: the processor set is structured, located, connected, and/or programmed to execute instruction stored on the computer readable storage medium; and the instructions include: first instructions executable by a device to cause the device to identify a first set of storage drives; second instructions executable by a device to cause the device to organize the first set of storage drives into a first ring, wherein the first ring is a hash ring; third instructions executable by a device to cause the device to identify a second set of storage drives; fourth instructions executable by a device to cause the device to organize the second set of storage drives into a second ring, wherein the second ring is a hash ring; fifth instructions executable by a device to cause the device to correlate the first ring and the second ring, wherein correlating the first ring and the second ring includes: instructions to identify a first set of replica data files and a second set of replica data files; instructions to allocate each replica data file in the first set of replica data files to a storage drive in t

Assignees

Inventors

Classifications

  • G06F3/065Primary

    Replication mechanisms · CPC title

  • Erasing, e.g. deleting, data cleaning, moving of data to a wastebasket · CPC title

  • Plurality of storage devices · CPC title

  • in relation to data integrity, e.g. data losses, bit errors · CPC title

  • by allocating resources to storage systems · 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 US9733863B1 cover?
Correlating two storage rings based on an access rate for an object. A correlative dual hash ring includes a first ring of storage drives and a second ring of storage drives. Objects and replicas are allocated to either a first ring or a second ring.
Who is the assignee on this patent?
IBM
What technology area does this patent fall under?
Primary CPC classification G06F3/065. Mapped technology areas include Physics.
When was this patent published?
Publication date Tue Aug 15 2017 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 3 related publications on this page (citations in our corpus or others sharing the same primary CPC).