CN104778100A - Safe data backup method - Google Patents
Safe data backup method Download PDFInfo
- Publication number
- CN104778100A CN104778100A CN201510195741.4A CN201510195741A CN104778100A CN 104778100 A CN104778100 A CN 104778100A CN 201510195741 A CN201510195741 A CN 201510195741A CN 104778100 A CN104778100 A CN 104778100A
- Authority
- CN
- China
- Prior art keywords
- data
- block
- disk
- stick
- pos
- 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
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a safe data backup method, which comprises the following steps that memories in a storage cluster are divided into a plurality of groups, in addition, the parallel reading and writing modes are arranged in each group through parallel addressing; the disc scheduling is carried out according to historical information of the request queue, the distribution region of reading and writing access in a logic space and the time-space distribution features; the disc data flow rate is used as a parameter, and the random reading and writing filtering is realized through pre-defining a cache strategy. The invention provides a storage method, the additional reading and writing expenditure generated by check data generation is avoided in the disc write-in process, through the sequential data write-in, the addressing operation is effectively reduced, 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 method of secure backup data, comprising:
Memory partitioning in storage cluster is multiple groups, concurrent reading and concurrent writing pattern is set by parallel being addressed in each group;
Disk scheduling is carried out in the distributed areas of logical space and time and space distribution characteristics thereof according to the historical information of request queue, read and write access;
Using data in magnetic disk flow as parameter, filter random read-write by predefine cache policy.
Preferably, described memory partitioning in storage cluster is multiple groups, concurrent reading and concurrent writing pattern is set by parallel being addressed in each group, comprises further:
Storage cluster is divided into N block logic magnetic disc, form 1 row × N column matrix, be N number of stick by assemblage classification, each stick comprises N number of storage block, comprising 1 check block, N-1 data block, divides multiple storage sub-block by each storage block, in sub-block, the logical address of data is that order is arranged, and verification sub-block is drawn by N-1 the data sub-block XOR that same stick bias internal position is identical;
With X (i, j) storage block data in storage cluster are represented, wherein i represents the stick number at its place, 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 the i-th stick is X (i, N-1-i); In data block data D (i, v), v represents its data block sequence number in affiliated stick, and as i+v<N-1, D (i, v)=X (i, v), when i+v >=N-1 (1), X (i, v+1);
Divide into groups to data block according to following process: the data block of the N-1 on each stick is divided into P group, often group comprises Q data block, wherein P>=2, Q>=1, and meets PQ=N-1; In each group, adopting parallel data to address in units of data sub-block, is S by group size
grp's, the offset address in p group, the i-th stick, q data block is the logical address LBA of the data sub-block of off
p, i, q, offbe set to
LBA
p，i，q，off＝S
Grp·(N·p+i)+off·Q+q
Wherein 0≤p<P, 0≤i<N, 0≤q<Q, 0≤off<S
grp.
Preferably, the described historical information according to request queue, read and write access carry out disk scheduling in the distributed areas of logical space and time and space distribution characteristics thereof, comprise further:
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, and wherein solicited status comprises waits, execution, completion status, ask length in units of subregion;
Be mapped to disk number j by the logical address pos of request r, obtain mapping function f (r.pos) by the following method:
(1) group number p, the interior block q and stick i of group at this request place is drawn 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) utilize D (i, pQ+q), obtain pos place disk j, the i.e. j=pQ+q 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, uses num
jrepresent S set
jthe number of middle element;
If the request in request set Sj meets following formula, then can dispatch corresponding disk j to holding state:
wherein t
thfor the time threshold of disk scheduling, t is current time, when needing next time to access this disk, then schedules it to running status.
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 method for secure backup data 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 method of secure backup data, 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, and become the write request of aliging with storage cluster stick in internal memory cache region inner tissue, namely 1 write request just takes 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 r.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:
Represent current time t and S
jdifference between the deadline maximal value of the request that middle all elements is corresponding is greater than the time threshold t of disk scheduling
th,
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 (3)
1. a method for secure backup data, is characterized in that, comprising:
Memory partitioning in storage cluster is multiple groups, concurrent reading and concurrent writing pattern is set by parallel being addressed in each group;
Disk scheduling is carried out in the distributed areas of logical space and time and space distribution characteristics thereof according to the historical information of request queue, read and write access;
Using data in magnetic disk flow as parameter, filter random read-write by predefine cache policy.
2. method according to claim 1, is characterized in that, described memory partitioning in storage cluster is multiple groups, arranges concurrent reading and concurrent writing pattern, comprise further by parallel being addressed in each group:
Storage cluster is divided into N block logic magnetic disc, N be greater than 3 positive integer, form 1 row × N column matrix, be N number of stick by assemblage classification, each stick comprises N number of storage block, comprising 1 check block, N-1 data block, each storage block is divided multiple storage sub-block, and in sub-block, the logical address of data is that order is arranged, and verification sub-block is drawn by N-1 the data sub-block XOR that same stick bias internal position is identical;
With X (i, j) storage block data in storage cluster are represented, wherein i represents the stick number at its place, 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 the i-th stick is X (i, N-1-i); Data in the data block being i by stick number are expressed as D (i, v), wherein v represents its data block sequence number in affiliated stick, and as i+v<N-1, D (i, v)=X (i, v), when i+v >=N-1 (1), X (i, v+1);
Divide into groups to data block according to following process: the data block of the N-1 on each stick is divided into P group, often group comprises Q data block, wherein P>=2, Q>=1, and meets PQ=N-1; In each group, adopting parallel data to address in units of data sub-block, is S by group size
grpp group, the i-th stick, offset address in q data block be the logical address LBA of the data sub-block of off
p, i, q, offbe set to:
LBA
p，i，q，off＝S
Grp·(N·p+i)+off·Q+q
Wherein 0≤p<P, 0≤i<N, 0≤q<Q, 0≤off<S
grp.
3. method according to claim 2, is characterized in that, the described historical information according to request queue, read and write access carry out disk scheduling in the distributed areas of logical space and time and space distribution characteristics thereof, comprise further:
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, and wherein solicited status comprises wait, execution, completion status, and described request length is in units of subregion;
Be mapped to disk number j by the logical address r.pos of request r, obtain mapping function f (r.pos) by the following method:
(1) group number p, the interior block q and stick i of group at this request place is drawn by pos:
p＝r.pos/(S
Grp·N)
q＝(r.pos)MODQ
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) utilize D (i, pQ+q), obtain pos place disk j, the i.e. j=pQ+q 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 S set:
S
j={ r|r ∈ rq ∧ f (r.pos)=j}, wherein 0≤j<N, uses num
jrepresent S set
jthe number of middle element;
If request set S
jin request meet: current time t and S
jdifference between the deadline maximal value of the request that middle all elements is corresponding is greater than the time threshold t of disk scheduling
th,
Then can dispatch corresponding disk j to holding state, when needing next time to access this disk, then schedule it to running status.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510195741.4A CN104778100A (en) | 2015-04-23 | 2015-04-23 | Safe data backup method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510195741.4A CN104778100A (en) | 2015-04-23 | 2015-04-23 | Safe data backup method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN104778100A true CN104778100A (en) | 2015-07-15 |
Family
ID=53619581
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510195741.4A Pending CN104778100A (en) | 2015-04-23 | 2015-04-23 | Safe data backup method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104778100A (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105204785A (en) * | 2015-10-15 | 2015-12-30 | 中国科学技术大学 | Disk array writemode selecting method based on I/O queue of disk |
| CN106951350A (en) * | 2017-03-30 | 2017-07-14 | 努比亚技术有限公司 | The inspection method and device of a kind of mobile terminal disk |
| CN110110004A (en) * | 2018-01-30 | 2019-08-09 | 腾讯科技（深圳）有限公司 | A kind of data manipulation method, device and storage medium |
| CN111782135A (en) * | 2019-06-14 | 2020-10-16 | 北京京东尚科信息技术有限公司 | Data storage method, system, data node and computer readable storage medium |
| CN117112455A (en) * | 2023-10-24 | 2023-11-24 | 苏州元脑智能科技有限公司 | Space address conversion method and device, computer equipment and storage medium |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001306266A (en) * | 2000-04-18 | 2001-11-02 | Oki Electric Ind Co Ltd | Method for protecting data in hard disk and computer system |
| CN102521068A (en) * | 2011-11-08 | 2012-06-27 | 华中科技大学 | Reconstructing method of solid-state disk array |
| CN103049222A (en) * | 2012-12-28 | 2013-04-17 | 中国船舶重工集团公司第七0九研究所 | RAID5 (redundant array of independent disk 5) write IO optimization processing method |
-
2015
- 2015-04-23 CN CN201510195741.4A patent/CN104778100A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2001306266A (en) * | 2000-04-18 | 2001-11-02 | Oki Electric Ind Co Ltd | Method for protecting data in hard disk and computer system |
| CN102521068A (en) * | 2011-11-08 | 2012-06-27 | 华中科技大学 | Reconstructing method of solid-state disk array |
| CN103049222A (en) * | 2012-12-28 | 2013-04-17 | 中国船舶重工集团公司第七0九研究所 | RAID5 (redundant array of independent disk 5) write IO optimization processing method |
Non-Patent Citations (1)
| Title |
|---|
| 李元章，孙志卓，马忠梅，郑军，谭毓安: "S-RAID5：一种适用于顺序数据访问的节能磁盘阵列", 《计算机学报》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105204785A (en) * | 2015-10-15 | 2015-12-30 | 中国科学技术大学 | Disk array writemode selecting method based on I/O queue of disk |
| CN105204785B (en) * | 2015-10-15 | 2018-07-06 | 中国科学技术大学 | A kind of disk array WriteMode selection method based on magnetic disc i/o queue |
| CN106951350A (en) * | 2017-03-30 | 2017-07-14 | 努比亚技术有限公司 | The inspection method and device of a kind of mobile terminal disk |
| CN110110004A (en) * | 2018-01-30 | 2019-08-09 | 腾讯科技（深圳）有限公司 | A kind of data manipulation method, device and storage medium |
| CN110110004B (en) * | 2018-01-30 | 2023-05-30 | 腾讯科技（深圳）有限公司 | Data operation method, device and storage medium |
| CN111782135A (en) * | 2019-06-14 | 2020-10-16 | 北京京东尚科信息技术有限公司 | Data storage method, system, data node and computer readable storage medium |
| CN117112455A (en) * | 2023-10-24 | 2023-11-24 | 苏州元脑智能科技有限公司 | Space address conversion method and device, computer equipment and storage medium |
| CN117112455B (en) * | 2023-10-24 | 2024-02-06 | 苏州元脑智能科技有限公司 | Space address conversion method and device, computer equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104765575B (en) | information storage processing method | |
| CN104765574A (en) | Data cloud storage method | |
| CN106708425B (en) | Distributed multi-mode storage management | |
| US10649969B2 (en) | Memory efficient persistent key-value store for non-volatile memories | |
| US9600184B2 (en) | Apparatus, system, and method for coordinating storage requests in a multi-processor/multi-thread environment | |
| EP2271978B1 (en) | Apparatus, system, and method for converting a storage request into an append data storage command | |
| US8195912B2 (en) | Apparatus, system, and method for efficient mapping of virtual and physical addresses | |
| CN106775476A (en) | Mixing memory system and its management method | |
| CN107066393A (en) | The method for improving map information density in address mapping table | |
| CN104239234B (en) | The management of a kind of local cache efficiently and reading/writing method | |
| CN106716334A (en) | Efficient data movement within file system volumes | |
| US9507705B2 (en) | Write cache sorting | |
| CN103399823B (en) | The storage means of business datum, equipment and system | |
| CN104778100A (en) | Safe data backup method | |
| CN110262922A (en) | Correcting and eleting codes update method and system based on copy data log | |
| CN104679442A (en) | Method and device for improving performance of disk array | |
| CN103514249A (en) | Method and system for automatic data reduction and storage device | |
| CN104750433A (en) | Cache design method based on SCST | |
| CN109375868B (en) | Data storage method, scheduling device, system, equipment and storage medium | |
| CN114138200A (en) | Pre-writing log method and system based on rocksDB | |
| CN101859232A (en) | Variable length data memory interface | |
| CN108293027B (en) | Data streaming unit and method for operating a data streaming unit | |
| CN109783032A (en) | A kind of distributed storage accelerating method and device based on Heterogeneous Computing | |
| 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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20150715 |