CN111930711B - Method, device and equipment for adding nodes to distributed file system cluster - Google Patents
Method, device and equipment for adding nodes to distributed file system cluster Download PDFInfo
- Publication number
- CN111930711B CN111930711B CN202010943793.6A CN202010943793A CN111930711B CN 111930711 B CN111930711 B CN 111930711B CN 202010943793 A CN202010943793 A CN 202010943793A CN 111930711 B CN111930711 B CN 111930711B
- Authority
- CN
- China
- Prior art keywords
- cluster
- nodes
- expanding
- file system
- copy
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/18—File system types
- G06F16/182—Distributed file systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/11—File system administration, e.g. details of archiving or snapshots
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Data Mining & Analysis (AREA)
- Databases & Information Systems (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a method, a device and equipment for adding nodes to a distributed file system cluster. The method for adding nodes to the distributed file system cluster comprises the following steps: expanding the duplicate redundancy number of the cluster; and executing copy data synchronization and copy data repair on the expanded cluster. By adopting the invention, the problems of cluster data distribution layout change and inflexible copy redundancy control caused by the capacity expansion of a metadata-free center architecture mode can be solved, so that the distributed file system cluster can flexibly increase nodes, and the minimum data volume migration and the safe redundancy of data are ensured.
Description
Technical Field
The invention relates to the field of computers, in particular to a method, a device and equipment for adding nodes to a distributed file system cluster.
Background
In the production process, the service cannot accurately estimate the storage capacity, and in consideration of the service cost, a distributed file system is generally required to be built as required and can be expanded and reduced as required. The distributed file system has strong lateral expansion capability, and one of the biggest difficulties in realizing the distributed file system is the recording problem of metadata, namely the mapping relation between logical data and physical storage nodes and the recording of other posix file attributes.
In the related art, the metadata recording and management architecture modes mainly include a main/standby metadata center architecture mode, a distributed metadata center architecture mode, and a metadata-free center architecture mode. The main and standby metadata center architecture mode has the advantages of simple implementation and low complexity in engineering and has the defects of single-point risk and performance bottleneck. The distributed metadata center architecture mode has the advantages that single point and performance bottlenecks are eliminated, metadata and storage are separated, flexible expansion of the whole system is improved, complete distribution is achieved, complexity of the system is greatly increased, and more challenging new problems such as data consistency and performance overhead are brought. The architecture mode of the metadata-free center has the advantages that the hash algorithm is used for mapping metadata and physical storage nodes to improve the expansibility of the whole system and eliminate the complexity of the metadata, and the defects are that the hash mapping algorithm causes the change of data distribution layout during expansion and reduction, so that the problems of large amount of data migration, inflexible copy redundancy control and the like are caused.
Disclosure of Invention
The embodiment of the invention provides a method, a device and equipment for adding nodes to a distributed file system cluster, which are used for solving the problems of cluster data distribution layout change and copy redundancy control inflexibility caused by expansion without a metadata center architecture mode in the prior art.
The embodiment of the invention provides a method for adding nodes to a distributed file system cluster, which comprises the following steps:
expanding the duplicate redundancy number of the cluster;
and executing copy data synchronization and copy data repair on the expanded cluster.
According to some embodiments of the invention, the number of duplicate redundancies of the extended cluster comprises:
when the total number of the nodes of the cluster is 1, expanding the redundant number of the copies of the cluster to be 1;
when the total number of the nodes of the cluster is 2, expanding the redundant number of the copies of the cluster to be 2;
and when the total number of the nodes of the cluster is more than 2, expanding the duplicate redundancy number of the cluster to be 3.
According to some embodiments of the invention, the method further comprises:
and expanding the virtual blocks of the cluster after expanding the copy redundancy number of the cluster and before executing copy data synchronization and copy data repair on the expanded cluster.
According to some embodiments of the invention, the virtual block of the extended cluster comprises:
the virtual blocks that extend each node in the cluster include at least 3.
The embodiment of the invention provides a device for adding nodes to a distributed file system cluster, which comprises:
the first expansion unit is used for expanding the duplicate redundancy number of the cluster;
and the processing unit is used for executing copy data synchronization and copy data repair on the expanded cluster.
According to some embodiments of the invention, the first extension unit is configured to:
when the total number of the nodes of the cluster is 1, expanding the redundant number of the copies of the cluster to be 1;
when the total number of the nodes of the cluster is 2, expanding the redundant number of the copies of the cluster to be 2;
and when the total number of the nodes of the cluster is more than 2, expanding the duplicate redundancy number of the cluster to be 3.
According to some embodiments of the invention, the apparatus further comprises:
and the second expansion unit is used for expanding the virtual blocks of the cluster after the redundant number of the copies of the cluster is expanded and before the synchronization of the copy data and the repair of the copy data are executed on the expanded cluster.
According to some embodiments of the invention, the second extension unit is configured to:
expanding each node in the cluster to include at least 3 virtual blocks.
The embodiment of the present invention further provides a device for adding nodes to a distributed file system cluster, including: a memory, a processor and a computer program stored on the memory and executable on the processor, the computer program when executed by the processor implementing the steps of the method of adding nodes to a distributed file system cluster as described above.
The embodiment of the present invention further provides a computer-readable storage medium, where an implementation program for information transfer is stored on the computer-readable storage medium, and when the program is executed by a processor, the steps of the method for adding nodes to a distributed file system cluster as described above are implemented.
By adopting the embodiment of the invention, the problems of cluster data distribution layout change and inflexible copy redundancy control caused by the capacity expansion of a metadata-free center architecture mode can be solved, so that the distributed file system cluster can flexibly increase nodes, and the minimum data volume migration and the safe redundancy of data are ensured.
The foregoing description is only an overview of the technical solutions of the present invention, and the embodiments of the present invention are described below in order to make the technical means of the present invention more clearly understood and to make the above and other objects, features, and advantages of the present invention more clearly understandable.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the invention. In the drawings:
FIG. 1 is a flowchart of a method for adding nodes to a distributed file system cluster in an embodiment of the present invention;
FIG. 2 is a flowchart of a method for adding nodes to a distributed file system cluster in an embodiment of the present invention.
Detailed Description
Exemplary embodiments of the present invention will be described in more detail below with reference to the accompanying drawings. While exemplary embodiments of the invention are shown in the drawings, it should be understood that the invention can be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the invention to those skilled in the art.
As shown in fig. 1, an embodiment of the present invention provides a method for adding nodes to a distributed file system cluster, including:
s1, expanding the duplicate redundancy number of the cluster;
and S2, executing copy data synchronization and copy data repair on the expanded cluster.
By adopting the embodiment of the invention, the problems of cluster data distribution layout change and inflexible copy redundancy control caused by the capacity expansion of a metadata-free center architecture mode can be solved, so that the distributed file system cluster can flexibly increase nodes, and the minimum data volume migration and the safe redundancy of data are ensured.
On the basis of the above-described embodiment, various modified embodiments are further proposed, and it is to be noted herein that, in order to make the description brief, only the differences from the above-described embodiment are described in the various modified embodiments.
According to some embodiments of the invention, the number of duplicate redundancies of the extended cluster comprises:
when the total number of the nodes of the cluster is 1, expanding the redundant number of the copies of the cluster to be 1;
when the total number of the nodes of the cluster is 2, expanding the redundant number of the copies of the cluster to be 2;
and when the total number of the nodes of the cluster is more than 2, expanding the duplicate redundancy number of the cluster to be 3.
According to some embodiments of the invention, the method further comprises:
and expanding the virtual blocks of the cluster after expanding the copy redundancy number of the cluster and before executing copy data synchronization and copy data repair on the expanded cluster.
According to some embodiments of the invention, the virtual block of the extended cluster comprises:
the virtual blocks that extend each node in the cluster include at least 3.
The method for adding nodes to a distributed file system cluster according to an embodiment of the present invention is described in detail with reference to fig. 2. It is to be understood that the following description is illustrative only and is not intended to be in any way limiting. All similar structures and similar variations thereof adopted by the invention are intended to fall within the scope of the invention.
The distributed file system cluster needs to meet the constraint condition that each node in the cluster has at least 3 virtual blocks, the duplicate redundancy number is 1 when the cluster node is 1, the duplicate redundancy number is 2 when the cluster node is 2, and the duplicate redundancy number is 3 when the cluster node is greater than 2, j (j >0) nodes are added on the basis of n (n >0) nodes.
As shown in fig. 2, the method for adding nodes is to expand the redundant number of copies of the cluster, then expand the virtual blocks, synchronize the data of the copies, and finally repair the distribution layout of the data, in order to satisfy the above constraint conditions.
The method for adding j nodes (j >0) to n nodes (n >0) of the distributed file system cluster is as follows:
when n =1, j =1, the cluster node has an a node having virtual blocks a1, a2, A3, and an additional B node having virtual blocks B1, B2, and B3. After the nodes are added, the number of the cluster nodes is 2, the copy is firstly expanded to meet the requirement that the redundancy number is 2, the copies are formed by A1, B1, A2, B2 and A3 and B3, then the copy data is repaired to enable the copy data to be synchronous and consistent, and the addition is finished.
When n =1 and j =2, the cluster node has a node, the virtual blocks are a1, a2 and A3, B and C are added, and the virtual blocks are B1, B2, B3, C1, C2 and C3. After the nodes are added, the number of the cluster nodes is 3, the copy is expanded to meet the requirement that the redundancy number is 3, A1, B1 and C1 form a copy, A2, B2 and C2 form a copy, A3, B3 and C3 form a copy, then copy data is repaired to enable the copy data to be synchronous and consistent, and the addition is finished.
When n =1 and j =3, the cluster node has a node, the virtual block is a1, a2, A3, B, C, and D nodes are added, and the virtual block is B1, B2, B3, C1, C2, C3, D1, D2, and D3. After the nodes are added, the number of cluster nodes is 4, the copy is expanded to meet the requirement that the number of redundancy is 3, A1, B1 and C1 form a copy, A2, D1 and B2 form a copy, and A3, C2 and D2 form a copy. At least 3 virtual blocks are required for each node, and then virtual blocks B3 and C3 and D3 are expanded to form copies. And then, copy data is repaired to ensure that the copy data is synchronous and consistent, and then data distribution layout repair is carried out, and the increase is finished.
The same method is used when n =1, j >3 as when j = 3.
When n =2 and j =1, the cluster nodes have nodes a and B, the copy groups are a1, B1, a2, B2, A3 and B3, the node C is added, the virtual nodes are C1, C2 and C3, the number of the cluster nodes after the node is added is 3, the copies are expanded to satisfy the redundancy number of 3, the copies are formed by a1, B1 and C1, the copies are formed by a2, B2 and C2, the copies are formed by A3, B3 and C3, and then the copy data is repaired to ensure that the copy data are synchronous and consistent, and the addition is completed.
When n =2 and j =2, the cluster node has a and B nodes, the copy pair is a1, B1, a2, B2, A3 and B3, the node C and D are added, the virtual node is C1, C2, C3, D1, D2 and D3, the number of the cluster nodes is 4 after the node is added, the copy is expanded first to satisfy the redundancy number of 3, a1 forms a copy with B1 and C1, a2 forms a copy with B2 and D1, and A3 forms a copy with B3 and C2. At least 3 virtual blocks are needed for each node, then the virtual blocks A4 and C3 and D2 are expanded to form copies, then A1 is moved to D3, and finally copy groups are formed, namely D3, B1, C1, A2, B2, D1, A3, B3, C2, A4, C3 and D2. And then, copy data is repaired to ensure that the copy data is synchronous and consistent, and then data distribution layout repair is carried out, and the increase is finished.
The same method is used when n =2, j >2, as when j = 2.
When n =3 and j =1, the cluster nodes are a, B and C, and the copy groups are a1, B1, C1, a2, B2, C2, A3, B3 and C3. Newly adding D nodes, wherein each node at least needs 3 virtual blocks, newly adding copy groups A4, B4 and D1, then moving A1 to D2 and B2 to D3, and finally forming copy groups D2, B1, C1, A2, D3, C2, A3, B3, C3, A4, B4 and D1. And then, copy data is repaired to ensure that the copy data is synchronous and consistent, and then data distribution layout repair is carried out, and the increase is finished.
The same method is used when n =3 and j =2 as when j = 1.
When n =3 and j =3, the cluster nodes are a, B, and C, and the copy groups are a1, B1, C1, a2, B2, C2, A3, B3, and C3. Newly adding D, E and F nodes, wherein each node at least needs 3 virtual blocks, and newly adding copy groups D1, E1, F1, D2, E2, F2, D3, E3 and F3. And then, data distribution layout repair is carried out, and the increase is finished.
Otherwise, the addition method is similar when n >0, j > 0.
It should be noted that the above-mentioned embodiments are only preferred embodiments of the present invention, and are not intended to limit the present invention, and those skilled in the art can make various modifications and changes. Any modification, equivalent replacement, or improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
The embodiment of the invention provides a device for adding nodes to a distributed file system cluster, which comprises:
the first expansion unit is used for expanding the duplicate redundancy number of the cluster;
and the processing unit is used for executing copy data synchronization and copy data repair on the expanded cluster.
By adopting the embodiment of the invention, the problems of cluster data distribution layout change and inflexible copy redundancy control caused by the capacity expansion of a metadata-free center architecture mode can be solved, so that the distributed file system cluster can flexibly increase nodes, and the minimum data volume migration and the safe redundancy of data are ensured.
According to some embodiments of the invention, the first extension unit is configured to:
when the total number of the nodes of the cluster is 1, expanding the redundant number of the copies of the cluster to be 1;
when the total number of the nodes of the cluster is 2, expanding the redundant number of the copies of the cluster to be 2;
and when the total number of the nodes of the cluster is more than 2, expanding the duplicate redundancy number of the cluster to be 3.
According to some embodiments of the invention, the apparatus further comprises:
and the second expansion unit is used for expanding the virtual blocks of the cluster after the redundant number of the copies of the cluster is expanded and before the synchronization of the copy data and the repair of the copy data are executed on the expanded cluster.
According to some embodiments of the invention, the second extension unit is configured to:
expanding each node in the cluster to include at least 3 virtual blocks.
The embodiment of the present invention further provides a device for adding nodes to a distributed file system cluster, including: a memory, a processor and a computer program stored on the memory and executable on the processor, the computer program when executed by the processor implementing the steps of:
s1, expanding the duplicate redundancy number of the cluster;
and S2, executing copy data synchronization and copy data repair on the expanded cluster.
By adopting the embodiment of the invention, the problems of cluster data distribution layout change and inflexible copy redundancy control caused by the capacity expansion of a metadata-free center architecture mode can be solved, so that the distributed file system cluster can flexibly increase nodes, and the minimum data volume migration and the safe redundancy of data are ensured.
On the basis of the above-described embodiment, various modified embodiments are further proposed, and it is to be noted herein that, in order to make the description brief, only the differences from the above-described embodiment are described in the various modified embodiments.
According to some embodiments of the invention, the number of duplicate redundancies of the extended cluster comprises:
when the total number of the nodes of the cluster is 1, expanding the redundant number of the copies of the cluster to be 1;
when the total number of the nodes of the cluster is 2, expanding the redundant number of the copies of the cluster to be 2;
and when the total number of the nodes of the cluster is more than 2, expanding the duplicate redundancy number of the cluster to be 3.
According to some embodiments of the invention, the method further comprises:
and expanding the virtual blocks of the cluster after expanding the copy redundancy number of the cluster and before executing copy data synchronization and copy data repair on the expanded cluster.
According to some embodiments of the invention, the virtual block of the extended cluster comprises:
the virtual blocks that extend each node in the cluster include at least 3.
The embodiment of the present invention further provides a computer-readable storage medium, where an implementation program for information transfer is stored on the computer-readable storage medium, and when executed by a processor, the implementation program implements the following steps:
s1, expanding the duplicate redundancy number of the cluster;
and S2, executing copy data synchronization and copy data repair on the expanded cluster.
By adopting the embodiment of the invention, the problems of cluster data distribution layout change and inflexible copy redundancy control caused by the capacity expansion of a metadata-free center architecture mode can be solved, so that the distributed file system cluster can flexibly increase nodes, and the minimum data volume migration and the safe redundancy of data are ensured.
On the basis of the above-described embodiment, various modified embodiments are further proposed, and it is to be noted herein that, in order to make the description brief, only the differences from the above-described embodiment are described in the various modified embodiments.
According to some embodiments of the invention, the number of duplicate redundancies of the extended cluster comprises:
when the total number of the nodes of the cluster is 1, expanding the redundant number of the copies of the cluster to be 1;
when the total number of the nodes of the cluster is 2, expanding the redundant number of the copies of the cluster to be 2;
and when the total number of the nodes of the cluster is more than 2, expanding the duplicate redundancy number of the cluster to be 3.
According to some embodiments of the invention, the method further comprises:
and expanding the virtual blocks of the cluster after expanding the copy redundancy number of the cluster and before executing copy data synchronization and copy data repair on the expanded cluster.
According to some embodiments of the invention, the virtual block of the extended cluster comprises:
the virtual blocks that extend each node in the cluster include at least 3.
The computer-readable storage medium of this embodiment includes, but is not limited to: ROM, RAM, magnetic or optical disks, and the like.
It will be apparent to those skilled in the art that the modules or steps of the present invention described above may be implemented by a general purpose computing device, they may be centralized on a single computing device or distributed across a network of multiple computing devices, and alternatively, they may be implemented by program code executable by a computing device, such that they may be stored in a storage device and executed by a computing device, and in some cases, the steps shown or described may be performed in an order different than that described herein, or they may be separately fabricated into individual integrated circuit modules, or multiple ones of them may be fabricated into a single integrated circuit module. Thus, the present invention is not limited to any specific combination of hardware and software.
It should be noted that, in the description of the present specification, in the following description, suffixes such as "module", "component", or "unit" used to represent elements are used only for facilitating the description of the present invention, and have no specific meaning in itself. Thus, "module", "component" or "unit" may be used mixedly. Furthermore, references to the description of the terms "one embodiment," "some embodiments," "illustrative embodiments," "examples," "specific examples," or "some examples," or the like, mean that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the invention. In this specification, the schematic representations of the terms used above do not necessarily refer to the same embodiment or example. Although some embodiments described herein include some features included in other embodiments instead of others, combinations of features of different embodiments are meant to be within the scope of the invention and form different embodiments. The particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. For example, in the claims, any of the claimed embodiments may be used in any combination.
While embodiments of the invention have been shown and described, it will be understood by those of ordinary skill in the art that: various changes, modifications, substitutions and alterations can be made to the embodiments without departing from the principles and spirit of the invention, the scope of which is defined by the claims and their equivalents.
Claims (6)
1. A method for adding nodes to a distributed file system cluster is characterized by comprising the following steps:
expanding the duplicate redundancy number of the cluster nodes;
the number of duplicate redundancies of the extended cluster node comprises:
when the total number of the nodes of the cluster is 1 after the nodes are added, expanding the redundant number of the copies of the cluster nodes to be 1;
when the total number of the nodes of the cluster is 2 after the nodes are added, expanding the redundant number of the copies of the cluster nodes to be 2;
when the total number of the nodes of the cluster is more than 2 after the nodes are added, expanding the duplicate redundancy number of the cluster nodes to be 3;
performing duplicate data synchronization and duplicate data repair on the expanded cluster;
and expanding the virtual blocks of the cluster after expanding the copy redundancy number of the cluster nodes and before executing copy data synchronization and copy data repair on the expanded cluster.
2. The method of claim 1, wherein expanding the virtual block of the cluster comprises:
the virtual blocks that extend each node in the cluster include at least 3.
3. An apparatus for adding nodes to a distributed file system cluster, comprising:
the first expansion unit is used for expanding the duplicate redundancy number of the cluster node;
when the total number of the nodes of the cluster is 1 after the nodes are added, expanding the redundant number of the copies of the cluster nodes to be 1;
when the total number of the nodes of the cluster is 2 after the nodes are added, expanding the redundant number of the copies of the cluster nodes to be 2;
when the total number of the nodes of the cluster is more than 2 after the nodes are added, expanding the duplicate redundancy number of the cluster nodes to be 3;
the processing unit is used for executing copy data synchronization and copy data repair on the expanded cluster;
and the second expansion unit is used for expanding the virtual blocks of the cluster after the redundant number of the copies of the cluster nodes is expanded and before the synchronization of the copy data and the repair of the copy data are executed on the expanded cluster.
4. The apparatus of claim 3, wherein the second expansion unit is to:
expanding each node in the cluster to include at least 3 virtual blocks.
5. An apparatus for adding nodes to a distributed file system cluster, comprising: memory, a processor and a computer program stored on the memory and executable on the processor, the computer program, when executed by the processor, implementing the steps of the method of adding nodes to a distributed file system cluster according to any of claims 1 to 2.
6. A computer-readable storage medium, on which an information transfer implementing program is stored, which, when executed by a processor, implements the steps of the method for adding nodes to a distributed file system cluster according to any one of claims 1 to 2.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010943793.6A CN111930711B (en) | 2020-09-10 | 2020-09-10 | Method, device and equipment for adding nodes to distributed file system cluster |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010943793.6A CN111930711B (en) | 2020-09-10 | 2020-09-10 | Method, device and equipment for adding nodes to distributed file system cluster |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111930711A CN111930711A (en) | 2020-11-13 |
| CN111930711B true CN111930711B (en) | 2020-12-29 |
Family
ID=73308730
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010943793.6A Active CN111930711B (en) | 2020-09-10 | 2020-09-10 | Method, device and equipment for adding nodes to distributed file system cluster |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111930711B (en) |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US9697220B2 (en) * | 2013-12-13 | 2017-07-04 | Oracle International Corporation | System and method for supporting elastic data metadata compression in a distributed data grid |
| CN104077423B (en) * | 2014-07-23 | 2017-05-03 | 山东大学（威海） | Consistent hash based structural data storage, inquiry and migration method |
| CN106446126B (en) * | 2016-09-19 | 2021-04-20 | 哈尔滨航天恒星数据系统科技有限公司 | Mass spatial information data storage management method and storage management system |
| CN106570091B (en) * | 2016-10-20 | 2020-05-22 | 北京鲸鲨软件科技有限公司 | Method for enhancing high availability of distributed cluster file system |
| US10282115B2 (en) * | 2017-04-13 | 2019-05-07 | International Business Machines Corporation | Object synchronization in a clustered system |
| CN108846064B (en) * | 2018-06-06 | 2021-07-23 | 南京群顶科技有限公司 | Method for realizing dynamic chained storage cluster based on ceph |
| US20200117362A1 (en) * | 2018-10-15 | 2020-04-16 | Netapp, Inc. | Erasure coding content driven distribution of data blocks |
-
2020
- 2020-09-10 CN CN202010943793.6A patent/CN111930711B/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| CN111930711A (en) | 2020-11-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| EP3620905B1 (en) | Method and device for identifying osd sub-health, and data storage system | |
| CN102317923A (en) | Storage system | |
| CN110633325B (en) | Docker-based database cluster capacity expansion method and device | |
| CN104735110A (en) | Metadata management method and system | |
| CN115826876B (en) | Data writing method, system, storage hard disk, electronic device and storage medium | |
| CN107018185A (en) | The synchronous method and device of cloud storage system | |
| CN104054076A (en) | Data storage method, database storage node failure processing method and apparatus | |
| CN104461706A (en) | Method and multiprocessing unit for sharing shared global variables | |
| US7831859B2 (en) | Method for providing fault tolerance to multiple servers | |
| CN111930711B (en) | Method, device and equipment for adding nodes to distributed file system cluster | |
| CN114490524A (en) | High-performance distributed key value storage method based on master-slave copy data decoupling | |
| CN113821362B (en) | Data copying method and device | |
| CN111400098B (en) | Copy management method and device, electronic equipment and storage medium | |
| CN115563221A (en) | Data synchronization method, storage system, device and storage medium | |
| CN115705269A (en) | Data synchronization method, system, server and storage medium | |
| JP6142669B2 (en) | Data editing program, data editing apparatus, and data editing method | |
| CN112202601A (en) | Application method of two physical node mongo clusters operated in duplicate set mode | |
| Chang et al. | A generalized grid quorum strategy for k-mutual exclusion in distributed systems | |
| CN115840756B (en) | Data updating method of main and standby modulation system, equipment and medium | |
| CN112835533B (en) | Cloud storage array expansion method and device based on rack level | |
| CN118673086B (en) | Data processing method, device, electronic equipment and computer readable storage medium | |
| CN112749136B (en) | File storage method and system based on Glusteris | |
| CN117478300B (en) | Cross-chain consensus method and device based on node determination and computer equipment | |
| WO2023222113A1 (en) | Sparse parameter updating method, training node, device, and storage medium | |
| CN113486040B (en) | Data storage method, device, equipment and medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |