CN103858092A - Data migration method and device - Google Patents
Data migration method and device Download PDFInfo
- Publication number
- CN103858092A CN103858092A CN201380002566.1A CN201380002566A CN103858092A CN 103858092 A CN103858092 A CN 103858092A CN 201380002566 A CN201380002566 A CN 201380002566A CN 103858092 A CN103858092 A CN 103858092A
- Authority
- CN
- China
- Prior art keywords
- extent
- disk
- lun
- data
- disk group
- 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
Images
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/0866—Addressing of a memory level in which the access to the desired data or data block requires associative addressing means, e.g. caches for peripheral storage systems, e.g. disk cache
- G06F12/0868—Data transfer between cache memory and other subsystems, e.g. storage devices or host systems
-
- 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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/08—Error detection or correction by redundancy in data representation, e.g. by using checking codes
- G06F11/10—Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/16—Error detection or correction of the data by redundancy in hardware
- G06F11/20—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements
- G06F11/2053—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements where persistent mass storage functionality or persistent mass storage control functionality is redundant
- G06F11/2094—Redundant storage or storage space
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2201/00—Indexing scheme relating to error detection, to error correction, and to monitoring
- G06F2201/81—Threshold
-
- 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/26—Using a specific storage system architecture
- G06F2212/261—Storage comprising a plurality of storage devices
- G06F2212/262—Storage comprising a plurality of storage devices configured as RAID
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Quality & Reliability (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention provides a data migration technology, comprising: acquiring load information of a first disk group; reading at least one emigration Extent data of an objective logical unit member LUN in the first disk group to a buffer memory of a controller, when the load information reaches emigration threshold value; acquiring at least one immigration Extent in a second disk group, wherein the number of the immigration Extent is the same as that of the emigration Extent, a RAID level of the emigration Extent is respectively corresponding to that of the immigration Extent which is unoccupied Extent. Mapping relation between the emigration LUN and the emigration Extent is updated to the mapping relation between the emigration LUN and the immigration Extent.
Description
Technical field
The present invention relates to memory technology, particularly a kind of Data Transference Technology.
Background technology
In field of storage, in order to improve the read or write speed of data or to strengthen the security of data, one is called the technology of inexpensive disk array (Redundant Arrays of Independent Disks, RAID) and is used widely.In this technology, according to the requirement of certain RIAD rank, multiple disks are linked together, form a RAID group.
According to small computer system interface (Small Computer System Interface, SCSI), or fiber channel (Fibre Channel, FC), internet small computer system interface net iSCSI(internet Small Computer System Interface, etc. SCSI) encapsulated the agreement of SCSI, or other similar agreements, can be according to the capacity of RAID group, from in logic RAID group being done to transverse cuts, this RAID group is divided into multiple logical blocks (Logic Unit).In field of storage, traditionally also with LUN(logical unit number, Logic Unit Number) call logical block, unless stated otherwise, the present invention continues to use this custom.
In RAID group, each disk provides the storage space of formed objects for this LUN, and each unit cutting down is just called a LUN.Each LUN can supply separately host access, and like this, an original RAID group just can have been used as multiple RAID groups in logic.
Disk group is made up of at least one RAID group, because number of disks in disk group is difficult to direct expansion, and disk set up vertical at the beginning of, be difficult to determine the actual demand amount of user to resource, therefore often there is the situation that resource that disk group can provide is difficult to meet consumers' demand.
Summary of the invention
The invention provides a kind of Data Transference Technology, can realize the Data Migration across disk group.
First aspect, the invention provides a kind of data migration method, be applied in controller, described controller respectively with the first disk group, second disk group connects, described the first disk group DG and described second disk group include disk, each described disk comprises multiple piecemeal Chunk, wherein, at least 2 Chunk from same DG and different disk, become piecemeal group CKG according to Redundant Array of Inexpensive Disc RAID algorithm groups, each CKG is divided into multiple length Extent, and in described CKG, each described Chunk provides onesize storage space for described Extent, the method comprises: the load information that obtains the first disk group, when described load information reaches while moving out threshold value, at least one data of moving out in Extent of destination logical unit LUN in the first disk group are read in the buffer memory of described controller, obtain at least one Extent that moves in second disk group, the quantity of the described Extent of moving into described in the move out quantity of Extent identical, the RAID grade of Extent of moving into described in the RAID grade of Extent of moving out described in each and one is corresponding one by one, described in the Extent that moves into be idle Extent, by the described LUN of moving out with described in move out the mapping relations of Extent move out described in being updated to LUN with described in the move into mapping relations of Extent.
In the possible implementation of the first of first aspect, load information comprises: bandwidth B PS per second is higher than first threshold, with idle storage space lower than at least one in Second Threshold.
Second aspect, the invention provides a kind of data migration device, arrive second disk group for the data of moving the first disk group, described the first disk group DG and described second disk group include disk, each described disk comprises multiple piecemeal Chunk, wherein, at least 2 Chunk from same DG and different disk, become piecemeal group CKG according to Redundant Array of Inexpensive Disc RAID algorithm groups, each CKG is divided into multiple length Extent, and in described CKG, each described Chunk provides onesize storage space for described Extent, this device comprises: parameter acquiring unit, for obtaining the load information of the first disk group, data-reading unit, is connected with described parameter acquiring unit 41, when described load information reaches while moving out threshold value, at least one data of moving out in Extent of destination logical unit LUN in the first disk group is read in the buffer memory of described controller, data write unit, be connected with described data-reading unit, for obtaining at least one Extent that moves into of second disk group, the quantity of the described Extent of moving into described in the move out quantity of Extent identical, the RAID grade of Extent of moving into described in the RAID grade of Extent of moving out described in each and one is corresponding one by one, described in the Extent that moves into be idle Extent, LUN updating block, for by the described LUN of moving out with described in move out the mapping relations of Extent move out described in being updated to LUN with described in the move into mapping relations of Extent.
In the possible implementation of the first of second aspect, load information comprises: bandwidth B PS per second is higher than first threshold, with idle storage space lower than at least one in Second Threshold.
Brief description of the drawings
In order to be illustrated more clearly in embodiment of the present invention technical scheme, will the accompanying drawing of the required use of embodiment be briefly described below, the accompanying drawing in the following describes is only some embodiments of the present invention, can also obtain according to these accompanying drawings other accompanying drawing.
Fig. 1 is embodiment of the present invention data migration method process flow diagram;
Fig. 2 is the invention process csr controller schematic diagram;
Fig. 3 is embodiment of the present invention data migration device structural drawing.
Embodiment
Below in conjunction with the accompanying drawing in the embodiment of the present invention, technical scheme of the present invention is clearly and completely described, obviously, described embodiment is only the present invention's part embodiment, instead of whole embodiment.The every other embodiment that embodiment based in the present invention obtains, belongs to the scope of protection of the invention.
In traditional RAID technology, first according to selected RAID rank, multiple disk combination are formed to RAID group together, then, using each disk in RAID group as least unit, the equal-sized a part of space of each disk taking-up forms LUN jointly.LUN offers main frame read-write as unit, because LUN is across all disks, so in the time that main frame is write data, data can be write in whole RAID group; When read data, provide data to main frame by whole RAID group.
Most of RAID rank all provides the function of data reconstruction.For example, in RAID3, there is a disk storage checking data, all the other disk storage business datums.When there being a disk to occur after fault, can recover the data in failed disk by checking algorithm by all the other disks.But, because the storage space of single disk is increasing, and number of disks in composition RAID group is often few, for example form a RAID group by 6 disks, if therefore there is a disk that fault has occurred, can only participate in reconstruct by all the other few disks of quantity in RAID group, this time may be very very long, for example the data block of reconstruct 1 terabyte (TB), need to expend 10 hours.If there is new disk to break down during reconstruct, may cause the loss of data that cannot recover to storage system.
With in prior art, directly set up using disk as granularity RAID group different be.In the present invention program, first the each disk in multiple disks is cut into equal-sized piecemeal (CK, Chunk), for example 6 disk disk groups of composition (Disk Group, DG), it is 64MB(megabyte that each disk in DG is cut into size) Chunk, then set up RAID group using Chunk as granularity, a for example RAID group of 3 Chunk compositions, the RAID group being formed by these Chunk, we are called piecemeal group (Chunk Group, CKG).In same disk, do not have and belong to multiple Chunk in same CKG, in other words, a disk is at most a CKG provides a Chunk.Not the each disk in DG will provide Chunk for CKG, and namely, in CKG, the quantity of Chunk can be fewer than the quantity of disk in DG.
It should be noted that, technology involved in the present invention is not limited to storage medium itself, therefore, except disk, is equally applicable to other media such as solid state hard disc, erasable optical disk, floppy disk, tape, for convenience of description, the embodiment of the present invention is given an example with disk.The said data of the embodiment of the present invention, such as picture, video, database data, audio frequency, text etc.
The now traditional RAID relation of not recomposition between disk, but can form the disk group (for example 96 disks) of larger number of disks, the Chunk on disk is the Chunk composition CKG of different disk in disk group therewith.Each CKG can have the RAID rank of oneself, and like this, the Chunk on a disk can belong to multiple piecemeal groups of multiple RAID ranks.
Each Chunk in CKG is divided into the storage space of fritter, a block space of formed objects is provided by each Chunk, can form a length (Extent), the size of an Extent is 256KB(kilobyte for example).Use this way, a CKG can be able to be divided into multiple Extent, form Extent Pool(length pond).Extent is the elementary cell of composition LUN of the present invention, chooses one or more Extent and can form LUN for host access from Extent Pool.In the time that LUN is made up of multiple Extent, form the Extent of this LUN from same CKG, also can be from different CKG, the RAID rank that forms the Extent of same LUN can be the same or different, the Raid rank of Extent with its from the RAID rank of CKG identical.The storage size of different Extent that belongs to same LUN is identical, realizes mutual exclusion can facilitate Data Migration time.
In addition in traditional RAID technology, are LUN ID+ LBA (Logical Block Addressing) (LBA) addresses to the addressing mode of data in LUN.If a RAID group of every 6 Chunk composition, the storage space of so each Extent is also from 6 disks.But because LUN is made up of different Extent, and the disk that each Extent crosses over can be different, so in this case, the disk that the number of disks that LUN crosses over can be crossed over than traditional RAID group is more.Therefore in the time having disk to break down, the number of disks that participates in reconstruct is also more, and reconstitution time shortens greatly.The foundation of embodiment of the present invention Chunk, CKG, Extent and LUN can complete by controller.In storage system, be jointly made up of controller and storage medium, storage medium provides storage space, and controller manages storage space, and is responsible for reading and writing data in storage space.The disk that Extent crosses over, refers to the disk that the storage space of Extent is originated.
The embodiment of the present invention can realize the Data Migration across DG.In a storage system, can there be multiple DG, each DG is made up of the disk of multiple same types, the quantity requiring according to RAID algorithm in DG is selected CKG, CKG is made up of the piece on different hard disks in DG, the space of LUN is made up of the space of several CKG, so the data of LUN can be distributed in the multiple hard disks in DG.
In the embodiment of the present invention, same disk group belongs to same failure domain, and different disk groups belongs to different failure domains.That is to say if there is the disk of any amount to send fault in a disk group, in the time recovering data, irrelevant with the disk of other disk groups, rely on other disks of disk group inside to recover.
By the division of CKG, there is direct or indirect relation in the disk of same disk group and other disks.For example total disk A, a B, C, D and E amount to a DG of 5 disks compositions, and the Chunk that forms so a CKG can be from any more than 2 or 2 disk wherein.The Chunk of for example CKG1 can be from A, B and these 3 disks of C, the Chunk of CKG2 from the Chunk of these 4 disks of A, B, C and D, CKG3 from C, D, these three disks of E ... because disk A and disk C provide Chunk composition CKG1 jointly, therefore by CKG1 and CKG2, disk A, C have set up direct contact; By CKG3, disk C and E have set up and have contacted directly; By the contacting directly between disk C, E of contacting directly between disk A, C, form the indirect association of disk A, E.
As Fig. 1, below to doing concrete introduction across the Data Migration of DG.
Step 11, controller obtains bandwidth per second (Band Per Second, BPS) and the remanence disk space of a DG.In the one DG, have the LUN that can move away, be called the LUN that moves out, the LUN that moves out mapping is made up of multiple Extent, and has mapping relations with its Extent of composition.Wherein, controller manages a DG, the 2nd DG.The data of moving out in any Extent of any LUN can reduce the load of a DG.The one DG and the 2nd DG can be made up of the storage medium of same size, for example identical read or write speed storage medium.
When each execution input operation or output function, controller can be recorded, and the sum of the input/output operations in the time period is added up, and averages and just can obtain BPS per second.And total storage space of controller inquiry DG, and the disk space that write operation takies at every turn, can obtain DG remaining space.
Step 12, when BPS is higher than first threshold, and remanence disk space is during lower than Second Threshold, reads the data of at least one Extent in the LUN that moves out to the buffer memory of controller.
The introduction of this step be the trigger condition of Data Migration.BPS is the average bandwidth taking per second of read/write operation.For example, according to the setting of threshold value, as BPS >=100MB/S, and residual memory space≤10%, just triggering migration, in the LUN that then moves out, the data of at least one Extent are to the buffer memory of controller.The quantity of the Extent of sense data can be set by the user, and threshold value also can be set respectively, then calculates and obtains according to algorithm.For example can arrange when meeting the just no longer migration of BPS≤50MB/S and residual memory space >=50%.Can calculate or roughly estimate the quantity that needs the Extent moving according to these two threshold value settings that stop migration so.
Step 13, obtains the Extent information of the 2nd DG, will read the data of controller cache, writes in the Extent of the 2nd DG.The Extent of sense data from a DG, and in the 2nd DG, the Extent of data writing has identical RAID rank and memory capacity.Obtain Extent information and the step 12 of the 2nd DG and also can any one first carry out, or executed in parallel.The Extent being written into does not store valid data, can be called idle Extent.The RAID rank of Extent is exactly the RAID rank of the CKG that belongs to of Extent.
If the DG of controller management is except a DG, multiple in addition, can from these multiple DG, select arbitrarily one as the 2nd DG, also can choose according to certain condition, the threshold value of moving into is for example set, and the judgement parameter of the threshold value of moving into is identical with the judgement parameter of the threshold value of moving out.Consider that when the threshold value of moving out whether BPS is higher than first threshold, the threshold value of moving into considers that whether BPS is lower than the 3rd threshold value.When the threshold value of moving out considers that whether BPS is higher than first threshold, and whether free space is less than Second Threshold; The threshold value of moving into considers that whether BPS is lower than the 3rd threshold value, and whether free space is greater than the 4th threshold value.For example, can set DG that BPS and residual memory space all meet certain condition as the 2nd DG, for example BPS≤20MB/S and residual memory space >=80% just can become the DG of the data of being moved into.Selection any one DG except a DG is as the 2nd DG, and statistically also can reach the present invention is beneficial effect.
Step 14, upgrades the Extent that LUN shines upon that moves out, particularly, be with a DG in the mapping of Extent of sense data, change into the 2nd DG in the mapping of Extent of data writing.The storage space that can discharge the Extent that moves out of sense data in a DG, becomes idle Extent, for other LUN.
In the embodiment of the present invention, the first disk group and second disk group include disk, and each disk comprises multiple piecemeal Chunk.CKG is formed according to RAID algorithm and is formed by least 2 Chunk, forms the Chunk of same CKG from the different disk of same DG.Each CKG is divided into multiple length Extent, and the storage space of each Extent provides jointly by all Chunk of CKG, and to same Extent, the storage size that each Chunk provides is identical.
LUN is made up of Extent, by mapping relations, records the Extent that LUN comprises.By upgrading mapping relations, make a part of Extent in LUN from the 2nd DG, complete the migration to data in LUN.
In the present embodiment, relate to BPS, these two parameters of remanence disk space, these two parameters can be referred to as to load information, and meet threshold value with these two parameters simultaneously, namely work as BPS >=100MB/S, and residual memory space≤10%, as trigger data migration operation.In other embodiments, also can only obtain a wherein parameter, in the time that this parameter meets threshold value, move with regard to trigger data.Or consider two parameters simultaneously, and two parameters weight is separately set, obtaining a total numerical value after two parameter weightings, then compare by total numerical value and total threshold value, to judge whether to punish Data Migration operation.
The embodiment of the present invention adopts the mapping relations of LUN-Extent to carry out addressing to the content of LUN, and data Replica to be migrated, to object DG, is then changed to these mapping relations and just can realize the Data Migration across DG.And in traditional RAID, to carry out addressing in LUN ID+LAB address, cannot complete the Data Migration across DG.
As Fig. 2, to describe from hardware, above-mentioned Data Migration step can be carried out by the processor of controller 2 21, the instruction that has program stored therein in the internal memory 22 of controller 2, processor 21 execution of program instructions realize this method.Controller 2 is connected with disk group 31 disk groups 32, can be particularly that internal memory 22 is connected with disk group 31 and disk group 32.
As Fig. 3, the present invention also provides a kind of data migration device 4, can apply above-mentioned moving method.Data migration device 4 comprises parameter acquiring unit 41, data-reading unit 42, data write unit 43 and LUN updating block 44.Data migration device 4 is integrated in controller, can between disk group, move data.
In the one DG, have the LUN that can move away, be called the LUN that moves out, also can be called the LUN that moves out, the LUN that moves out is mapped with multiple Extent.Wherein, controller manages a DG, the 2nd DG.The data of moving out in any Extent of any LUN can reduce the load of a DG.The one DG and the 2nd DG can be made up of the storage medium of same size, for example identical read or write speed storage medium.
When each execution input operation or output function, can be recorded in controller buffer memory all, the sum of the input/output operations in the time period is added up, average and just can obtain BPS per second.And parameter acquiring unit 41 is inquired about total storage space of DG, and the disk space that write operation takies at every turn, DG remaining space can be obtained.
Data-reading unit 42, is connected with parameter acquiring unit 41, and for when BPS is higher than first threshold, and remanence disk space is during lower than first threshold, reads the data of at least one Extent in the LUN that moves out to the buffer memory of controller.
The trigger condition of threshold value as Data Migration can be set.For example, according to the setting of threshold value, as BPS >=100MB/S, and residual memory space≤10%, just triggering migration, in the LUN that then moves out, the data of at least one Extent are to the buffer memory of controller.The quantity of the Extent of sense data can be set by the user, and threshold value also can be set respectively, then calculates and obtains according to algorithm.For example can arrange when meeting the just no longer migration of BPS≤50MB/S and residual memory space >=50%.Can calculate or roughly estimate the quantity that needs the Extent moving according to these two threshold value settings that stop migration so.
The Extent of sense data from a DG, and in the 2nd DG, the Extent of data writing has identical RAID rank and memory capacity.The Extent being written into does not store valid data, can be called idle Extent.The RAID rank of Extent is exactly the RAID rank of the CKG that belongs to of Extent.
If DG has more than three or three, data write unit 43 can therefrom be selected arbitrarily one and also can choose according to certain condition as the 2nd DG, for example, the threshold value of moving into is set, the project of the threshold value of moving into and the threshold value coupling of moving out.Consider that when the threshold value of moving out whether BPS is higher than first threshold, the threshold value of moving into considers that whether BPS is lower than the 3rd threshold value.When the threshold value of moving out considers that whether BPS is higher than first threshold, and whether free space is less than Second Threshold; The threshold value of moving into considers that whether BPS is lower than the 3rd threshold value, and whether free space is greater than the 4th threshold value.
LUN is made up of Extent, by mapping relations, records the Extent that LUN comprises.By upgrading mapping relations, make a part of Extent in LUN from the 2nd DG, complete the migration to data in LUN.
In the embodiment of the present invention, the first disk group DG and second disk group include disk, and each disk comprises multiple piecemeal Chunk.CKG is formed according to RAID algorithm and is formed by least 2 Chunk, forms the Chunk of same CKG from the different disk of same DG.Each CKG is divided into multiple length Extent, and the storage space of each Extent provides jointly by all Chunk of CKG, and to same Extent, the storage size that each Chunk provides is identical
In the present embodiment, relate to BPS, these two parameters of remanence disk space, these two parameters can be referred to as to load information, and meet threshold value with these two parameters simultaneously, namely work as BPS >=100MB/S, and residual memory space≤10%, as trigger data migration operation.In other embodiments, also can only obtain a wherein parameter, in the time that this parameter meets threshold value, move with regard to trigger data.Or consider two parameters simultaneously, and weight is set to two, after weighting, obtain a total numerical value, then compare by total numerical value and total threshold value, to judge whether to punish Data Migration operation.
The embodiment of the present invention adopts the mapping relations of LUN-Extent to carry out addressing to the content of LUN, and data Replica to be migrated, to object DG, is then changed to these mapping relations and just can realize the Data Migration across DG.And in traditional RAID, to carry out addressing in LUN ID+LAB address, cannot complete the Data Migration across DG.
In above-described embodiment, except BPS, can also use read-write number of times per second (Input/OutputOperations Per Second, IOPS) as threshold value, BPS=IOPS × I/O size, I/O size is the data volume that single read/write requests is asked, for example, such as 512B, 4KB, 1MB etc.
The possible implementation that one of ordinary skill in the art will appreciate that various aspects of the present invention or various aspects can be embodied as system, method or computer program.Therefore, the possible implementation of each aspect of the present invention or various aspects can adopt complete hardware implementation example, complete implement software example (comprising firmware, resident software etc.), or the form of the embodiment of integration software and hardware aspect, is all referred to as " circuit ", " module " or " system " here.In addition, the possible implementation of each aspect of the present invention or various aspects can adopt the form of computer program, and computer program refers to the computer readable program code being stored in computer-readable medium.
Computer-readable medium can be computer-readable signal media or computer-readable recording medium.Computer-readable recording medium is including but not limited to electronics, magnetic, optics, electromagnetism, infrared or semiconductor system, equipment or device, or aforesaid appropriately combined arbitrarily, as random-access memory (ram), ROM (read-only memory) (ROM), Erasable Programmable Read Only Memory EPROM (EPROM or flash memory), optical fiber, portable ROM (read-only memory) (CD-ROM).
Processor in computing machine reads the computer readable program code being stored in computer-readable medium, makes processor can carry out the function action specifying in the combination of in process flow diagram each step or each step; Generation is implemented in the device of the function action specifying in each piece of block diagram or each combination.
Claims (12)
1. a data migration method, be applied in controller, described controller respectively with the first disk group, second disk group connects, it is characterized in that: described the first disk group and described second disk group include disk, each described disk comprises multiple piecemeal Chunk, wherein, at least 2 Chunk from same disk group and different disk, become piecemeal group CKG according to Redundant Array of Inexpensive Disc RAID algorithm groups, each CKG is divided into multiple length Extent, and in described CKG, each described Chunk provides onesize storage space for described Extent, the method comprises:
Obtain the load information of the first disk group;
When described load information reaches while moving out threshold value, at least one data of moving out in Extent of destination logical unit LUN in the first disk group are read in the buffer memory of described controller;
Obtain at least one Extent that moves in second disk group, the quantity of the described Extent of moving into described in the move out quantity of Extent identical, the RAID grade of Extent of moving into described in the RAID grade of Extent of moving out described in each and one is corresponding one by one, described in the Extent that moves into be idle Extent;
By the described LUN of moving out with described in move out the mapping relations of Extent move out described in being updated to LUN with described in the move into mapping relations of Extent.
2. method according to claim 1, is characterized in that, described load information reaches the threshold value of moving out, and comprising:
Bandwidth B PS per second is higher than first threshold; With
Idle storage space is lower than Second Threshold.
3. method according to claim 1, is characterized in that, described load information reaches the threshold value of moving out, and comprising:
Bandwidth B PS per second is higher than first threshold.
4. method according to claim 1, is characterized in that, described load information reaches the threshold value of moving out, and comprising:
Idle storage space is lower than Second Threshold.
5. according to the method described in claim 1,2,3 or 4, it is characterized in that, by the described LUN of moving out with described in move out the mapping relations of Extent move out described in being updated to LUN with described in move into after the mapping relations of Extent, further comprise:
Move out described in the release storage space of Extent.
6. according to the method described in claim 1,2,3 or 4, it is characterized in that:
The load information of described second disk group meets the threshold value of moving into.
7. according to the method described in claim 1,2,3 or 4, it is characterized in that:
The storage size of different Extent that belongs to same LUN is identical.
8. a data migration device, arrive second disk group for the data of moving the first disk group, it is characterized in that: described the first disk group and described second disk group include disk, each described disk comprises multiple piecemeal Chunk, wherein, at least 2 Chunk from same disk group and different disk, become piecemeal group CKG according to Redundant Array of Inexpensive Disc RAID algorithm groups, each CKG is divided into multiple length Extent, and in described CKG, each described Chunk provides onesize storage space for described Extent, and this device comprises:
Parameter acquiring unit, for obtaining the load information of the first disk group;
Data-reading unit, is connected with described parameter acquiring unit 41, when described load information reaches while moving out threshold value, at least one data of moving out in Extent of destination logical unit LUN in the first disk group is read in the buffer memory of described controller;
Data write unit, be connected with described data-reading unit, for obtaining at least one Extent that moves into of second disk group, the quantity of the described Extent of moving into described in the move out quantity of Extent identical, the RAID grade of Extent of moving into described in the RAID grade of Extent of moving out described in each and one is corresponding one by one, described in the Extent that moves into be idle Extent;
LUN updating block, for by the described LUN of moving out with described in move out the mapping relations of Extent move out described in being updated to LUN with described in the move into mapping relations of Extent.
9. device according to claim 8, is characterized in that, described load information reaches the threshold value of moving out, and comprising:
Bandwidth B PS per second is higher than first threshold; With
Idle storage space is lower than Second Threshold.
10. device according to claim 8, is characterized in that, described load information reaches the threshold value of moving out, and comprising:
Bandwidth B PS per second is higher than first threshold.
11. devices according to claim 8, is characterized in that, described load information reaches the threshold value of moving out, and comprising:
Idle storage space is lower than Second Threshold.
Device 12. according to Claim 8, described in 9,10 or 11, is characterized in that:
The storage size of different Extent that belongs to same LUN is identical.
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/CN2013/089982 WO2015089798A1 (en) | 2013-12-19 | 2013-12-19 | Data migration method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103858092A true CN103858092A (en) | 2014-06-11 |
| CN103858092B CN103858092B (en) | 2016-03-09 |
Family
ID=50864332
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201380002566.1A Active CN103858092B (en) | 2013-12-19 | 2013-12-19 | A kind of data migration method and device |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN103858092B (en) |
| WO (1) | WO2015089798A1 (en) |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105988727A (en) * | 2015-02-25 | 2016-10-05 | 中兴通讯股份有限公司 | RAID-based storage method and storage device |
| CN106168882A (en) * | 2015-05-18 | 2016-11-30 | 联发科技股份有限公司 | The method of managing storage and storage system thereof |
| CN106408684A (en) * | 2016-09-30 | 2017-02-15 | 北京新能源汽车股份有限公司 | Fault information storage method and device |
| CN106598500A (en) * | 2016-12-16 | 2017-04-26 | 郑州云海信息技术有限公司 | Hierarchical storage dynamic migration method |
| CN106775481A (en) * | 2016-12-23 | 2017-05-31 | 华为技术有限公司 | Method for reading data and equipment |
| CN111007988A (en) * | 2019-11-29 | 2020-04-14 | 苏州浪潮智能科技有限公司 | RAID internal wear balancing method, system, terminal and storage medium |
| US10795599B2 (en) | 2016-11-26 | 2020-10-06 | Huawei Technologies Co., Ltd. | Data migration method, host and solid state disk |
| WO2020215223A1 (en) * | 2019-04-23 | 2020-10-29 | 华为技术有限公司 | Distributed storage system and garbage collection method used in distributed storage system |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109558068B (en) * | 2017-09-27 | 2024-04-05 | 北京忆恒创源科技股份有限公司 | Data migration method and migration system |
| CN114442942B (en) * | 2022-01-05 | 2023-05-09 | 杭州宏杉科技股份有限公司 | Data migration method, system, equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101084481A (en) * | 2004-12-20 | 2007-12-05 | 伊姆西公司 | A method to perform parallel data migration in a clustered storage environment |
| CN101587425A (en) * | 2009-06-16 | 2009-11-25 | 杭州华三通信技术有限公司 | A kind of method and device that increases magnetic disc redundant array redundancy |
| CN102184080A (en) * | 2011-04-29 | 2011-09-14 | 华中科技大学 | Curing band based data reading and writing method used after capacity expansion of RAID (Redundant Array of Independent Disk) system |
| US8452928B1 (en) * | 2006-06-29 | 2013-05-28 | Emc Corporation | Virtual array non-disruptive migration of extended storage functionality |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101546249A (en) * | 2008-03-26 | 2009-09-30 | 中兴通讯股份有限公司 | On-line capacity expansion method for disk arrays |
| US8639907B2 (en) * | 2010-07-22 | 2014-01-28 | Netgear, Inc. | Method and apparatus for dynamically adjusting memory capacity in accordance with data storage |
| CN102103629B (en) * | 2010-12-14 | 2012-09-26 | 西北工业大学 | Online data migration method |
-
2013
- 2013-12-19 CN CN201380002566.1A patent/CN103858092B/en active Active
- 2013-12-19 WO PCT/CN2013/089982 patent/WO2015089798A1/en active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101084481A (en) * | 2004-12-20 | 2007-12-05 | 伊姆西公司 | A method to perform parallel data migration in a clustered storage environment |
| US8452928B1 (en) * | 2006-06-29 | 2013-05-28 | Emc Corporation | Virtual array non-disruptive migration of extended storage functionality |
| CN101587425A (en) * | 2009-06-16 | 2009-11-25 | 杭州华三通信技术有限公司 | A kind of method and device that increases magnetic disc redundant array redundancy |
| CN102184080A (en) * | 2011-04-29 | 2011-09-14 | 华中科技大学 | Curing band based data reading and writing method used after capacity expansion of RAID (Redundant Array of Independent Disk) system |
Cited By (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105988727B (en) * | 2015-02-25 | 2021-04-16 | 中兴通讯股份有限公司 | Storage method and storage device based on RAID |
| CN105988727A (en) * | 2015-02-25 | 2016-10-05 | 中兴通讯股份有限公司 | RAID-based storage method and storage device |
| CN106168882A (en) * | 2015-05-18 | 2016-11-30 | 联发科技股份有限公司 | The method of managing storage and storage system thereof |
| CN106408684A (en) * | 2016-09-30 | 2017-02-15 | 北京新能源汽车股份有限公司 | Fault information storage method and device |
| CN106408684B (en) * | 2016-09-30 | 2019-10-18 | 北京新能源汽车股份有限公司 | A kind of method and device of fault message storage |
| US11960749B2 (en) | 2016-11-26 | 2024-04-16 | Huawei Technologies Co., Ltd. | Data migration method, host, and solid state disk |
| US11644994B2 (en) | 2016-11-26 | 2023-05-09 | Huawei Technologies Co., Ltd. | Data migration method, host, and solid state disk |
| US10795599B2 (en) | 2016-11-26 | 2020-10-06 | Huawei Technologies Co., Ltd. | Data migration method, host and solid state disk |
| CN106598500A (en) * | 2016-12-16 | 2017-04-26 | 郑州云海信息技术有限公司 | Hierarchical storage dynamic migration method |
| CN106775481B (en) * | 2016-12-23 | 2019-11-05 | 华为技术有限公司 | Method for reading data and equipment |
| CN106775481A (en) * | 2016-12-23 | 2017-05-31 | 华为技术有限公司 | Method for reading data and equipment |
| WO2020215223A1 (en) * | 2019-04-23 | 2020-10-29 | 华为技术有限公司 | Distributed storage system and garbage collection method used in distributed storage system |
| CN111007988B (en) * | 2019-11-29 | 2022-10-18 | 苏州浪潮智能科技有限公司 | RAID internal wear balancing method, system, terminal and storage medium |
| CN111007988A (en) * | 2019-11-29 | 2020-04-14 | 苏州浪潮智能科技有限公司 | RAID internal wear balancing method, system, terminal and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2015089798A1 (en) | 2015-06-25 |
| CN103858092B (en) | 2016-03-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103858092B (en) | A kind of data migration method and device | |
| US11157365B2 (en) | Method for processing stripe in storage device and storage device | |
| US20160179403A1 (en) | Storage controller, storage device, storage system, and semiconductor storage device | |
| US9146851B2 (en) | Single-level cell and multi-level cell hybrid solid state drive | |
| TWI716416B (en) | Storage system, method and system for managing storage media, method of operating storage system, and non-transitory computer-readable medium | |
| KR102170539B1 (en) | Method for storing data by storage device and storage device | |
| KR101491943B1 (en) | Transaction log recovery | |
| US10146435B2 (en) | Storage system and data write method | |
| JP5944587B2 (en) | Computer system and control method | |
| CN111164574A (en) | Redundant coded stripes based on internal addresses of storage devices | |
| TWI531963B (en) | Data storage systems and their specific instruction enforcement methods | |
| CN106371761A (en) | Memory system and method of controlling nonvolatile memory | |
| CN104246721A (en) | Storage system, storage controller, and method, for managing mapping between logical addresses and physical addresses | |
| KR101729636B1 (en) | File processing method and storage device | |
| CN104937574A (en) | Tiered caching and migration in differing granularities | |
| KR20170099724A (en) | Data storage device for increasing lifetime of device and raid system including the same | |
| US9442834B2 (en) | Data management method, memory controller and memory storage device | |
| US10019315B2 (en) | Control device for a storage apparatus, system, and method of controlling a storage apparatus | |
| CN104679442A (en) | Method and device for improving performance of disk array | |
| CN103019882B (en) | The RAID4 system of solid state hard disc | |
| CN105354152A (en) | Nonvolatile memory and wear leveling method | |
| WO2015114829A1 (en) | Information processing device | |
| JP2019169101A (en) | Electronic apparatus, computer system, and control method | |
| CN110515550B (en) | Method and device for separating cold data and hot data of SATA solid state disk | |
| JP2020191055A (en) | Recovery processing method and device from instantaneous interruption, and computer readable storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant |