CN107797945A - A kind of storage system and its date storage method, device, system and equipment - Google Patents
A kind of storage system and its date storage method, device, system and equipment Download PDFInfo
- Publication number
- CN107797945A CN107797945A CN201711046083.8A CN201711046083A CN107797945A CN 107797945 A CN107797945 A CN 107797945A CN 201711046083 A CN201711046083 A CN 201711046083A CN 107797945 A CN107797945 A CN 107797945A
- Authority
- CN
- China
- Prior art keywords
- node
- caching
- data
- storage
- lower floor
- 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
- G06F12/00—Accessing, addressing or allocating within memory systems or architectures
- G06F12/02—Addressing or allocation; Relocation
- G06F12/08—Addressing or allocation; Relocation in hierarchically structured memory systems, e.g. virtual memory systems
- G06F12/0802—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches
- G06F12/0893—Caches characterised by their organisation or structure
- G06F12/0897—Caches characterised by their organisation or structure with two or more cache hierarchy levels
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/10—Providing a specific technical effect
- G06F2212/1016—Performance improvement
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2212/00—Indexing scheme relating to accessing, addressing or allocation within memory systems or architectures
- G06F2212/10—Providing a specific technical effect
- G06F2212/1041—Resource optimization
Abstract
The embodiment of the invention discloses a kind of storage system and its date storage method, device, system, equipment and computer-readable recording medium, including the write IO request that Receiving Host end is sent, and the data message in write IO request is encapsulated as a data chain structure；Data chain structure is sent into the upper strata caching of peer node, stored the data message in data chain structure so as to the upper strata caching of peer node；The first response message and the first storage address that the upper strata caching of peer node returns are received, and by the data information memory in write IO request to this node；First storage address is sent into lower floor's caching of this node, the lower floor of peer node is cached the first storage address of multiplexing so that lower floor's caching of this node sends the first storage address.The embodiment of the present invention has saved the communication link resources between node in use, and the performance of data-handling efficiency and whole storage system is improved.
Description
Technical field
The present embodiments relate to memory system technologies field, more particularly to a kind of storage system and its data storage side
Method, device, system, equipment and computer-readable recording medium.
Background technology
Under normal circumstances, the caching in storage system can be divided into write buffer, read buffer and metadata, and cache
Presence can effectively improve storage performance.At present, the application of dual control storage is more and more extensive, is stored in a kind of typical dual control
Caching is divided into upper strata caching in system to cache with lower floor, the upper strata of this node is buffered in caching in the processing procedure of IO stacks
Writing just can return after IO data, and upper strata caches and will asynchronously can write during lower floor that this node is brushed under data caches,
So as to complete the processing in cache layer.In view of Data Consistency, upper strata caching and lower floor's caching in this node all need
Data image will be write to peer node, that is, the upper strata caching of this node will be write data and be sent to the upper strata of peer node
Backed up on caching, and this node lower floor caching be also required to by this write data send to peer node lower floor caching on
Backed up, identical, which writes data, needs mirror image twice, and the communication link resources between node consume more, data-handling efficiency
It is low, so as to influence the performance of whole storage system.
Therefore, how a kind of storage system for solving above-mentioned technical problem and its date storage method, device are provided, is
System, equipment and computer-readable recording medium, which turn into those skilled in the art, to be needed to solve the problems, such as at present.
The content of the invention
The purpose of the embodiment of the present invention be to provide a kind of storage system and its date storage method, device, system, equipment and
Computer-readable recording medium, has saved the communication link resources between node in use, data-handling efficiency and whole
The performance of individual storage system is improved.
In order to solve the above technical problems, the embodiments of the invention provide a kind of date storage method of storage system, including：
The write IO request that Receiving Host end is sent, and the data message in the write IO request is encapsulated as a Data-Link
Structure；
The data chain structure is sent into the upper strata caching of peer node, cached so as to the upper strata of the peer node
Data message in the data chain structure is stored；
The first response message and the first storage address that the upper strata caching of the peer node returns are received, and is write described
Data information memory in I/O request is to this node；
First storage address is sent into lower floor's caching of described node, so that the lower floor of described node delays
Deposit and send first storage address to lower floor's caching of the peer node, the lower floor of the peer node is cached multiplexing
First storage address.
Optionally, after described data information memory to this node by the write IO request, in addition to：
The second storage address that the data message is stored in described node is obtained, and second storage address is sent out
Deliver in lower floor's caching of described node, so that lower floor's caching of described node is multiplexed second storage address.
Optionally, after described data information memory to this node by the write IO request, in addition to：
The second response message is returned to the host side.
The embodiment of the present invention provides a kind of data storage device of storage system accordingly, including：
Package module, the write IO request sent for Receiving Host end, and the data message in the write IO request is sealed
Fill as a data chain structure；
First sending module, for the data chain structure to be sent into the upper strata caching of peer node, so as to described
The upper strata caching of peer node is stored the data message in the data chain structure；
First receiving module, the upper strata for receiving the peer node cache the first response message and first returned and deposited
Store up address；
Memory module, for by data information memory to this node in the write IO request；
Second sending module, for first storage address to be sent into lower floor's caching of described node, so as to
Lower floor's caching of described node sends first storage address to lower floor's caching of the peer node, makes the opposite end
Lower floor's caching of node is multiplexed first storage address.
Optionally, in addition to acquisition module, the second storage of the data message is stored in described node for obtaining
Address；
Second sending module, it is additionally operable to send second storage address into lower floor's caching of described node, with
Lower floor's caching that toilet states this node is multiplexed second storage address.
Optionally, in addition to return module；
The memory module, it is additionally operable to trigger institute after by data information memory to this node in the write IO request
State return module；
The return module, for returning to the second response message to the host side.
The embodiments of the invention provide a kind of storage system, including the data of host side and storage system as described above
Storage device.
The embodiments of the invention provide a kind of data storage device of storage system, including：
Memory, for storing computer program；
Processor, the date storage method of storage system as described above is realized during for performing the computer program
Step.
The embodiments of the invention provide a kind of computer-readable recording medium, stored on the computer-readable recording medium
There is computer program, the computer program realizes the date storage method of storage system as described above when being executed by processor
The step of.
The embodiments of the invention provide a kind of storage system and its date storage method, device, system, equipment and computer
Readable storage medium storing program for executing, including：The write IO request that Receiving Host end is sent, and the data message in write IO request is encapsulated as one
Data chain structure；Data chain structure is sent into the upper strata caching of peer node, cached so as to the upper strata of peer node by number
Stored according to the data message in chain structure；The first response message and first for receiving the upper strata caching return of peer node is deposited
Address is stored up, and by the data information memory in write IO request to this node；First storage address is sent to the lower floor of this node
In caching, the first storage address is sent to lower floor's caching of peer node so as to lower floor's caching of this node, makes peer node
Lower floor caching multiplexing the first storage address.
The embodiment of the present invention is when carrying out the processing of write IO request, it is only necessary to which on the upper strata of this node, caching carries out a number
Cached according to action to the upper strata of peer node of mirror image, then cached by the lower floor on this node and peer node is stored into respective counts
It is believed that the first storage address of breath is sent to lower floor's caching of peer node, lower floor's caching multiplexing of peer node first storage
Address data information, so as to realize the mirror image for caching the data message in write IO request in the lower floor of peer node.Due to
Byte number shared by one storage address is far smaller than the byte number of the data message in write IO request, so the embodiment of the present invention
Carrying out reducing the occupancy to communication link resources between node during write IO request processing, saving the communication chain between node
The performance of road resource, data-handling efficiency and whole storage system is improved.
Brief description of the drawings
Technical scheme in order to illustrate the embodiments of the present invention more clearly, below will be to institute in prior art and embodiment
The accompanying drawing needed to use is 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, on the premise of not paying creative work, can also be obtained according to these accompanying drawings
Obtain other accompanying drawings.
Fig. 1 is a kind of schematic flow sheet of the date storage method of storage system provided in an embodiment of the present invention；
Fig. 2 is a kind of structural representation of the data storage device of storage system provided in an embodiment of the present invention.
Embodiment
The embodiments of the invention provide a kind of storage system and its date storage method, device, system, equipment and computer
Readable storage medium storing program for executing, the communication link resources between node, data-handling efficiency and whole storage have been saved in use
The performance of system is improved.
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 accompanying drawing, the technical scheme 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, rather than whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art
The every other embodiment obtained under the premise of creative work is not made, belongs to the scope of protection of the invention.
Fig. 1 is refer to, Fig. 1 is that a kind of flow of date storage method of storage system provided in an embodiment of the present invention is illustrated
Figure.
This method includes：
S11：The write IO request that Receiving Host end is sent, and the data message in write IO request is encapsulated as a Data-Link
Structure；
It should be noted that the data message carried in the write IO request that host side is sent generally includes multiple data blocks,
Wherein, the size of each data block is, for example, 32k, the node for the write IO request for sending Receiving Host end in the embodiment of the present invention
Referred to as this node, backup node corresponding with this node is referred to as peer node.For example, this node is first in storage system
Node, peer node are the section point in the storage system.
Specifically, this node (first node) in the embodiment of the present invention is receiving the write IO request of host side transmission
Afterwards, each data block entrained in the write IO request can be encapsulated as a data link by the upper strata caching on this node
Structure, the data message that the data chain structure can will be greater than 32k are effectively associated together, and keep the continuity of data message.
S12：Data chain structure is sent into the upper strata caching of peer node, cached so as to the upper strata of peer node by number
Stored according to the data message in chain structure；
Specifically, the data message carried in write IO request is encapsulated as one by the superstructure of this node (first node)
After data chain structure, the data chain structure is sent to the upper strata caching of peer node (section point), peer node (the second section
Point) upper strata be buffered in and receive the data chain structure after, by the data information memory in the data chain structure into the node,
And storing successfully with rear the first storage for returning to the first response message to first node, while also storing the data message
Address is back to first node.
S13：The first response message and the first storage address that the upper strata caching of peer node returns are received, and IO will be write and asked
Data information memory in asking is to this node；
It is understood that this node (first node) in the embodiment of the present invention is receiving peer node (the second section
Point) after the first response message for returning, by data information memory to this node in write IO request, namely in write IO request
Data message after section point stores successfully again by data information memory to this node in write IO request, when not connecing
When receiving the first response message of section point return, it is believed that storage failure of the data message on section point, now
By without the operation in this node data storage information, and the situation can also be fed back to host side, to ensure data
Uniformity, it is ensured that when this node failure, peer node adapter after offer service is provided, to economize on resources, and effectively
Ensure treatment effeciency.
S14：First storage address is sent into lower floor's caching of this node, cached so as to the lower floor of this node by first
Storage address, which is sent, to lower floor's caching of peer node, makes the lower floor of peer node cache the first storage address of multiplexing.
It should be noted that cached on the upper strata of this node by data information memory to this node in write IO request
Afterwards, the upper strata caching of this node is needed to cache lower brush data to lower floor, and now, the upper strata of this node is cached the upper of peer node
Brush is into lower floor's caching of this node under the first storage address that layer caching returns, and the lower floor of this node is buffered in and received
After first storage address, first storage address is sent into lower floor's caching of peer node, now need not be by data message
Send into lower floor's caching of peer node, it is only necessary to send first storage address of the data information memory in peer node
Lower floor to peer node caches, and lower floor's caching of peer node receives and is multiplexed first storage address, and passes through this
Where storage address is directly linked on the data message of node storage.Because the byte number of first storage address this information is remote
Much smaller than the byte number of data message, so the resource occupation that will substantially reduce communication link between node, improves processing speed.
It should also be noted that, after lower floor's caching the first storage address of multiplexing of peer node (section point), may be used also
To return to the 3rd response message to first node (this node), understanding lower floor's caching of peer node in time so as to first node is
It is no to receive the first storage address and be multiplexed success.
In addition, when the lower floor's caching cached for the upper strata in this node into this node brushed under data, Ke Yizhi
Connect in lower floor's caching by brush under the data message in stored, write IO request to this node, this process needs to take node
The resource of communication link between internal upper strata caching and lower floor's caching.
It should also be noted that, actual storage in first node and section point in the storage system of the embodiment of the present invention
Data message be portion, i.e., when by first node by the first of the data message of the upper strata buffer memory in section point
When storage address sends lower floor's caching into section point, lower floor's caching can be found by first storage address to be stored in
Data message in section point, namely upper strata caching in section point and lower floor's caching can be quoted and be stored in the first storage
Data message on address.
The embodiment of the present invention is when carrying out the processing of write IO request, it is only necessary to which on the upper strata of this node, caching carries out a number
Cached according to action to the upper strata of peer node of mirror image, then cached by the lower floor on this node and peer node is stored into respective counts
It is believed that the first storage address of breath is sent to lower floor's caching of peer node, lower floor's caching multiplexing of peer node first storage
Address data information, so as to realize the mirror image for caching the data message in write IO request in the lower floor of peer node.Due to
Byte number shared by one storage address is far smaller than the byte number of the data message in write IO request, so the embodiment of the present invention
Carrying out reducing the occupancy to communication link resources between node during write IO request processing, saving the communication chain between node
The performance of road resource, data-handling efficiency and whole storage system is improved.
As a specific embodiment, in the S13 of above-described embodiment by the data information memory in write IO request extremely
After this node, this method can also include：
The second storage address of data storage information in this node is obtained, and the second storage address is sent to this node
In lower floor's caching, so as to lower floor's caching second storage address of multiplexing of this node.
It should be noted that the lower floor's caching cached for the upper strata in this node into this node brushed under data
When, in addition to can be directly by lower floor's caching of brush under the data message in stored, write IO request to this node, also
It can obtain the second storage address of the data message being stored with this node in write IO request, and by second storage address
For lower brush into lower floor's caching of this node, lower floor's caching of this node can be linked to what is stored according to second storage address
Data message, namely the upper strata caching of this node and lower floor's caching of this node can be found together by second storage address
One data message.The embodiment of the present invention is by sending the second storage address, without sending corresponding data message, can improve
Disposed of in its entirety speed.
As a specific embodiment, in the S13 of above-described embodiment by the data information memory in write IO request extremely
After this node, this method can also include returning to the second response message to host side.
Specifically, after being cached on the upper strata of this node by data information memory to this node in write IO request, can be with
The second response message is returned to host side, to notify host side write IO request to handle successfully.Certainly, in write IO request processing failure
When, can also be to the information of host side return processing failure, so that host side carries out subsequent treatment.
Accordingly the embodiment of the invention also discloses a kind of data storage device of storage system, Fig. 2 is specifically refer to, is schemed
2 be a kind of structural representation of the data storage device of storage system provided in an embodiment of the present invention.In the base of above-described embodiment
On plinth：
The device includes：
Package module 1, the write IO request sent for Receiving Host end, and the data message in write IO request is encapsulated as
One data chain structure；
First sending module 2, for data chain structure to be sent into the upper strata caching of peer node, so as to peer node
Upper strata caching the data message in data chain structure is stored；
First receiving module 3, the upper strata for receiving peer node cache the first response message returned and the first storage
Address；
Memory module 4, for by data information memory to this node in write IO request；
Second sending module 5, for the first storage address to be sent into lower floor's caching of this node, so as to this node
Lower floor's caching, which sends the first storage address, to lower floor's caching of peer node deposits, lower floor's caching multiplexing first of peer node
Store up address.
Optionally, in addition to acquisition module, for obtaining the second storage address of data storage information in this node；
Second sending module 5, it is additionally operable to send the second storage address into lower floor's caching of this node, so as to this node
Lower floor caching multiplexing the second storage address.
Optionally, in addition to return module；
Memory module 4, it is additionally operable to the triggering after by data information memory to this node in write IO request and returns to module；
Module is returned to, for returning to the second response message to host side.
It should be noted that the embodiment of the present invention is when carrying out the processing of write IO request, it is only necessary on the upper strata of this node
Action to the upper strata of peer node that caching carries out a data image caches, then is cached by the lower floor on this node by opposite end
First storage address of node storage corresponding data information is sent to lower floor's caching of peer node, lower floor's caching of peer node
The first storage address data message is multiplexed, caches lower floor of the data message in write IO request in peer node so as to realize
Mirror image.It is far smaller than the byte number of the data message in write IO request, institute due to the byte number shared by the first storage address
Carrying out reducing the occupancy to communication link resources between node during write IO request processing with the embodiment of the present invention, saving section
The performance of communication link resources between point, data-handling efficiency and whole storage system is improved.
In addition, the specific introduction for the date storage method of storage system involved in the embodiment of the present invention please be joined
According to the embodiment of the above method, the application will not be repeated here.
On the basis of above-described embodiment, the embodiments of the invention provide a kind of storage system, including host side and as above
The data storage device for the storage system stated.
It should be noted that treatment effeciency is higher in use for the embodiment of the present invention, and the performance of storage system
Also it is improved.In addition, the specific introduction of the data storage device for storage system involved in the embodiment of the present invention
The embodiment of said apparatus is refer to, the application will not be repeated here.
On the basis of above-described embodiment, the embodiments of the invention provide a kind of data storage device of storage system, bag
Include：
Memory, for storing computer program；
Processor, the step of date storage method such as above-mentioned storage system is realized during for performing computer program.
It should be noted that for storage system involved in the embodiment of the present invention date storage method it is specific
Introduce, refer to above method embodiment, the application will not be repeated here.
On the basis of above-described embodiment, the embodiments of the invention provide a kind of computer-readable recording medium, computer
Computer program is stored with readable storage medium storing program for executing, the number such as above-mentioned storage system is realized when computer program is executed by processor
The step of according to storage method.
It should be noted that for storage system involved in the embodiment of the present invention date storage method it is specific
Introduce, refer to above method embodiment, the application will not be repeated here.
Each embodiment is described by the way of progressive in this specification, what each embodiment stressed be and other
The difference of embodiment, between each embodiment identical similar portion mutually referring to.For device disclosed in embodiment
For, because it is corresponded to the method disclosed in Example, so description is fairly simple, related part is said referring to method part
It is bright.
It should also be noted that, in this manual, such as first and second or the like relational terms be used merely to by
One entity or operation make a distinction with another entity or operation, and not necessarily require or imply these entities or operation
Between any this actual relation or order be present.Moreover, term " comprising ", "comprising" or its any other variant meaning
Covering including for nonexcludability, so that process, method, article or equipment including a series of elements not only include that
A little key elements, but also the other element including being not expressly set out, or also include for this process, method, article or
The intrinsic key element of equipment.In the absence of more restrictions, the key element limited by sentence "including a ...", is not arranged
Except other identical element in the process including the key element, method, article or equipment being also present.
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, the composition and step of each example are generally described 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 scheme.Specialty
Technical staff can realize described function using distinct methods to each specific application, but this realization should not
Think beyond the scope of this invention.
Directly it can 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), internal memory, read-only deposit
Reservoir (ROM), electrically programmable ROM, electrically erasable ROM, register, hard disk, moveable magnetic disc, CD-ROM or technology
In the storage medium of any other forms well known in field.
The foregoing description of the disclosed embodiments, professional and technical personnel in the field are enable to realize or using the present invention.
A variety of modifications to these embodiments will be apparent for those skilled in the art, as defined herein
General Principle can be realized in other embodiments without departing from the spirit or scope of the present invention.Therefore, it is of the invention
The embodiments shown herein is not intended to be limited to, and is to fit to and principles disclosed herein and features of novelty phase one
The most wide scope caused.
Claims (9)
- A kind of 1. date storage method of storage system, it is characterised in that including：The write IO request that Receiving Host end is sent, and the data message in the write IO request is encapsulated as a data link Structure；The data chain structure is sent into the upper strata caching of peer node, cached so as to the upper strata of the peer node by institute The data message stated in data chain structure is stored；The first response message and the first storage address that the upper strata caching of the peer node returns are received, and please by the IO that writes Data information memory in asking is to this node；First storage address is sent into lower floor's caching of described node, so that lower floor's caching of described node will First storage address is sent to lower floor's caching of the peer node, the lower floor of the peer node is cached described in multiplexing First storage address.
- 2. the date storage method of storage system according to claim 1, it is characterised in that described by the write IO request In data information memory to this node after, in addition to：Obtain the second storage address that the data message is stored in described node, and by second storage address send to In lower floor's caching of described node, so that lower floor's caching of described node is multiplexed second storage address.
- 3. the date storage method of storage system according to claim 1 or 2, it is characterised in that described to write IO by described After data information memory to this node in request, in addition to：The second response message is returned to the host side.
- A kind of 4. data storage device of storage system, it is characterised in that including：Package module, the write IO request sent for Receiving Host end, and the data message in the write IO request is encapsulated as One data chain structure；First sending module, for the data chain structure to be sent into the upper strata caching of peer node, so as to the opposite end The upper strata caching of node is stored the data message in the data chain structure；First receiving module, the upper strata for receiving the peer node cache the first response message and the first storage that return Location；Memory module, for by data information memory to this node in the write IO request；Second sending module, for first storage address to be sent into lower floor's caching of described node, so as to described Lower floor's caching of this node sends first storage address to lower floor's caching of the peer node, makes the peer node Lower floor's caching be multiplexed first storage address.
- 5. the data storage device of storage system according to claim 4, it is characterised in that also including acquisition module, use In obtaining the second storage address that the data message is stored in described node；Second sending module, it is additionally operable to send second storage address into lower floor's caching of described node, with toilet The lower floor's caching for stating this node is multiplexed second storage address.
- 6. the data storage device of the storage system according to claim 4 or 5, it is characterised in that also include returning to module；The memory module, it is additionally operable to return described in triggering after by data information memory to this node in the write IO request Return module；The return module, for returning to the second response message to the host side.
- A kind of 7. storage system, it is characterised in that the storage system including host side and as described in claim 4-6 any one Data storage device.
- A kind of 8. data storage device of storage system, it is characterised in that including：Memory, for storing computer program；Processor, the number of the storage system as described in claim 1-3 any one is realized during for performing the computer program The step of according to storage method.
- 9. a kind of computer-readable recording medium, it is characterised in that be stored with computer on the computer-readable recording medium Program, the data of the storage system as described in claim 1-3 any one are realized when the computer program is executed by processor The step of storage method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711046083.8A CN107797945A (en) | 2017-10-31 | 2017-10-31 | A kind of storage system and its date storage method, device, system and equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201711046083.8A CN107797945A (en) | 2017-10-31 | 2017-10-31 | A kind of storage system and its date storage method, device, system and equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107797945A true CN107797945A (en) | 2018-03-13 |
Family
ID=61547784
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201711046083.8A Pending CN107797945A (en) | 2017-10-31 | 2017-10-31 | A kind of storage system and its date storage method, device, system and equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107797945A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108563468A (en) * | 2018-03-30 | 2018-09-21 | 深圳市冠旭电子股份有限公司 | A kind of method, apparatus and Baffle Box of Bluetooth of Baffle Box of Bluetooth data processing |
| CN110750392A (en) * | 2019-08-31 | 2020-02-04 | 苏州浪潮智能科技有限公司 | Method, system, terminal and storage medium for improving write bandwidth of dual active slave nodes |
| CN111241036A (en) * | 2020-01-21 | 2020-06-05 | 苏州浪潮智能科技有限公司 | Asynchronous IO data processing method, device, equipment and medium |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1918551A (en) * | 2004-02-05 | 2007-02-21 | 米克伦技术公司 | Dynamic command and/or address mirroring system and method for memory modules |
| CN101689145A (en) * | 2007-03-30 | 2010-03-31 | 拉姆伯斯公司 | System including hierarchical memory modules having different types of integrated circuit memory devices |
| WO2013048497A1 (en) * | 2011-09-30 | 2013-04-04 | Intel Corporation | Apparatus and method for implementing a multi-level memory hierarchy |
| CN103577125A (en) * | 2013-11-22 | 2014-02-12 | 浪潮(北京)电子信息产业有限公司 | Cross controller group mirror image writing method and device applied to high-end disk array |
| CN103645969A (en) * | 2013-12-13 | 2014-03-19 | 华为技术有限公司 | Data replication method and data storage system |
| CN104881368A (en) * | 2015-05-07 | 2015-09-02 | 北京飞杰信息技术有限公司 | Cache synchronization method and system applied to double control storage system |
| CN105793830A (en) * | 2013-12-26 | 2016-07-20 | 英特尔公司 | Sharing memory and I/O services between nodes |
| CN106293520A (en) * | 2016-07-29 | 2017-01-04 | 浪潮(北京)电子信息产业有限公司 | A kind of processing method of I/O Request |
| CN106484311A (en) * | 2015-08-31 | 2017-03-08 | 华为数字技术（成都）有限公司 | A kind of data processing method and device |
| CN106919338A (en) * | 2015-12-24 | 2017-07-04 | 中国移动通信集团公司 | A kind of Flash suitable for software definition storage stores access processing method and system |
| CN107302770A (en) * | 2016-04-15 | 2017-10-27 | 中兴通讯股份有限公司 | A kind of data repeating method and device |
-
2017
- 2017-10-31 CN CN201711046083.8A patent/CN107797945A/en active Pending
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1918551A (en) * | 2004-02-05 | 2007-02-21 | 米克伦技术公司 | Dynamic command and/or address mirroring system and method for memory modules |
| CN101689145A (en) * | 2007-03-30 | 2010-03-31 | 拉姆伯斯公司 | System including hierarchical memory modules having different types of integrated circuit memory devices |
| WO2013048497A1 (en) * | 2011-09-30 | 2013-04-04 | Intel Corporation | Apparatus and method for implementing a multi-level memory hierarchy |
| CN103577125A (en) * | 2013-11-22 | 2014-02-12 | 浪潮(北京)电子信息产业有限公司 | Cross controller group mirror image writing method and device applied to high-end disk array |
| CN103645969A (en) * | 2013-12-13 | 2014-03-19 | 华为技术有限公司 | Data replication method and data storage system |
| CN105793830A (en) * | 2013-12-26 | 2016-07-20 | 英特尔公司 | Sharing memory and I/O services between nodes |
| CN104881368A (en) * | 2015-05-07 | 2015-09-02 | 北京飞杰信息技术有限公司 | Cache synchronization method and system applied to double control storage system |
| CN106484311A (en) * | 2015-08-31 | 2017-03-08 | 华为数字技术（成都）有限公司 | A kind of data processing method and device |
| CN106919338A (en) * | 2015-12-24 | 2017-07-04 | 中国移动通信集团公司 | A kind of Flash suitable for software definition storage stores access processing method and system |
| CN107302770A (en) * | 2016-04-15 | 2017-10-27 | 中兴通讯股份有限公司 | A kind of data repeating method and device |
| CN106293520A (en) * | 2016-07-29 | 2017-01-04 | 浪潮(北京)电子信息产业有限公司 | A kind of processing method of I/O Request |
Non-Patent Citations (2)
| Title |
|---|
| 海欣: "《数字电子技术学习及考研辅导》", 31 August 2008 * |
| 陈国龙等: "《C语言程序设计》", 31 December 2016 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108563468A (en) * | 2018-03-30 | 2018-09-21 | 深圳市冠旭电子股份有限公司 | A kind of method, apparatus and Baffle Box of Bluetooth of Baffle Box of Bluetooth data processing |
| CN108563468B (en) * | 2018-03-30 | 2021-09-21 | 深圳市冠旭电子股份有限公司 | Bluetooth sound box data processing method and device and Bluetooth sound box |
| US11199893B2 (en) | 2018-03-30 | 2021-12-14 | Shenzhen Grandsun Electronic Co., Ltd. | Method, device for processing data of bluetooth speaker, and bluetooth speaker |
| CN110750392A (en) * | 2019-08-31 | 2020-02-04 | 苏州浪潮智能科技有限公司 | Method, system, terminal and storage medium for improving write bandwidth of dual active slave nodes |
| CN111241036A (en) * | 2020-01-21 | 2020-06-05 | 苏州浪潮智能科技有限公司 | Asynchronous IO data processing method, device, equipment and medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103473150B (en) | A kind of fragment rewrite method in data deduplication system | |
| US10831741B2 (en) | Log-shipping data replication with early log record fetching | |
| US8775479B2 (en) | Method and system for state maintenance of a large object | |
| CN102053802B (en) | Network RAID (redundant array of independent disk) system | |
| CN104935648A (en) | High-cost-performance CDN system, and file pre-push and fragment buffer memory methods | |
| CN107797945A (en) | A kind of storage system and its date storage method, device, system and equipment | |
| CN101094154B (en) | Multi-master data backup different place protection system and method | |
| US20150193342A1 (en) | Storage apparatus and method of controlling the same | |
| CN106648464B (en) | Multi-node mixed block cache data reading and writing method and system based on cloud storage | |
| CN109614377A (en) | File delet method, device, equipment and the storage medium of distributed file system | |
| US9098404B2 (en) | Storage array, storage system, and data access method | |
| CN109213420A (en) | Date storage method, apparatus and system | |
| CN103116552A (en) | Method and device for distributing storage space in distributed type storage system | |
| CN106657356A (en) | Data writing method and device for cloud storage system, and cloud storage system | |
| CN110737388A (en) | Data pre-reading method, client, server and file system | |
| US20090265401A1 (en) | Method, System and Computer Program Product for Shrinking a File System | |
| CN108255429A (en) | A kind of write operation control method, system, device and computer readable storage medium | |
| CN110196818A (en) | Data cached method, buffer memory device and storage system | |
| CN102868727A (en) | Method for realizing high availability of logical volume | |
| CN104079600B (en) | File memory method, device, access client and meta data server system | |
| CN106446097A (en) | File reading method and system | |
| CN110515550A (en) | A kind of method and device thereof of the cold and hot data separating of SATA solid state hard disk | |
| CN103150268A (en) | Block-level data capture method in CDP (Continuous Data Protection) | |
| WO2018153202A1 (en) | Data caching method and apparatus | |
| CN109271367A (en) | Distributed file system multinode snapshot rollback method and system |
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: 20180313 |