Correlating storage rings

Patent metadata

Field	Value
Publication number	US-10055167-B2
Application number	US-201715639159-A
Country	US
Kind code	B2
Filing date	Jun 30, 2017
Priority date	Aug 18, 2016
Publication date	Aug 21, 2018
Grant date	Aug 21, 2018

Abstract

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

What is claimed is:

1. A method comprising:
allocating each replica data file in a set of replica data files for a data object to a storage drive in a first ring of storage drives based, at least in part, on an access rate for the data object being below a predetermined threshold;
creating a shadow replica for a first replica data file in the set of replica data files, wherein the shadow replica is a placeholder for a location of available storage space on a second storage drive in a second ring of storage drives;
moving the first replica data file from the first storage drive to the second storage drive in the second ring of storage drives based, at least in part, on the access rate for the data object being above the predetermined threshold; and
deleting the shadow replica for the first replica data file based, at least in part, on the access rate for the data object being below the predetermined threshold level.

2. The method of claim 1 , wherein the first ring of storage drives and the second ring of storage drives are hash rings.

3. The method of claim 1 , wherein:
the first ring of storage drives includes at least a first set of low performance storage drives; and
the second ring of storage drives includes at least a first set of high performance storage drives.

4. The method of claim 1 , further comprising comparing current access rates for each replica data file in the set of replica data files.

5. The method of claim 4 , wherein comparing current access rates for each replica data file in the set of replica data files is based on receiving a notification that at least one of a timer option and an object update option is triggered.

6. The method of claim 1 , further comprising checking a storage capacity of the second ring of storage drives.

7. The method of claim 1 , further comprising adding the shadow replica to a lookup table.

8. The method of claim 1 , wherein the shadow replica does not utilize any storage space on the second ring of storage drives.

9. The method of claim 1 , wherein deleting the shadow replica for the first replica data file further comprises:
restoring the first replica data file to the first ring of storage drives.

10. A computer program product, the computer program product comprising one or more computer readable storage media and program instructions stored on the one or more computer readable storage media, the program instructions comprising instructions to:
allocate each replica data file in a set of replica data files for a data object to a storage drive in a first ring of storage drives based, at least in part, on an access rate for the data object being below a predetermined threshold;
create a shadow replica for a first replica data file in the set of replica data files, wherein the shadow replica is a placeholder for a location of available storage space on a second storage drive in a second ring of storage drives;
move the first replica data file from the first storage drive to the second storage drive in the second ring of storage drives based, at least in part, on the access rate for the data object being above the predetermined threshold; and
delete the shadow replica for the first replica data file based, at least in part, on the access rate for the data object being below the predetermined threshold level.

11. The computer program product of claim 10 , wherein the first ring of storage drives and the second ring of storage drives are hash rings.

12. The computer program product of claim 10 , wherein:
the first ring of storage drives includes at least a first set of low performance storage drives; and
the second ring of storage drives includes at least a first set of high performance storage drives.

13. The computer program product of claim 10 , further comprising program instructions to compare current access rates for each replica data file in the set of replica data files.

14. The computer program product of claim 13 , wherein the program instructions to compare current access rates for each replica data file in the set of replica data files is based on receiving a notification that at least one of a timer option and an object update option is triggered.

15. The computer program product of claim 10 , further comprising program instructions to check a storage capacity of the second ring of storage drives.

16. The computer program product of claim 10 , further comprising program instructions to add the shadow replica to a lookup table.

17. The computer program product of claim 10 , wherein the shadow replica does not utilize any storage space on the second ring of storage drives.

18. The computer program product of claim 10 , wherein the program instructions to delete the shadow replica for the first replica data file further comprises program instructions to:
restore the first replica data file to the first ring of storage drives.

19. A computer system, the computer system comprising:
one or more computer processors;
one or more computer readable storage media;
computer program instructions;
the computer program instructions being stored on the one or more computer readable storage media for execution by the one or more computer processors; and
the computer program instructions comprising instructions to:
allocate each replica data file in a set of replica data files for a data object to a storage drive in a first ring of storage drives based, at least in part, on an access rate for the data object being below a predetermined threshold;
create a shadow replica for a first replica data file in the set of replica data files, wherein the shadow replica is a placeholder for a location of available storage space on a second storage drive in a second ring of storage drives;
move the first replica data file from the first storage drive to the second storage drive in the second ring of storage drives based, at least in part, on the access rate for the data object being above the predetermined threshold; and
delete the shadow replica for the first replica data file based, at least in part, on the access rate for the data object being below the predetermined threshold level.

20. The computer system of claim 19 , wherein the first ring of storage drives and the second ring of storage drives are hash rings.

Assignees

• IBM

Inventors

• Dai Jiming
• Hu xiao lei
• Liao mengze
• Wang Yangming
• Zeng Xiao Hua

Classifications

• G06F3/065 Primary

  Replication mechanisms · CPC title

• G06F3/0619

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

• G06F3/0683

  Plurality of storage devices · CPC title

• G06F3/0652

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

• G06F3/0631

  by allocating resources to storage systems · CPC title