WO2018076954A1

WO2018076954A1 - Data storage method, apparatus and system

Info

Publication number: WO2018076954A1
Application number: PCT/CN2017/101847
Authority: WO
Inventors: 陈伟; 林起芊; 汪渭春
Original assignee: 杭州海康威视数字技术股份有限公司
Priority date: 2016-10-31
Filing date: 2017-09-15
Publication date: 2018-05-03
Also published as: CN108008909B; CN108008909A

Abstract

A data storage method, apparatus and system, relating to the field of computer technology. The data storage method is applied to a main storage server in a data storage system, and the data storage system comprises a management server and a storage server. The method comprises: receiving a first data block to be stored to a first stripe (S301); sending a storage address acquisition request for the first data block to a management server, acquiring a first storage address determined by the management server according to a stripe storage mechanism, and storing the first data block to the first storage address (S302); determining whether the first data block is the last data block in the first stripe (S303); if yes, calculating a first parity block in the first stripe according to all data blocks that have been successfully stored in the first stripe (S304); and sending a storage address acquisition request for the first parity block to the management server, acquiring a second storage address determined by the management server according to the stripe storage mechanism, and storing the first parity block to the second storage address (S305). Applying said method may to the greatest extent avoid inconsistent data blocks and parity blocks.

Description

Data storage method, device and system

The present application claims priority to Chinese Patent Application No. 201610930966.4, entitled "A Data Storage Method, Apparatus and System", filed on October 31, 2016, the entire contents of which is incorporated herein by reference. In the application.

Technical field

The present application relates to the field of computer technologies, and in particular, to a data storage method, apparatus, and system.

Background technique

With the development of computer technology, the amount of data that needs to be stored has grown geometrically. In order to improve the storage performance during data storage, the current storage mode is RAID 5 and RAID 6 in the RAID (Redundant Array of Independent Disks) mode. Among them, RAID5 is a mode in which block cross-access and check information are evenly distributed. The RAID 5 read and write operations are based on strips. The strips are divided into multiple storage units, which are used to store data blocks and check blocks. Figure 1a is a schematic structural view of a strip, wherein the strip includes n data blocks (D1, D2, ..., Dn) and m check blocks (P1, P2, ..., Pm), each data block And the check blocks are distributed on different disks. In a distributed storage system, disks can be on different servers. As an example, when n takes 3, m takes 1 , the strip corresponds to 4 servers, and FIG. 1b shows a schematic diagram of the logical relationship between the strip and the server in this example. Among them, there are 4 independent servers, each of which stores 3 data blocks and 1 check block. The horizontal 3 data blocks and 1 check block in Fig. 1b form a strip. Table 1 is The composition of each specific strip. Thus, the data blocks and check blocks in each stripe are located on different servers.

Table 1

In a stripe, the check block is calculated based on the data in the data block, that is, the data blocks D1 to Dn and the check block P satisfy the following relationship: D1 xor D2 xor...Dn xor P=0. Where xor is the XOR operator. When the data block is updated, the corresponding check block is also recalculated and updated. Generally, when a data block and a check block conform to the above relationship, there is consistency between the data block and the check block. When there is consistency between the data block and the check block, any data block or check block of not less than n is taken from any of them, and other data blocks or check blocks can be obtained according to the above relationship. That is, when a server fails, the data on that server can be recovered from the data on other servers.

In the related art, the method of storing data is usually a full strip write to a disk in the server, that is, a check block is obtained according to the data block, and then the data block and the check block in the stripe are simultaneously written to the disk. However, in the process of simultaneously writing data blocks and parity blocks to the disk, if the system suddenly encounters a power outage, the stripe data may not be completely written successfully. After the system is restarted, the data in the stripe may be incomplete, and the valid data in the data block and the data in the check block may be inconsistent.

At this point, if a disk fails, it will be wrong to recover the data recovered from the data blocks and check blocks on the non-failed disk. This phenomenon is also known as the Write Hole phenomenon.

Summary of the invention

The purpose of the embodiments of the present application is to provide a data storage method, apparatus, and system to avoid the problem of inconsistency between data blocks and check blocks as much as possible.

In order to achieve the above objective, the embodiment of the present application discloses a data storage method, which is applied to a primary storage server in a data storage system, where the data storage system includes: a management server and a storage server; and the storage server includes: a storage server and a non-primary storage server; the primary storage server is any one of the storage servers; the method includes:

Receiving a first data block to be stored to the first stripe;

Sending, to the management server, a storage address obtaining request for the first data block, and obtaining a first storage address determined by the management server according to a stripe storage mechanism, storing the first data block to the first Storage address

When it is determined that the first data block is successfully stored, determining whether the first data block is the last data block in the first stripe;

If yes, calculating a first check block in the first strip according to all data blocks in the first strip that have been successfully stored;

Sending a storage address obtaining request for the first check block to the management server, and obtaining a second storage address determined by the management server according to a stripe storage mechanism, storing the first check block to the The second storage address.

Optionally, after the storing the first data block to the first storage address, the method further includes:

Deleting the stored data of the first data block when the first data block is not successfully stored, and performing the first data according to all data blocks that have been successfully stored in the first stripe The step of the first check block in the band.

Optionally, after the storing the first check block to the second storage address, the method further includes:

Determining whether the first check block is successfully stored;

If not, returning to performing the step of calculating the first check block in the first strip according to all data blocks that have been successfully stored in the first strip.

Optionally, when it is determined that the first data block is not the last data block in the first strip, the method further includes:

Detecting whether a second data block to be stored to the first stripe is received within a preset time period;

If not received, calculating a second check block in the first strip according to all data blocks in the first strip that have been successfully stored;

Sending a storage address obtaining request for the second check block to the management server, and obtaining a third storage address determined by the management server according to the stripe storage mechanism, storing the second check block to the The third storage address.

Optionally, after the storage unit for storing the data block in the first strip is not full, after the storing the second check block to the third storage address, the method further includes:

Receiving the second data block;

Sending a storage address obtaining request for the second data block to the management server, and obtaining a fourth storage address determined by the management server according to the stripe storage mechanism, and storing the second data block to the fourth Storage address

When it is determined that the storing of the second data block is successful, determining whether the second data block is the last data block in the first stripe;

If yes, calculating a third parity block in the first strip according to all data blocks in the first strip that have been successfully stored;

Updating the second parity block to the third parity block.

Optionally, after the storing the second data block to the fourth storage address, the method further includes:

When the second data block is the first data block received after storing the second parity block, and the second data block is not successfully stored, the stored data of the second data block is deleted.

When the second data block is not the first data block received after storing the second parity block, and the second data block is not successfully stored, deleting the stored data of the second data block, And performing the step of calculating a third parity block in the first strip according to all data blocks that have been successfully stored in the first strip.

Optionally, the data in the first data block is from a file.

In order to achieve the above objective, the embodiment of the present application discloses a data storage device, which is applied to a primary storage server in a data storage system, where the data storage system includes: a management server and a storage server; and the storage server includes: a storage server and a non-primary storage server; the primary storage server is any one of the storage servers; the device includes:

a first receiving module, configured to receive a first data block to be stored to the first stripe;

a first storage module, configured to send, to the management server, a storage address obtaining request for the first data block, and obtain a first storage address determined by the management server according to a stripe storage mechanism, and use the first data The block is stored to the first storage address;

a first determining module, configured to determine, when the first data block is successfully stored, whether the first data block is the last data block in the first stripe;

a first calculating module, configured to: when the determination result of the first determining module is YES, calculate a first check in the first strip according to all data blocks that have been successfully stored in the first stripe Piece;

a second storage module, configured to send a storage address obtaining request for the first check block to the management server, and obtain a second storage address determined by the management server according to a stripe storage mechanism, where the first A parity block is stored to the second storage address.

Optionally, the device further includes:

a first deleting module, configured to delete the stored data of the first data block when the first data block is not stored successfully after storing the first data block to the first storage address, and Executing the first computing module.

Optionally, the device further includes:

a second determining module, configured to determine whether the first check block is successfully stored after storing the first check block to the second storage address, and if not, returning to execute the first calculating module .

Optionally, after the first determining module, the device further includes:

a detecting module, configured to detect, when the first data block is not the last data block in the first strip, whether to receive the second data block to be stored in the first stripe in a preset time period ;

a second calculating module, configured to: when the detection result of the detecting module is negative, calculate a second parity block in the first strip according to all data blocks that have been successfully stored in the first stripe;

a third storage module, configured to send a storage address obtaining request for the second check block to the management server, and obtain a third storage address determined by the management server according to a stripe storage mechanism, and the second storage The check block is stored to the third storage address.

Optionally, the device further includes:

a second receiving module, when the storage unit for storing the data block in the first strip is not full, after receiving the second parity block to the third storage address, receiving the first Two data blocks;

a fourth storage module, configured to send, to the management server, a storage address obtaining request for the second data block, and obtain a fourth storage address determined by the management server according to a stripe storage mechanism, and the second data is The block is stored to the fourth storage address;

a third determining module, configured to determine, when the second data block is successfully stored, whether the second data block is the last data block in the first stripe;

a third calculating module, configured to: when the determination result of the third determining module is YES, calculate a third check in the first strip according to all data blocks that have been successfully stored in the first stripe Piece;

And an update module, configured to update the second check block to the third check block.

Optionally, the device further includes:

a second deleting module, configured to: after storing the second data block to the fourth storage address, when the second data block is the first data block received after storing the second parity block And storing the stored data of the second data block when the second data block is not successfully stored.

Optionally, the device further includes:

a third deleting module, configured to: after storing the second data block to the fourth storage address, when the second data block is not the first data block received after storing the second parity block And if the second data block is not successfully stored, the stored data of the second data block is deleted, and the third computing module is executed.

In order to achieve the above object, the present application discloses a data storage system including: a management server and a storage server; the storage server includes: a primary storage server and a non-primary storage server, wherein the primary storage server is the storage server Any of them;

The primary storage server is configured to receive a first data block to be stored to the first strip, and send a storage address obtaining request for the first data block to the management server;

The management server is configured to receive a storage address obtaining request for the first data block sent by the primary storage server, determine a first storage address according to a stripe storage mechanism, and send the first storage address to the Said primary storage server;

The primary storage server is configured to receive the first storage address sent by the management server, store the first data block to the first storage address, and when determining that the first data block is successfully stored, Determining whether the first data block is the last data block in the first strip, and if so, calculating the first strip according to all data blocks that have been successfully stored in the first strip a first parity block; sending a storage address obtaining request for the first parity block to the management server;

The management server is configured to receive a storage address obtaining request for the first check block sent by the primary storage server, determine a second storage address according to a stripe storage mechanism, and send the second storage address to The primary storage server;

The primary storage server is configured to receive the second storage address sent by the management server, and store the first parity block to the second storage address.

Optionally, the management server is further configured to: when it is detected that the first data block is not successfully stored, and when detecting that an abnormality occurs in the primary storage server, deleting the stored data of the first data block, Selecting a new primary storage server from the non-primary storage server, switching the primary storage server to the new primary storage server, and transmitting a calculation instruction for the first parity block to the primary storage server The calculation instruction carries a storage address of all data blocks that have been successfully stored in the first stripe;

The primary storage server is configured to receive the calculation instruction sent by the management server, and obtain a data block according to the storage address carried in the calculation instruction, and calculate the first strip according to the obtained data block. The first check block in .

In order to achieve the above objective, the embodiment of the present application discloses a primary storage server in a data storage system, where the data storage system includes: a management server and a storage server; the storage server includes: a primary storage server and a non-primary storage server; The primary storage server is any one of the storage servers; the primary storage server includes:

a housing, a processor, a memory, a circuit board, and a power supply circuit, wherein the circuit board is disposed inside the space enclosed by the housing, the processor and the memory are disposed on the circuit board; and the power circuit is configured to Each circuit or device of the primary storage server is powered; the memory is for storing executable program code; the processor runs the program corresponding to the executable program code by reading executable program code stored in the memory for performing the following steps:

Receiving a first data block to be stored to the first stripe;

In order to achieve the above object, the embodiment of the present application discloses a storage medium for storing executable code, which is used to implement the data storage method provided by the embodiment of the present application. The data storage method includes:

Receiving a first data block to be stored to the first stripe;

As shown in the foregoing technical solution, in the embodiment of the present application, the primary storage server as the execution entity requests the first storage address of the first data block from the management server when receiving the first data block to be stored in the first stripe. Saving the first data block to the first storage location after obtaining the first storage address site. When it is determined that the first data block is successfully stored, it is determined whether the first data block is the last data block in the first strip, and if so, the first data is calculated according to all the data blocks that have been successfully stored in the first strip. The first check block in the strip. Then, the second storage address of the first parity block is requested from the management server, and the first parity block is stored to the second storage address after the second storage address is obtained.

That is to say, in the embodiment of the present application, the data block is stored first, and when all the data blocks in the stripe are successfully stored, the check block is calculated according to the data block stored in the stripe, and the check block is stored. In the related art, the check block is first calculated according to the data block, and in the case where both the data block and the check block in the strip are available, the data block and the check block are simultaneously stored. If a power failure occurs during the storage process, both the data block and the check block may be unsuccessful in storage. In this case, the data block and the check block are inconsistent, and a Write Hole problem occurs. Applying the solution of the embodiment of the present application, if the data blocks in the first strip are successfully stored, the check block is calculated and stored, and even if a power failure occurs during the storage process, the data block and the data block can be avoided as much as possible. The check block is inconsistent.

DRAWINGS

In order to more clearly illustrate the technical solutions in the embodiments of the present application or the related art, the drawings to be used in the embodiments or the related art description will be briefly described below. Obviously, the drawings in the following description are only some of the embodiments of the present application, and those skilled in the art can obtain other drawings according to the drawings without any creative work.

Figure 1a is a schematic structural view of a strip;

Figure 1b is a schematic diagram of the logical relationship between a stripe and a server;

FIG. 2 is a schematic structural diagram of a data storage system according to an embodiment of the present disclosure;

FIG. 3 is a schematic flowchart of a data storage method according to an embodiment of the present application;

4 is another schematic flowchart of a data storage method according to an embodiment of the present application;

Figure 5a is a schematic structural diagram of a strip after data has been stored;

FIG. 5b is another schematic structural diagram of a strip after data has been stored;

FIG. 5c is a schematic structural diagram of another strip after the data has been stored;

FIG. 6 is a schematic structural diagram of a data storage device according to an embodiment of the present disclosure;

FIG. 7 is another schematic structural diagram of a data storage device according to an embodiment of the present application;

FIG. 8 is a schematic structural diagram of a data storage system according to an embodiment of the present application.

detailed description

The technical solutions in the embodiments of the present application are clearly and completely described in the following with reference to the accompanying drawings in the embodiments. It is apparent that the described embodiments are only a part of the embodiments of the present application, and not all of them. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments of the present application without departing from the inventive scope are the scope of the present application.

The embodiment of the present application provides a data storage method, device, and system, which can avoid the problem of inconsistency between a data block and a check block as much as possible. The application can be applied to a primary storage server in a data storage system. The data storage system can include a management server and a storage server. The storage server may in turn include a primary storage server and a non-primary storage server, and the primary storage server may be any one of the storage servers.

FIG. 2 is a schematic structural diagram of a data storage system according to an embodiment of the present application. Such a data storage system can also be referred to as a distributed storage system. The system can include a management server 21, a storage server 22, and a client 23. The management server 21 (Master Data Services, MDS) is also referred to as a metadata server for organizing and managing storage space information in the storage server 22. The storage server 22, which is also referred to as an object server, a storage node, and the like, can receive data to be stored by the client 23 and issue storage tasks to itself and other storage servers, and undertake partial computing tasks. The client 23 is configured to send data to be stored to the storage server.

The present application will be described in detail below through specific embodiments.

FIG. 3 is a schematic flowchart of a data storage method according to an embodiment of the present disclosure, which is applied to a primary storage server in a data storage system. The data storage system includes: a management server and a storage server. Storage servers include: primary storage servers and non-primary storage servers. The primary storage server is any one of the storage servers. Specifically, the method includes the following steps:

Step S301: Receive a first data block to be stored to the first strip. The number of the first data blocks is one.

The first data block received by the primary storage server may be the first data block of the first stripe or the last data block of the first stripe.

When the first data block is the first data block of the first stripe, the primary storage server as the execution body does not know which strip the first stripe is. At this time, the primary storage server may send a stripe obtaining request to the management server, and after receiving the stripe obtaining request sent by the primary storage server, the management server determines the first strip according to the strip allocation mechanism, and sends the first strip to the Primary storage server The storage server receives and records the first strip. The management server determines the first strip, which may include determining the identity of the first strip.

The foregoing strip allocation mechanism can be understood as a stripe allocation rule, which can adopt a stripe allocation rule in the related art, which is not described in detail in this embodiment. In addition, the stripe obtains a format of the stripe to be acquired in the request, the format may include a first quantity of the storage unit for storing the data block in the stripe, and a second quantity of the storage unit for storing the check block. Quantity.

For example, the stripe to be acquired by the main storage server as the execution subject includes four storage units that store data blocks and one storage unit that stores check blocks.

When the first data block is not the first data block of the first stripe, the main storage server as the execution body has determined which stripe the first stripe is. Specifically, when the first data block is not the first data block of the first strip, the primary storage server may determine, according to the saved label of the first strip, the first strip corresponding to the first data block. The mark of the first strip may be that when the first data block is the first data block of the first strip, the primary storage server saves after receiving the first strip determined by the management server.

It should be noted that when the client sends the file to be stored to the primary storage server, the primary storage server may divide the file data according to the size of each storage unit for storing the data block in the strip stored by itself. Get multiple blocks of data one by one.

For example, the size of the file A to be stored is 1.6 MB, and the size of each storage unit for storing data blocks in the strip is 1 MB, then the primary storage server can divide the file A into 2 data blocks, one is 1 MB. One is 0.6MB. The first data block received in step S301 may be the first data block or the second data block.

Step S302: Send a storage address obtaining request for the first data block to the management server, and obtain a first storage address determined by the management server according to the stripe storage mechanism, and store the first data block to the first storage address.

The stripe storage mechanism can also be understood as a stripe storage rule, which includes a storage address allocation rule of each data block in the stripe and each check block. The stripe storage mechanism in this embodiment may adopt a storage mechanism in the related art, which is not detailed in this embodiment.

Specifically, when the first data block is the first data block in the first strip, the primary storage server as the execution entity may simultaneously send a stripe obtaining request for the first data block to the management server and for the first The storage address of the data block obtains the request, and may also send a stripe obtaining request for the first data block and a storage address obtaining request for the first data block to the management server.

The first storage address determined by the management server for storing the first data block may include: a first storage server for storing the first data block and a disk therein. The first storage server can be any of all storage servers in the data storage system, including the primary storage server itself. That is, the first storage address may be located on the primary storage server itself or on other storage servers in the data storage system.

When the first storage address is located in the primary storage server itself, storing the first data block to the first storage address may include: the primary storage server directly storing the first data block to the first storage address.

When the first storage address is located on another storage server in the data storage system, storing the first data block to the first storage address may include: the primary storage server sending the first data block to the other storage server, to Causes the other storage server to store the first data block to the first storage address.

Step S303: When it is determined that the first data block is successfully stored, it is determined whether the first data block is the last data block in the first strip, and if yes, step S304 is performed.

Specifically, the step may include: determining whether the first data block has been successfully stored, and if yes, determining whether the first data block is the last data block in the first strip.

When determining whether the first data block has been successfully stored, in order to improve the accuracy of the determination result, the primary storage server may divide the file to be stored into data blocks according to the manner in which one data block corresponds to the same file. That is, the data in the first data block comes from a file. When the size of a file is smaller than the size of the storage unit in the strip for storing data, the file is stored as a block of data, and the data of other files is no longer filled in the block. In this way, the following situation can be avoided: when the data of one data block comes from at least two files, if the data storage of one file is successful, the data storage of the other file fails, and finally it may be impossible to determine whether the data block is successfully stored.

Determining whether the first data block has been successfully stored may include the following implementation manners:

When the first storage address is located on the primary storage server itself, the primary storage server may directly determine whether the first data block has been successfully stored.

When the first storage address is located on another storage server in the data storage system, the primary storage server may detect whether the first data block storage success confirmation message sent by the other storage server is received within the preset time period, and if received, Then it is determined that the first data block has been successfully stored.

Determining whether the first data block is the last data block in the first strip may include: the number of data blocks stored in the first strip according to the first storage server and the first strip in the first strip A total number of storage units for storing data blocks, and determining whether the first data block is the last data block in the first strip.

When it is determined that the first data block is not the last data block in the first strip, when the first data block has been successfully stored, the primary storage server may continue to receive the next first data to be stored to the first strip. Blocking, sending a storage address obtaining request for the next first data block to the management server, and obtaining a next first storage address determined by the management server according to the stripe storage mechanism, storing the next first data block to the next A first storage address. Until the storage unit for storing the data block in the first strip is full of data, then step S304 is performed.

That is to say, each data block in the first strip is stored sequentially, and after the first data block is successfully stored, the second data block is continued to be stored until the last data in the first strip. The block is stored successfully before the check block is calculated and stored.

It can be understood that, for the data block stored in the manner of the embodiment, when the last data block in the first strip is successfully stored, all the data blocks in the first strip are stored successfully.

Step S304: Calculate the first check block in the first strip according to all the data blocks that have been successfully stored in the first strip.

Specifically, since each data block in the strip is stored on a different storage server, the first check block in the first strip is calculated according to all the data blocks that have been successfully stored in the first strip. Can include the following implementations:

When the primary storage server caches all the data blocks that have been successfully stored in the first strip, the primary storage server obtains all the data blocks that have been successfully stored in the first strip of the cache, and calculates the first strip according to the obtained data blocks. The first check block in .

When the primary storage server does not cache all the data blocks that have been successfully stored in the first strip, the primary storage server sends the first strip data block obtaining request to each of the first storage servers, where the first storage server is the storage first. A server that strips data blocks. The primary storage server obtains the data block in the first strip sent by each first storage server, and calculates the first check block in the first strip according to the obtained data block.

It should be noted that the method for calculating the check block according to the data block may adopt a corresponding method in the related art, and the specific process is not detailed herein.

Step S305: Send a storage address obtaining request for the first check block to the management server, and obtain a second storage address determined by the management server according to the stripe storage mechanism, and store the first check block to the second storage address.

It should be noted that the step S305 is substantially similar to the step S302. Therefore, the related content in step S302 can be referred to in step S305, and the specific process is not described in detail.

As can be seen from the above, in the embodiment, when the primary storage server that is the execution entity receives the first data block to be stored in the first strip, the first storage address of the first data block is requested from the management server. The first data block is stored to the first storage address after the first storage address. When it is determined that the first data block is successfully stored, it is determined whether the first data block is the last data block in the first strip, and if so, the first data is calculated according to all the data blocks that have been successfully stored in the first strip. The first check block in the strip. Then, the second storage address of the first parity block is requested from the management server, and the first parity block is stored to the second storage address after the second storage address is obtained.

As a specific implementation manner, in the embodiment shown in FIG. 3, in order to further ensure the consistency of the data block and the check block, after step S302, that is, after storing the first data block to the first storage address, When the first data block is not successfully stored, the method may further include:

The stored data of the first data block is deleted, and step S304 is performed, that is, the step of calculating the first parity block in the first strip according to all the data blocks that have been successfully stored in the first stripe is performed.

It should be noted that the first data block is not stored successfully, and the data of the first data block may only be stored in one part, and the other part is not stored successfully; or all the data of the first data block may be stored, but part of the data is stored. An error occurred.

Specifically, when the first data block is not successfully stored, deleting the stored data of the first data block may include the following implementation manners:

When the first storage address is located in the primary storage server itself, that is, when the first data block is stored in the primary storage server itself, the primary storage server may directly delete the stored data of the first data block.

When the first storage address is located on another storage server in the data storage system, that is, when the first data block is stored in the first storage server, the primary storage server may send the first storage server to the first storage server. The delete instruction of the first data block is deleted, and the first storage server deletes the stored data of the first data block after receiving the delete instruction sent by the primary storage server. The first storage server is a server that stores the first data block.

Of course, the step of deleting the stored data of the first data block can also be performed by the management server. That is, the management server may determine whether the confirmation information that the first data block is successfully stored by the first storage server is received within the preset time period, and if not received, determining that the first data block is not successfully stored, to the first storage server. Sending a delete instruction for deleting the first data block, the first storage server deleting the stored data of the first data block after receiving the delete instruction sent by the management server. The first storage server is a server that stores the first data block. In this embodiment, the first storage server may be a primary storage server or a non-primary storage server.

It should be noted that, when the first data block is the first data block in the first strip, after the stored data of the first data block is deleted, there is no data block that has been successfully stored in the first strip. There is no need to perform the step of calculating the first parity block. When the first data block is not the first data block in the first strip, after the stored data of the first data block is deleted, the data block that has been successfully stored in the first stripe may continue to perform the calculation. A step of a check block.

It can be seen that, in this implementation manner, when a certain data block in the first strip is not successfully stored, the stored data of the data block is deleted, and the check is calculated according to all the data blocks that have been successfully stored in the first strip. Block and store the check block. In this way, it is possible to prevent the data block that has not been successfully stored from contaminating the stripe, and further ensure the consistency between the data block and the check block in the stripe.

As a specific implementation manner, in the embodiment shown in FIG. 3, in order to further ensure the consistency of the data block and the check block, after step S305, that is, after storing the first parity block to the second storage address The method may further include:

It is judged whether the first check block is successfully stored, and if not, the process returns to step S304; if so, it may not be processed.

Specifically, determining whether the first check block is successfully stored may include the following implementation manners:

When the second storage address is located on the primary storage server itself, the primary storage server may directly determine whether the first verification block has been successfully stored.

When the second storage address is located on another storage server in the data storage system, the primary storage server may detect whether the confirmation information that the first check block is successfully stored by the other storage server is received within the preset time period, if received Then, it is determined that the first check block has been successfully stored.

When the first parity block is not stored successfully, the primary storage server is again stored according to the first strip. All the data blocks that are successful, calculate the first check block in the first stripe; resend the storage address obtaining request for the first check block to the management server, and regain the second determined by the management server according to the stripe storage mechanism The address is stored, and the first check block is stored to the second storage address.

It should be noted that the first check block is not stored successfully, which may be because the storage server storing the first check block is abnormal, so the storage address of the first check block needs to be re-acquired.

Certainly, when it is determined that the first check block is not successfully stored, the stored data of the first check block may also be deleted to save storage space.

In another embodiment of the present application, on the basis of the embodiment shown in FIG. 3, when the storage unit for storing the data block in the first strip is not full, if other file data is not received for a long time, In order to ensure the security of the data, in this case, the check block is still calculated and stored. Therefore, when the result of the determination in step S303 is NO, the method may further include the steps as shown in FIG. 4:

Step S306: When the first data block is not the last data block in the first strip, detecting whether the second data block to be stored to the first stripe is received within the preset time period, if not, executing Step S307.

It should be noted that, if the primary storage server does not receive the second data block to be stored in the first stripe within the preset time period, in order to prevent the first strip from being in a writable state for a long time, the check block cannot be calculated. The check block can be calculated and stored when the first strip is not full. In this way, the management server can temporarily set the state of the first stripe to be unwritable when it detects that the check block storage is successful.

Step S307: Calculate a second check block in the first strip according to all data blocks that have been successfully stored in the first strip.

Step S308: Send a storage address obtaining request for the second check block to the management server, and obtain a third storage address determined by the management server according to the stripe storage mechanism, and store the second check block to the third storage address.

It should be noted that steps S307 and S308 in the embodiment shown in FIG. 4 are similar to steps S304 and S305 in the embodiment shown in FIG. 3, respectively. Therefore, reference may be made to the related description in the embodiment shown in FIG.

It can be seen that, in this embodiment, when the storage unit for storing the data block in the first strip is not full, if the primary storage server does not receive the new data to be stored in the first stripe within the preset time period Block, the calculation block is directly calculated and stored, so that the strip can be prevented from being written for a long time, and the security of the stored data in the strip is further ensured.

As a specific implementation manner, in the embodiment shown in FIG. 4, when used in the first strip When the storage unit of the storage block is not full, after storing the second parity block to the third storage address, if the second data block is received, the second data block may be further stored to the first strip. Therefore, the method may further include:

Step 1: Receive the second data block.

Step 2: Send a storage address obtaining request for the second data block to the management server, and obtain a fourth storage address determined by the management server according to the stripe storage mechanism, and store the second data block to the fourth storage address.

Step 3: When it is determined that the second data block is successfully stored, it is determined whether the second data block is the last data block in the first strip, and if yes, step 4 is performed.

Step 4: Calculate the third check block in the first strip according to all the data blocks that have been successfully stored in the first strip.

Step 5: Update the second parity block to the third parity block.

The above process will be described in detail below with a specific example.

In the strip A shown in FIG. 5a, four memory cells for storing data blocks and one memory cell for storing parity blocks are included. It is known that the data block D1, the data block D2, and the check block P are stored in the strip A. When receiving the data block D3 to be stored in the strip A, the storage address obtaining request of the data block D3 is sent to the management server, and the storage address determined by the management server according to the stripe storage mechanism is obtained, and the data block D3 is stored to The storage address.

When it is determined that the data block D3 is successfully stored, if it is determined that the data block D3 is not the last data block in the strip A, the data block D4 is further sent to the management server for the received data block D4 to be stored to the strip A. The storage address obtains the request, and obtains the storage address determined by the management server according to the stripe storage mechanism, and stores the data block D4 to the storage address.

When it is determined that the data block D4 is successfully stored, it is judged that the data block D4 is the last data block in the strip A. At this time, the parity block P' in the strip A is calculated based on the data blocks D1 to D4 that have been successfully stored in the strip A, and the parity block P is updated to P'. At this time, the strip A becomes the form shown in Fig. 5b, which includes the data blocks D1 to D4 and the check block P'.

It can be seen that, in this embodiment, in a case where the storage unit for storing the data block in the strip is not full, after the check block has been stored, the primary storage server receives the data to be stored to the strip again. When the block is stored, these data blocks are stored. When the storage unit for storing the data block in the strip is full, and the last data block is also successfully stored, the check block is recalculated and updated according to the data block in the strip.

As a specific implementation manner, in the embodiment shown in FIG. 4, in order to further ensure the consistency of the data block and the check block, after the above step 2, that is, after storing the second data block to the fourth storage address The method may further include:

When the second data block is the first data block received after storing the second parity block, and the second data block is not stored successfully, the stored data of the second data block is deleted.

The strips shown in Figures 5a and 5b are still taken as an example for illustration. The data blocks D1 and D2 and the check block P have been stored in the strip A shown in FIG. 5a. When the data block D3 is received, the data block D3 is the one to be stored to the strip A after the check block P is stored. The first data block, if the data block D3 is abnormal in the storage process, and the storage is not successful, the stored data of the D3 can be directly deleted, so that the consistency of the data block and the check block in the strip A can be ensured. That is, after the data block D3 is directly deleted, the strip A is restored to the form of FIG. 5a, and is retracted to the version when the data block D3 is not written.

As a specific implementation manner, in the embodiment shown in FIG. 4, in order to further ensure the consistency of the data block and the check block, after the step 2 is performed, after storing the second data block to the fourth storage address, The method may further include:

When the second data block is not the first data block received after storing the second parity block, and the second data block is not stored successfully, the stored data of the second data block is deleted, and the execution is performed according to the first All the data blocks that have been successfully stored in the stripe are calculated, and the step of calculating the third check block in the first stripe is returned to step 4.

The strips shown in Figures 5a and 5b are still taken as an example for illustration. The data blocks D1 and D2 and the check block P are already stored in the strip A shown in FIG. 5a. When the data block D3 is received, it can be determined that the data block D3 is received after the check block P is stored. The first data block of strip A. When the data block D3 is successfully stored, the data block D4 is continuously stored, and the data block D4 is not the first data block to be stored to the strip A received after the check block P is stored. When the data block D4 is not successfully stored, the primary storage server deletes the data block D4 and calculates the check block P〞 according to the successfully stored D1, D2, and D3 in the strip A, and updates the check block P to Check block P〞. At this time, the strip A becomes the form shown in Fig. 5c, which includes the data blocks D1, D2, D3 and the check block P〞.

In this embodiment, the successfully stored data block D3 has changed the consistency of the data block and the check block in the strip A. Therefore, the check block should be recalculated and updated to ensure the data block and the check block. consistency.

As a specific implementation manner, in the embodiment shown in FIG. 4, in order to further ensure the consistency of the data block and the check block, the method may further include:

Determining whether the third check block is successfully updated, if not, returning to perform the step of calculating the third check block in the first strip according to all the data blocks that have been successfully stored in the first strip, that is, returning to step 4 .

The strips shown in Figures 5a and 5b are still taken as an example for illustration. The data blocks D1 and D2 and the check block P have been stored in the strip A shown in FIG. 5a, the data blocks D3 and D4 are added to the strip A shown in FIG. 5b, and the check block P is updated to the school. Check block P'. When an abnormality occurs during the update process and P' is not updated successfully, the check block P0 can be calculated again according to the data blocks D1 to D4, and the check block P' is updated to P0 to ensure that the check block update is successful.

FIG. 6 is a schematic structural diagram of a data storage device according to an embodiment of the present disclosure, corresponding to the method embodiment shown in FIG. 3, applied to a primary storage server in a data storage system, where the data storage system includes: a management server and a storage server; the storage server includes: a primary storage server and a non-primary storage server; the primary storage server is any one of the storage servers.

Specifically, the device includes:

The first receiving module 601 is configured to receive a first data block to be stored to the first stripe;

a first storage module 602, configured to send, to the management server, a storage address obtaining request for the first data block, and obtain a first storage address determined by the management server according to a stripe storage mechanism, where the first The data block is stored to the first storage address;

The first determining module 603 is configured to determine, when the first data block is successfully stored, whether the first data block is the last data block in the first stripe;

The first calculating module 604 is configured to: when the determination result of the first determining module 603 is YES, calculate the first one of the first strips according to all the data blocks that have been successfully stored in the first stripe Check block

a second storage module 605, configured to send, to the management server, a storage address obtaining request for the first check block, and obtain a second storage address determined by the management server according to a stripe storage mechanism, where the A parity block is stored to the second storage address.

As a specific implementation manner, in the embodiment shown in FIG. 6, the device may further include:

a first deleting module (not shown), configured to delete the first data after storing the first data block to the first storage address, when the first data block is not successfully stored The block has stored data and executes the first calculation module 604.

a second determining module (not shown) for storing the first check block to the second After storing the address, it is determined whether the first check block is successfully stored, and if not, returning to the first calculating module 604.

In another embodiment of the present application, in the embodiment shown in FIG. 6, after the first determining module 603, the device may further include the following modules, which may be as shown in FIG. 7, FIG. The illustrated embodiment corresponds to the method embodiment shown in FIG.

The detecting module 606 is configured to detect, when the first data block is not the last data block in the first strip, whether to receive the second data to be stored in the first stripe in the preset time period Piece;

The second calculating module 607 is configured to: when the detection result of the detecting module is negative, calculate a second check block in the first strip according to all data blocks that have been successfully stored in the first stripe ;

a third storage module 608, configured to send, to the management server, a storage address obtaining request for the second check block, and obtain a third storage address determined by the management server according to a stripe storage mechanism, where the first The second parity block is stored to the third storage address.

As a specific implementation manner, in the embodiment shown in FIG. 7, the device may further include:

a second receiving module (not shown) for storing the second parity block to the third storage when the storage unit for storing the data block in the first strip is not full After the address, receiving the second data block;

a fourth storage module (not shown), configured to send a storage address obtaining request for the second data block to the management server, and obtain a fourth storage address determined by the management server according to a stripe storage mechanism And storing the second data block to the fourth storage address;

a third determining module (not shown), configured to determine, when the second data block is successfully stored, whether the second data block is the last data block in the first stripe;

a third calculating module (not shown), configured to calculate the first piece according to all data blocks that have been successfully stored in the first strip when the determining result of the third judging module is YES a third check block in the band;

An update module (not shown) for updating the second check block to the third check block.

a second deleting module (not shown), configured to: after storing the second data block to the fourth storage address, receive the second data block after storing the second parity block When the first data block is reached, and the second data block is not successfully stored, the stored data of the second data block is deleted.

a third deleting module (not shown), configured to receive after the storing the second data block to the fourth storage address, when the third data block is not storing the second parity block When the first data block is reached, and the second data block is not successfully stored, the stored data of the second data block is deleted, and the third calculation module is executed.

FIG. 8 is a schematic structural diagram of a data storage system according to an embodiment of the present disclosure. The system includes: a management server 81 and a storage server 82. The storage server 82 includes a primary storage server 821 and a non-primary storage server 822. The primary storage server is any one of the storage servers;

The primary storage server 821 is configured to receive a first data block to be stored to the first strip, and send a storage address obtaining request for the first data block to the management server 81;

The management server 81 is configured to receive a storage address obtaining request for the first data block sent by the primary storage server 821, determine a first storage address according to a stripe storage mechanism, and send the first storage address To the primary storage server 821;

The primary storage server 821 is configured to receive the first storage address sent by the management server 81, store the first data block to the first storage address, and determine that the first data block is successfully stored. Determining whether the first data block is the last data block in the first strip, and if so, calculating the first strip according to all data blocks in the first strip that have been successfully stored. a first parity block in the band; sending a storage address obtaining request for the first parity block to the management server 81;

The management server 81 is configured to receive a storage address obtaining request for the first check block sent by the primary storage server 821, determine a second storage address according to a strip storage mechanism, and set the second storage address Send to the primary storage server 821;

The primary storage server 821 is configured to receive the second storage address sent by the management server 81, and store the first parity block to the second storage address.

As a specific implementation manner, in the embodiment shown in FIG. 8, the management server 81 is further configured to: when detecting that the first data block is not successfully stored, and when detecting that the primary storage server 821 is generated When abnormal, deleting the stored data of the first data block, selecting a new primary storage server from the non-primary storage server 822, switching the primary storage server to the new primary storage server, and The primary storage server sends a calculation instruction for the first parity block, wherein the calculation instruction carries a storage address of all data blocks that have been successfully stored in the first stripe;

The primary storage server is configured to receive the calculation instruction sent by the management server 81, And obtaining a data block according to the storage address carried in the calculation instruction, and calculating a first parity block in the first strip according to the obtained data block.

It can be understood that the failure to store the first data block may be caused by various reasons, such as an abnormality occurs in the storage server storing the first data block, or an abnormality may occur in the primary storage server. When the management server detects that an abnormality has occurred in the primary storage server, it can reselect the new storage server as the primary storage server from the storage server.

The above-mentioned device embodiments and system embodiments are obtained based on the method embodiments, and have the same technical effects as the method. Therefore, the technical effects of the device embodiments and system embodiments are not described herein again.

For the device embodiment and the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the description of the method embodiment.

a housing, a processor, a memory, a circuit board, and a power supply circuit, wherein the circuit board is disposed inside a space enclosed by the housing, the processor and the memory are disposed on the circuit board; and the power supply circuit is configured to be the main storage server Each circuit or device is powered; the memory is for storing executable program code; the processor runs the program corresponding to the executable program code by reading executable program code stored in the memory for performing the following steps:

Receiving a first data block to be stored to the first stripe;

The memory mentioned by the primary storage server may include a random access memory (RAM), and may also include a non-volatile memory (NVM), such as at least one disk storage. Optionally, the memory may also be at least one storage device located away from the aforementioned processor.

The processor may be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc., or a digital signal processing (DSP), an application specific integrated circuit. (Application Specific Integrated Circuit, ASIC), Field-Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic device, discrete hardware component.

The embodiment of the present invention and the method embodiment shown in FIG. 3 are based on the same inventive concept. The specific embodiment of the present embodiment can adopt the content of the method embodiment shown in FIG.

It can be seen that, in this embodiment, the data block can be stored first. When all the data blocks in the stripe are successfully stored, the check block is calculated according to the data block successfully stored in the stripe, and then the check block is stored. In the related art, the check block is first calculated according to the data block, and in the case where both the data block and the check block in the strip are available, the data block and the check block are simultaneously stored. If a power failure occurs during the storage process, both the data block and the check block may be unsuccessful in storage. In this case, the data block and the check block are inconsistent, and a Write Hole problem occurs. Applying the solution of the embodiment of the present application, if the data blocks in the first strip are successfully stored, the check block is calculated and stored, and even if a power failure occurs during the storage process, the data block and the data block can be avoided as much as possible. The check block is inconsistent.

Receiving a first data block to be stored to the first stripe;

It should be noted that, in this context, relational terms such as first and second are used merely to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply such entities or operations. There is any such actual relationship or order between them. Furthermore, the terms "comprises," "comprising," or "includes" or "includes" or "includes" or "includes" or "includes" or "includes" Other elements, or elements that are inherent to such a process, method, item, or device. An element that is defined by the phrase "comprising a ..." does not exclude the presence of additional equivalent elements in the process, method, item, or device that comprises the element.

It will be understood by those skilled in the art that all or part of the steps in the above embodiments can be implemented by hardware related to program instructions, and the programs can be stored in a computer readable storage medium. The storage medium referred to herein means a ROM/RAM, a magnetic disk, an optical disk, or the like.

The above description is only the preferred embodiment of the present application, and is not intended to limit the scope of the present application. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and principles of the present application are included in the scope of the present application.

Claims

A data storage method, which is applied to a primary storage server in a data storage system, wherein the data storage system includes: a management server and a storage server; the storage server includes: a primary storage server and a non-primary storage server The primary storage server is any one of the storage servers; the method includes:

Receiving a first data block to be stored to the first stripe;

Sending, to the management server, a storage address obtaining request for the first data block, and obtaining a first storage address determined by the management server according to a stripe storage mechanism, storing the first data block to the first Storage address

When it is determined that the first data block is successfully stored, determining whether the first data block is the last data block in the first stripe;

If yes, calculating a first check block in the first strip according to all data blocks in the first strip that have been successfully stored;

Sending a storage address obtaining request for the first check block to the management server, and obtaining a second storage address determined by the management server according to a stripe storage mechanism, storing the first check block to the The second storage address.
The method according to claim 1, wherein after storing the first data block to the first storage address, the method further comprises:

Deleting the stored data of the first data block when the first data block is not successfully stored, and performing the first data according to all data blocks that have been successfully stored in the first stripe The step of the first check block in the band.
The method of claim 2, after the storing the first check block to the second storage address, the method further comprises:

Determining whether the first check block is successfully stored;

If not, returning to performing the step of calculating the first check block in the first strip according to all data blocks that have been successfully stored in the first strip.
The method according to claim 2, wherein when it is determined that the first data block is not the last data block in the first strip, the method further comprises:

Detecting whether a second data block to be stored to the first stripe is received within a preset time period;

If not received, calculating a second check block in the first strip according to all data blocks in the first strip that have been successfully stored;

Sending a storage address obtaining request for the second check block to the management server, and obtaining a third storage address determined by the management server according to the stripe storage mechanism, storing the second check block to the The third storage address.
The method according to claim 4, wherein when the storage unit for storing the data block in the first strip is not full, storing the second parity block to the third storage address Thereafter, the method further includes:

Receiving the second data block;

Sending a storage address obtaining request for the second data block to the management server, and obtaining a fourth storage address determined by the management server according to the stripe storage mechanism, and storing the second data block to the fourth Storage address

When it is determined that the storing of the second data block is successful, determining whether the second data block is the last data block in the first stripe;

If yes, calculating a third parity block in the first strip according to all data blocks in the first strip that have been successfully stored;

Updating the second parity block to the third parity block.
The method according to claim 5, wherein after storing the second data block to the fourth storage address, the method further comprises:

When the second data block is the first data block received after storing the second parity block, and the second data block is not successfully stored, the stored data of the second data block is deleted.
The method according to claim 5, wherein after storing the second data block to the fourth storage address, the method further comprises:

When the second data block is not the first data block received after storing the second parity block, and the second data block is not successfully stored, deleting the stored data of the second data block, And performing the step of calculating a third parity block in the first strip according to all data blocks that have been successfully stored in the first strip.
The method according to any one of claims 1 to 7, wherein the data in the first data block is from a file.
A data storage device, characterized by being applied to a primary storage server in a data storage system, wherein the data storage system comprises: a management server and a storage server; the storage server comprises: a primary storage server and a non-primary storage server The primary storage server is any one of the storage servers; the device includes:

a first receiving module, configured to receive a first data block to be stored to the first stripe;

a first storage module, configured to send, to the management server, a storage address obtaining request for the first data block, and obtain a first storage address determined by the management server according to a stripe storage mechanism, and use the first data The block is stored to the first storage address;

a first determining module, configured to determine, when the first data block is successfully stored, whether the first data block is the last data block in the first stripe;

a first calculating module, configured to: when the determination result of the first determining module is YES, calculate a first check in the first strip according to all data blocks that have been successfully stored in the first stripe Piece;

a second storage module, configured to send a storage address obtaining request for the first check block to the management server, and obtain a second storage address determined by the management server according to a stripe storage mechanism, where the first A parity block is stored to the second storage address.
The device according to claim 9, wherein the device further comprises:

a first deleting module, configured to delete the stored data of the first data block when the first data block is not stored successfully after storing the first data block to the first storage address, and Executing the first computing module.
The device according to claim 10, wherein the device further comprises:

a second determining module, configured to determine whether the first check block is successfully stored after storing the first check block to the second storage address, and if not, returning to execute the first calculating module .
The device according to claim 10, wherein after the first determining module, the device further comprises:

a detecting module, configured to detect, when the first data block is not the last data block in the first strip, whether to receive the second data block to be stored in the first stripe in a preset time period ;

a second calculating module, configured to: when the detection result of the detecting module is negative, calculate a second parity block in the first strip according to all data blocks that have been successfully stored in the first stripe;

a third storage module, configured to send a storage address obtaining request for the second check block to the management server, and obtain a third storage address determined by the management server according to a stripe storage mechanism, and the second storage The check block is stored to the third storage address.
The device of claim 12, wherein the device further comprises:

a second receiving module, when the storage unit for storing the data block in the first strip is not full, after receiving the second parity block to the third storage address, receiving the first Two data blocks;

a fourth storage module, configured to send, to the management server, a storage address obtaining request for the second data block, and obtain a fourth storage address determined by the management server according to a stripe storage mechanism, and the second data is The block is stored to the fourth storage address;

a third determining module, configured to determine, when the second data block is successfully stored, whether the second data block is the last data block in the first stripe;

a third calculating module, configured to: when the determination result of the third determining module is YES, calculate a third check in the first strip according to all data blocks that have been successfully stored in the first stripe Piece;

And an update module, configured to update the second check block to the third check block.
The device according to claim 13, wherein the device further comprises:

a second deleting module, configured to: after storing the second data block to the fourth storage address, when the second data block is the first data block received after storing the second parity block And storing the stored data of the second data block when the second data block is not successfully stored.
The device according to claim 13, wherein the device further comprises:

a third deleting module, configured to: after storing the second data block to the fourth storage address, when the second data block is not the first data block received after storing the second parity block And if the second data block is not successfully stored, the stored data of the second data block is deleted, and the third computing module is executed.
A data storage system, comprising: a management server and a storage server; the storage server comprises: a primary storage server and a non-primary storage server, wherein the primary storage server is any one of the storage servers;

The primary storage server is configured to receive a first data block to be stored to the first strip, and send a storage address obtaining request for the first data block to the management server;

The management server is configured to receive a storage address obtaining request for the first data block sent by the primary storage server, determine a first storage address according to a stripe storage mechanism, and send the first storage address to the Said primary storage server;

The primary storage server is configured to receive the first storage address sent by the management server, store the first data block to the first storage address, and when determining that the first data block is successfully stored, Determining whether the first data block is the last data block in the first strip, and if so, calculating the first strip according to all data blocks that have been successfully stored in the first strip a first parity block; sending a storage address obtaining request for the first parity block to the management server;

The management server is configured to receive a storage address obtaining request for the first check block sent by the primary storage server, determine a second storage address according to a stripe storage mechanism, and send the second storage address to The primary storage server;

The primary storage server is configured to receive the second storage address sent by the management server, and store the first parity block to the second storage address.
The system of claim 16 wherein:

The management server is further configured to: when it is detected that the first data block is not successfully stored, and when detecting that an abnormality occurs in the primary storage server, deleting the stored data of the first data block, from the non- Selecting a new primary storage server from the primary storage server, switching the primary storage server to the new primary storage server, and transmitting a calculation instruction for the first parity block to the primary storage server, where The calculation instruction carries a storage address of all data blocks that have been successfully stored in the first stripe;

The primary storage server is configured to receive the calculation instruction sent by the management server, and obtain a data block according to the storage address carried in the calculation instruction, and calculate the first strip according to the obtained data block. The first check block in .
A primary storage server in a data storage system, the data storage system includes: a management server and a storage server; the storage server includes: a primary storage server and a non-primary storage server; Any one of the storage servers; the primary storage server includes:

a housing, a processor, a memory, a circuit board, and a power supply circuit, wherein the circuit board is disposed inside a space enclosed by the housing, the processor and the memory are disposed on the circuit board; and the power supply circuit is configured to be the main storage server Each circuit or device is powered; the memory is for storing executable program code; the processor runs the program corresponding to the executable program code by reading executable program code stored in the memory for performing the following steps:

Receiving a first data block to be stored to the first stripe;

Sending, to the management server, a storage address obtaining request for the first data block, and obtaining a first storage address determined by the management server according to a stripe storage mechanism, storing the first data block to the first Storage address

When it is determined that the first data block is successfully stored, determining whether the first data block is the last data block in the first stripe;

If yes, calculating the number according to all the data blocks in the first strip that have been successfully stored. a first check block in a strip;

Sending a storage address obtaining request for the first check block to the management server, and obtaining a second storage address determined by the management server according to a stripe storage mechanism, storing the first check block to the The second storage address.
A storage medium for storing executable code, the executable code being operative to perform the data storage method steps of any of claims 1-8.