CN107608820B - Erasure code based file writing method and related device - Google Patents
Erasure code based file writing method and related device Download PDFInfo
- Publication number
- CN107608820B CN107608820B CN201710882638.6A CN201710882638A CN107608820B CN 107608820 B CN107608820 B CN 107608820B CN 201710882638 A CN201710882638 A CN 201710882638A CN 107608820 B CN107608820 B CN 107608820B
- Authority
- CN
- China
- Prior art keywords
- data
- file
- zero data
- writing
- written
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 38
- 238000012937 correction Methods 0.000 claims abstract description 20
- 238000004422 calculation algorithm Methods 0.000 claims abstract description 13
- 230000000295 complement effect Effects 0.000 claims abstract description 13
- 238000004590 computer program Methods 0.000 claims description 12
- 230000004044 response Effects 0.000 claims description 11
- 238000005457 optimization Methods 0.000 claims description 8
- 230000004048 modification Effects 0.000 claims description 5
- 238000012986 modification Methods 0.000 claims description 5
- 230000009286 beneficial effect Effects 0.000 abstract description 2
- 238000005516 engineering process Methods 0.000 description 7
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000010586 diagram Methods 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 230000002349 favourable effect Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
- Techniques For Improving Reliability Of Storages (AREA)
Abstract
The application discloses an erasure code-based file writing method, a file writing device, a computer-readable storage medium and a server, wherein the method comprises the following steps: judging whether the length of the source data needs to be written with zero data to complement the length of the erasure correction strip; if so, writing the zero data into the source data, and calculating by using an erasure code algorithm to obtain redundant data; when the zero data are written into the hard disk, a file with the same size as the zero data is created through a system operation command, so that the storage system can identify the file as the zero data. When the zero data are written into the hard disk, the writing operation is replaced by creating an empty file with the same size as the zero data, and the storage system can recognize that the zero data are written into, so that the time for writing the zero data is saved, the original performance for writing the zero data is liberated, and the performance utilization rate of the storage system is improved. The file writing device, the computer readable storage medium and the server have the beneficial effects.
Description
Technical Field
The present disclosure relates to the field of distributed storage technologies, and in particular, to a method and an apparatus for writing a file based on an erasure code, a computer-readable storage medium, and a server.
Background
With the continuous development of storage technology, storage systems which deal with different application scenarios are extended. In dealing with large amounts of data, distributed storage systems are generally used, where erasure coding techniques are commonly used to increase the reliability of the storage system in order to maintain the reliability of data storage.
The erasure code technology is a data protection method, which divides data with a certain length into K parts, and calculates M-part redundant check block data by using K parts of data through a coding algorithm. Let K + M pieces of data be stored in different locations, such as disks, storage nodes, or other locations. Only K out of K + M data are needed to pay for all data. Therefore, compared with a mode of storing data copies, the erasure code technology has the same condition of ensuring data safety and can effectively improve the utilization rate of the storage space.
However, in the erasure correction code, data reading and writing are performed on the basis of the erasure correction data stripe size, and when the written data is insufficient and the stripe size is small, the insufficient length is complemented with zero data to the stripe size. Even if data of one byte length is written, the data is continuously padded to the stripe length by zero data, and then all the padded contents are written into the hard disk in the writing unit with the smallest stripe length.
Furthermore, zero data are all invalid data, which not only occupies the actual storage space of the hard disk, but also increases the writing time. When the operating pressure of the storage system is large, the performance of the whole storage system is definitely affected by writing the zero data, which causes the performance waste of the storage system.
Therefore, how to solve the problem that writing zero data under erasure code technology affects the performance of the storage system is a hot issue that is focused on by those skilled in the art.
Disclosure of Invention
The application aims to provide a file writing method, a file writing device, a computer readable storage medium and a server based on erasure codes.
In order to solve the above technical problem, the present application provides a file writing method based on erasure codes, including:
judging whether the length of the source data needs to be written with zero data to complement the length of the erasure correction strip;
if so, writing the zero data into the source data, and calculating by using an erasure code algorithm to obtain redundant data;
when the zero data are written into the hard disk, a file with the same size as the zero data is created through a system operation command, so that the storage system can identify the file as the zero data.
Optionally, when the zero data is written into the hard disk, creating a file with the same size as the zero data through a system operation command, so that the storage system identifies the file as the zero data, including:
when the zero data are written into the hard disk, creating an empty file through touch operation;
and modifying the size data of the empty file into the size data of the zero data by using a truncate operation to obtain the file, so that the storage system identifies the file as the zero data.
Optionally, the determining whether the write source data needs to write zero data to complement the length of the erasure correction stripe includes:
and judging whether the number of the data blocks of the source data is less than the number of erasure code data blocks or not according to the offset and the writing length of the source data needing to be written.
Optionally, the method further includes:
and when the writing operation is completed, generating a response message and sending the response message to the client.
The present application further provides a file writing device based on erasure codes, including:
the source data judging module is used for judging whether the length of the source data needs to be written with zero data to complement the length of the erasure correcting strip;
the zero data writing module is used for writing the zero data into the source data and calculating by utilizing an erasure code algorithm to obtain redundant data;
and the write optimization module is used for creating a file with the same size as the zero data through a system operation command when the zero data are written into a hard disk so as to enable the storage system to identify the file as the zero data.
Optionally, the write optimization module includes:
the null file creating unit is used for creating a null file through touch operation when the zero data is written into the hard disk;
and the empty file modification unit is used for modifying the size data of the empty file into the size data of the zero data by using a truncate operation to obtain the file, so that the storage system identifies the file as the zero data.
Optionally, the source data determining module is specifically configured to determine whether the number of data blocks of the source data is smaller than the number of erasure code data blocks according to the offset and the write length of the source data that needs to be written.
Optionally, the method further includes:
and the feedback module is used for generating a response message and sending the response message to the client after the write-in operation is completed.
The present application further provides a computer-readable storage medium, wherein a computer program is stored on the computer-readable storage medium, and when executed by a processor, the computer program implements the following steps:
judging whether the length of the source data needs to be written with zero data to complement the length of the erasure correction strip;
if so, writing the zero data into the source data, and calculating by using an erasure code algorithm to obtain redundant data;
when the zero data are written into the hard disk, a file with the same size as the zero data is created through a system operation command, so that the storage system can identify the file as the zero data.
The present application further provides a server, comprising:
a memory for storing a computer program;
a processor, configured to implement the following steps when executing the computer program:
judging whether the length of the source data needs to be written with zero data to complement the length of the erasure correction strip;
if so, writing the zero data into the source data, and calculating by using an erasure code algorithm to obtain redundant data;
when the zero data are written into the hard disk, a file with the same size as the zero data is created through a system operation command, so that the storage system can identify the file as the zero data.
The application provides a file writing method based on erasure codes, which comprises the following steps: judging whether the length of the source data needs to be written with zero data to complement the length of the erasure correction strip; if so, writing the zero data into the source data, and calculating by using an erasure code algorithm to obtain redundant data; when the zero data are written into the hard disk, a file with the same size as the zero data is created through a system operation command, so that the storage system can identify the file as the zero data.
When the zero data are written into the hard disk, the writing operation is replaced by creating an empty file with the same size as the zero data, and the storage system can recognize that the zero data are written into, so that the time for writing the zero data is saved, the original performance for writing the zero data is liberated, and the performance utilization rate of the storage system is improved.
The application also provides a file writing device based on erasure codes, a computer readable storage medium and a server, which all have the beneficial effects and are not described herein again.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
Fig. 1 is a flowchart of a method for writing a file based on erasure codes according to an embodiment of the present application;
fig. 2 is a flowchart illustrating specific operations of a method for writing a file based on erasure codes according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a file writing device based on erasure codes according to an embodiment of the present disclosure.
Detailed Description
The core of the application is to provide a file writing method based on erasure codes, a file writing device, a computer readable storage medium and a server.
In order to make the objects, technical solutions and advantages of the embodiments of the present application clearer, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some embodiments of the present application, but not all embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Referring to fig. 1, fig. 1 is a flowchart illustrating an erasure code based file writing method according to an embodiment of the present disclosure.
The embodiment provides a file writing method based on erasure codes, which may include:
s101, judging whether the length of the source data needs to be written with zero data to complement the length of an erasure correction strip;
this step aims to determine whether the source data needs to be written with zero data to complete the length of the erasure correction stripes.
The erasure code is a data protection mode, data with a certain length is divided into K parts, wherein the certain length is the strip length in the erasure code technology, and M parts of redundant data blocks and check blocks are obtained by calculating K parts of data blocks; and stores the K + M data blocks in different locations. Only K data blocks of the K + M data blocks are needed to recover the source data.
However, since erasure correction code data is read and written in a basic unit of a stripe length, even if a content of one byte length is written by an erasure correction code technique, it is necessary to first fill the written content with zero data to a stripe length and then write the filled content to a hard disk in a unit of writing the smallest stripe length. Only the hard disks less than K are written with valid data and source data, and all other hard disks are written with zero data for completing the length. In all data writing processes, zero data writing occupies a large amount of hardware resources, which is not favorable for performance utilization. Therefore, optimization is required for writing of zero data, and the premise of the optimization is to determine whether the written data needs to be filled with zero data.
The specific determination method may perform the determination according to the identification bit and the identifier of the erasure correction code in operation, or may perform the determination according to the length of the source data and the length of the erasure correction stripe, both for determining whether zero data needs to be filled, and the specific determination method may be selected according to the application environment, which is not described herein again.
S102, if yes, writing zero data into source data, and calculating by using an erasure code algorithm to obtain redundant data;
on the basis of step S101, this step is intended to write zero data into the source data and to calculate redundant data from the erasure code.
The step is a step in the existing erasure code technology, and is to write zero data into source data and obtain redundant data through erasure code calculation. The redundant data is obtained and then written into the hard disk.
And S103, when the zero data are written into the hard disk, creating a file with the same size as the zero data through a system operation command so that the storage system can recognize the file as the zero data.
On the basis of step S102, this step is intended to create a file with the same size as zero data to replace the write operation of the zero data when the zero data is written to the hard disk.
The file with the same size is created through the operation command symbol of the system, and the replacement operation can be completed without adding other operations, so that the use of a developer is facilitated, and the change of the system is small. The consumption of system resources by the system operation command symbol execution action is relatively small, and the overall performance of the system is improved.
The same size file created is equivalent to the system identifying its file as identifying zero data, without any difference in the reading of the data. And the original zero data writing operation is replaced, the writing frequency of the hard disk for the complemented zero data is reduced, the writing operation capability of the distributed storage system is improved, and a large amount of time for storing the zero data is saved.
In summary, according to the embodiment of the application, when the zero data is written into the hard disk, the writing operation is replaced by creating the empty file with the same size as the zero data, and the storage system can recognize that the zero data is written, so that the time for writing the zero data is saved, the original performance for writing the zero data is liberated, and the performance utilization rate of the storage system is improved.
Referring to fig. 2, fig. 2 is a flowchart illustrating specific operations of a method for writing a file based on erasure codes according to an embodiment of the present application.
In combination with the previous embodiment, this embodiment is an explanation of how to perform the write operation replacement in the previous embodiment, other parts are substantially the same as the previous embodiment, and the same parts may refer to the previous embodiment, which is not described herein.
The embodiment may include:
s201, when zero data are written into a hard disk, creating an empty file through touch operation;
this step aims at creating an empty file by touch operation.
Wherein, the touch operation refers to a system operation command in the linux system, and one function of the touch operation is to create a new empty file.
S202, modifying the size data of the empty file into the size data of zero data by using a truncate operation to obtain a file, so that the storage system can identify the file as the zero data.
On the basis of step S201, this step is intended to modify the size of the empty file by a truncate operation.
In the Linux system, the truncate operation refers to an operation of reducing or expanding a file to a specified size. If the specified file of the truncate operation exceeds the specified size, the excess data will be lost. And if the specified file is smaller than the specified size, complementing the specified file with zero data.
Therefore, the empty file is operated by the truncate command, the size of the empty file is modified to the size of the zero data to be stored, and at this time, the storage system can recognize the empty file as the written zero data.
Meanwhile, the zero data cannot be written into the hard disk by the two operations, only the zero data with the same size can be identified at the system level, the operation time consumption is shorter than the time consumption of actually writing the zero data, and the effect is the same. The time consumption for writing zero data is saved, and the file writing performance of the storage system is improved.
Specifically, the determining operation in the previous embodiment may be to determine whether the number of data blocks of the source data is smaller than the number of erasure correction code data blocks according to the offset and the write length of the source data that needs to be written.
The offset of the source data refers to the difference between the length of the source data and the length of the stripe, the written length is compared, and if the offset is smaller than the number of erasure code data blocks, it is determined that zero data needs to be written into the source data to complete the length.
Optionally, after the write operation is completed, a response message is generated and sent to the client.
The write operation refers to the system command operation, and when the operation is completed, a message that the data write is completed may be generated and sent to the client to notify the user.
The embodiment of the application provides a file writing method based on erasure codes, and the writing operation can be replaced by creating an empty file with the same size as zero data when the zero data are written into a hard disk, and a storage system can recognize that the zero data are written, so that the time for writing the zero data is saved, the original performance of writing the zero data is liberated, and the performance utilization rate of the storage system is improved.
In the following, a file writing device based on erasure codes provided by the embodiments of the present application is introduced, and a file writing device based on erasure codes described below and a file writing method based on erasure codes described above may be referred to correspondingly.
Referring to fig. 3, fig. 3 is a schematic structural diagram of a file writing device based on erasure codes according to an embodiment of the present disclosure.
A source data determining module 100, configured to determine whether the length of the source data needs to be written with zero data to complement the length of the erasure correction stripe;
a zero data writing module 200, configured to write zero data into source data, and calculate to obtain redundant data by using an erasure code algorithm;
the write optimization module 300 creates a file with the same size as the zero data through a system operation command when the zero data is written in the hard disk, so that the storage system recognizes the file as the zero data.
Optionally, the write optimization module 300 includes:
the device comprises an empty file creating unit, a null file creating unit and a null file creating unit, wherein the empty file creating unit is used for creating an empty file through touch operation when zero data are written into a hard disk;
and the empty file modification unit is used for modifying the size data of the empty file into the size data of the zero data by using a truncate operation to obtain a file so that the storage system can identify the file as the zero data.
Optionally, the source data determining module is specifically configured to determine whether the number of data blocks of the source data is smaller than the number of erasure code data blocks according to the offset and the write length of the source data that needs to be written.
Optionally, the method further includes:
and the feedback module is used for generating a response message and sending the response message to the client after the write-in operation is completed.
An embodiment of the present application further provides a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the following steps are implemented:
judging whether the length of the source data needs to be written with zero data to complement the length of the erasure correction strip;
if so, writing zero data into the source data, and calculating by using an erasure code algorithm to obtain redundant data;
when the zero data is written into the hard disk, a file with the same size as the zero data is created through a system operation command, so that the storage system recognizes the file as the zero data.
An embodiment of the present application further provides a server, including:
a memory for storing a computer program;
a processor, configured to implement the following steps when executing the computer program:
judging whether the length of the source data needs to be written with zero data to complement the length of the erasure correction strip;
if so, writing zero data into the source data, and calculating by using an erasure code algorithm to obtain redundant data;
when the zero data is written into the hard disk, a file with the same size as the zero data is created through a system operation command, so that the storage system recognizes the file as the zero data.
It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working processes of the system, the apparatus and the module described above may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, a division of modules is merely a division of logical functions, and an actual implementation may have another division, for example, a plurality of modules or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or modules, and may be in an electrical, mechanical or other form.
Modules described as separate parts may or may not be physically separate, and parts displayed as modules may or may not be physical modules, may be located in one place, or may be distributed on a plurality of network modules. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment.
In addition, functional modules in the embodiments of the present application may be integrated into one processing module, or each of the modules may exist alone physically, or two or more modules are integrated into one module. The integrated module can be realized in a hardware mode, and can also be realized in a software functional module mode.
The integrated module, if implemented in the form of a software functional module and sold or used as a separate product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a function calling device, or a network device) to execute all or part of the steps of the method of the embodiments of the present application. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The erasure code-based file writing method, the erasure code-based file writing device, the erasure code-based computer-readable storage medium, and the erasure code-based server provided by the present application are described in detail above. The principles and embodiments of the present application are explained herein using specific examples, which are provided only to help understand the method and the core idea of the present application. It should be noted that, for those skilled in the art, it is possible to make several improvements and modifications to the present application without departing from the principle of the present application, and such improvements and modifications also fall within the scope of the claims of the present application.
Claims (8)
1. A file writing method based on erasure codes is characterized by comprising the following steps:
judging whether the length of the source data needs to be written with zero data to complement the length of the erasure correction strip;
if so, writing the zero data into the source data, and calculating by using an erasure code algorithm to obtain redundant data;
when the zero data are written into a hard disk, creating a file with the same size as the zero data through a system operation command so that a storage system can identify the file as the zero data;
when the zero data is written into the hard disk, creating a file with the same size as the zero data through a system operation command so that the storage system identifies the file as the zero data, wherein the method comprises the following steps:
when the zero data are written into the hard disk, creating an empty file through touch operation;
and modifying the size data of the empty file into the size data of the zero data by using a truncate operation to obtain the file, so that the storage system identifies the file as the zero data.
2. The method according to claim 1, wherein the determining whether the write source data needs to write zero data to fill up the length of the erasure correction stripe comprises:
and judging whether the number of the data blocks of the source data is less than the number of erasure code data blocks or not according to the offset and the writing length of the source data needing to be written.
3. The file writing method according to claim 2, further comprising:
and when the writing operation is completed, generating a response message and sending the response message to the client.
4. An erasure code-based file writing apparatus, comprising:
the source data judging module is used for judging whether the length of the source data needs to be written with zero data to complement the length of the erasure correcting strip;
the zero data writing module is used for writing the zero data into the source data and calculating by utilizing an erasure code algorithm to obtain redundant data;
the write-in optimization module is used for creating a file with the same size as the zero data through a system operation command when the zero data are written into a hard disk so as to enable a storage system to identify the file as the zero data;
wherein the write optimization module comprises:
the null file creating unit is used for creating a null file through touch operation when the zero data is written into the hard disk;
and the empty file modification unit is used for modifying the size data of the empty file into the size data of the zero data by using a truncate operation to obtain the file, so that the storage system identifies the file as the zero data.
5. The apparatus according to claim 4, wherein the source data determining module is specifically configured to determine whether the number of data blocks of the source data is smaller than the number of erasure code data blocks according to an offset and a write length of the source data that needs to be written.
6. The file writing apparatus according to claim 5, further comprising:
and the feedback module is used for generating a response message and sending the response message to the client after the write-in operation is completed.
7. A computer-readable storage medium, characterized in that a computer program is stored thereon, which computer program, when being executed by a processor, carries out the steps of the file writing method according to any one of claims 1 to 3.
8. A server, comprising:
a memory for storing a computer program;
a processor for implementing the steps of the file writing method according to any one of claims 1 to 3 when executing said computer program.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710882638.6A CN107608820B (en) | 2017-09-26 | 2017-09-26 | Erasure code based file writing method and related device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710882638.6A CN107608820B (en) | 2017-09-26 | 2017-09-26 | Erasure code based file writing method and related device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107608820A CN107608820A (en) | 2018-01-19 |
| CN107608820B true CN107608820B (en) | 2020-08-21 |
Family
ID=61058610
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710882638.6A Active CN107608820B (en) | 2017-09-26 | 2017-09-26 | Erasure code based file writing method and related device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107608820B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108595287B (en) * | 2018-04-27 | 2021-11-05 | 新华三技术有限公司成都分公司 | Data truncation method and device based on erasure codes |
| CN109683817A (en) * | 2018-12-14 | 2019-04-26 | 浪潮电子信息产业股份有限公司 | A kind of method for writing data, system and electronic equipment and storage medium |
| CN110347640B (en) * | 2019-06-26 | 2022-02-18 | 北京三快在线科技有限公司 | File storage method and device, storage medium and electronic equipment |
| CN112000627B (en) * | 2020-08-14 | 2022-08-05 | 苏州浪潮智能科技有限公司 | Data storage method, system, electronic equipment and storage medium |
| CN112463460B (en) * | 2020-12-11 | 2022-11-29 | 苏州浪潮智能科技有限公司 | Erasure code-based small block data recovery method and system |
| CN112965660B (en) * | 2021-02-09 | 2023-08-08 | 山东英信计算机技术有限公司 | Method, system, equipment and medium for double storage pool information feedback |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4072593B2 (en) * | 2001-12-14 | 2008-04-09 | 独立行政法人産業技術総合研究所 | Data distribution system |
| CN101645040A (en) * | 2009-09-15 | 2010-02-10 | 苏州超锐微电子有限公司 | Specific data read-write acceleration method for Flash |
| CN102110145A (en) * | 2011-02-15 | 2011-06-29 | 中国科学院计算技术研究所 | Micro FAT file system and quick data access method thereof |
| CN102546755A (en) * | 2011-12-12 | 2012-07-04 | 华中科技大学 | Data storage method of cloud storage system |
| CN105760116A (en) * | 2016-03-10 | 2016-07-13 | 天津科技大学 | Increment erasure code storage method and increment erasure code storage system under multiple network disks |
| CN106445423A (en) * | 2016-12-06 | 2017-02-22 | 郑州云海信息技术有限公司 | Optimization method and system for direct erasure codes based on NVRAM (Non Volatile Random Access Memory) storage system |
| CN107094186A (en) * | 2017-06-15 | 2017-08-25 | 深圳市云舒网络技术有限公司 | A kind of correcting and eleting codes optimization method of distributed memory system |
-
2017
- 2017-09-26 CN CN201710882638.6A patent/CN107608820B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4072593B2 (en) * | 2001-12-14 | 2008-04-09 | 独立行政法人産業技術総合研究所 | Data distribution system |
| CN101645040A (en) * | 2009-09-15 | 2010-02-10 | 苏州超锐微电子有限公司 | Specific data read-write acceleration method for Flash |
| CN102110145A (en) * | 2011-02-15 | 2011-06-29 | 中国科学院计算技术研究所 | Micro FAT file system and quick data access method thereof |
| CN102546755A (en) * | 2011-12-12 | 2012-07-04 | 华中科技大学 | Data storage method of cloud storage system |
| CN105760116A (en) * | 2016-03-10 | 2016-07-13 | 天津科技大学 | Increment erasure code storage method and increment erasure code storage system under multiple network disks |
| CN106445423A (en) * | 2016-12-06 | 2017-02-22 | 郑州云海信息技术有限公司 | Optimization method and system for direct erasure codes based on NVRAM (Non Volatile Random Access Memory) storage system |
| CN107094186A (en) * | 2017-06-15 | 2017-08-25 | 深圳市云舒网络技术有限公司 | A kind of correcting and eleting codes optimization method of distributed memory system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107608820A (en) | 2018-01-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107608820B (en) | Erasure code based file writing method and related device | |
| US10545823B2 (en) | Accelerating erasure code replication in distributed systems | |
| JP6381801B2 (en) | Dynamic scaling of storage volume for storage client file system | |
| CN107844268B (en) | Data distribution method, data storage method, related device and system | |
| CN103034566B (en) | Method and device for restoring virtual machine | |
| CN102411523B (en) | Method and device for storing file backups and backup method for file systems | |
| CN106201659B (en) | A kind of method and host of live migration of virtual machine | |
| CN109522154B (en) | Data recovery method and related equipment and system | |
| CN103164523A (en) | Inspection method, device and system of data consistency inspection | |
| CN103377279A (en) | Systems and methods for migrating data | |
| CN108733311B (en) | Method and apparatus for managing storage system | |
| CN110187832B (en) | Data operation method, device and system | |
| CN109189613A (en) | A kind of database data recovery method and relevant apparatus | |
| CN105302665B (en) | A kind of improved Copy on write Snapshot Method and system | |
| EP3336702B1 (en) | Metadata recovery method and device | |
| CN115495025B (en) | Method and device for managing abnormal memory block | |
| CN111966631A (en) | Mirror image file generation method, system, equipment and medium capable of being rapidly distributed | |
| CN111290836A (en) | Virtual machine snapshot creating method and device, storage medium and computer equipment | |
| US11275518B2 (en) | System and method for implementing heterogeneous media types with raid | |
| CN111857545B (en) | Read-write lock conflict judging method, system, equipment and computer medium | |
| CN111506450B (en) | Method, apparatus and computer program product for data processing | |
| CN108052294B (en) | Modification writing method and modification writing system of distributed storage system | |
| CN112748862A (en) | Method, electronic device and computer program product for managing disc | |
| CN111435323A (en) | Information transmission method, device, terminal, server and storage medium | |
| CN115827308A (en) | Solid state disk data error correction method and solid state disk |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200723 Address after: 215100 No. 1 Guanpu Road, Guoxiang Street, Wuzhong Economic Development Zone, Suzhou City, Jiangsu Province Applicant after: SUZHOU LANGCHAO INTELLIGENT TECHNOLOGY Co.,Ltd. Address before: 450018 Henan province Zheng Dong New District of Zhengzhou City Xinyi Road No. 278 16 floor room 1601 Applicant before: ZHENGZHOU YUNHAI INFORMATION TECHNOLOGY Co.,Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |