WO2019170011A1

WO2019170011A1 - Task allocation method and device, and distributed storage system

Info

Publication number: WO2019170011A1
Application number: PCT/CN2019/076048
Authority: WO
Inventors: 黄华东; 夏伟强; 王伟; 林起芊
Original assignee: 杭州海康威视系统技术有限公司
Priority date: 2018-03-07
Filing date: 2019-02-25
Publication date: 2019-09-12
Also published as: CN110244901B; CN110244901A

Abstract

The present disclosure relates to the technical field of storage, and provided thereby are a task allocation method and device and a distributed storage system. The method comprises: after receiving a storage request sent by a terminal, determining a plurality of available storage nodes in a distributed storage system; acquiring the number of allocation instances for each available storage node among the plurality of available storage nodes within a preset period of time, wherein the number of allocation instances for the available storage nodes is the number of times storage tasks are allocated to the available storage nodes; when at least one available storage node of which the number of allocation instances is less than a number of allocation instances threshold exists among the plurality of available storage nodes, screening a target storage node among said at least one available storage node; and allocating a storage task to be executed to the target storage node on the basis of the storage request. The present disclosure solves the problem of a low level of load balance in a distributed storage system, and the present disclosure is used to allocate storage tasks.

Description

Task allocation method and device, distributed storage system

Cross-reference to related applications

The present disclosure claims priority to Chinese Patent Application No. 20110118 589 4.4, entitled "Task Assignment Method and Apparatus, Distributed Storage System," filed on March 7, 2018, the entire disclosure of which is incorporated herein by reference. .

Technical field

The present disclosure relates to the field of storage technologies, and in particular, to a task allocation method and apparatus, and a distributed storage system.

Background technique

With the development of storage technology, distributed storage systems have been widely used. The distributed storage system may include: a management node, and a plurality of storage nodes managed by the management node. The terminal can store data in the distributed storage system through the management node and the storage node.

In the related art, when a terminal needs to store data in a distributed storage system, the terminal may send a storage request to the management node. Thereafter, the management node may allocate a storage task to the target storage node among the plurality of storage nodes according to the storage request, and instruct the terminal to store the data through the target storage node.

Due to the increasing number of terminals in the related art that need to store data in a distributed storage system, the management node needs to allocate multiple storage tasks separately. If the management node allocates multiple storage tasks to the same storage node, the write data load of the storage node is large, resulting in a low load balance in the entire distributed storage system.

Summary of the invention

The present disclosure provides a task allocation method and apparatus, and a distributed storage system, which can solve the problem of low load balancing in a distributed storage system. The technical solution is as follows:

In a first aspect, a task assignment method is provided for managing a node, the method comprising:

After receiving the storage request sent by the terminal, determining a plurality of available storage nodes in the distributed storage system;

Obtaining an allocation number of each of the plurality of available storage nodes within a preset time period, wherein the number of allocations of the available storage nodes is the number of times the available storage nodes are allocated storage tasks;

When there is at least one available storage node whose allocation number is less than the allocation number threshold, the target storage node is filtered among the at least one available storage node;

A storage task to be executed is allocated to the target storage node based on the storage request.

Optionally, before the screening the target storage node in the at least one available storage node, the method further includes:

Determining, according to the number of allocations of each available storage node, an average number of allocation times of the plurality of available storage nodes;

M times the average value of the number of allocations is determined as the threshold number of allocation times, M ≥ 1.

Optional, M = 1.3.

Optionally, the method further includes:

Receiving load information sent by each storage node in the distributed storage node, where the load information sent by each storage node is used to indicate a write data load value of each storage node;

Determining, according to the load information sent by each storage node, a write data load value of each storage node;

The determining a plurality of available storage nodes in the distributed storage system includes:

A storage node whose write data load value is smaller than a preset load threshold in the distributed storage system is used as the available storage node.

Optionally, screening the target storage node in the at least one available storage node, including:

Filtering, in the at least one available storage node, an available storage node with the smallest number of allocations as the target storage node;

Or filtering, in the at least one available storage node, an available storage node with the smallest write data load value as the target storage node;

Or the available storage node with the smallest sum of allocation times and write data load values among the at least one available storage node is the target storage node;

Alternatively, the target storage node is randomly selected among the at least one available storage node.

Optionally, the method further includes:

When there is no available storage node whose allocation number is less than the allocation number threshold among the plurality of available storage nodes, the target storage node is screened among the plurality of available storage nodes.

Optionally, before filtering the target storage node in the at least one available storage node, the method further includes:

Determining, when the number of allocations of the xth available storage node of the plurality of available storage nodes meets a preset condition, determining that the number of allocations of the xth available storage node is less than the threshold of the number of allocations;

The preset condition includes: (osdx−avg)/avg<M-1, osdx is the number of allocations of the xth available storage node, x≥1, avg is the average of the allocation times, M≥ 1.

In a second aspect, a task assignment apparatus is provided for managing a node, the task assignment apparatus comprising:

a first determining module, configured to determine, after receiving the storage request sent by the terminal, multiple available storage nodes in the distributed storage system;

An obtaining module, configured to acquire an allocation number of each of the plurality of available storage nodes in a preset time period, where the number of allocations of the available storage nodes is the number of times the available storage nodes are allocated storage tasks;

a first screening module, configured to filter a target storage node among the at least one available storage node when there is at least one available storage node whose number of allocations is less than an allocation number threshold;

And an allocating module, configured to allocate, to the target storage node, a storage task to be executed based on the storage request.

Optionally, the task distribution device further includes:

a second determining module, configured to determine an average number of allocation times of the plurality of available storage nodes according to the number of allocations of each available storage node;

a third determining module, configured to determine M times the average value of the number of allocation times as the threshold number of allocation times, M≥1.

Optional, M = 1.3.

Optionally, the task distribution device further includes:

a receiving module, configured to receive load information sent by each storage node in the distributed storage node, where the load information sent by each storage node is used to indicate a write data load value of each storage node;

a fourth determining module, configured to determine, according to the load information sent by each storage node, a write data load value of each storage node;

The first determining module is configured to use, as the available storage node, a storage node in the distributed storage system whose write data load value is less than a preset load threshold.

Optionally, the first screening module is used to:

Optionally, the task distribution device further includes:

And a second screening module, configured to filter the target storage node among the plurality of available storage nodes when there is no available storage node whose allocation number is less than the allocation number threshold.

Optionally, the task distribution device further includes:

a fifth determining module, configured to determine an average value of allocation times of the plurality of available storage nodes according to the number of allocations of each available storage node;

a sixth determining module, configured to determine, when the number of allocations of the xth available storage node of the plurality of available storage nodes meets a preset condition, that the number of allocations of the xth available storage node is less than the threshold of the number of allocations;

A third aspect provides a computer device including a processor, a communication interface, a memory, and a communication bus, wherein the processor, the communication interface, and the memory complete communication with each other through a bus; the memory is configured to store the computer program; For executing the program stored on the memory, implementing the method described in the first aspect.

In a fourth aspect, a computer readable storage medium is provided having stored therein a computer program that, when executed by a processor, implements the method of the first aspect.

In a fifth aspect, a distributed storage system is provided, the distributed storage system comprising a management node and a plurality of storage nodes, the management node comprising the task allocation device of the second aspect.

In a sixth aspect, a distributed storage system is provided, the distributed storage system comprising a management node and a plurality of storage nodes, the management node comprising the computer device of the third aspect.

In a seventh aspect, a computer program product is provided, which, when run on a computer, causes the computer to perform the task assignment method of the first aspect.

The beneficial effects brought by the technical solutions provided by the present disclosure are:

In the task allocation method provided by the embodiment of the present disclosure, before the storage task to be executed is allocated, when there are at least one available storage node whose allocation number is less than the allocation number threshold among the plurality of available storage nodes, it is determined that the allocation number is small and available. A storage node and a target storage node for performing storage tasks among the available storage nodes. Therefore, the management node is prevented from allocating more storage tasks to the same storage node, and the load value balance degree of the distributed storage system is improved.

DRAWINGS

In order to more clearly illustrate the technical solutions in the embodiments of the present disclosure, the drawings used in the description of the embodiments will be briefly described below. It is obvious that the drawings in the following description are only some embodiments of the present disclosure. Other drawings may also be obtained from those of ordinary skill in the art in light of the inventive work.

FIG. 1 is a schematic diagram of an application environment involved in a task allocation method according to an embodiment of the present disclosure;

FIG. 2 is a flowchart of a method for assigning a task according to an embodiment of the present disclosure;

FIG. 3 is a flowchart of a method for another task allocation method according to an embodiment of the present disclosure;

FIG. 4 is a schematic structural diagram of a task distribution apparatus according to an embodiment of the present disclosure;

FIG. 5 is a schematic structural diagram of another task distribution apparatus according to an embodiment of the present disclosure;

FIG. 6 is a schematic structural diagram of still another task distribution apparatus according to an embodiment of the present disclosure;

FIG. 7 is a schematic structural diagram of still another task distribution apparatus according to an embodiment of the present disclosure;

FIG. 8 is a schematic structural diagram of still another task distribution apparatus according to an embodiment of the present disclosure.

Detailed ways

The embodiments of the present disclosure will be further described in detail below with reference to the accompanying drawings.

FIG. 1 is a schematic diagram of an application environment involved in a task allocation method according to an embodiment of the present disclosure. As shown in FIG. 1 , the application environment includes a distributed storage system 0 and a terminal 1 . The distributed storage system 0 may include: a management node 01, and a plurality of storage nodes 02 managed by the management node 01. In FIG. 1 , a management node 01 collectively manages three storage nodes 02 as an example, and the three storage nodes 02 are respectively a first storage node, a second storage node, and a third storage node. The terminal 1 can store data in the distributed storage system 0 through the management node 01 and the storage node 02.

Optionally, the management node 01 can be a server or a server cluster composed of multiple servers. The management node 01 may also be referred to as a metadata management server (English: metadata service; abbreviation: MDS). The storage node 02 may also be referred to as an object storage device (English: object storage device; abbreviated as: OSD). The management node 01 can establish a communication connection with the terminal 1 and the storage node 02.

FIG. 2 is a flowchart of a method for assigning a task according to an embodiment of the present disclosure. The task assignment method may be used in the management node 01 in FIG. 1. As shown in FIG. 2, the task assignment method includes:

Step 201: After receiving the storage request sent by the terminal, determine a plurality of available storage nodes in the distributed storage system.

Step 202: Acquire an allocation number of each available storage node of the plurality of available storage nodes in a preset time period, where the number of allocations of the available storage nodes is the number of times the available storage nodes are allocated storage tasks.

Step 203: When there are at least one available storage node whose allocation number is less than the allocation number threshold, the target storage node is filtered in the at least one available storage node.

Step 204: Allocate a storage task to be executed to the target storage node based on the storage request.

In summary, in the task allocation method provided by the embodiment of the present disclosure, before the storage task to be executed is allocated, the number of allocation times and the number of allocation times of each available storage node are compared to determine an available storage node with a small number of allocations. And filter the target storage nodes used to perform storage tasks among these available storage nodes. Therefore, the number of allocations of each storage node is relatively balanced, which avoids the management node allocating more storage tasks to the same storage node, and improves the load value balance degree of the distributed storage system.

FIG. 3 is a flowchart of a method for assigning another task according to an embodiment of the present disclosure. The task allocation method may be used in the distributed storage system in FIG. 1. As shown in FIG. 3, the task assignment method includes:

Step 301: The storage node sends load information to the management node. Go to step 302.

It should be noted that the load information sent by each storage node to the management node may be used to indicate the write data load value of each storage node. The load information sent by the first storage node to the management node may be used to indicate the write data load value of the first storage node, and the load information sent by the second storage node to the management node may be used to indicate the write data load value of the second storage node. Wait. It should be noted that the write data load value of the storage node is a value for reflecting the write data load of the storage node, and the write data load of the storage node is positively correlated with the write data load value of the storage node.

Optionally, each storage node in the distributed storage system may send load information to the management node every preset time period to notify the management node of the write data load value of the storage node. The management node may store the load information of each storage node, and after receiving the load information sent by the same storage node again, update the load information of the storage node.

Step 302: The terminal sends a storage request to the management node. Go to step 303.

When the user needs to control the terminal to store data in the distributed storage system, the user can operate on the terminal to trigger the terminal to send a storage request to the management node.

Step 303: The management node determines a write data load value of each storage node according to load information sent by each storage node. Go to step 304.

After receiving the storage request sent by the terminal, the management node may acquire the pre-stored load information sent by each storage node, and determine the write data load value of each storage node according to the load information sent by each storage node.

Step 304: The management node uses a plurality of storage nodes in the distributed storage system whose write data load value is less than a preset load threshold as the plurality of available storage nodes. Go to step 305.

A preset load threshold is pre-stored on the management node, and after determining the write data load value of each storage node in the distributed storage system, the management node may compare the write data load value of each storage node with the preset load threshold. And determining, by the plurality of storage nodes, a plurality of storage nodes whose write data load value is less than the preset load threshold, and using the multiple storage nodes as available storage nodes.

For example, assume that the write data load value of the first storage node is 95%, the write data load value of the second storage node is 50%, the write data load value of the third storage node is 40%, and the preset load threshold is 80%. The management node may use both the first storage node and the second storage node as available storage nodes. At this time, there are two available storage nodes in the distributed storage system.

In step 304, the management node filters out a plurality of available storage nodes in the plurality of storage nodes in the distributed storage system by using a preset load threshold, where the available storage node is a storage node with a smaller data load value. Available storage nodes can continue to be assigned storage tasks, but continuing to allocate storage tasks to non-available storage nodes can result in non-available storage nodes not functioning properly.

Step 305: The management node acquires the number of allocations of each available storage node of the plurality of available storage nodes within a preset time period. Go to step 306.

The number of allocations of available storage nodes is the number of times the available storage node is assigned a storage task.

Optionally, before step 302, the management node may record the number of times the storage node is allocated a storage task after each time a storage task is allocated to the storage node.

For example, if the management node allocates a storage task to the first storage node at the first moment before step 302, the management node may record that the number of allocations of the first storage node is 1. At this time, the management node may record that the number of allocations of the first storage node is 1, the number of allocations of the second storage node is 0, and the number of allocations of the third storage node is 0. If the management node allocates a storage task to the second storage node at the second moment, the management node may update the allocation number of the second storage node from 0 to 1. At this time, the management node may record that the number of allocations of the first storage node is 1, the number of allocations of the second storage node is 1, and the number of allocations of the third storage node is 0. It should be noted that, if the fourth storage node is newly added to the distributed storage system at the second moment, the fourth storage node is a storage node that is not assigned a storage task, and the management node may record the fourth storage node. The number of allocations is 0.

Further, the management node can also periodically clear the number of records (for example, the management node can clear the number of records every hour). The management node may acquire, in step 305, the number of allocations of each available storage node that was previously recorded, which is the number of allocations in the time period between the time of the last clearing and the current time (that is, the preset time period). .

Step 306: The management node determines an average number of allocation times of the plurality of available storage nodes according to the number of allocations of each available storage node. Go to step 307.

After obtaining the number of allocations of each available storage node, the management node may use the average of the number of allocations of the plurality of available storage nodes as the average of the number of allocations.

By way of example, assuming that a plurality of available storage nodes include n available storage nodes, the average number of allocations of the n available storage nodes is avg=(osd1+osd2+...+osdn)/n, where osd1 represents n available storage nodes. The number of allocations of the first available storage node, osd2 represents the number of allocations of the second available storage node among the n available storage nodes, and osdn represents the number of allocations of the nth available storage node among the n available storage nodes.

Step 307: The management node determines M times of the average number of allocation times as the allocation number threshold. Go to step 308.

After determining the average number of allocation times, the management node may multiply the average number of allocation times by M to obtain the allocation number threshold, M ≥ 1.

Optionally, M=1, at this time, the allocation number threshold is equal to the average number of allocation times.

Optionally, M=1.3. At this time, the allocation number threshold is 1.3 times the average value of the allocation times.

It should be noted that, in the embodiment of the present disclosure, M is equal to 1 or 1.3. Alternatively, M may be other values greater than or equal to 1. This embodiment of the present disclosure does not limit this.

Step 308: The management node determines, by the plurality of available storage nodes, whether there is at least one available storage node whose allocation number is less than the allocation number threshold. If there are at least one available storage node whose number of allocations is less than the allocation number threshold, the step 309 is performed; if there is no at least one available storage node whose allocation number is less than the allocation number threshold, the execution is performed. Step 310.

The management node may compare the number of allocations of each available storage node to the number of allocation thresholds to determine if the number of allocations per available storage node is less than the number of allocation thresholds. For example, the management node may make the number of allocations of each available storage node worse than the number of allocation thresholds. When the obtained difference is less than zero, it is determined that the number of allocations of the available storage nodes is less than the allocation number threshold.

Optionally, after determining the number of allocations of each available storage node and the average number of allocation times, the management node may not directly perform step 307 and step 308, but directly determine whether the allocated number of available storage nodes meets the preset. Condition, the preset condition may be (osdx–avg)/avg<M-1, where osdx is the number of allocations of the xth available storage node among the n available storage nodes, x≥1. If the number of allocations of a storage node satisfies the preset condition, the management node may determine that the allocation number of the storage node is less than the allocation number threshold.

Step 309: The management node filters the target storage node in the at least one available storage node. Go to step 311.

After determining that the load value is less than the preset load threshold and the number of allocations is less than the at least one available storage node, the management node may filter one storage node as the target storage node among the at least one available storage node. The manner in which the management node filters the target storage node in the at least one available storage node may be various, and the following four screening manners are exemplified in the embodiment of the present disclosure.

In the first screening mode, the management node may filter the available storage nodes with the smallest number of allocations as the target storage node among the at least one available storage node based on the number of allocations of each available storage node acquired in step 305.

In the second screening mode, the management node may filter, according to the write data load value of each available storage node determined in step 303, the available storage node with the smallest write data load value as the target storage node in the at least one available storage node. .

In a third screening mode, the management node may calculate the available data storage node based on the write data load value of each available storage node determined in step 303 and the number of allocations of each available storage node determined in step 305. Write the sum of the data load value and the number of allocations. Thereafter, the management node may filter the available storage nodes with the smallest sum of allocation times and write data load values as the target storage node among the at least one available storage node. That is, the management node can use the available storage nodes with smaller write data load values and allocation times as the target storage nodes to further improve the load balancing degree of the plurality of available storage nodes.

In the fourth screening mode, the management node may randomly filter one storage node as the target storage node among the at least one available storage node.

Step 310: The management node filters the target storage node among the plurality of available storage nodes. Go to step 311.

When there are no available storage nodes whose number of allocations is smaller than the number of allocation times in the plurality of available storage nodes in the distributed storage system, it may be indicated that the number of allocations of the plurality of available storage nodes is relatively balanced at this time, and the management node may be at the time The target storage node is filtered from the plurality of available storage nodes.

The process of filtering the target storage node in the plurality of available storage nodes may refer to the step of filtering the target storage node in the at least one available storage node in step 309, which is not described herein.

Step 311: The management node allocates a storage task to be executed to the target storage node based on the storage request.

After the target storage node is obtained, the management node may allocate a storage task to be executed to the target storage node based on the storage request sent by the terminal in step 302. The terminal may also instruct the terminal to store data through the target storage node. The terminal can then store the data in the distributed storage system through the target storage node to which the storage task is assigned.

In addition, after the management node allocates a storage task to the target storage node, the management node may increase the number of allocations of the target storage node recorded by one.

It should be noted that, in the embodiment of the present disclosure, the number of available storage nodes determined by the management node in step 304 is taken as an example. Optionally, if the number of available storage nodes determined by the management node is 1, the management node may directly use the available storage node as the target storage node, and allocate the storage task to be executed to the target storage node. If the number of available storage nodes determined by the management node is 0, it may indicate that there is no storage node in the current distributed storage system that can continue to allocate storage tasks. At this time, the management node may prohibit the continued allocation of the storage task, or the management node may select one of the current storage nodes and allocate a storage task to the storage node.

In the related art, the management node may allocate a storage task to the target storage node among the multiple storage nodes according to the storage request sent by the terminal, and instruct the terminal to store the data through the target storage node. Generally, if a distributed storage system is expanded, that is, a new storage node appears in the distributed storage system, the management node allocates more than one storage task to the newly added storage node, thereby The write data load of the newly added storage node is large, resulting in a low load balance in the entire distributed storage system.

In the embodiment of the present disclosure, regardless of whether the distributed storage system is expanded, the management node performs a reasonable allocation storage task according to the write data load value and the number of allocations of each storage node. In this way, when the newly added storage node occurs, the management node allocates multiple storage tasks to the newly added storage node, thereby improving the load balancing degree in the distributed storage system.

FIG. 4 is a schematic structural diagram of a task distribution apparatus according to an embodiment of the present disclosure. The task distribution apparatus may be used to manage a node. As shown in FIG. 4, the task distribution apparatus 40 may include:

The first determining module 401 is configured to determine, after receiving the storage request sent by the terminal, multiple available storage nodes in the distributed storage system;

The obtaining module 402 is configured to obtain an allocation number of each available storage node of the plurality of available storage nodes in a preset time period, where the number of allocations of the available storage nodes is the number of times the available storage nodes are allocated storage tasks;

The first screening module 403 is configured to filter the target storage node in the at least one available storage node when there are at least one available storage node whose allocation number is less than the allocation number threshold.

The allocating module 404 is configured to allocate a storage task to be executed to the target storage node based on the storage request.

In summary, in the task allocation apparatus provided by the embodiment of the present disclosure, before the allocating module allocates the storage task to be executed, the first screening module combines the first determining module and the obtaining module by comparing the allocation times of each available storage node with A number of allocation thresholds are determined to determine available storage nodes with a small number of allocations, and the allocation module filters the target storage nodes for performing storage tasks among the available storage nodes. Therefore, the management node is prevented from allocating more storage tasks to the same storage node, and the load value balance degree of the distributed storage system is improved.

FIG. 5 is a schematic structural diagram of another task distribution apparatus 40 according to an embodiment of the present disclosure. As shown in FIG. 5, the task distribution apparatus 40 may further include:

a second determining module 405, configured to determine an average number of allocation times of the plurality of available storage nodes according to the number of allocations of each available storage node;

The third determining module 406 is configured to determine M times of the average number of allocation times as the allocation number threshold, and M≥1.

Optional, M = 1.3.

Optionally, FIG. 6 is a schematic structural diagram of another task distribution apparatus 40 according to an embodiment of the present disclosure. As shown in FIG. 6, the task distribution apparatus 40 may further include:

The receiving module 407 is configured to receive load information sent by each storage node in the distributed storage node, where the load information sent by each storage node is used to indicate a write data load value of each storage node;

a fourth determining module 408, configured to determine, according to load information sent by each storage node, a write data load value of each storage node;

The first determining module 401 is configured to use, as an available storage node, a storage node in the distributed storage system whose write data load value is less than a preset load threshold.

Optionally, the first screening module 403 can be used to:

Filtering, at least one available storage node, the available storage node with the smallest number of allocations as the target storage node;

Or filtering the available storage node with the smallest write data load value as the target storage node in the at least one available storage node;

Or, the available storage node with the smallest sum of the allocation number and the write data load value in the at least one available storage node is the target storage node;

Alternatively, the target storage node is randomly selected in at least one of the available storage nodes.

Optionally, FIG. 7 is a schematic structural diagram of another task distribution apparatus 40 according to an embodiment of the present disclosure. As shown in FIG. 7, the task distribution apparatus 40 may further include:

The second screening module 409 is configured to filter the target storage node among the plurality of available storage nodes when there are no available storage nodes whose allocation times are less than the allocation number threshold.

Optionally, FIG. 8 is a schematic structural diagram of still another task distribution apparatus 40 according to an embodiment of the present disclosure. As shown in FIG. 8, the task distribution apparatus 40 may further include:

The fifth determining module 410 is configured to determine an average number of allocation times of the plurality of available storage nodes according to the number of allocations of each available storage node;

The sixth determining module 411 is configured to determine, when the number of allocations of the xth available storage node of the plurality of available storage nodes meets the preset condition, that the number of allocations of the xth available storage node is less than the allocation number threshold;

The preset conditions include: (osdx–avg)/avg<M-1, osdx is the number of allocations of the xth available storage node, x≥1, avg is the average of the number of allocations, and M≥1.

In summary, in the task allocation apparatus provided by the embodiment of the present disclosure, before the allocating module allocates the storage task to be executed, the first screening module combines the first determining module and the obtaining module by comparing the allocation times of each available storage node with A number of allocation thresholds are determined to determine available storage nodes with a small number of allocations, and the allocation module filters the target storage nodes for performing storage tasks among the available storage nodes. Therefore, the number of allocations of each storage node is relatively balanced, which avoids the management node allocating more storage tasks to the same storage node, and improves the load value balance degree of the distributed storage system.

An embodiment of the present disclosure provides a computer device, including a processor and a memory, wherein the memory is configured to store a computer program, and the processor is configured to execute a program stored on the memory to implement the task assignment method.

The embodiment of the present disclosure further provides a computer readable storage medium, where the computer program is stored in the storage medium, and the task assignment method is implemented when the computer program is executed by the processor.

The embodiment of the invention further provides a computer program product, when the computer program product is run on a computer, causing the computer to execute the task assignment method.

It should be noted that the embodiment of the present invention, the embodiment of the present invention, the embodiment of the present invention, and the embodiment of the present invention are not limited.

The above description is only an alternative embodiment of the present disclosure, and is not intended to limit the disclosure, and any modifications, equivalents, improvements, etc., made within the spirit and principles of the present disclosure should be included in the protection of the present disclosure. Within the scope.

Claims

A task assignment method for managing a node, the method comprising:

After receiving the storage request sent by the terminal, determining a plurality of available storage nodes in the distributed storage system;

Obtaining an allocation number of each of the plurality of available storage nodes within a preset time period, wherein the number of allocations of the available storage nodes is the number of times the available storage nodes are allocated storage tasks;

When there is at least one available storage node whose allocation number is less than the allocation number threshold, the target storage node is filtered among the at least one available storage node;

A storage task to be executed is allocated to the target storage node based on the storage request.
The method of claim 1, before the screening of the target storage node in the at least one available storage node, the method further comprising:

Determining, according to the number of allocations of each available storage node, an average number of allocation times of the plurality of available storage nodes;

M times the average value of the number of allocations is determined as the threshold number of allocation times, M ≥ 1.
The method of claim 2, M = 1.3.
The method according to any one of claims 1 to 3, further comprising:

Receiving load information sent by each storage node in the distributed storage node, where the load information sent by each storage node is used to indicate a write data load value of each storage node;

Determining, according to the load information sent by each storage node, a write data load value of each storage node;

The determining a plurality of available storage nodes in the distributed storage system includes:

A storage node whose write data load value is smaller than a preset load threshold in the distributed storage system is used as the available storage node.
The method of claim 4, screening the target storage node in the at least one available storage node, comprising:

Filtering, in the at least one available storage node, an available storage node with the smallest number of allocations as the target storage node;

Or filtering, in the at least one available storage node, an available storage node with the smallest write data load value as the target storage node;

Or the available storage node with the smallest sum of allocation times and write data load values among the at least one available storage node is the target storage node;

Alternatively, the target storage node is randomly selected among the at least one available storage node.
The method according to any one of claims 1 to 3, further comprising:

When there is no available storage node whose allocation number is less than the allocation number threshold among the plurality of available storage nodes, the target storage node is screened among the plurality of available storage nodes.
The method of claim 1, before the screening of the target storage node in the at least one available storage node, the method further comprising:

Determining, according to the number of allocations of each available storage node, an average number of allocation times of the plurality of available storage nodes;

Determining, when the number of allocations of the xth available storage node of the plurality of available storage nodes meets a preset condition, determining that the number of allocations of the xth available storage node is less than the threshold of the number of allocations;

The preset condition includes: (osdx avg)/avg<M-1, osdx is the number of allocations of the xth available storage node, x≥1, avg is the average of the allocation times, M≥1 .
A task assignment device for managing a node, the task assignment device comprising:

a first determining module, configured to determine, after receiving the storage request sent by the terminal, multiple available storage nodes in the distributed storage system;

An obtaining module, configured to acquire an allocation number of each of the plurality of available storage nodes in a preset time period, where the number of allocations of the available storage nodes is the number of times the available storage nodes are allocated storage tasks;

a first screening module, configured to filter a target storage node among the at least one available storage node when there is at least one available storage node whose number of allocations is less than an allocation number threshold;

And an allocating module, configured to allocate, to the target storage node, a storage task to be executed based on the storage request.
The task assigning device according to claim 8, wherein the task assigning device further comprises:

a second determining module, configured to determine an average number of allocation times of the plurality of available storage nodes according to the number of allocations of each available storage node;

a third determining module, configured to determine M times the average value of the number of allocation times as the threshold number of allocation times, M≥1.
The task distribution device according to claim 9, M = 1.3.
The task distribution device according to any one of claims 8 to 10, further comprising:

a receiving module, configured to receive load information sent by each storage node in the distributed storage node, where the load information sent by each storage node is used to indicate a write data load value of each storage node;

a fourth determining module, configured to determine, according to the load information sent by each storage node, a write data load value of each storage node;

The first determining module is configured to use, as the available storage node, a storage node in the distributed storage system whose write data load value is less than a preset load threshold.
The task distribution device according to claim 11, wherein the first screening module is configured to:

Filtering, in the at least one available storage node, an available storage node with the smallest number of allocations as the target storage node;

Or filtering, in the at least one available storage node, an available storage node with the smallest write data load value as the target storage node;

Or the available storage node with the smallest sum of allocation times and write data load values among the at least one available storage node is the target storage node;

Alternatively, the target storage node is randomly selected among the at least one available storage node.
The task distribution device according to any one of claims 8 to 10, further comprising:

And a second screening module, configured to filter the target storage node among the plurality of available storage nodes when there is no available storage node whose allocation number is less than the allocation number threshold.
The task assigning device according to claim 8, wherein the task assigning device further comprises:

a fifth determining module, configured to determine an average value of allocation times of the plurality of available storage nodes according to the number of allocations of each available storage node;

a sixth determining module, configured to determine, when the number of allocations of the xth available storage node of the plurality of available storage nodes meets a preset condition, that the number of allocations of the xth available storage node is less than the threshold of the number of allocations;

The preset condition includes: (osdx avg)/avg<M-1, osdx is the number of allocations of the xth available storage node, x≥1, avg is the average of the allocation times, M≥1 .
A distributed storage system comprising a management node and a plurality of storage nodes, the management node comprising the task allocation device of any one of claims 8 to 14.
A computer device comprising a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface, the memory complete communication with each other through the bus; the memory for storing the computer program; and the processor for executing the memory The stored program implements the task assignment method of any one of claims 1 to 7.
A distributed storage system comprising a management node and a plurality of storage nodes, the management node comprising the computer device of claim 14.
A computer readable storage medium having stored therein a computer program, the computer program being executed by a processor to implement the task assignment method of any one of claims 1 to 7.
A computer readable program product, when the computer program product is run on a computer, causing the computer to perform the task assignment method of any one of claims 1 to 7.