Data Compression Method and Storage System

Patent metadata

Field	Value
Publication number	US-2016246512-A1
Application number	US-201615146076-A
Country	US
Kind code	A1
Filing date	May 4, 2016
Priority date	Nov 7, 2013
Publication date	Aug 25, 2016
Grant date	—

Abstract

Collecting, by a metadata controller (MDC) in a storage system, first information indicating a current working status of each computing node in the storage system, and second information indicating a current working status of each storage node in the storage system, determining, by the MDC based on the first information, a computing node that is one of the computing nodes and whose current working status is not a busy state as a current active computing node, determining, by the MDC based on the second information, a storage node that is one of the storage nodes and whose current working status is not a busy state as a current active storage node, and compressing, by a distributed software header (DSH) in the current active computing node or a memory manager (MM) in the current active storage node, a piece of data when the storage system needs to compress the data.

First claim

What is claimed is:

1 . A data compression method, comprising:
collecting, by a metadata controller (MDC) in a storage system, first information indicating a first current working status of each computing node in the storage system and second information indicating a second current working status of each storage node in the storage system; determining, by the MDC based on the first information, a first computing node of the computing nodes whose first current working status is not a first busy state as a current active computing node; determining, by the MDC based on the second information, a first storage node of the storage nodes whose second current working status is not a second busy state as a current active storage node; and compressing, by a first distributed software header (DSH) in the current active computing node, data.

2 . The method according to claim 1 , further comprising generating the first information by:
determining, by a corresponding DSH in each computing node based on a current resource usage rate of at least one computing node hardware in the computing node in which the corresponding DSH is located, a corresponding first current working status of the computing node in which the corresponding DSH is located; and generating the first information based on the corresponding first current working status of the computing node in which the corresponding DSH is located, wherein the at least one computing node hardware comprises a central processing unit (CPU), a memory, or combinations thereof, wherein when the current resource usage rate of the at least one computing node hardware is greater than or equal to a first preset resource usage rate, the corresponding first current working status of the computing node in which the at least one computing node hardware is located is the first busy state, and wherein when the current resource usage rate of the at least one computing node hardware is less than the first preset resource usage rate, the corresponding first current working status of the computing node in which the at least one computing node hardware is located is not the first busy state.

3 . The method according to claim 1 , further comprising generating the second information by:
determining, by a corresponding MM in each storage node based on a current resource usage rate of at least one storage node hardware in the storage node in which the corresponding MM is located, a corresponding second current working status of the storage node in which the corresponding MM is located; and generating the second information based on the corresponding second current working status of the storage node in which the corresponding MM is located, wherein the at least one storage node hardware comprises a central processing unit (CPU), a memory, or combinations thereof, wherein when the current resource usage rate of the at least one storage node hardware is greater than or equal to a second preset resource usage rate, the corresponding second current working status of the storage node in which the at least one storage node hardware is located is the second busy state, and wherein when the current resource usage rate of the at least one storage node hardware is less than the second preset resource usage rate, the corresponding second current working status of the storage node in which the at least one storage node hardware is located is not the second busy state.

4 . The method according to claim 1 , wherein the method further comprises generating, by the MDC, a current active node list that records the current active computing node and the current active storage node.

5 . The method according to claim 4 , wherein compressing, by the first DSH in the current active computing node or the first MM in the current active storage node, the data further comprises:
acquiring, by the first DSH, the data, wherein an application program corresponding to the data is deployed in the first computing node; acquiring, by the first DSH, the current active node list; determining, by the first DSH, whether the current active node list records the first computing node; and compressing, by the first DSH, the data to obtain compressed data when the current active node list records the first computing node.

6 . The method according to claim 5 , wherein after acquiring, by the first DSH, the current active node list and determining whether the current active node list records the first computing node, the method further comprises:
adding, by the first DSH to the data, a label indicating that the data is not compressed in order to obtain labeled data when the current active node list does not record the first computing node; determining, by the first DSH, whether the current active node list records the first storage node, wherein a memory that is configured to store the data and the first MM that is configured to manage the memory are disposed in the first storage node; and sending, by the first DSH, the labeled data to the first MM when the current active node list records the first storage node.

7 . The method according to claim 6 , wherein after determining, by the first DSH, whether the current active node list records the first storage node, the method further comprises:
determining, by the first DSH when the current active node list does not record the first storage node, whether the current active node list records a second computing node of the computing nodes, wherein the second computing node is any computing node except the first computing node; and sending, by the first DSH, the labeled data to a second DSH in the second computing node when the current active node list records the second computing node such that the second DSH compresses the data to obtain the compressed data.

8 . The method according to claim 6 , wherein after the determining, by the first DSH, whether the current active node list records the first storage node, the method further comprises:
determining, by the first DSH when the current active node list does not record the first storage node, whether the current active node list records a second computing node of the computing nodes, wherein the second computing node is any computing node except the first computing node; and sending, by the first DSH, the labeled data to the first MM when the current active node list does not record the second computing node.

9 . The method according to either of claim 6 , wherein after sending, by the first DSH, the labeled data to the first MM, the method further comprises:
receiving, by the first MM, the labeled data; acquiring, by the first MM, the data and the label from the labeled data; determining, by the first MM based on the label, whether the second current working status of the first storage node is the second busy state; and compressing, by the first MM, the data to obtain the compressed data when the second current working status of the first storage node is not the second busy state.

10 . A storage system, comprising:
N computing nodes, wherein at least one distributed software header (DSH) is disposed in each computing node of the N computing nodes, and wherein N is a positive integer; P storage nodes, wherein at least one memory manager (MM) is disposed in each storage node of the P storage nodes, and wherein P is a positive integer; and at least one metadata controller (MDC), separately connected to the N computing nodes and separately connected to the P storage nodes, wherein the MDC is configured to:
collect first information indicating a first current working status of each computing node, and second information indicating a second current working status of each storage node;
determine, ba

Assignees

• Huawei Tech Co Ltd

Inventors

• Li Lizhen

Classifications

• G06F3/0608 Primary

  Saving storage space on storage systems · CPC title

• H03M7/6058

  Saving memory space in the encoder or decoder · CPC title

• G06F3/0604

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

• G06F3/0631

  by allocating resources to storage systems · CPC title

• G06F3/0685

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