CN104765575A - Information storage processing method - Google Patents
Information storage processing method Download PDFInfo
- Publication number
- CN104765575A CN104765575A CN201510197292.7A CN201510197292A CN104765575A CN 104765575 A CN104765575 A CN 104765575A CN 201510197292 A CN201510197292 A CN 201510197292A CN 104765575 A CN104765575 A CN 104765575A
- Authority
- CN
- China
- Prior art keywords
- write
- data
- storage cluster
- write request
- bufsend
- 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.)
- Granted
Links
Landscapes
- Memory System Of A Hierarchy Structure (AREA)
Abstract
The invention provides an information storage processing method. The information storage processing method comprises the steps that non-sequential read-write request addresses are mapped to a continuous actual address space, write data flush with storage cluster bars are cached and structured in a cache, physical address sequentialization write requests are aggregated or split and are organized in a memory cache area into writing requests flush with the storage cluster bars, and thus the complete bars are covered by the write requests on a storage cluster. The storage method is provided, additional read-writer expenditures caused by generation of verification data are avoided in the disc write-in process, addressing operation is effectively reduced through the sequential write-in of data, and the storage performance is improved.
Description
Technical field
The present invention relates to the network storage, particularly the large data storage handling method of one.
Background technology
In large-scale storage systems, in order to improve storage system reliability, improve IO performance and satisfying magnanimity data storage requirement, multiple storage cluster is joined together, form unified memory device, such as data scatter is stored in the different disk in cluster to ensure concurrency, and adopt redundancy check mechanism, Large Copacity and high data transmission rate can be obtained while assuring data security, for the storage system that order reads and writes data, general logarithm reportedly defeated bandwidth requirement is not harsh, but requires higher to data reliability, storage space.Even if consider that video playback, Backup and Restore etc. are to the additional demand of bandwidth, when adopting storage cluster, also there is serious waist performance, the energy dissipation that simultaneous is serious and disk loss, in order to calculation check data, data write needs extra read-write expense and time delay, reduces the handling capacity of storage cluster.On the other hand, when the data block write to storage cluster is random, disk just needs to be addressed to new Data Position, and now, random read-write transmission performance is lower than order read-write transmission performance.
Summary of the invention
For solving the problem existing for above-mentioned prior art, the present invention proposes a kind of information storage processing method, comprising:
By the read-write requests address maps of non-sequential to continuous print actual address space, in the buffer buffer memory and structure align with storage cluster stick write data, the write request ordered to physical address is polymerized or splits, become the write request of aliging with the stick of storage cluster in internal memory cache region inner tissue, on storage cluster, cover complete stick to make write request.
Preferably, what described buffer memory in the buffer structure alignd with storage cluster stick writes data, comprises the write request in employing non-volatile ram mirror memory buffer area, and comprises further:
Run the driver of an alignment write request, this program comprises receiving thread and sends thread and write request queue, wherein;
Receiving thread sends to the write request of storage cluster for monitoring and receive application program, first carry out address conversion, is converted to continuous print write request in physical space, and is joined in write request queue; Described transmission thread is used for taking out and processing write requests from write request queue when write request queue is not empty;
First, obtain the parameter of storage cluster by reading storage cluster configuration file, this parameter comprises bar block unit, member's disk number, then is multiplied by member's disk number by bar block unit, obtains bar block size, can bar block unit and member's disk number;
Write request be expressed as (buf, cnt, off), wherein buf is user's space buffer area pointer, points to the start address writing data; Cnt is the size writing data block; Off is side-play amount, is the reference position of user data write device file;
Send thread creation one and send buffer area array, be denoted as bufsend [M], wherein M be greater than 1 positive integer, the size of buffer area bufsend [i] (0≤i<M) equals the bar block size of storage cluster, is designated as STSize; Obtain the byte number filled [i] of buffer area bufsend [i] buffer memory, and free word joint number empty [i];
Send thread and first from bufsend [M], obtain free buffer district bufsend [i], if not, wait for, for bufsend [i], initial empty [i] is STSize, filled [i]=0, then by the write request in the queue of following flow processing write request:
After buffer area bufsend [i] fills up, send thread and data are wherein sent to storage cluster, write the entirety of storage cluster stick, alignment driver monitoring application program opening and shutoff operation device file, carries out scene protection and recovery; When closing application program device file, transmission thread write data to storage cluster for the last time, while the data write storage cluster in bufsend [i], record off and the cnt value of this write operation; When device file is opened again, according to off and the cnt value of record, carry out in-situ FTIR spectroelectrochemitry, then enter normal write request treatment scheme.
The present invention compared to existing technology, has the following advantages:
The present invention proposes a kind of storage means, in write disk process, avoiding the extra read-write expense produced because generating checking data, effectively reducing addressing operation by being sequentially written in of data, improve memory property.
Accompanying drawing explanation
Fig. 1 is the process flow diagram of the information storage processing method according to the embodiment of the present invention.
Embodiment
Detailed description to one or more embodiment of the present invention is hereafter provided together with the accompanying drawing of the diagram principle of the invention.Describe the present invention in conjunction with such embodiment, but the invention is not restricted to any embodiment.Scope of the present invention is only defined by the claims, and the present invention contain many substitute, amendment and equivalent.Set forth many details in the following description to provide thorough understanding of the present invention.These details are provided for exemplary purposes, and also can realize the present invention according to claims without some in these details or all details.
An aspect of of the present present invention provides a kind of information storage processing method, to improve the write performance of storage cluster in alphabetic data storage.Fig. 1 is the method flow diagram according to the embodiment of the present invention.
The present invention utilizes section mapping to carry out address conversion, by the read-write requests address maps of non-sequential to continuous print address space, to realize continuous write.Be particularly suitable for the address conversion of the chunk data in alphabetic data storage; Utilize and write optimization storage architecture based on the storage cluster of buffer memory, what buffer memory structure alignd with storage cluster stick in the buffer writes data, and then whole stick writes storage cluster, realizes writing completely storage cluster.
Write data address translation and alignment is write in data procedures, first introduce the definition of virtual address, physical address.Virtual address is the read-write requests address that application program is sent; Physical address is the actual addresses of data in storage cluster storage space.Address translation process realizes the mapping of virtual address to physical address, and the virtual address map by non-sequential (possible part order) is continuous print physical address, and records mapping relations to address translation table.After the conversion of address, write operation is completely ordered in physical address space.
It is that the write request ordered to physical address is polymerized or splits that data are write in alignment, becomes the write request of aliging with storage cluster stick in internal memory cache region inner tissue, and namely 1 write request just covers one or more complete sticks on storage cluster.In order to prevent power down from causing loss of data in buffer area, adopt the write request in non-volatile ram mirror memory buffer area.
In section of the present invention maps, realize address conversion, carry out address maps by writing in units of section of each write operation, key data structure is as follows.
1) metadata is mapped: form is (V
iStart, P
iStart, Len
i, next), describe one and map section, V
iStart, P
iStart, Len
i, next is respectively the virtual start address, physical start address section length and the neighbor mapping index of metadata that map section i, and external memory data structure is called for short metadata;
2) mapped memory region: the storage compartments mapping metadata in external memory;
3) address translation table: record index of metadata corresponding to each virtual address (index), external memory data structure.
During the conversion of address, first obtain index of metadata according to virtual address from address translation table, then obtain metadata in mapped memory region by index value, and carry out sector address conversion according to metadata.
Can from virtual section (V during the conversion of address
start, V
end) in V
startto V
end, wherein V
startfor the virtual start address of virtual section, V
iEndfor the virtual end address of virtual section, inquire about one by one according to virtual address, worst case is the virtual address of all pieces of inquiry.
In order to improve address conversion efficiency further, can consider that introducing LSM tree carries out the inquiry of mapping section.The LSM tree mapping metadata is set up, with (V in internal memory
iStart, V
iEnd, p
imeta) represent leaf node, wherein V
startfor the virtual start address of section i, V
iEndfor the virtual end address of section i, p
imetapoint to metadata (Vi
start, Pi
start, Len
i, next) pointer (reading in internal memory).
The key word of father node is the maximum key word in all subtrees, and each leaf node only comprises both keyword, represents an order section.If search value when searching to be positioned at certain section, search successfully, otherwise can by the key word of its father node, determine its adjacent sections, map and be arranged in (insert rule by mapping, virtual section can not intersect) in chained list by virtual address order from low to high.
If the virtual address section of request k is (V
kStart, V
kEnd), utilize the process of LSM tree query mapping section as follows:
1) V is searched respectively
kStart, V
kEndposition in LSM tree;
2) by V
kStart, V
kEndbetween the mapping of all existence as the mapping that will search.
Excessive in order to prevent LSM from setting, preferably can setting the maximum node number of LSM tree, just building a new LSM tree when exceeding this maximum node number, when searching, first determine that the LSM tree at place is searched according to virtual address again.
In data write request alignment, in order to realize writing completely storage cluster during alphabetic data storing, needing the driver of operation one alignment write request, mainly comprising 2 threads and 1 write request queue, 2 threads are receive and send thread respectively.
1) receiving thread: monitoring and reception application program send to the write request of storage cluster, first carry out address above mentioned conversion, are converted to continuous print write request in physical space, and are joined in write request queue.
2) thread is sent: take out and processing write requests from write request queue when write request queue is not empty.
First, need the parameter obtaining storage cluster, comprise bar block unit, member's disk number, then be multiplied by member's disk number by bar block unit, obtain bar block size.Bar block unit and member's disk number is obtained by reading storage cluster configuration file.
If write request is expressed as (buf, cnt, off), wherein buf is user's space buffer area pointer, points to the start address writing data; Cnt is the size writing data block; Off is side-play amount, is the reference position of user data write device file.
Send thread creation one and send buffer area array, be denoted as bufsend [M], wherein M be greater than 1 positive integer, the size of buffer area bufsend [i] (0≤i<M) equals the bar block size of storage cluster, is designated as STSize.
The byte number of buffer area bufsend [i] buffer memory is designated as filled [i], and free word joint number is empty [i], has filled [i]+empty [i]=STSize to set up.
Send thread from bufsend [M], first obtain free buffer district bufsend [i] (then not waiting for), for bufsend [i], initial empty [i] is STSize, filled [i]=0, then by the write request in the queue of following flow processing write request.
After buffer area bufsend [i] fills up, send thread and data wherein will be sent to storage cluster, thus achieve and the entirety of storage cluster stick is write.Owing to being continuous print all the time to the write of stick, avoid the addressing needed for random writing operations.In order to ensure application program restart data that rear bufsend [i] writes still with the stick boundary alignment of storage cluster, alignment driver needs monitoring application program opening and shutoff operation device file, carries out scene protection and recovery.
When closing application program device file, transmission thread write data to storage cluster for the last time, buffer area bufsend [i] may not fill up, therefore, while the data write storage cluster in bufsend [i], off and the cnt value recording this write operation is needed; When device file is opened again, need, according to off and the cnt value of record, to carry out in-situ FTIR spectroelectrochemitry, then enter normal write request treatment scheme.
Further, storage cluster of the present invention is under the prerequisite meeting performance requirement, and by reducing the concurrency of storage cluster, namely adopt local parallel strategy, and realize consumption reduction, its realization mainly comprises: data layout, data dispatch, cache management strategy.
Storage cluster of the present invention is made up of and N >=3 N block logic magnetic disc, forms 1 row × N column matrix.Be N number of stick by assemblage classification, each stick comprises N number of storage block, wherein 1 check block, N-1 data block.Each storage block divides multiple storage sub-block, can arrange the size of sub-block as requested, and representative value is as 4KB, 8KB, 16KB etc., and in sub-block, the logical address of data is orders.Verification sub-block is drawn by N-1 the data sub-block XOR that same stick bias internal position is identical.
Represent storage block data in storage cluster with X (i, j), wherein i represents the stick number at its place, and j represents the disk number at place, and X (i, j) is positioned on disk j, 0≤i, j<N.Check block data Check (i) in i-th stick represents, is Check (i)=X (i, N-1-i) with the pass of storage block data X (i, j).Data block data D (i, v) represents, v represents its data block sequence number (ignoring check block) in affiliated stick, 0≤i, j<N-1, with storage block data X (i, j) relation, represents by formula (1):
D(i，v)＝X(i，v)，i+v<N-1
X(i，v+1)，i+v≥N-1(1)
In order to provide suitable performance, need to divide into groups to data block, scheme is as follows: the data block of the N-1 on each stick is divided into P group, and often group comprises Q data block, wherein P >=2, Q >=1, and meets PQ=N-1.In each group, adopt parallel data addressing method, addressing unit is data sub-block, and addressing method is as follows: set group size as S
grp, the logical address LBA that p group, the i-th stick, q data block are interior, offset address is the data sub-block of off
p, i, q, offcan be expressed as
LBA
p，i，q，off＝S
Grp·(N·p+i)+off·Q+q(2)
Wherein 0≤p<P, 0≤i<N, 0≤q<Q, 0≤off<S
grp.
The data layout obtaining storage cluster of the present invention according to formula (2) has following feature: the logical address that (1) respectively organizes the identical data sub-block in bias internal address is adjacent; (2) the group precedence partition of Logic adjacent is on identical or close disk.
For realizing consumption reduction, needing the historical information according to request queue, read and write access in the distributed areas of logical space, the randomness of perception present load stream and time and space distribution characteristics thereof, thus carrying out disk scheduling.
With r=(t
arrive, t
finish, status, pos, len) and 1 read-write requests, wherein t in record request queue rq
arrive, t
finish, status, pos, len represent request arrival time of r, deadline, solicited status, initial logical address and request length respectively.Solicited status comprises wait, perform, the state such as to complete, and request length, in units of subregion, represents the parameter x of request r with r.x.
By the mapping f (r.pos) of the logical address pos to disk number j of request r, can obtain by the following method:
(1) following formula is utilized to draw group number p, the interior block q and stick i of group at this request place by pos:
p＝r.pos/S
Grp·N
q＝(r.pos)MOD Q
i＝(r.pos)MOD(S
Grp·N)/S
Grp
(2) according to block q, stick i in group number p, group, the data block data D (i, pQ+q) that pos points to is drawn;
(3) known D (i, pQ+q), obtains pos place disk j=pQ+q according to formula (1), works as i+pQ+q<N-1; Otherwise j=pQ+q+1.
To each read-write requests in request queue rq, according to the disk at its logical address place, be divided into N number of set:
S
j={ r|r ∈ rq ∧ f (r.pos)=j}, wherein 0≤j<N claims S
jfor the request set of disk j, use num
jrepresent S set
jthe number of middle element.
The time threshold t of setting disk scheduling
th, the current time in system is t, if the request in request set Sj meets following formula, then can dispatch corresponding disk j to holding state:
When needing next time to access this disk, then schedule it to running status.
In addition, alphabetic data stores based on alphabetic data access, but also comprises some random accesss, and random access can affect the energy-saving effect of storage cluster of the present invention, need take measures to filter the random access to storage cluster of the present invention.
When the disk being in halted state proceeds to running status because of miss read operation, initiatively the corresponding data of buffer memory in current cache is write this disk.Log cache is adopted to reduce the number of starts of disk, logging device can be non-volatile ram or fixed disk, for a small amount of random writing operations, can keep in the middle of logging device, after target disk proceeds to duty, then buffer memory in logging device write data syn-chronization in this disk.
According to the request set of each disk in storage cluster, drawn the data traffic DFR of disk j by following formula
jfor
If DFR
thfor postponing the flow threshold write back, to any disk j, if its flow DFR
j<DFR
th, then by the write operation of this dish, be redirected on the disk of current active, maybe will write data buffer storage to non-volatile ram, reduce disk because of a small amount of random access and carry out the number of times of State Transferring.Meanwhile, data traffic also can be used as the scheduling parameter of disk, selects for scheduling strategy.
Read request r is mapped to a grouping according to mapping f (r.pos) by the read operation of storage cluster of the present invention, and makes disk concurrent working in group, and does not need all disk concurrent workings in stick.The write operation of storage cluster of the present invention is generally based on " read-modify-write ", because under normal circumstances, storage cluster of the present invention only has a small amount of disk work.When performing write operation, need to upgrade corresponding checking data, generating new checking data needs to obtain legacy data and old checking data, and following formula can be utilized to generate new checking data.
Wherein, D
sub (k), P
subbeing respectively group bias internal position is the new data sub-block data of off, the new syndrome blocks of data of its correspondence; D '
sub (k), P '
subfor legacy data sub-block data and old syndrome blocks of data; The write data sub-block number of m to be deviation post be off,
for xor operator.Can adopt and suitable pre-read strategy, improve " read-modify-write " impact on storage cluster write performance of the present invention, as by being used for generating the legacy data of new checking data, old checking data reads in buffer memory, in advance to reduce the number of times of reading.
In sum, the present invention proposes a kind of storage means, in write disk process, avoiding the extra read-write expense produced because generating checking data, effectively reducing addressing operation by being sequentially written in of data, improve memory property.
Obviously, it should be appreciated by those skilled in the art, above-mentioned of the present invention each module or each step can realize with general computing system, they can concentrate on single computing system, or be distributed on network that multiple computing system forms, alternatively, they can realize with the executable program code of computing system, thus, they can be stored and be performed by computing system within the storage system.Like this, the present invention is not restricted to any specific hardware and software combination.
Should be understood that, above-mentioned embodiment of the present invention only for exemplary illustration or explain principle of the present invention, and is not construed as limiting the invention.Therefore, any amendment made when without departing from the spirit and scope of the present invention, equivalent replacement, improvement etc., all should be included within protection scope of the present invention.In addition, claims of the present invention be intended to contain fall into claims scope and border or this scope and border equivalents in whole change and modification.
Claims (2)
1. an information storage processing method, is characterized in that, comprising:
By the read-write requests address maps of non-sequential to continuous print actual address space, in the buffer buffer memory and structure align with storage cluster stick write data, the write request ordered to physical address is polymerized or splits, become the write request of aliging with the stick of storage cluster in internal memory cache region inner tissue, on storage cluster, cover complete stick to make write request.
2. method according to claim 1, is characterized in that, what described buffer memory in the buffer structure alignd with storage cluster stick writes data, comprises the write request in employing non-volatile ram mirror memory buffer area, and comprises further:
Run the driver of an alignment write request, this program comprises receiving thread and sends thread and write request queue, wherein;
Receiving thread sends to the write request of storage cluster for monitoring and receive application program, first carry out address conversion, is converted to continuous print write request in physical space, and is joined in write request queue; Described transmission thread is used for taking out and processing write requests from write request queue when write request queue is not empty;
First, obtain the parameter of storage cluster by reading storage cluster configuration file, this parameter comprises bar block unit, member's disk number, then is multiplied by member's disk number by bar block unit, obtains bar block size, can bar block unit and member's disk number;
Write request be expressed as (buf, cnt, off), wherein buf is user's space buffer area pointer, points to the start address writing data; Cnt is the size writing data block; Off is side-play amount, is the reference position of user data write device file;
Send thread creation one and send buffer area array, be denoted as bufsend [M], wherein M be greater than 1 positive integer, the size of buffer area bufsend [i] (0≤i<M) equals the bar block size of storage cluster, is designated as STSize; Obtain the byte number filled [i] of buffer area bufsend [i] buffer memory, and free word joint number empty [i];
Send thread and first from bufsend [M], obtain free buffer district bufsend [i], if not, wait for, for bufsend [i], initial empty [i] is STSize, filled [i]=0, then by the write request in the queue of following flow processing write request:
After buffer area bufsend [i] fills up, send thread and data are wherein sent to storage cluster, write the entirety of storage cluster stick, alignment driver monitoring application program opening and shutoff operation device file, carries out scene protection and recovery; When closing application program device file, transmission thread write data to storage cluster for the last time, while the data write storage cluster in bufsend [i], record off and the cnt value of this write operation; When device file is opened again, according to off and the cnt value of record, carry out in-situ FTIR spectroelectrochemitry, then enter normal write request treatment scheme.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510197292.7A CN104765575B (en) | 2015-04-23 | 2015-04-23 | information storage processing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510197292.7A CN104765575B (en) | 2015-04-23 | 2015-04-23 | information storage processing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104765575A true CN104765575A (en) | 2015-07-08 |
| CN104765575B CN104765575B (en) | 2017-09-15 |
Family
ID=53647439
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510197292.7A Expired - Fee Related CN104765575B (en) | 2015-04-23 | 2015-04-23 | information storage processing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104765575B (en) |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106502595A (en) * | 2016-11-11 | 2017-03-15 | 济南浪潮高新科技投资发展有限公司 | A kind of isomery storage medium data consistency method |
| CN107506156A (en) * | 2017-09-28 | 2017-12-22 | 焦点科技股份有限公司 | A kind of io optimization methods of block device |
| CN107861685A (en) * | 2017-06-20 | 2018-03-30 | 平安科技（深圳）有限公司 | Virtual disk wiring method and device, storage medium based on copy-on-write |
| CN109144963A (en) * | 2017-06-26 | 2019-01-04 | 阿里巴巴集团控股有限公司 | One kind redoing log persistence method and equipment |
| CN109426438A (en) * | 2017-08-31 | 2019-03-05 | 中国移动通信集团广东有限公司 | Real-time big data mirrored storage method and device |
| CN109542361A (en) * | 2018-12-04 | 2019-03-29 | 郑州云海信息技术有限公司 | A kind of distributed memory system file reading, system and relevant apparatus |
| CN109582235A (en) * | 2018-11-27 | 2019-04-05 | 杭州宏杉科技股份有限公司 | Manage metadata storing method and device |
| CN110209340A (en) * | 2018-02-28 | 2019-09-06 | 杭州宏杉科技股份有限公司 | A kind of access method and device of full flash-memory storage system |
| CN110795038A (en) * | 2019-10-25 | 2020-02-14 | 浪潮电子信息产业股份有限公司 | Method, device and equipment for processing modified write request and readable storage medium |
| CN110865771A (en) * | 2019-09-30 | 2020-03-06 | 潍柴动力股份有限公司 | Data storage method and device |
| CN110968253A (en) * | 2018-09-29 | 2020-04-07 | 阿里巴巴集团控股有限公司 | Data storage method, device and system |
| CN111007991A (en) * | 2015-08-13 | 2020-04-14 | 北京忆恒创源科技有限公司 | Method for separating read-write request based on NVDIMM and computer thereof |
| CN111290973A (en) * | 2020-05-11 | 2020-06-16 | 深圳市科信通信技术股份有限公司 | Data writing method and device, computer equipment and storage medium |
| CN111625482A (en) * | 2016-03-23 | 2020-09-04 | 北京忆恒创源科技有限公司 | Sequential flow detection method and device |
| CN112130765A (en) * | 2020-09-17 | 2020-12-25 | 智新控制系统有限公司 | EEPROM data reading and writing method and device |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1945537A (en) * | 2006-07-27 | 2007-04-11 | 清华大学 | Method for realizing high speed solid storage device based on storage region network |
| CN103049222A (en) * | 2012-12-28 | 2013-04-17 | 中国船舶重工集团公司第七0九研究所 | RAID5 (redundant array of independent disk 5) write IO optimization processing method |
| CN104156324A (en) * | 2014-08-11 | 2014-11-19 | 四川九成信息技术有限公司 | Program run method for embedded system |
-
2015
- 2015-04-23 CN CN201510197292.7A patent/CN104765575B/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1945537A (en) * | 2006-07-27 | 2007-04-11 | 清华大学 | Method for realizing high speed solid storage device based on storage region network |
| CN103049222A (en) * | 2012-12-28 | 2013-04-17 | 中国船舶重工集团公司第七0九研究所 | RAID5 (redundant array of independent disk 5) write IO optimization processing method |
| CN104156324A (en) * | 2014-08-11 | 2014-11-19 | 四川九成信息技术有限公司 | Program run method for embedded system |
Cited By (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111007991B (en) * | 2015-08-13 | 2024-01-26 | 北京忆恒创源科技股份有限公司 | Method for separating read-write requests based on NVDIMM and computer thereof |
| CN111007991A (en) * | 2015-08-13 | 2020-04-14 | 北京忆恒创源科技有限公司 | Method for separating read-write request based on NVDIMM and computer thereof |
| CN111625482A (en) * | 2016-03-23 | 2020-09-04 | 北京忆恒创源科技有限公司 | Sequential flow detection method and device |
| CN111625482B (en) * | 2016-03-23 | 2022-02-01 | 北京忆恒创源科技股份有限公司 | Sequential flow detection method and device |
| CN106502595A (en) * | 2016-11-11 | 2017-03-15 | 济南浪潮高新科技投资发展有限公司 | A kind of isomery storage medium data consistency method |
| CN107861685A (en) * | 2017-06-20 | 2018-03-30 | 平安科技（深圳）有限公司 | Virtual disk wiring method and device, storage medium based on copy-on-write |
| CN109144963A (en) * | 2017-06-26 | 2019-01-04 | 阿里巴巴集团控股有限公司 | One kind redoing log persistence method and equipment |
| CN109426438A (en) * | 2017-08-31 | 2019-03-05 | 中国移动通信集团广东有限公司 | Real-time big data mirrored storage method and device |
| CN109426438B (en) * | 2017-08-31 | 2021-09-21 | 中国移动通信集团广东有限公司 | Real-time big data mirror image storage method and device |
| CN107506156A (en) * | 2017-09-28 | 2017-12-22 | 焦点科技股份有限公司 | A kind of io optimization methods of block device |
| CN107506156B (en) * | 2017-09-28 | 2020-05-12 | 焦点科技股份有限公司 | Io optimization method of block device |
| CN110209340A (en) * | 2018-02-28 | 2019-09-06 | 杭州宏杉科技股份有限公司 | A kind of access method and device of full flash-memory storage system |
| CN110968253A (en) * | 2018-09-29 | 2020-04-07 | 阿里巴巴集团控股有限公司 | Data storage method, device and system |
| CN109582235A (en) * | 2018-11-27 | 2019-04-05 | 杭州宏杉科技股份有限公司 | Manage metadata storing method and device |
| CN109542361A (en) * | 2018-12-04 | 2019-03-29 | 郑州云海信息技术有限公司 | A kind of distributed memory system file reading, system and relevant apparatus |
| CN109542361B (en) * | 2018-12-04 | 2022-06-07 | 郑州云海信息技术有限公司 | Distributed storage system file reading method, system and related device |
| CN110865771A (en) * | 2019-09-30 | 2020-03-06 | 潍柴动力股份有限公司 | Data storage method and device |
| CN110865771B (en) * | 2019-09-30 | 2024-02-20 | 潍柴动力股份有限公司 | Data storage method and device |
| CN110795038A (en) * | 2019-10-25 | 2020-02-14 | 浪潮电子信息产业股份有限公司 | Method, device and equipment for processing modified write request and readable storage medium |
| CN111290973A (en) * | 2020-05-11 | 2020-06-16 | 深圳市科信通信技术股份有限公司 | Data writing method and device, computer equipment and storage medium |
| CN112130765A (en) * | 2020-09-17 | 2020-12-25 | 智新控制系统有限公司 | EEPROM data reading and writing method and device |
| CN112130765B (en) * | 2020-09-17 | 2023-05-30 | 智新控制系统有限公司 | EEPROM data reading and writing method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104765575B (en) | 2017-09-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104765575A (en) | Information storage processing method | |
| CN104765574A (en) | Data cloud storage method | |
| CN103186350B (en) | The moving method of mixing storage system and hot spot data block | |
| US9600184B2 (en) | Apparatus, system, and method for coordinating storage requests in a multi-processor/multi-thread environment | |
| US9021189B2 (en) | System and method for performing efficient processing of data stored in a storage node | |
| US9092321B2 (en) | System and method for performing efficient searches and queries in a storage node | |
| EP2271978B1 (en) | Apparatus, system, and method for converting a storage request into an append data storage command | |
| CN106775476A (en) | Mixing memory system and its management method | |
| CN109085997A (en) | Memory-efficient for nonvolatile memory continues key assignments storage | |
| US20130185532A1 (en) | Apparatus, system, and method for log storage | |
| CN106503051B (en) | A kind of greediness based on meta data category prefetches type data recovery system and restoration methods | |
| US9507705B2 (en) | Write cache sorting | |
| CN103399823B (en) | The storage means of business datum, equipment and system | |
| CN104239234B (en) | The management of a kind of local cache efficiently and reading/writing method | |
| CN110262922A (en) | Correcting and eleting codes update method and system based on copy data log | |
| CN104778100A (en) | Safe data backup method | |
| CN112632069B (en) | Hash table data storage management method, device, medium and electronic equipment | |
| US20160291881A1 (en) | Method and apparatus for improving disk array performance | |
| CN104750433A (en) | Cache design method based on SCST | |
| US20220253417A1 (en) | Database management systems for managing data with data confidence | |
| CN109375868B (en) | Data storage method, scheduling device, system, equipment and storage medium | |
| CN101859232A (en) | Variable length data memory interface | |
| CN108293027B (en) | Data streaming unit and method for operating a data streaming unit | |
| CN117806570B (en) | Online memory expansion method, device, equipment and storage medium | |
| CN106991021A (en) | The method and system of new data file are built from available data file |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| EXSB | Decision made by sipo to initiate substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170915 Termination date: 20180423 |