CN107172222A - A kind of date storage method and device based on distributed memory system - Google Patents
A kind of date storage method and device based on distributed memory system Download PDFInfo
- Publication number
- CN107172222A CN107172222A CN201710623736.8A CN201710623736A CN107172222A CN 107172222 A CN107172222 A CN 107172222A CN 201710623736 A CN201710623736 A CN 201710623736A CN 107172222 A CN107172222 A CN 107172222A
- Authority
- CN
- China
- Prior art keywords
- storage
- allocative decision
- target data
- alternative
- allocative
- 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
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/01—Protocols
- H04L67/10—Protocols in which an application is distributed across nodes in the network
- H04L67/1097—Protocols in which an application is distributed across nodes in the network for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
Abstract
The invention discloses a kind of date storage method based on distributed memory system, this method comprises the following steps：Receive the storage request for target data that user sends；According to storage request, allocative decision set is determined；For each allocative decision in allocative decision set, if the allocative decision is defined as alternative by the allocative decision comprising node is locally stored；An alternative in alternative based on determination carries out the storage of target data.The technical scheme provided using the embodiment of the present invention, in allocative decision set, prioritizing selection contains the storage for the allocative decision progress target data that node is locally stored, the copy data of increase target data is stored in the probability that node is locally stored, so as to reduce network overhead, I/O path length is shortened, storage performance is improved.The invention also discloses a kind of data storage device based on distributed memory system, with relevant art effect.
Description
Technical field
The present invention relates to technical field of memory, more particularly to a kind of date storage method based on distributed memory system
And device.
Background technology
With the development of science and technology, distributed memory system application is more and more extensive.Distributed memory system use can expand
Data are divided into multiple data blocks by the system architecture of exhibition, are disperseed to be stored on many independent memory nodes to share storing and are born
Lotus, positions storage information, with higher reliability, availability, autgmentability and access efficiency using location server.
, typically can be by each data block in order to further improve data reliability in existing distributed memory system
Multiple copy datas be respectively stored on multiple memory nodes.It is specific to store to random by hash algorithm on which memory node
It is determined that.
This mode have the shortcomings that it is certain because copy data storage to determining on which memory node at random,
If most of copy data is all assigned on other memory nodes, it can all be produced when being stored and being accessed to copy data
Raw extra network overhead, increases I/O path length, influences the performance of storage system.
The content of the invention
It is an object of the invention to provide a kind of date storage method and device based on distributed memory system, to save net
Network expense, shortens the length of I/O path, improves the performance of storage system.
In order to solve the above technical problems, the present invention provides following technical scheme：
A kind of date storage method based on distributed memory system, including：
Receive the storage request for target data that user sends；
Asked according to the storage, determine allocative decision set；
For each allocative decision in the allocative decision set, if the allocative decision, which is included, is locally stored node,
The allocative decision is then defined as alternative；
An alternative in alternative based on determination carries out the storage of the target data.
In a kind of embodiment of the present invention, an alternative in the alternative based on determination is entered
The storage of the row target data, including：
One alternative of the storage cost minimum in the alternative based on determination carries out depositing for the target data
Storage.
In a kind of embodiment of the present invention, asked described according to the storage, determine allocative decision set
Afterwards, in addition to：
If any one allocative decision, which does not include, in the allocative decision set is locally stored node, based on described
An allocative decision in allocative decision set carries out the storage of the target data.
In a kind of embodiment of the present invention, an allocative decision based in the allocative decision set
The storage of the target data is carried out, including：
Determine the storage cost of each allocative decision in the allocative decision set；
The storage of the target data is carried out based on a minimum allocative decision of storage cost.
It is described to be asked according to the storage in a kind of embodiment of the present invention, allocative decision set is determined, is wrapped
Include：
Asked according to the storage, based on default logic storage pool, determine allocative decision set, the logic storage pool
Logical memory space be more than and be pre-assigned to the physical memory space of the user.
A kind of data storage device based on distributed memory system, including：
Request receiving module is stored, the storage for target data for receiving user's transmission is asked；
Allocative decision set determining module, for being asked according to the storage, determines allocative decision set；
Alternative determining module, for for each allocative decision in the allocative decision set, if the distribution
The allocative decision is then defined as alternative by scheme comprising node is locally stored；
Data memory module, the target data is carried out for an alternative in the alternative based on determination
Storage.
In a kind of embodiment of the present invention, the data memory module, specifically for：
One alternative of the storage cost minimum in the alternative based on determination carries out depositing for the target data
Storage.
In a kind of embodiment of the present invention, the data memory module is additionally operable to：
Asked described according to the storage, after determining allocative decision set, if appointed in the allocative decision set
One allocative decision of meaning, which does not include, is locally stored node, then is carried out based on an allocative decision in the allocative decision set
The storage of the target data.
In a kind of embodiment of the present invention, the data memory module, specifically for：
Determine the storage cost of each allocative decision in the allocative decision set；
The storage of the target data is carried out based on a minimum allocative decision of storage cost.
In a kind of embodiment of the present invention, the allocative decision set determining module, specifically for：
Asked according to the storage, based on default logic storage pool, determine allocative decision set, the logic storage pool
Logical memory space be more than and be pre-assigned to the physical memory space of the user.
The technical scheme provided using the embodiment of the present invention, receives the storage for target data that user sends first
Request, then asks according to storage, determines allocative decision set.For each allocative decision in allocative decision set, if
The allocative decision is then defined as alternative by the allocative decision comprising node is locally stored.In alternative based on determination
An alternative carry out target data storage.In allocative decision set, prioritizing selection, which contains, is locally stored node
Allocative decision carries out the storage of target data, and the copy data of increase target data is stored in the probability that node is locally stored, from
And network overhead is reduced, I/O path length is shortened, storage performance is improved.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to embodiment or existing
There is the accompanying drawing used required in technology description to be briefly described, it should be apparent that, drawings in the following description are only this
Some embodiments of invention, for those of ordinary skill in the art, on the premise of not paying creative work, can be with
Other accompanying drawings are obtained according to these accompanying drawings.
Fig. 1 is a kind of implementing procedure figure of the date storage method based on distributed memory system in the embodiment of the present invention；
Fig. 2 is allocative decision schematic diagram in the embodiment of the present invention；
Fig. 3 is logical memory space schematic diagram in the embodiment of the present invention；
Fig. 4 is a kind of structural representation of the data storage device based on distributed memory system in the embodiment of the present invention.
Embodiment
In order that those skilled in the art more fully understand the present invention program, with reference to the accompanying drawings and detailed description
The present invention is described in further detail.Obviously, described embodiment is only a part of embodiment of the invention, rather than
Whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art are not making creative work premise
Lower obtained every other embodiment, belongs to the scope of protection of the invention.
Fig. 1 is refer to, Fig. 1 is a kind of reality of the date storage method based on distributed memory system in the embodiment of the present invention
Flow chart is applied, this method comprises the following steps：
S101, the storage request for target data for receiving user's transmission.
In actual applications, user can send data write request to distributed memory system as needed.It is distributed
The data that storage system can be written into are divided into multiple data blocks, and generate the corresponding copy data of each data block.Often
The number of the corresponding copy data of individual data block can be determined according to default copy generation strategy or user instruction.For each
Data block, if the copy data of the data block has multiple, each copy data storage of the data block is deposited to different
Store up in node.In embodiments of the present invention, any one data block can be regard as target data.
Or, distributed memory system receive user for target data storage request when, by target data pair
The copy data answered is stored into corresponding memory node.
When the storage for target data for receiving user's transmission is asked, step S102 behaviour can be continued executing with
Make.
S102, according to storage ask, determine allocative decision set.
After storage request is received, asked according to the storage, it may be determined that allocative decision set.Kazakhstan can specifically be used
It is uncommon to wait random algorithm to determine one or more allocative decisions, constitute allocative decision set.Each allocative decision includes number of targets
According to the corresponding memory node of copy data.
In actual applications, multiple memory nodes are included in distributed memory system, each memory node can include many
Individual disk.Can be that each user distributes a certain size the physical memory space on each memory node in advance, that is to say, that
The physical memory space that each user can use in distributed memory system is fixed.
As shown in Figure 2 and Figure 3, dotted line frame memory space is the physical memory space for being pre-assigned to user 1, the reality
Memory space is specifically included：Disk 1, disk 2 in disk 1, the memory space of disk 2 in memory node 1, memory node 2
Memory space, disk 1, the memory space of disk 2 in memory node 3.
In the scheme that is allocated timing really, will there is remaining storage in the physical memory space for distributing to user first empty
Between disk as disk to be selected, then select the disk to be allocated in disk to be selected, constitute an allocative decision.
In an allocative decision, comprising disk need to be located at different memory nodes on.
For example, in the distributed memory system shown in Fig. 2, distributing to and there is residue in the physical memory space of user 1
The disk of memory space has the disk 1 of memory node 1, the disk 1 and disk 2 of memory node 2, the disk 2 of memory node 3.When
Preceding user 1 has the storage request for target data, it is necessary to this storage of target data progress two-pack.In this case, really
Fixed allocative decision set can be included：First allocative decision：The disk 1 of memory node 1 and the disk 1 of memory node 2；Second
Allocative decision：The disk 1 of memory node 1 and the disk 2 of memory node 2；3rd allocative decision is：The He of disk 1 of memory node 1
The disk 2 of memory node 3；4th allocative decision is：The disk 1 of memory node 2 and the disk 2 of memory node 3；5th distribution side
Case is：The disk 2 of memory node 2 and the disk 2 of memory node 3.
In one embodiment of the invention, step S102 can be following steps：
According to storage request, based on default logic storage pool, allocative decision set is determined, the logic of logic storage pool is deposited
Storage space is more than the physical memory space for being pre-assigned to user.
In the present embodiment, a logic storage pool for being used to determine allocative decision, logic storage can be pre-set
The logical memory space in pond is more than the physical memory space for being pre-assigned to user.For example, logical memory space is actual storage
The positive integer times in space, as shown in figure 3, logical memory space is twice of the physical memory space for being pre-assigned to user.
It should be noted that the size for the memory space that user can actually use is with being pre-assigned to actually depositing for user
The size for storing up space is identical.
After the storage request for target data that user sends is received, asked according to storage, based on default logic
Storage pool, determines allocative decision set.Because the logical memory space of logic storage pool is more than the reality for being pre-assigned to user
Memory space, so being asked according to storage, the number for the allocative decision determined is more than passes through physical memory space institute merely
The number of the allocative decision of determination.So it is more convenient for selecting preferably allocative decision.
Determine in step s 102 after allocative decision set, can perform step S103 operation.
S103, for each allocative decision in allocative decision set, if the allocative decision is comprising being locally stored node,
The allocative decision is then defined as alternative.
In embodiments of the present invention, the memory node that node is user's carry is locally stored.For in allocative decision set
Each allocative decision inquired about, if comprising node is locally stored, the allocative decision is defined as the allocative decision
Alternative.For example, Fig. 2 is refer to, if node is locally stored for memory node 2, then contain in allocative decision set and deposit
The allocative decision for storing up node 2 is alternative.Specifically, including the first allocative decision, the second allocative decision, the 4th distribution side
Case and the 5th allocative decision.
Determine after alternative, step S104 operation can be continued executing with.
An alternative in S104, the alternative based on determination carries out the storage of target data.
When it is determined that alternative be one when, select the alternative carry out target data storage；When it is determined that can
During the scheme at least two of choosing, one of alternative is selected to carry out the storage of target data.Carry out the storage of target data
Process is the process for being stored the corresponding copy data of target data.
In a kind of embodiment of the invention, step S104 may comprise steps of：
One alternative of the storage cost minimum in the alternative based on determination carries out the storage of target data.
In embodiments of the present invention, storage cost is when carrying out the storage of target data, using the generation of software and hardware resources
Valency.Specifically, when the copy data storage of target data is arrived into corresponding memory node, with certain I/O path length
And/or certain network overhead is produced, according to I/O path length and/or network overhead, it may be determined that corresponding storage cost.Example
Such as, corresponding storage cost can be determined according to the weighted sum of I/O path length and network overhead.Specific weight can be according to reality
Border situation is determined and adjusted, and the embodiment of the present invention is not limited.
It is determined that alternative in, the storage cost of each alternative can be calculated respectively, and select storage generation
A minimum alternative of valency, the storage of target data is carried out based on the alternative.It so can accordingly reduce network to open
Pin, reduces I/O path length.
The method provided using the embodiment of the present invention, the storage for target data that user's transmission is received first please
Ask, then asked according to storage, determine allocative decision set.For each allocative decision in allocative decision set, if should
The allocative decision is then defined as alternative by allocative decision comprising node is locally stored.In alternative based on determination
One alternative carries out the storage of target data.In allocative decision set, prioritizing selection contains point that node is locally stored
The storage of target data is carried out with scheme, the copy data of increase target data is stored in the probability that node is locally stored, so that
Network overhead is reduced, I/O path length is shortened, improves storage performance.
In one embodiment of the invention, asked in step S102 according to storage, determine after allocative decision set, go back
Comprise the following steps：
If any one allocative decision, which does not include, in allocative decision set is locally stored node, based on allocative decision
An allocative decision in set carries out the storage of target data.
In the present embodiment, it is determined that after allocative decision set, to each allocative decision in allocative decision set
Inquired about, if Query Result does not include for any one allocative decision in allocative decision set is locally stored node,
An allocative decision is then selected to carry out the storage of target data in allocative decision set.
For the present embodiment, the present invention also has some improvement, such as in another embodiment of the presently claimed invention, above-mentioned step
Suddenly it may comprise steps of：
Step 1: determining the storage cost of each allocative decision in allocative decision set；
Step 2: carrying out the storage of target data based on a minimum allocative decision of storage cost.
For ease of description, above-mentioned two step is combined and illustrated.
When it is determined that being not present in allocative decision set containing the allocative decision that node is locally stored, allocative decision is first determined
The storage cost of each allocative decision in set, obtains the minimum allocative decision of storage cost, is then based on storage cost minimum
An allocative decision carry out target data storage.It so can accordingly reduce network overhead, reduce I/O path length.
The specific determination method of storage cost will not be repeated here.
Corresponding to above method embodiment, the embodiment of the present invention additionally provides a kind of number based on distributed memory system
According to storage device, a kind of data storage device based on distributed memory system described below is based on above-described one kind
The date storage method of distributed memory system can be mutually to should refer to.
Shown in Figure 4, the device is included with lower module：
Request receiving module 201 is stored, the storage for receiving for target data is asked；
Allocative decision set determining module 202, for being asked according to storage, determines allocative decision set；
Alternative determining module 203, for for each allocative decision in allocative decision set, if the distribution side
The allocative decision is then defined as alternative by case comprising node is locally stored；
Data memory module 204, target data is carried out for an alternative in the alternative based on determination
Storage.
The device provided using the embodiment of the present invention, the storage for target data that user's transmission is received first please
Ask, then asked according to storage, determine allocative decision set.For each allocative decision in allocative decision set, if should
The allocative decision is then defined as alternative by allocative decision comprising node is locally stored.In alternative based on determination
One alternative carries out the storage of target data.In allocative decision set, prioritizing selection contains point that node is locally stored
The storage of target data is carried out with scheme, the copy data of increase target data is stored in the probability that node is locally stored, so that
Network overhead is reduced, I/O path length is shortened, improves storage performance.
In a kind of embodiment of the present invention, data memory module 204, specifically for：
One alternative of the storage cost minimum in the alternative based on determination carries out the storage of target data.
In a kind of embodiment of the present invention, data memory module 204 is additionally operable to：
After allocative decision set according to storage request, is determined, if any one distribution side in allocative decision set
Case, which does not include, is locally stored node, then the storage of target data is carried out based on an allocative decision in allocative decision set.
In a kind of embodiment of the present invention, data memory module 204, specifically for：
Determine the storage cost of each allocative decision in allocative decision set；
The storage of target data is carried out based on a minimum allocative decision of storage cost.
In a kind of embodiment of the present invention, allocative decision set determining module 202, specifically for：
According to storage request, based on default logic storage pool, allocative decision set is determined, the logic of logic storage pool is deposited
Storage space is more than the physical memory space for being pre-assigned to user.
The embodiment of each in this specification is described by the way of progressive, what each embodiment was stressed be with it is other
Between the difference of embodiment, each embodiment same or similar part mutually referring to.For being filled disclosed in embodiment
For putting, because it is corresponded to the method disclosed in Example, so description is fairly simple, related part is referring to method part
Explanation.
Professional further appreciates that, with reference to the unit of each example of the embodiments described herein description
And algorithm steps, can be realized with electronic hardware, computer software or the combination of the two, in order to clearly demonstrate hardware and
The interchangeability of software, generally describes the composition and step of each example according to function in the above description.These
Function is performed with hardware or software mode actually, depending on the application-specific and design constraint of technical scheme.Specialty
Technical staff can realize described function to each specific application using distinct methods, but this realization should not
Think beyond the scope of this invention.
Directly it can be held with reference to the step of the method or algorithm that the embodiments described herein is described with hardware, processor
Capable software module, or the two combination are implemented.Software module can be placed in random access memory (RAM), internal memory, read-only deposit
Reservoir (ROM), electrically programmable ROM, electrically erasable ROM, register, hard disk, moveable magnetic disc, CD-ROM or technology
In any other form of storage medium well known in field.
Specific case used herein is set forth to the principle and embodiment of the present invention, and above example is said
It is bright to be only intended to help and understand technical scheme and its core concept.It should be pointed out that for the common of the art
For technical staff, under the premise without departing from the principles of the invention, some improvement and modification can also be carried out to the present invention, these
Improve and modification is also fallen into the protection domain of the claims in the present invention.
Claims (10)
1. a kind of date storage method based on distributed memory system, it is characterised in that including：
Receive the storage request for target data that user sends；
Asked according to the storage, determine allocative decision set；
, will if the allocative decision, which is included, is locally stored node for each allocative decision in the allocative decision set
The allocative decision is defined as alternative；
An alternative in alternative based on determination carries out the storage of the target data.
2. according to the method described in claim 1, it is characterised in that an optional side in the alternative based on determination
Case carries out the storage of the target data, including：
One alternative of the storage cost minimum in the alternative based on determination carries out the storage of the target data.
3. according to the method described in claim 1, it is characterised in that asked described according to the storage, determine allocative decision
After set, in addition to：
If any one allocative decision, which does not include, in the allocative decision set is locally stored node, based on the distribution
An allocative decision in scheme set carries out the storage of the target data.
4. method according to claim 3 a, it is characterised in that distribution based in the allocative decision set
Scheme carries out the storage of the target data, including：
Determine the storage cost of each allocative decision in the allocative decision set；
The storage of the target data is carried out based on a minimum allocative decision of storage cost.
5. the method according to any one of Claims 1-4, it is characterised in that described to be asked according to the storage, really
Determine allocative decision set, including：
Asked according to the storage, based on default logic storage pool, determine allocative decision set, the logic storage pool is patrolled
Collect memory space and be more than the physical memory space for being pre-assigned to the user.
6. a kind of data storage device based on distributed memory system, it is characterised in that including：
Request receiving module is stored, the storage for target data for receiving user's transmission is asked；
Allocative decision set determining module, for being asked according to the storage, determines allocative decision set；
Alternative determining module, for for each allocative decision in the allocative decision set, if the allocative decision
Comprising node is locally stored, then the allocative decision is defined as alternative；
Data memory module, depositing for the target data is carried out for an alternative in the alternative based on determination
Storage.
7. device according to claim 6, it is characterised in that the data memory module, specifically for：
One alternative of the storage cost minimum in the alternative based on determination carries out the storage of the target data.
8. device according to claim 6, it is characterised in that the data memory module, is additionally operable to：
Asked described according to the storage, after determining allocative decision set, if any one in the allocative decision set
Individual allocative decision, which does not include, is locally stored node, then is carried out based on an allocative decision in the allocative decision set described
The storage of target data.
9. device according to claim 8, it is characterised in that the data memory module, specifically for：
Determine the storage cost of each allocative decision in the allocative decision set；
The storage of the target data is carried out based on a minimum allocative decision of storage cost.
10. the device according to any one of claim 6 to 9, it is characterised in that the allocative decision set determines mould
Block, specifically for：
Asked according to the storage, based on default logic storage pool, determine allocative decision set, the logic storage pool is patrolled
Collect memory space and be more than the physical memory space for being pre-assigned to the user.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710623736.8A CN107172222A (en) | 2017-07-27 | 2017-07-27 | A kind of date storage method and device based on distributed memory system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710623736.8A CN107172222A (en) | 2017-07-27 | 2017-07-27 | A kind of date storage method and device based on distributed memory system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107172222A true CN107172222A (en) | 2017-09-15 |
Family
ID=59817557
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710623736.8A Pending CN107172222A (en) | 2017-07-27 | 2017-07-27 | A kind of date storage method and device based on distributed memory system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107172222A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108696585A (en) * | 2018-05-11 | 2018-10-23 | 国网电子商务有限公司 | A kind of distributed storage method and system of data |
| CN110325958A (en) * | 2017-10-13 | 2019-10-11 | 华为技术有限公司 | Date storage method, device and computer readable storage medium in distributed block storage system |
| WO2020057282A1 (en) * | 2018-09-20 | 2020-03-26 | 华为技术有限公司 | Resource allocation method and device for hard disks in distributed storage system |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102035884A (en) * | 2010-12-03 | 2011-04-27 | 华中科技大学 | Cloud storage system and data deployment method thereof |
| CN102333103A (en) * | 2010-07-12 | 2012-01-25 | 戴元顺 | Cloud storage system |
| CN104205780A (en) * | 2014-01-23 | 2014-12-10 | 华为技术有限公司 | Data storage method and device |
| CN105068755A (en) * | 2015-07-08 | 2015-11-18 | 南京邮电大学 | Data duplicate storage method facing cloud computing content distribution network |
-
2017
- 2017-07-27 CN CN201710623736.8A patent/CN107172222A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102333103A (en) * | 2010-07-12 | 2012-01-25 | 戴元顺 | Cloud storage system |
| CN102035884A (en) * | 2010-12-03 | 2011-04-27 | 华中科技大学 | Cloud storage system and data deployment method thereof |
| CN104205780A (en) * | 2014-01-23 | 2014-12-10 | 华为技术有限公司 | Data storage method and device |
| CN105068755A (en) * | 2015-07-08 | 2015-11-18 | 南京邮电大学 | Data duplicate storage method facing cloud computing content distribution network |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110325958A (en) * | 2017-10-13 | 2019-10-11 | 华为技术有限公司 | Date storage method, device and computer readable storage medium in distributed block storage system |
| CN108696585A (en) * | 2018-05-11 | 2018-10-23 | 国网电子商务有限公司 | A kind of distributed storage method and system of data |
| WO2020057282A1 (en) * | 2018-09-20 | 2020-03-26 | 华为技术有限公司 | Resource allocation method and device for hard disks in distributed storage system |
| US11385814B2 (en) | 2018-09-20 | 2022-07-12 | Huawei Cloud Computing Technologies Co., Ltd. | Method and device for allocating resource of hard disk in distributed storage system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103870394B (en) | Based on the cache replacement policy for retaining priority | |
| US20060003823A1 (en) | Dynamic player groups for interest management in multi-character virtual environments | |
| CN110377436A (en) | Data storage access method, equipment and the device of persistence memory | |
| CN105378667B (en) | A kind of dispatching method and device of resources of virtual machine | |
| CN107276827A (en) | Qos implementation method and device in a kind of distributed memory system | |
| CN103559319B (en) | The cache synchronization method and equipment of distributed cluster file system | |
| CN106095589A (en) | Partition allocation method, device and system | |
| CN107172222A (en) | A kind of date storage method and device based on distributed memory system | |
| CN110209490A (en) | A kind of EMS memory management process and relevant device | |
| CN109408590A (en) | Expansion method, device, equipment and the storage medium of distributed data base | |
| CN103548324B (en) | Virtual machine distribution method and virtual machine distributor | |
| CN110399102A (en) | Method for writing data, device, equipment and the storage medium of distributed memory system | |
| CN108664222A (en) | A kind of block catenary system and its application process | |
| CN107368583A (en) | A kind of method and system of more cluster information inquiries | |
| CN107632791A (en) | The distribution method and system of a kind of memory space | |
| CN110377529A (en) | A kind of method, apparatus and equipment of full flash memory storage system data management | |
| CN109521943A (en) | The distribution method and Related product of cloud database instance | |
| CN106598737A (en) | Method and device for implementing hardware resource allocation | |
| CN107220184A (en) | The management method and device of a kind of LUN memory cell | |
| CN104216684B (en) | A kind of multi-core parallel concurrent system and its data processing method | |
| CN107391050A (en) | A kind of data migration method, system, device and computer-readable recording medium | |
| CN116302461A (en) | Deep learning memory allocation optimization method and system | |
| CN104965793B (en) | A kind of cloud storage data node device | |
| CN110795226A (en) | Method for processing task using computer system, electronic device and storage medium | |
| CN104715044B (en) | A kind of distributed system and its data manipulation 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: 20170915 |
|
| RJ01 | Rejection of invention patent application after publication |