CN110018800A - Group is put in order in distributed memory system selects main method, apparatus, equipment and medium - Google Patents
Group is put in order in distributed memory system selects main method, apparatus, equipment and medium Download PDFInfo
- Publication number
- CN110018800A CN110018800A CN201910295223.8A CN201910295223A CN110018800A CN 110018800 A CN110018800 A CN 110018800A CN 201910295223 A CN201910295223 A CN 201910295223A CN 110018800 A CN110018800 A CN 110018800A
- Authority
- CN
- China
- Prior art keywords
- master
- order
- group
- hard disk
- putting
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/0604—Improving or facilitating administration, e.g. storage management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0629—Configuration or reconfiguration of storage systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/067—Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Hardware Redundancy (AREA)
Abstract
This application discloses putting in order group in a kind of distributed memory system to select main method, apparatus and a kind of electronic equipment and computer readable storage medium, this method comprises: receive put in order group select main request after, all hard disks of group are put in order described in traversal；It determines that master counts least target hard disk in all hard disks, the target hard disk is determined as the master for putting in order group, and the corresponding master of the target hard disk is counted and adds one；Traverse in the distributed memory system it is all put in order group, and be followed successively by all groups of putting in order and carry out selected master operation.The application is after putting in order the selected master of group, the corresponding master of the disk is counted and adds one, determine that master counts least hard disk to count when selecting main using master, and least hard disk will be counted and be determined as master, it improves and puts in order a group harmony for master distribution, it can be avoided individual disk overloads, effectively improve the efficiency of system.
Description
Technical field
This application involves technical field of distributed memory, more specifically to being put in order in a kind of distributed memory system
Group selects main method, apparatus and a kind of electronic equipment and a kind of computer readable storage medium.
Background technique
There are two types of the strategy for saving data in distributed memory system, copy and entangling is deleted.So-called copy is i.e. by a data
N parts of duplication, and be stored on N block disk, duplicate data are saved on every piece of disk；It is so-called entangle to delete calculation is deleted by fixed entangling
A data are divided into K parts, and calculate M parts of redundancies according to K parts of data, and K+M parts of data are stored in K+M block disk by method
On, every piece of disk saves different data.
Above two Data Preservation Policy is both needed to save the data in simultaneously on muti-piece disk, and the group of muti-piece disk is collectively referred to as one
It is a to put in order group (the N block disk of replication policy is known as one and puts in order group, entangle delete the K+M block disk of strategy be also referred to as one and put in order group).Point
All disks can be divided into several according to specific storage strategy and put in order group by cloth storage system, and different puts in order a group possibility
Include identical or different hard disk.Each putting in order group has a master, and general master chooses first piece of hard disk for putting in order group.
For example put in order group and include 4 pieces of hard disks [1,2,3,4], then hard disk 1 is generally put in order to the master of group as this.
However, the default for putting in order group master select method not can guarantee be distributed on every piece of disk put in order in group this disk as master
Put in order a group number equilibrium.For example, being respectively distributed 100 on two pieces of disks of A, B puts in order group, A is 60 as the group of putting in order of master, and B makees
It is 40 for the group of putting in order of master.In the case where certain needs put in order group scene of master distributing equilibrium, such as need to delay on master
When deposit data, to will lead to buffer efficiency low for master unbalanced.
Therefore, how to solve the above problems is that those skilled in the art need to pay close attention to.
Summary of the invention
Being designed to provide of the application puts in order group in a kind of distributed memory system and selects main method, apparatus and a kind of electronics
Equipment and a kind of computer readable storage medium can guarantee to put in order a group master distributing equilibrium, avoid overloading influence efficiency.
To achieve the above object, this application provides put in order group in a kind of distributed memory system to select main method, comprising:
Receive put in order group select main request after, put in order described in traversal group all hard disks；
It determines that master counts least target hard disk in all hard disks, the target hard disk is determined as described put in order
The master of group, and the corresponding master of the target hard disk is counted and adds one；
Traverse in the distributed memory system it is all put in order group, and be followed successively by all groups of putting in order and carry out selected master
Disk operation.
Wherein, during all hard disks of group are put in order described in the traversal, further includes:
If detecting, the master is counted as zero hard disk, stops traversing, and the hard disk is directly determined as described return
Set the master of group.
Wherein, further includes:
After detecting that any hard disk breaks down, judge whether the faulty hard disk currently to break down is master；
If it is, obtaining the faulty hard disk as the target of master puts in order group, and group is put in order to the target again
Carry out the selected master operation.
Wherein, further includes:
After detecting that newly-increased hard disk addition currently puts in order group, by the master for currently putting in order all hard disks in group
It counts and resets, and group progress selected master of currently putting in order is operated again.
To achieve the above object, this application provides put in order group in a kind of distributed memory system to select master device, comprising:
Hard disk spider module, for receive put in order group select main request after, put in order described in traversal group all hard disks；
Target determination module, for determining, master counts least target hard disk in all hard disks, by the target
Hard disk is determined as the master for putting in order group, and the corresponding master of the target hard disk is counted and adds one；
Master chosen module, for traverse in the distributed memory system it is all put in order group, and be followed successively by the institute
It puts in order group and carries out selected master operation.
Wherein, further includes:
Hard disk detection module, during for putting in order all hard disks of group described in the traversal, if detecting described
Master is counted as zero hard disk, then stops traversing, and the hard disk is directly determined as the master for putting in order group.
Wherein, further includes:
Master judgment module, for after detecting that any hard disk breaks down, judging that the failure currently to break down is hard
Whether disk is master；
Again main module is selected, for if it is, obtaining the faulty hard disk as the target of master puts in order group, and again
Group progress selected master operation is put in order to the target.
Wherein, further includes:
Newly-increased detection module, for currently being put in order described in group after detecting that newly-increased hard disk addition currently puts in order group
The master of all hard disks, which counts, to reset, and operates again to group progress selected master of currently putting in order.
To achieve the above object, this application provides a kind of electronic equipment, comprising:
Memory, for storing computer program；
Processor is realized when for executing the computer program as put in order group in above-mentioned any distributed memory system
The step of selecting main method.
To achieve the above object, this application provides a kind of computer readable storage medium, the computer-readable storages
It is stored with computer program on medium, such as above-mentioned any distributed storage is realized when the computer program is executed by processor
The step of group selects main method is put in order in system.
By above scheme it is found that putting in order group in a kind of distributed memory system provided by the present application selects main method, comprising:
Receive put in order group select main request after, put in order described in traversal group all hard disks；Determine that master counts in all hard disks
The target hard disk is determined as the master for putting in order group by least target hard disk, and by the corresponding institute of the target hard disk
It states master and counts and add one；Traverse in the distributed memory system it is all put in order group, and be followed successively by it is described it is all put in order group into
The selected master operation of row.The application is after putting in order the selected master of group, the corresponding master of the disk to be counted and adds one, thus when selecting main
It is counted using master and determines that master counts least hard disk, and least hard disk will be counted and be determined as master, improved and put in order group
The harmony of master distribution can be avoided individual disk overloads, effectively improve the efficiency of system.Disclosed herein as well is one kind
Group is put in order in distributed memory system selects master device and a kind of electronic equipment and a kind of computer readable storage medium, it equally can be real
Existing above-mentioned technical effect.
It should be understood that the above general description and the following detailed description are merely exemplary, this can not be limited
Application.
Detailed description of the invention
In order to illustrate the technical solutions in the embodiments of the present application or in the prior art more clearly, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
Some embodiments of application for those of ordinary skill in the art without creative efforts, can be with
It obtains other drawings based on these drawings.
Fig. 1 is to put in order the flow chart that group selects main method in a kind of distributed memory system disclosed in the embodiment of the present application；
Fig. 2 is to put in order the flow chart that group selects main method in another kind distributed memory system disclosed in the embodiment of the present application；
Fig. 3 is to put in order the structure chart that group selects master device in a kind of distributed memory system disclosed in the embodiment of the present application；
Fig. 4 is the structure chart of a kind of electronic equipment disclosed in the embodiment of the present application；
Fig. 5 is the structure chart of another kind electronic equipment disclosed in the embodiment of the present application.
Specific embodiment
Below in conjunction with the attached drawing in the embodiment of the present application, technical solutions in the embodiments of the present application carries out clear, complete
Site preparation description, it is clear that described embodiments are only a part of embodiments of the present application, instead of all the embodiments.It is based on
Embodiment in the application, it is obtained by those of ordinary skill in the art without making creative efforts every other
Embodiment shall fall in the protection scope of this application.
In the prior art, the default for putting in order group master selects method not can guarantee this disk of putting in order in group being distributed on every piece of disk to make
A group number equilibrium is put in order for master.For example, being respectively distributed 100 on two pieces of disks of A, B puts in order group, A is as the group of putting in order of master
60, B is 40 as the group of putting in order of master.In the case where certain needs put in order group scene of master distributing equilibrium, such as need
When data cached on master, to will lead to buffer efficiency low for master unbalanced.
Therefore, the embodiment of the present application, which discloses, puts in order group in a kind of distributed memory system and selects main method, improves and puts in order
The harmony of group master distribution.
Referring to Fig. 1, the flow chart that group selects main method is put in order in a kind of distributed memory system disclosed in the embodiment of the present application,
As shown in Figure 1, comprising:
S101: receive put in order group select main request after, put in order described in traversal group all hard disks；
In the present embodiment, the system deployment stage created it is all put in order group after, receive put in order group select main request,
At this point, traversal puts in order all hard disks of group.
S102: determine that master counts least target hard disk in all hard disks, is determined as institute for the target hard disk
The master for putting in order group is stated, and the corresponding master of the target hard disk is counted and adds one；
Specifically, all hard disks that group is put in order by traversing determine that it is hard to count least target for master in all hard disks
Disk so that will count least target hard disk is chosen to be the master put in order and organized, and then the master of target hard disk is counted and adds one.It is logical
Cross differentiation master count it is selected put in order a group master, master can be made to count to greatest extent on every piece of disk almost the same, reach opposite
It is balanced.
S103: traverse in the distributed memory system it is all put in order group, and be followed successively by all put in order and group carry out
Selected master operation.
Further, all of creation put in order group after the present embodiment ergodic distribution formula storage system has been disposed, according to above-mentioned
Step S101 and S102 are followed successively by each put in order and organize a selected master, and a group choosing master is put in order in completion.
By above scheme it is found that putting in order group in a kind of distributed memory system provided by the present application selects main method, comprising:
Receive put in order group select main request after, put in order described in traversal group all hard disks；Determine that master counts in all hard disks
The target hard disk is determined as the master for putting in order group by least target hard disk, and by the corresponding institute of the target hard disk
It states master and counts and add one；Traverse in the distributed memory system it is all put in order group, and be followed successively by it is described it is all put in order group into
The selected master operation of row.The application is after putting in order the selected master of group, the corresponding master of the disk to be counted and adds one, thus when selecting main
It is counted using master and determines that master counts least hard disk, and least hard disk will be counted and be determined as master, improved and put in order group
The harmony of master distribution can be avoided individual disk overloads, effectively improve the efficiency of system.
The embodiment of the present application, which discloses, puts in order group in a kind of distributed memory system and selects main method, implements relative to upper one
Example, the present embodiment have made further instruction and optimization to technical solution.It is specific:
Referring to fig. 2, the process that group selects main method is put in order in another distributed memory system provided by the embodiments of the present application
Figure, as shown in Figure 2, comprising:
S201: receive put in order group select main request after, put in order described in traversal group all hard disks；
S202: if detecting, the master is counted as zero hard disk, stops traversing, and the hard disk is directly determined as institute
State the master for putting in order group；
In the present embodiment, in the ergodic process for putting in order all hard disks of group, if detecting, a certain hard disk master is counted as zero,
Then stop the traversal for putting in order hard disk in group, can directly be determined as the hard disk putting in order the master of group.
S203: if the hard disk that the master is counted as zero is not detected, terminate to determine in ergodic process described all hard
Master counts least target hard disk in disk, and the target hard disk is determined as the master for putting in order group, and by the target
The corresponding master of hard disk, which counts, adds one；
In addition, after completing hard disk ergodic process, determining all hard disks if the hard disk that master is counted as zero is not detected
Least target hard disk in master counting, so that target hard disk is determined as to put in order the master of group.
It is understood that during traversing all hard disks, after detecting that master is counted as zero hard disk, if still
The traversal of hard disk is so completed, determining that master counts least hard disk after ergodic process is when putting in order the master of group, it would still be possible to
Can select current count for zero hard disk as master, therefore, the present embodiment is no longer traversed, directly using the disk as putting in order
The master of group, improves and selects main effect rate.
S204: traverse in the distributed memory system it is all put in order group, and be followed successively by all put in order and group carry out
Selected master operation.
Based on any of the above embodiments, group is put in order in distributed memory system provided in this embodiment select main method
It can further include:
After detecting that any hard disk breaks down, judge whether the faulty hard disk currently to break down is master；
If it is, obtaining the faulty hard disk as the target of master puts in order group, and group is put in order to the target again
Carry out the selected master operation.
It is understood that system deployment created it is all put in order group, and for put in order group choosing it is main after, if detecting
Any hard disk breaks down, then needs to judge the type of the faulty hard disk currently to break down.If it is determined that obtaining faulty hard disk and being
Master, it is determined that faulty hard disk puts in order group as the target of master, further puts in order group to target and carries out choosing again and lead, avoid by
System function is caused to lack in master failure.In addition, if being not necessarily to select master again when faulty hard disk is not master.
Further, group is put in order in distributed memory system provided in this embodiment selects main method that can also further wrap
It includes:
After detecting that newly-increased hard disk addition currently puts in order group, by the master for currently putting in order all hard disks in group
It counts and resets, and group progress selected master of currently putting in order is operated again.
In the present embodiment, if detecting the presence of newly-increased hard disk addition currently puts in order group, such as the case where dilatation, it will work as at this time
Before put in order the masters of all hard disks in group and count and reset, and then carry out selected master operation to currently putting in order group again, effectively protect
Card currently puts in order the master distributing equilibrium of group, improves the efficiency of system.
Master device is selected to be introduced to putting in order group in a kind of distributed memory system provided by the embodiments of the present application below, under
Group is put in order in a kind of distributed memory system of text description and is selected returns in master device and a kind of above-described distributed memory system
Setting group selects main method cross-referenced.
Referring to Fig. 3, the structure chart that group selects master device is put in order in a kind of distributed memory system provided by the embodiments of the present application,
As shown in Figure 3, comprising:
Hard disk spider module 100, for receive put in order group select main request after, all hard of group is put in order described in traversal
Disk；
Target determination module 200, for determining, master counts least target hard disk in all hard disks, by the mesh
Mark hard disk is determined as the master for putting in order group, and the corresponding master of the target hard disk is counted and adds one；
Master chosen module 300, for traverse in the distributed memory system it is all put in order group, and be followed successively by described
All groups of putting in order carry out selected master operation.
Further, group is put in order in distributed memory system provided in this embodiment selects the master device can also to include:
Hard disk detection module, during for putting in order all hard disks of group described in the traversal, if detecting described
Master is counted as zero hard disk, then stops traversing, and the hard disk is directly determined as the master for putting in order group.
Further, group is put in order in distributed memory system provided in this embodiment selects the master device can also to include:
Master judgment module, for after detecting that any hard disk breaks down, judging that the failure currently to break down is hard
Whether disk is master；
Again main module is selected, for if it is, obtaining the faulty hard disk as the target of master puts in order group, and again
Group progress selected master operation is put in order to the target.
Further, group is put in order in distributed memory system provided in this embodiment selects the master device can also to include:
Newly-increased detection module, for currently being put in order described in group after detecting that newly-increased hard disk addition currently puts in order group
The master of all hard disks, which counts, to reset, and operates again to group progress selected master of currently putting in order.
Present invention also provides a kind of electronic equipment, referring to fig. 4, the knot of a kind of electronic equipment provided by the embodiments of the present application
Composition, as shown in Figure 4, comprising:
Memory 11, for storing computer program；
Any distribution provided by above-described embodiment may be implemented in processor 12 when for executing the computer program
The step of group selects main method is put in order in formula storage system.
Specifically, memory 11 includes non-volatile memory medium, built-in storage.The non-volatile memory medium is stored with
Operating system and computer-readable instruction, the built-in storage are the operating system and computer-readable in non-volatile memory medium
The operation of instruction provides environment.Processor 12 can be a central processing unit (Central in some embodiments
Processing Unit, CPU), controller, microcontroller, microprocessor or other data processing chips, mentioned for electronic equipment
For calculating and control ability.
On the basis of the above embodiments, preferably, referring to Fig. 5, the electronic equipment further include:
Input interface 13 is connected with processor 12, for obtaining computer program, parameter and the instruction of external importing, warp
The control of processor 12 is saved into memory 11.The input interface 13 can be connected with input unit, receive user and be manually entered
Parameter or instruction.The input unit can be the touch layer covered on display screen, be also possible to be arranged in terminal enclosure by
Key, trace ball or Trackpad are also possible to keyboard, Trackpad or mouse etc..
Display unit 14 is connected with processor 12, for the data of the processing of video-stream processor 12 and for showing visually
The user interface of change.The display unit 14 can be light-emitting diode display, liquid crystal display, touch-control liquid crystal display and OLED
(Organic Light-Emitting Diode, Organic Light Emitting Diode) touches device etc..
The network port 15 is connected with processor 12, for being communicatively coupled with external each terminal device.The communication connection
The used communication technology can be cable communicating technology or wireless communication technique, such as mobile high definition chained technology (MHL), general
Universal serial bus (USB), high-definition media interface (HDMI), adopting wireless fidelity technology (WiFi), Bluetooth Communication Technology, low-power consumption bluetooth
The communication technology, communication technology based on IEEE802.11s etc..
Fig. 5 illustrates only the electronic equipment with component 11-15, it will be appreciated by persons skilled in the art that Fig. 5 is shown
Structure do not constitute the restriction to electronic equipment, may include more certain than illustrating less perhaps more components or combination
Component or different component layouts.
Present invention also provides a kind of computer readable storage medium, the storage medium may include: USB flash disk, mobile hard disk,
Read-only memory (Read-Only Memory, ROM), random access memory (Random Access Memory, RAM), magnetic
The various media that can store program code such as dish or CD.Computer program, the calculating are stored on the storage medium
Machine program realizes that group is put in order in any distributed memory system provided by above-described embodiment selects main side when being executed by processor
The step of method.
The application is after putting in order the selected master of group, the corresponding master of the disk to be counted and adds one, to utilize master when selecting main
Disc gage number determines that master counts least hard disk, and will count least hard disk and be determined as master, improves and puts in order group master point
The harmony of cloth can be avoided individual disk overloads, effectively improve the efficiency of system.
Each embodiment is described in a progressive manner in specification, the highlights of each of the examples are with other realities
The difference of example is applied, the same or similar parts in each embodiment may refer to each other.For system disclosed in embodiment
Speech, since it is corresponded to the methods disclosed in the examples, so being described relatively simple, related place is referring to method part illustration
?.It should be pointed out that for those skilled in the art, under the premise of not departing from the application principle, also
Can to the application, some improvement and modification can also be carried out, these improvement and modification also fall into the protection scope of the claim of this application
It is interior.
It should also be noted that, in the present specification, relational terms such as first and second and the like be used merely to by
One entity or operation are distinguished with another entity or operation, without necessarily requiring or implying these entities or operation
Between there are any actual relationship or orders.Moreover, the terms "include", "comprise" or its any other variant meaning
Covering non-exclusive inclusion, so that the process, method, article or equipment for including a series of elements not only includes that
A little elements, but also including other elements that are not explicitly listed, or further include for this process, method, article or
The intrinsic element of equipment.In the absence of more restrictions, the element limited by sentence "including a ...", is not arranged
Except there is also other identical elements in the process, method, article or apparatus that includes the element.
Claims (10)
1. putting in order group in a kind of distributed memory system selects main method characterized by comprising
Receive put in order group select main request after, put in order described in traversal group all hard disks；
It determines in all hard disks that master counts least target hard disk, the target hard disk is determined as the group of putting in order
Master, and the corresponding master of the target hard disk is counted and adds one；
Traverse in the distributed memory system it is all put in order group, and be followed successively by all groups of putting in order and carry out selected master behaviour
Make.
2. putting in order group in distributed memory system according to claim 1 selects main method, which is characterized in that the traversal institute
During stating all hard disks for putting in order group, further includes:
If detecting, the master is counted as zero hard disk, stops traversing, and is directly determined as the hard disk described to put in order group
Master.
3. putting in order group in distributed memory system according to claim 1 selects main method, which is characterized in that further include:
After detecting that any hard disk breaks down, judge whether the faulty hard disk currently to break down is master；
If it is, obtaining the faulty hard disk as the target of master puts in order group, and a group progress is put in order to the target again
The selected master operation.
4. putting in order group in distributed memory system according to any one of claims 1 to 3 selects main method, which is characterized in that
Further include:
After detecting that newly-increased hard disk addition currently puts in order group, the master for currently putting in order all hard disks in group is counted
It resets, and group progress selected master of currently putting in order is operated again.
5. putting in order group in a kind of distributed memory system selects master device characterized by comprising
Hard disk spider module, for receive put in order group select main request after, put in order described in traversal group all hard disks；
Target determination module, for determining, master counts least target hard disk in all hard disks, by the target hard disk
It is determined as the master for putting in order group, and the corresponding master of the target hard disk is counted and adds one；
Master chosen module, for traverse in the distributed memory system it is all put in order group, and be followed successively by described all return
It sets group and carries out selected master operation.
6. putting in order group in distributed memory system according to claim 5 selects main method, which is characterized in that further include:
Hard disk detection module, during for putting in order all hard disks of group described in the traversal, if detecting the master
It is counted as zero hard disk, then stops traversing, the hard disk is directly determined as the master for putting in order group.
7. putting in order group in distributed memory system according to claim 5 selects main method, which is characterized in that further include:
Master judgment module judges that the faulty hard disk currently to break down is for after detecting that any hard disk breaks down
No is master；
Again main module is selected, for if it is, obtaining the faulty hard disk as the target of master puts in order group, and again to institute
It states target and puts in order group progress selected master operation.
8. selecting main method according to group is put in order in the described in any item distributed memory systems of claim 5 to 7, which is characterized in that
Further include:
Newly-increased detection module, for after detecting that newly-increased hard disk addition currently puts in order group, described currently put in order in group to be owned
The master of hard disk, which counts, to reset, and operates again to group progress selected master of currently putting in order.
9. a kind of electronic equipment characterized by comprising
Memory, for storing computer program；
Processor realizes the distributed memory system as described in any one of Claims 1-4 when for executing the computer program
In put in order the step of group selects main method.
10. a kind of computer readable storage medium, which is characterized in that be stored with computer on the computer readable storage medium
Program is realized as described in any one of Claims 1-4 when the computer program is executed by processor in distributed memory system
Put in order the step of group selects main method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910295223.8A CN110018800A (en) | 2019-04-12 | 2019-04-12 | Group is put in order in distributed memory system selects main method, apparatus, equipment and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910295223.8A CN110018800A (en) | 2019-04-12 | 2019-04-12 | Group is put in order in distributed memory system selects main method, apparatus, equipment and medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110018800A true CN110018800A (en) | 2019-07-16 |
Family
ID=67191245
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910295223.8A Pending CN110018800A (en) | 2019-04-12 | 2019-04-12 | Group is put in order in distributed memory system selects main method, apparatus, equipment and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110018800A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110427160A (en) * | 2019-08-09 | 2019-11-08 | 济南浪潮数据技术有限公司 | Put in order a group equalization methods and device for distribution |
| WO2024055529A1 (en) * | 2022-09-14 | 2024-03-21 | 浪潮电子信息产业股份有限公司 | Placement group member selection method and apparatus, device, and readable storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101706805A (en) * | 2009-10-30 | 2010-05-12 | 中国科学院计算技术研究所 | Method and system for storing object |
| US20160246531A1 (en) * | 2012-03-22 | 2016-08-25 | Kabushiki Kaisha Toshiba | Semiconductor memory device and driving method of the same |
| CN107817951A (en) * | 2017-10-31 | 2018-03-20 | 新华三技术有限公司 | A kind of method and device for realizing the fusion of Ceph clusters |
| CN108121510A (en) * | 2017-12-19 | 2018-06-05 | 紫光华山信息技术有限公司 | OSD choosing methods, method for writing data, device and storage system |
| CN109002259A (en) * | 2018-06-28 | 2018-12-14 | 郑州云海信息技术有限公司 | One kind putting in order hard disk distribution method, system, device and storage medium belonging to group |
| CN109189738A (en) * | 2018-09-18 | 2019-01-11 | 郑州云海信息技术有限公司 | Choosing method, the apparatus and system of main OSD in a kind of distributed file system |
| CN109558437A (en) * | 2018-11-16 | 2019-04-02 | 新华三技术有限公司成都分公司 | Main OSD method of adjustment and device |
-
2019
- 2019-04-12 CN CN201910295223.8A patent/CN110018800A/en active Pending
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101706805A (en) * | 2009-10-30 | 2010-05-12 | 中国科学院计算技术研究所 | Method and system for storing object |
| US20160246531A1 (en) * | 2012-03-22 | 2016-08-25 | Kabushiki Kaisha Toshiba | Semiconductor memory device and driving method of the same |
| CN107817951A (en) * | 2017-10-31 | 2018-03-20 | 新华三技术有限公司 | A kind of method and device for realizing the fusion of Ceph clusters |
| CN108121510A (en) * | 2017-12-19 | 2018-06-05 | 紫光华山信息技术有限公司 | OSD choosing methods, method for writing data, device and storage system |
| CN109002259A (en) * | 2018-06-28 | 2018-12-14 | 郑州云海信息技术有限公司 | One kind putting in order hard disk distribution method, system, device and storage medium belonging to group |
| CN109189738A (en) * | 2018-09-18 | 2019-01-11 | 郑州云海信息技术有限公司 | Choosing method, the apparatus and system of main OSD in a kind of distributed file system |
| CN109558437A (en) * | 2018-11-16 | 2019-04-02 | 新华三技术有限公司成都分公司 | Main OSD method of adjustment and device |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110427160A (en) * | 2019-08-09 | 2019-11-08 | 济南浪潮数据技术有限公司 | Put in order a group equalization methods and device for distribution |
| WO2024055529A1 (en) * | 2022-09-14 | 2024-03-21 | 浪潮电子信息产业股份有限公司 | Placement group member selection method and apparatus, device, and readable storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9733844B2 (en) | Data migration method, data migration apparatus, and storage device | |
| US8671263B2 (en) | Implementing optimal storage tier configurations for a workload in a dynamic storage tiering system | |
| CN105701025B (en) | A kind of method for recovering internal storage and device | |
| WO2010122674A1 (en) | Computer system and method for controlling same | |
| WO2013076795A1 (en) | Management device and management method for storage device | |
| US20080270720A1 (en) | Management device and management method | |
| US7657705B2 (en) | Method and apparatus of a RAID configuration module | |
| CN104423889A (en) | Multi-path management method and system | |
| CN105786405A (en) | Online upgrading method, device and system | |
| CN109634915A (en) | File dispositions method, Cloud Server, system and storage medium | |
| US11385828B2 (en) | Method and apparatus for calculating storage system available capacity | |
| US20130080727A1 (en) | Computer system and storage management method | |
| CN104765560A (en) | Display control method | |
| CN110018800A (en) | Group is put in order in distributed memory system selects main method, apparatus, equipment and medium | |
| CN103106045A (en) | Data migration method, system and device at host machine end | |
| CN110083272A (en) | A kind of touch localization method and relevant apparatus of infrared touch frame | |
| CN107220077A (en) | Using the management-control method and management and control devices of startup | |
| CN106547870A (en) | Point table method and device of data base | |
| CN110377215A (en) | Model display method, apparatus and terminal device | |
| CN108153454A (en) | Multiple point touching switching method, device, storage medium and terminal device | |
| US9569132B2 (en) | Path selection to read or write data | |
| CN110018944A (en) | Server sensor configuration method, system and equipment and storage medium | |
| CN109375871A (en) | A kind of log processing method, system and electronic equipment and storage medium | |
| CN106055280B (en) | A kind of metadata write-back method and electronic equipment | |
| CN104252265A (en) | Touch sensing system and method |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190716 |
|
| RJ01 | Rejection of invention patent application after publication |