Increasing data performance by transferring data between storage tiers using workload characteristics

Patent metadata

Field	Value
Publication number	US-12554428-B2
Application number	US-202318106399-A
Country	US
Kind code	B2
Filing date	Feb 6, 2023
Priority date	Jan 8, 2019
Publication date	Feb 17, 2026
Grant date	Feb 17, 2026

Abstract

A computer-implemented method, according to one embodiment, includes: receiving one or more suggestions which correspond to placement of data in storage. The one or more suggestions are used to identify portions of actual data stored in actual storage which correspond to the one or more suggestions. The first tier is configured to stripe data across the two or more shared nodes. For each of the identified portions of the actual data stored in the first tier, the one or more suggestions is further used to determine whether to transfer the given identified portion of the actual data to the second tier. Moreover, in response to a determination to transfer at least one of the identified portions of the actual data to the second tier, one or more instructions are sent to transfer the at least one of the identified portions of the actual data from the first tier to the second tier.

First claim

What is claimed is:

1 . A computer-implemented method, comprising:
receiving one or more suggestions which correspond to placement of data in storage; using the one or more suggestions to identify portions of actual data stored in actual storage which correspond to the one or more suggestions, wherein the actual storage includes: a first tier having two or more shared nodes, and a second tier having at least one shared nothing node, wherein the first tier is configured to stripe data across the two or more shared nodes, wherein the second tier includes at least two shared nothing nodes, wherein the second tier is configured such that data cannot be striped across the at least two shared nothing nodes; for each of the identified portions of the actual data stored in the first tier, using the one or more suggestions to determine whether to transfer the given identified portion of the actual data to the second tier; and in response to a determination to transfer at least one of the identified portions of the actual data to the second tier, sending one or more instructions to transfer the at least one of the identified portions of the actual data from the first tier to the second tier.

2 . The computer-implemented method of claim 1 , wherein the at least one shared nothing node implements a shared nothing architecture.

3 . The computer-implemented method of claim 1 , wherein each of the at least one shared nothing node in the second tier includes special purpose hardware, wherein the special purpose hardware is selected from the group consisting of: a graphics processing unit, a solid state drive cache, an application-specific integrated circuit, and non-volatile memory express.

4 . The computer-implemented method of claim 1 , wherein the first tier is configured to stripe data across the two or more shared nodes, with a proviso that the second tier is not configured to stripe data across two or more of the at least one shared nothing node.

5 . The computer-implemented method of claim 1 , wherein the first and second tiers are included in a same namespace.

6 . The computer-implemented method of claim 1 , comprising:
using the one or more suggestions to identify portions of newly received data which correspond thereto; for each of the identified portions of the newly received data, using the one or more suggestions to determine whether to store the given identified portion of the newly received data in the second tier; in response to determining to store the given identified portion of the newly received data in the second tier, sending one or more instructions to store the given identified portion of the newly received data in the second tier; and in response to determining to not store the given identified portion of the newly received data in the second tier, sending one or more instructions to store the given identified portion of the newly received data in the first tier.

7 . The computer-implemented method of claim 1 , wherein each of the two or more shared nodes are coupled to a same one or more data storage components in the actual storage, with a proviso that the second tier is not configured to stripe data across two or more of the at least one shared nothing node.

8 . A system, comprising:
a processor; and logic integrated with the processor, executable by the processor, or integrated with and executable by the processor, the logic being configured to perform the method of claim 1 .

9 . A computer program product comprising a computer readable storage medium having program instructions embodied therewith, the program instructions readable and/or executable by a processor to cause the processor to:
receive, by the processor, one or more suggestions which correspond to placement of data in storage; use, by the processor, the one or more suggestions to identify portions of actual data stored in actual storage which correspond to the one or more suggestions, wherein the actual storage includes: a first tier having two or more shared nodes, and a second tier having at least one shared nothing node, wherein the first tier is configured to stripe data across the two or more shared nodes, wherein the second tier includes at least two shared nothing nodes, wherein the second tier is configured such that data cannot be striped across the at least two shared nothing nodes; for each of the identified portions of the actual data stored in the first tier, use, by the processor, the one or more suggestions to determine whether to transfer the given identified portion of the actual data to the second tier; and in response to a determination to transfer at least one of the identified portions of the actual data to the second tier, send, by the processor, one or more instructions to transfer the at least one of the identified portions of the actual data from the first tier to the second tier.

10 . The computer program product of claim 9 , wherein each of the at least one two shared nothing node nodes in the second tier includes special purpose hardware, wherein the special purpose hardware is selected from the group consisting of: a graphics processing unit, a solid state drive cache, an application-specific integrated circuit, and non-volatile memory express.

11 . The computer program product of claim 9 , wherein the first tier is configured to stripe data across the two or more shared nodes, with a proviso that the second tier is not configured to stripe data across two or more of the at least one two shared nothing node nodes.

12 . The computer program product of claim 9 , wherein the first and second tiers are included in a same namespace.

13 . The computer program product of claim 9 , the program instructions readable and/or executable by the processor to cause the processor to:
use, by the processor, the one or more suggestions to identify portions of newly received data which correspond thereto; for each of the identified portions of the newly received data, use, by the processor, the one or more suggestions to determine whether to store the given identified portion of the newly received data in the second tier; in response to determining to store the given identified portion of the newly received data in the second tier, send, by the processor, one or more instructions to store the given identified portion of the newly received data in the second tier; and in response to determining to not store the given identified portion of the newly received data in the second tier, send, by the processor, one or more instructions to store the given identified portion of the newly received data in the first tier.

14 . The computer program product of claim 9 , wherein the one or more suggestions are based on data workload characteristics, wherein the data workload characteristics are generated using information selected from the group consisting of: read and/or write patterns, corresponding file types, and corresponding portions of a file.

Assignees

• IBM

Inventors

• Patil Sandeep R
• Eda Sasikanth
• Jain Abhishek
• Ukirde Digvijay

Classifications

• G06F3/0604

  Improving or facilitating administration, e.g. storage management · CPC title

• G06F3/0659

  Command handling arrangements, e.g. command buffers, queues, command scheduling · CPC title

• G06F3/067

  Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS] · CPC title

• G06F3/0685

  Hybrid storage combining heterogeneous device types, e.g. hierarchical storage, hybrid arrays · CPC title

• G06F3/0605

  by facilitating the interaction with a user or administrator · CPC title