Storage cluster

• US 9,836,234 B2
• Filed: 05/04/2016
• Issued: 12/05/2017
• Est. Priority Date: 06/04/2014
• Status: Active Grant

• Current Assignee: Pure Storage, Inc.
• Original Assignee: Pure Storage, Inc.
• Inventors: Colgrove, John, Davis, John D., Hayes, John Martin, Lee, Robert
• Primary Examiner(s): ELMORE, STEPHEN C
• Application Number:
  US15/146,681
• Publication Number:
  US 20160246528A1
• Time in Patent Office: 580 Days
• Field of Search: 711103, 711154, 711156, 711170, 36518533
• CPC Class Codes: G06F 11/1068 in sector programmable memories, e.g. flash disk G06F11/1072 takes precedence
• CPC Class Codes: G06F 11/1076 Parity data used in redundant arrays of independent storages, e.g. in RAID systems
• CPC Class Codes: G06F 11/108 Parity data distribution in semiconductor storages, e.g. in SSD
• CPC Class Codes: G06F 11/1092 Rebuilding, e.g. when physically replacing a failing disk
• CPC Class Codes: G06F 12/0246 in block erasable memory, e.g. flash memory
• CPC Class Codes: G06F 2201/845 Systems in which the redundancy can be transformed in increased performance
• CPC Class Codes: G06F 2212/7206 Reconfiguration of flash memory system
• CPC Class Codes: G06F 2212/7207 management of metadata or control data
• CPC Class Codes: G06F 3/06 Digital input from, or digital output to, record carriers , e.g. RAID, emulated record carriers or networked record carriers
• CPC Class Codes: G06F 3/0613 in relation to throughput
• CPC Class Codes: G06F 3/0622 in relation to access
• CPC Class Codes: G06F 3/0637 Permissions
• CPC Class Codes: G06F 3/0655 Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
• CPC Class Codes: G06F 3/0688 Non-volatile semiconductor memory arrays
• CPC Class Codes: H03M 13/1102 Codes on graphs and decoding on graphs, e.g. low-density parity check [LDPC] codes
• CPC Class Codes: H03M 13/1515 Reed-Solomon codes
• CPC Class Codes: H03M 13/154 Error and erasure correction, e.g. by using the error and erasure locator or Forney polynomial
• CPC Class Codes: H03M 13/3761 using code combining, i.e. using combining of codeword portions which may have been transmitted separately, e.g. Digital Fountain codes, Raptor codes or Luby Transform [LT] codes

Abstract

A method for managing processing power in a storage system is provided. The method includes providing a plurality of blades, each of a first subset having a storage node and storage memory, and each of a second, differing subset having a compute-only node. The method includes distributing authorities across the plurality of blades, to a plurality of nodes including at least one compute-only node, wherein each authority has ownership of a range of user data.

Claims

1. A method for managing processing power in a storage system, comprising:

providing a plurality of blades, each of a first subset having a storage node and storage memory, and each of a second, differing subset having a compute-only node; and

distributing authorities across the plurality of blades, to a plurality of nodes including at least one compute-only node, wherein each authority has ownership of a range of user data.

2. The method of claim 1, further comprising:

adding another blade having a compute-only node; and

re-distributing the authorities across the plurality of blades and the another blade.

3. The method of claim 1, wherein the distributing the authorities comprises:

moving one or more authorities from one or more of the plurality of blades to a further one of the plurality of blades, responsive to adding the further one of the plurality of blades to the storage system.

4. The method of claim 1, wherein the distributing the authorities is in accordance with balancing computing resources across the authorities, for each of the plurality of blades.

5. The method of claim 1, further comprising:

distributing computing tasks of external I/O (input/output) processing across the plurality of blades so that I/O processing for each of a plurality of classes of service is assigned to one or more storage nodes or compute nodes on an individual service class basis.

6. The method of claim 1, wherein:

the plurality of blades includes a first blade having a first set of processing characteristics including an amount of random access memory (RAM), processor speed or number of processor cores and a second blade having a second set of processing characteristics including an amount of RAM, processor speed or number of processor cores; and

a greater number of authorities is distributed to the second blade than to the first blade so as to balance the processing characteristics available to authorities of the first blade and authorities of the second blade.

7. The method of claim 1, wherein:

computing tasks of one or more applications in an application layer are distributed across at least one of the plurality of blades; and

the distributing the authorities is in proportion to relative amount of processing power available at each of the plurality of blades.

8. A tangible, non-transitory, computer-readable media having instructions thereupon which, when executed by a processor, cause the processor to perform a method comprising:

providing a plurality of blades, each of a first subset having a storage node and storage memory, and each of a second, differing subset having a compute-only node; and

distributing authorities across the plurality of blades, to a plurality of nodes including at least one compute-only node, wherein each authority has ownership of a range of user data.

9. The computer-readable media of claim 8, wherein the method further comprises:

adding another blade having a compute-only node; and

re-distributing the authorities across the plurality of blades and the another blade.

10. The computer-readable media of claim 8, wherein the distributing the authorities comprises:

moving one or more authorities from one or more of the plurality of blades to a further one of the plurality of blades, responsive to adding the further one of the plurality of blades to the storage system.

11. The computer-readable media of claim 8, wherein the distributing the authorities is in accordance with balancing computing resources across the authorities, for each of the plurality of blades.

12. The computer-readable media of claim 8, wherein the method further comprises:

distributing computing tasks of external I/O (input/output) processing across the plurality of blades so that I/O processing for each of a plurality of classes of service is assigned to one or more storage nodes or compute nodes on an individual service class basis.

13. The computer-readable media of claim 8, wherein:

the plurality of blades includes a first blade having a first set of processing characteristics including an amount of random access memory (RAM), processor speed or number of processor cores and a second blade having a second set of processing characteristics including an amount of RAM, processor speed or number of processor cores; and

a greater number of authorities is distributed to the second blade than to the first blade so as to balance the processing characteristics available to authorities of the first blade and authorities of the second blade.

14. A storage system, comprising:

a plurality of blades, each of a first subset having a storage node and storage memory, and each of a second, differing subset having a compute-only node; and

the plurality of blades forming the storage system, wherein authorities are distributed across the plurality of blades, to a plurality of nodes including at least one compute-only node, and wherein each authority has ownership of a range of user data.

15. The storage system of claim 14, configured to:

add another blade having a compute-only node; and

re-distribute the authorities across the plurality of blades and the another blade.

16. The storage system of claim 14, wherein the plurality of blades are configured to distribute the authorities by moving one or more authorities from one or more of the plurality of blades to a further one of the plurality of blades, responsive to adding the further one of the plurality of blades to the storage system.

17. The storage system of claim 14, wherein the authorities are distributed in accordance with balancing computing resources across the authorities, for each of the plurality of blades.

18. The storage system of claim 14, wherein:

computing tasks of external I/O (input/output) processing are distributed across the plurality of blades so that I/O processing for each of a plurality of classes of service is assigned to one or more storage nodes or compute nodes on an individual service class basis.

19. The storage system of claim 14, wherein:

the plurality of blades includes a first blade having a first set of processing characteristics including amount of random access memory (RAM), processor speed or number of processor cores and a second blade having a second set of processing characteristics including an amount of RAM, processor speed or number of processor cores; and

a greater number of authorities is distributed to the second blade than to the first blade so as to balance the processing characteristics available to authorities of the first blade and authorities of the second blade.

20. The storage system of claim 14, wherein:

computing tasks of one or more applications in an application layer are distributed across at least one of the plurality of blades; and

the distributing the authorities is in proportion to relative amount of processing power available at each of the plurality of blades.