CN107920129A - A kind of method, apparatus, equipment and the cloud storage system of data storage - Google Patents
A kind of method, apparatus, equipment and the cloud storage system of data storage Download PDFInfo
- Publication number
- CN107920129A CN107920129A CN201711284351.XA CN201711284351A CN107920129A CN 107920129 A CN107920129 A CN 107920129A CN 201711284351 A CN201711284351 A CN 201711284351A CN 107920129 A CN107920129 A CN 107920129A
- Authority
- CN
- China
- Prior art keywords
- memory node
- values
- node
- data
- memory
- 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]
-
- 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
- G06F3/0607—Improving or facilitating administration, e.g. storage management by facilitating the process of upgrading existing storage systems, e.g. for improving compatibility between host and storage device
-
- 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/0655—Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
-
- 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]
-
- 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/56—Provisioning of proxy services
- H04L67/561—Adding application-functional data or data for application control, e.g. adding metadata
Abstract
The invention discloses a kind of method of data storage, including：Calculate the ID values of each memory node and the ID values of each data object respectively using hash function；The ID values of the ID values of each memory node and each data object are mapped on the address space of circular ring shape respectively；Since the ID values position of each data object, the ID values of each memory node are found in described address space along preset direction；Store data into the corresponding memory node of ID values of the first memory node searched out.When this method can reduce storage device increase or exit, influence of the Data Migration to storage system overall performance, strong support is provided for the extension of storage resource in storage system, being uniformly distributed for data object between each memory node is maintained, there is efficient addressing data mechanism.The invention also discloses device, equipment, computer-readable recording medium and the cloud storage system of a kind of storage of data, above-mentioned technique effect is respectively provided with.
Description
Technical field
The present invention relates to technical field of network storage, more particularly to a kind of method of data storage；Further relate to a kind of data
Device, equipment, computer-readable recording medium and the cloud storage system of storage.
Background technology
With the development of Contemporary storage technologies, network store system has stepped into cloud era.Cloud storage system is with tradition
Distributed storage technology based on, using high-throughput network technology for rely on, on the one hand efficiently integration management network deposit
Storage resource, on the other hand externally provides friendly interface, issues easily network data storage service.Cloud storage technology welcomes
The opportunity of high speed development, while also it is faced with lot of challenges in technical elements.First, with the expansion of data message total amount, deposit
Storage system constantly must dynamically expand storage size for meet demand.This causes storage system to allow for supporting new deposit
Storage node is continuously added, while ensures data being uniformly distributed in each memory node, meets memory space and in Netowrk tape
Wide load balancing.
Therefore, how reasonably to store data into storage device, and simplified addressing process is those skilled in the art
Technical problem urgently to be resolved hurrily.
The content of the invention
The object of the present invention is to provide a kind of method of data storage, the method can realize that data object is saved in storage
Evenly distributed between point, influence when reducing storage device increase or exiting to storage system overall performance.The present invention's is another
One purpose is to provide a kind of device, equipment, computer-readable recording medium and the cloud storage system of data storage, is respectively provided with
Above-mentioned technique effect.
In order to solve the above technical problems, the present invention provides a kind of method of data storage, including：
Calculate the ID values of each memory node and the ID values of each data object respectively using hash function；
The address that the ID values of the ID values of each memory node and each data object are mapped to circular ring shape respectively is empty
Between on；
Since the ID values position of each data object, institute is found in described address space along preset direction
State the ID values of each memory node；
Store data into the corresponding memory node of ID values of the first memory node searched out.
Preferably, further include：
Update the resource utilization of the memory node；
Compare the resource utilization of the memory node and the size of threshold value；Wherein, the threshold value includes lower limit threshold
Value and upper limit threshold；
If the resource utilization of the memory node is less than the lower threshold, increase the virtual section of the memory node
Point number；
If the resource utilization of the memory node is more than the upper limit threshold, the virtual section of the memory node is reduced
Point number.
Preferably, the resource utilization for updating storage node includes：
Count the size of the address space of the memory node distribution；
The size for the address space that the memory node is distributed and the regulatory factor of memory node distribution make ratio,
Obtain the resource utilization of the memory node.
Preferably, the dummy node number of the increase memory node includes：
The solicited message for applying for dummy node is sent to main control end；
After the main control end responds the solicited message, Join functions are called to increase the dummy node of the memory node
Number.
Present invention also offers a kind of device of data storage, including：
Computing module, for calculating the ID values of each memory node and the ID values of each data object respectively using hash function；
Mapping block, for the ID values of the ID values of each memory node and each data object to be mapped to circle respectively
On the address space of annular；
Searching module, for since the ID values position of each data object, along preset direction in the circle
The ID values of each memory node are found in the address space of annular；
Memory module, for storing data into the corresponding memory node of ID values of the first memory node searched out.
Preferably, further include：
Update module, for updating the resource utilization of the memory node；
Comparison module, for the resource utilization of the memory node and the size of threshold value；Wherein, the thresholding
Value includes lower threshold and upper limit threshold；
First execution module, if the resource utilization for the memory node is less than the lower threshold, increases institute
State the dummy node number of memory node；
Second execution module, if the resource utilization for the memory node is more than the upper limit threshold, reduces institute
State the dummy node number of memory node.
Preferably, the update module includes：
Statistic submodule, the size of the address space for counting the memory node distribution；
Calculating sub module, for the size of address space and the memory node distribution for distributing the memory node
Regulatory factor makees ratio, obtains the resource utilization of the memory node.
Present invention also offers a kind of data storage device, including：
Memory, for storing computer program；
Processor, the step such as above-mentioned any one of them date storage method is realized during for performing the computer program
Suddenly.
Present invention also offers a kind of computer-readable recording medium, meter is stored with the computer-readable recording medium
Calculation machine program, realizes the step such as above-mentioned any one of them date storage method when the computer program is executed by processor
Suddenly.
Present invention also offers a kind of cloud storage system, including：
Client, for providing the interface to communicate with meta data server and memory resource pool；
The meta data server, for managing the metadata information of user data and the storage position of the user data
Put；
The memory resource pool, for preserving the user data and fault-tolerant, disaster tolerance processing being carried out to the user data.
The method of data storage provided by the present invention, including：Calculate the ID of each memory node respectively using hash function
Value and the ID values of each data object；The ID values of the ID values of each memory node and each data object are mapped to circle respectively
On the address space of annular；It is empty in described address along preset direction since the ID values position of each data object
Between the middle ID values for finding each memory node；Store data into the corresponding storage of ID values of the first memory node searched out
In node.
As it can be seen that the method for data storage provided by the present invention, sets up efficiently between data object and memory node
Mapping relations, by calculating the ID values of each memory node and the ID values of each data object；And respectively by each memory node
The ID values of ID values and each data object be mapped on the address space of circular ring shape, make the ID values of each memory node and each number
Whole address space is uniformly distributed according to the ID values of object, when the quantity of memory node and the quantity of data object reach certain
During thresholding, the address space of each memory node distribution is similar to equal, and data object is uniformly distributed between each memory node, can
Influence of the Data Migration to storage system overall performance caused by during effectively reducing storage device increase or exit, is for storage
The extension of storage resource provides strong support in system, meanwhile, maintain data object and evenly distributed between each memory node,
And there is efficient addressing data mechanism.
Device, equipment computer readable storage medium storing program for executing and the cloud storage system of data storage provided by the present invention,
With above-mentioned technique effect.
Brief description of the drawings
To describe the technical solutions in the embodiments of the present invention more clearly, below will be to institute in the prior art and embodiment
Attached drawing to be used is needed to be briefly described, it should be apparent that, drawings in the following description are only some implementations of the present invention
Example, for those of ordinary skill in the art, without creative efforts, can also obtain according to these attached drawings
Obtain other attached drawings.
The flow diagram for the method that the data that Fig. 1 is provided by the embodiment of the present invention store；
The dummy node that Fig. 2 is provided by the embodiment of the present invention distributes schematic diagram；
The schematic diagram for the device that the data that Fig. 3 is provided by the embodiment of the present invention store；
The schematic diagram for the equipment that the data that Fig. 4 is provided by the embodiment of the present invention store；
The schematic diagram for the cloud storage system that Fig. 5 is provided by the embodiment of the present invention.
Embodiment
The core of the present invention is to provide a kind of method of data storage, and the extension for storage resource in storage system provides
Strong support, keeps data object to be evenly distributed between each memory node, and has efficient addressing data mechanism.The present invention
Another core be to provide device, equipment, computer-readable recording medium and the cloud storage system of a kind of storage of data,
With above-mentioned technique effect.
To make the purpose, technical scheme and advantage of the embodiment of the present invention clearer, below in conjunction with the embodiment of the present invention
In attached drawing, the technical solution in the embodiment of the present invention is clearly and completely described, it is clear that described embodiment is
Part of the embodiment of the present invention, instead of all the embodiments.Based on the embodiments of the present invention, those of ordinary skill in the art
All other embodiments obtained without making creative work, belong to the scope of protection of the invention.
Please refer to Fig.1, the flow diagram for the method that the data that Fig. 1 is provided by the embodiment of the present invention store；With reference to this
Schematic diagram understands that the method for data storage can include：
S100：Calculate the ID values of each memory node and the ID values of each data object respectively using hash function；
S200：The ID values of the ID values of each memory node and each data object are mapped to the ground of circular ring shape respectively
Location is spatially；
Specifically, using hash function the ID values of memory node and the ID values of data object can be calculated respectively, will store
The ID values of node are mapped on the address space of circular ring shape, and the ID values of data object then are mapped to the ground of same circular ring shape
Location is spatially.
S300：Since the ID values position of each data object, along preset direction in described address space
Find the ID values of each memory node；
S400：Store data into the corresponding memory node of ID values of the first memory node searched out.
Specifically, after the ID values of each memory node and the ID values of each data object are mapped to the address space of circular ring shape, from
The position in the ID value addresses space of each data object starts, along preset direction, for example, clockwise in address
The ID values of each memory node are found in space.It is of course also possible to each storage section is found in address space counterclockwise
The ID values of point, can reach and travel through the ID values of each memory node, avoid omission.When the ID values for searching out first memory node
When, store data into the corresponding memory node of ID values of the memory node.The address space model of so each memory node
Enclose the ID values position of the upper memory node for being circular ring shape address space to the ID values position of this memory node it
Between scope.
Please refer to Fig.2, the dummy node that Fig. 2 is provided by the embodiment of the present invention distributes schematic diagram；A1, A2 distinguish in Fig. 2
For the position of the corresponding dummy nodes of memory node A, i.e. the ID values of memory node A are located at the position on circular ring shape address space；
Similarly, B1, B2 are respectively the position of the corresponding dummy nodes of memory node B, i.e., the ID values of memory node B are located at circular ring shape address
The position in space.S1 is position of the ID values of data object 1 on circular ring shape address space；S2 is that the ID values of data object 2 exist
Position on circular ring shape address space.From position S1, when finding the ID values of memory node clockwise, at this time,
The first dummy node searched out is A1, then data object 1 is stored in memory node A；From position S2, along clockwise
During the ID values of direction finding memory node, at this time, the first dummy node searched out is B2, then data object 2 is stored in storage
In node B.
In conclusion the method for data storage provided by the present invention, sets up between data object and memory node
Efficient mapping relations, by calculating the ID values of each memory node and the ID values of each data object；And respectively by each storage
The ID values of the ID values of node and each data object are mapped on the address space of circular ring shape, make each memory node ID values and
The ID values of each data object are uniformly distributed in whole address space, when the quantity of memory node and the quantity of data object reach
During certain thresholding, the address space of each memory node distribution is similar to equal, and data object uniformly divides between each memory node
Cloth, influence of the Data Migration to storage system overall performance caused by when can effectively reduce storage device increase or exit, is
The extension of storage resource provides strong support in storage system, meanwhile, it is equal between each memory node to maintain data object
Even distribution, and there is efficient addressing data mechanism.
On the basis of above-described embodiment：
As a preferred embodiment, this method further includes：
Update storage the resource utilization of node；
Compare the resource utilization of memory node and the size of threshold value；Wherein, threshold value includes lower threshold and the upper limit
Threshold value；
If the resource utilization of memory node is less than lower threshold, increase the dummy node number of memory node；
If the resource utilization of memory node is more than upper limit threshold, the dummy node number of memory node is reduced.
Specifically, due to the renewal upgrading with system memory devices, the memory node newly added often has higher
Bandwidth, the memory space of bigger.If give tacit consent to each memory node resource equity, can not in storage resource assigning process body
Performance difference between existing memory node.So estimation quantization can be carried out to the resource of each physical node, according to whole system
The resource situation of the physical node of system, is adjusted the dummy node number of physical node distribution, so that between optimizing physical node
Load balancing.After system initialization, update storage the resource utilization of node, compare the resource utilization of the memory node with
The size of threshold value, if the resource utilization of the memory node is less than lower threshold, carries out application dummy node operation, increase
The dummy node number of the memory node；If the resource utilization of the memory node is more than upper limit threshold, the storage section is reduced
The dummy node number of point.
By the preferred embodiment, can further optimize data storage procedure, improve the flexibility of storage system with can
Autgmentability, provides more flexible mechanism, it is ensured that the load of storage system storage resource for reasonable utilize of storage resource
Equilibrium, suitable for isomorphism and the storage system of isomery.
Preferably, updating storage the resource utilization of node includes：
Count the size of the address space of memory node distribution；
The size of the address space of memory node distribution and the regulatory factor of memory node distribution are made into ratio, stored
The resource utilization of node.
Specifically, can be that each physical node, that is, memory node distributes regulatory factor W, parameter W represents the money of memory node
Weights are distributed in source, can represent capacity or bandwidth of the memory node etc.；Count the address space that each memory node is distributed
Size S, parameter S can represent the storage overhead that memory node is distributed；P=S/W, represents the utilization of resources of memory node
Rate.The average of P is calculated by counting, corresponding threshold value is set according to the average.To each memory node, real-time statistics storage section
The size of the address space of point distribution, further obtains the resource utilization of memory node, so that in real time to the void of memory node
Intend number of nodes to make adjustment, further improve the load balance degree of storage resource.Furthermore, it is possible to the correlation by each memory node
Information is stored in main control end, to facilitate the theoretical average for obtaining resource utilization.
Preferably, increasing the dummy node number of memory node includes：
The solicited message for applying for dummy node is sent to main control end；
After main control end response request message, the dummy node number of Join functions increase memory node is called.
Specifically, the solicited message for applying for dummy node is sent to main control end；After main control end response request message, adjust
With Join functions, the dummy node number of the memory node is allocated again, increases appropriate number of dummy node, reaches
The purpose of storage resource load balancing.
Present invention also offers a kind of device of data storage, please refer to Fig.3, Fig. 3 is provided by the embodiment of the present invention
The schematic diagram of the device of data storage, by the schematic diagram, which can include：
Computing module 10, for calculating the ID values of each memory node and the ID of each data object respectively using hash function
Value；
Mapping block 20, for the ID values of the ID values of each memory node and each data object to be mapped to circular ring shape respectively
On address space；
Searching module 30, for since the ID values position of each data object, along preset direction in circular ring shape
The ID values of each memory node are found in address space；
Memory module 40, for storing data into the corresponding memory node of ID values of the first memory node searched out
In.
Preferably, further include：
Update module, for updating storage the resource utilization of node；
Comparison module, for comparing the resource utilization of memory node and the size of threshold value；Wherein, under threshold value includes
Limit threshold value and upper limit threshold；
First execution module, if the resource utilization for memory node is less than the lower threshold, increase storage section
The dummy node number of point；
Second execution module, if the resource utilization for memory node is more than the upper limit threshold, reduces storage section
The dummy node number of point.
Preferably, update module includes：
Statistic submodule, the size of the address space for counting memory node distribution；
Calculating sub module, for the size and the regulatory factor of memory node distribution of the address space for distributing memory node
Make ratio, obtain the resource utilization of memory node.
Present invention also offers a kind of data storage device, please refer to Fig.4, the number that Fig. 4 is provided by the embodiment of the present invention
According to the schematic diagram of the equipment of storage；Including：
Memory 1, for storing computer program；
Processor 2, for performing computer program when, realize following steps：
Calculate the ID values of each memory node and the ID values of each data object respectively using hash function；Each storage is saved respectively
The ID values of point are mapped on the address space of circular ring shape with the ID values of each data object；From the ID values position of each data object
Start, find the ID values of each memory node in address space along preset direction；Search out first is stored data into deposit
In the corresponding memory node of ID values for storing up node.
Present invention also offers a kind of computer-readable recording medium, meter is stored with the computer-readable recording medium
Calculation machine program, the computer program realize following steps when being executed by processor：
Calculate the ID values of each memory node and the ID values of each data object respectively using hash function；Each storage is saved respectively
The ID values of point are mapped on the address space of circular ring shape with the ID values of each data object；From the ID values position of each data object
Start, find the ID values of each memory node in address space along preset direction；Search out first is stored data into deposit
In the corresponding memory node of ID values for storing up node.
The computer-readable recording medium can include：USB flash disk, mobile hard disk, read-only storage (Read-Only
Memory, ROM), random access memory (Random Access Memory, RAM), magnetic disc or CD etc. are various to deposit
Store up the medium of program code.
Present invention also offers a kind of cloud storage system, refer to Fig. 5, and the cloud that Fig. 5 is provided by the embodiment of the present invention is deposited
The schematic diagram of storage system；Including：
Client, for providing the interface to communicate with meta data server and memory resource pool；
Meta data server, for managing the metadata information of user data and the deposit position of user data；
Memory resource pool, for preserving user data and fault-tolerant, disaster tolerance processing being carried out to user data.
Specifically, in order to effectively manage the storage resource of magnanimity, the present invention provides cloud storage system PB grades a kind of, bag
Include client, meta data server and memory resource pool.Wherein, client is embedded in access customer or storage application system
Portion, there is provided the application interface to communicate with meta data server and memory resource pool, is completed between client and storage system
Data interaction function.Since the system encapsulates storage application interface, meta data server and memory resource pool
Bottom architecture and working method are fully transparent to upper-layer client end so that user need not consider that the structure of bottom complexity is special
Sign, easily uses storage resource using simple interface, develops data service application.Meta data server, for managing user
The metadata information of data, and manage the deposit position and redundancy strategy of data.Meta data server provides text to user
Part interface, handles the file-level operations from client, and preserves the metadata information of key.Memory resource pool is by multiple storages
Node is formed, and is mainly used object storage technology and distributed framework, is completed the preservation of customer data, and provide the appearance of data
The functions such as mistake, disaster tolerance.
Each embodiment is described by the way of progressive in specification, and what each embodiment stressed is and other realities
Apply the difference of example, between each embodiment identical similar portion mutually referring to.For device disclosed in embodiment, set
For standby and computer-readable recording medium, since it is corresponded to the methods disclosed in the examples, so the comparison of description is simple
Single, reference may be made to the description of the method.
Professional further appreciates that, with reference to each exemplary unit 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 each exemplary composition and step according to function in the above description.These
Function is performed with hardware or software mode actually, application-specific and design constraint depending on technical solution.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.
Can directly it be held with reference to the step of method or algorithm that the embodiments described herein describes with hardware, processor
Capable software module, or the two combination are implemented.Software module can be placed in random access memory (RAM), 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.
Method, apparatus, equipment and the cloud storage system of data provided by the present invention storage have been carried out in detail above
Introduce.Specific case used herein is set forth the principle of the present invention and embodiment, the explanation of above example
It is only intended to help the method and its core concept for understanding the present invention.It should be pointed out that the ordinary skill people for the art
For member, without departing from the principle of the present invention, some improvement and modification can also be carried out to the present invention, these improve and
Modification also falls into the protection domain of the claims in the present invention.
Claims (10)
- A kind of 1. method of data storage, it is characterised in that including：Calculate the ID values of each memory node and the ID values of each data object respectively using hash function；The ID values of the ID values of each memory node and each data object are mapped on the address space of circular ring shape respectively；Since the ID values position of each data object, found along preset direction in described address space described each The ID values of memory node；Store data into the corresponding memory node of ID values of the first memory node searched out.
- 2. according to the method described in claim 1, it is characterized in that, further include：Update the resource utilization of the memory node；Compare the resource utilization of the memory node and the size of threshold value；Wherein, the threshold value include lower threshold and Upper limit threshold；If the resource utilization of the memory node is less than the lower threshold, increase the dummy node of the memory node Number；If the resource utilization of the memory node is more than the upper limit threshold, the dummy node of the memory node is reduced Number.
- 3. according to the method described in claim 2, it is characterized in that, the resource utilization for updating storage node includes：Count the size of the address space of the memory node distribution；The size for the address space that the memory node is distributed and the regulatory factor of memory node distribution make ratio, obtain The resource utilization of the memory node.
- 4. the according to the method described in claim 3, it is characterized in that, dummy node number bag of the increase memory node Include：The solicited message for applying for dummy node is sent to main control end；After the main control end responds the solicited message, Join functions are called to increase the dummy node of the memory node Number.
- A kind of 5. device of data storage, it is characterised in that including：Computing module, for calculating the ID values of each memory node and the ID values of each data object respectively using hash function；Mapping block, for the ID values of the ID values of each memory node and each data object to be mapped to circular ring shape respectively Address space on；Searching module, for since the ID values position of each data object, along preset direction in the circular ring shape Address space in find the ID values of each memory node；Memory module, for storing data into the corresponding memory node of ID values of the first memory node searched out.
- 6. device according to claim 5, it is characterised in that further include：Update module, for updating the resource utilization of the memory node；Comparison module, for the resource utilization of the memory node and the size of threshold value；Wherein, the threshold value bag Include lower threshold and upper limit threshold；First execution module, if the resource utilization for the memory node is less than the lower threshold, is deposited described in increase Store up the dummy node number of node；Second execution module, if the resource utilization for the memory node is more than the upper limit threshold, is deposited described in reduction Store up the dummy node number of node.
- 7. device according to claim 6, it is characterised in that the update module includes：Statistic submodule, the size of the address space for counting the memory node distribution；Calculating sub module, for the size of address space for distributing the memory node and the adjusting of memory node distribution The factor makees ratio, obtains the resource utilization of the memory node.
- A kind of 8. data storage device, it is characterised in that including：Memory, for storing computer program；Processor, such as Claims 1-4 any one of them date storage method is realized during for performing the computer program The step of.
- 9. a kind of computer-readable recording medium, it is characterised in that be stored with computer on the computer-readable recording medium Program, is realized such as Claims 1-4 any one of them date storage method when the computer program is executed by processor Step.
- A kind of 10. cloud storage system, it is characterised in that including：Client, for providing the interface to communicate with meta data server and memory resource pool；The meta data server, for managing the metadata information of user data and the deposit position of the user data；The memory resource pool, for preserving the user data and fault-tolerant, disaster tolerance processing being carried out to the user data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711284351.XA CN107920129A (en) | 2017-12-07 | 2017-12-07 | A kind of method, apparatus, equipment and the cloud storage system of data storage |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711284351.XA CN107920129A (en) | 2017-12-07 | 2017-12-07 | A kind of method, apparatus, equipment and the cloud storage system of data storage |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107920129A true CN107920129A (en) | 2018-04-17 |
Family
ID=61898432
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711284351.XA Pending CN107920129A (en) | 2017-12-07 | 2017-12-07 | A kind of method, apparatus, equipment and the cloud storage system of data storage |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107920129A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109146189A (en) * | 2018-08-30 | 2019-01-04 | 上海与德科技有限公司 | Increase storing information processing method, electronic equipment and computer-readable deposits medium |
| CN109272269A (en) * | 2018-08-30 | 2019-01-25 | 上海与德科技有限公司 | It deletes storing information processing method, electronic equipment and computer-readable deposits medium |
| CN111245924A (en) * | 2020-01-08 | 2020-06-05 | 北京松果电子有限公司 | Load balancing method and device and computer storage medium |
| CN113821340A (en) * | 2021-08-27 | 2021-12-21 | 济南浪潮数据技术有限公司 | Dynamic balancing method, system, terminal and storage medium of distributed system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140325088A1 (en) * | 2011-07-12 | 2014-10-30 | Hughes Network Systems, Llc | System and method for long range and short range data compression |
| CN104796496A (en) * | 2015-05-12 | 2015-07-22 | 国网智能电网研究院 | Cloud storage based load balancing calculating method |
| CN104850634A (en) * | 2015-05-22 | 2015-08-19 | 中国联合网络通信集团有限公司 | Data storage node adjustment method and system |
| CN105095103A (en) * | 2015-08-25 | 2015-11-25 | 曙光云计算技术有限公司 | Storage device management method and device used for cloud environment |
| CN106873919A (en) * | 2017-03-20 | 2017-06-20 | 郑州云海信息技术有限公司 | A kind of date storage method and device based on cloud storage system |
-
2017
- 2017-12-07 CN CN201711284351.XA patent/CN107920129A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140325088A1 (en) * | 2011-07-12 | 2014-10-30 | Hughes Network Systems, Llc | System and method for long range and short range data compression |
| CN104796496A (en) * | 2015-05-12 | 2015-07-22 | 国网智能电网研究院 | Cloud storage based load balancing calculating method |
| CN104850634A (en) * | 2015-05-22 | 2015-08-19 | 中国联合网络通信集团有限公司 | Data storage node adjustment method and system |
| CN105095103A (en) * | 2015-08-25 | 2015-11-25 | 曙光云计算技术有限公司 | Storage device management method and device used for cloud environment |
| CN106873919A (en) * | 2017-03-20 | 2017-06-20 | 郑州云海信息技术有限公司 | A kind of date storage method and device based on cloud storage system |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109146189A (en) * | 2018-08-30 | 2019-01-04 | 上海与德科技有限公司 | Increase storing information processing method, electronic equipment and computer-readable deposits medium |
| CN109272269A (en) * | 2018-08-30 | 2019-01-25 | 上海与德科技有限公司 | It deletes storing information processing method, electronic equipment and computer-readable deposits medium |
| CN111245924A (en) * | 2020-01-08 | 2020-06-05 | 北京松果电子有限公司 | Load balancing method and device and computer storage medium |
| CN113821340A (en) * | 2021-08-27 | 2021-12-21 | 济南浪潮数据技术有限公司 | Dynamic balancing method, system, terminal and storage medium of distributed system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10901796B2 (en) | Hash-based partitioning system | |
| US20200287961A1 (en) | Balancing resources in distributed computing environments | |
| US10798016B2 (en) | Policy-based scaling of network resources | |
| JP6185486B2 (en) | A method for performing load balancing in a distributed computing environment | |
| JP6190389B2 (en) | Method and system for performing computations in a distributed computing environment | |
| JP6165777B2 (en) | Computing system, computer storage memory, and computer-implemented method for automatic scaling | |
| US20180063271A1 (en) | Transparent sharding of traffic across messaging brokers | |
| US6928459B1 (en) | Plurality of file systems using weighted allocation to allocate space on one or more storage devices | |
| US20160088072A1 (en) | Balancing load across cache servers in a distributed data store | |
| US11106508B2 (en) | Elastic multi-tenant container architecture | |
| US9201896B2 (en) | Managing distributed storage quotas | |
| CN107920129A (en) | A kind of method, apparatus, equipment and the cloud storage system of data storage | |
| US20150046600A1 (en) | Method and apparatus for distributing data in hybrid cloud environment | |
| US10356150B1 (en) | Automated repartitioning of streaming data | |
| US11544226B2 (en) | Metadata control in a load-balanced distributed storage system | |
| CN104750558A (en) | Resource allocation management method and device of hierarchical quota system | |
| US11030169B1 (en) | Data re-sharding | |
| US10409648B1 (en) | Splitting processing responsibility for separately stored data partitions | |
| US10380023B2 (en) | Optimizing the management of cache memory | |
| US11093288B2 (en) | Systems and methods for cluster resource balancing in a hyper-converged infrastructure | |
| CN103918239A (en) | Load balancing method, device, system and computer readable medium | |
| KR101719116B1 (en) | Efficient resource utilization in data centers | |
| CN108228482A (en) | For managing the method and system of the buffer memory device in storage system | |
| US10558579B1 (en) | System and method for adaptive cache | |
| Hsieh et al. | The incremental load balance cloud algorithm by using dynamic data deployment |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20180417 |