CN102750111A - Method for storing redundant array of independent disk (RAID) bitmaps - Google Patents

Method for storing redundant array of independent disk (RAID) bitmaps Download PDF

Info

Publication number
CN102750111A
CN102750111A CN2012101721268A CN201210172126A CN102750111A CN 102750111 A CN102750111 A CN 102750111A CN 2012101721268 A CN2012101721268 A CN 2012101721268A CN 201210172126 A CN201210172126 A CN 201210172126A CN 102750111 A CN102750111 A CN 102750111A
Authority
CN
China
Prior art keywords
disk
bitmap
data
bitmaps
raid
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
Application number
CN2012101721268A
Other languages
Chinese (zh)
Other versions
CN102750111B (en
Inventor
古世磊
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Inspur Electronic Information Industry Co Ltd
Original Assignee
Inspur Electronic Information Industry Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Inspur Electronic Information Industry Co Ltd filed Critical Inspur Electronic Information Industry Co Ltd
Priority to CN201210172126.8A priority Critical patent/CN102750111B/en
Publication of CN102750111A publication Critical patent/CN102750111A/en
Application granted granted Critical
Publication of CN102750111B publication Critical patent/CN102750111B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Signal Processing For Digital Recording And Reproducing (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses a method for storing redundant array of independent disk (RAID) bitmaps and belongs to the field of a computer system and storage. Disk data are correspondingly divided into several equal parts according to the number of the bitmaps in a disk array, and each bitmap only corresponds to one part of data region and is unrelated with other data regions. The bitmaps are plated in the back of the shown data regions. The method for storing the RAID bitmaps has the advantages of enabling the read-write performance of disks to be in the best state and improving the disk performance.

Description

A kind of method of RAID bitmap storage
 
Technical field
The present invention relates to a kind of computer system and field of storage, specifically a kind of method of RAID bitmap storage.
Background technology
At RAID1, RAID5 etc. exist in the magnetic battle array structure of data redundancy, and the integrality of data requires the redundant data and the information of raw data will guarantee consistent.The write operation of magnetic battle array is a process, takes place in this process possibly cause redundant data and raw data inconsistent unusually, and for example disk is changed, and writes the dish failure, system's power down etc.
So, successfully writing data, whole band should be consistent, does not have successfully (or not exclusively) but write, it is inconsistent that strip data is likely.After system re-powered, perhaps the zone maybe be inconsistent just to need a kind of mechanism to come those bands.If there is not recorded information, it can only suppose that all data all maybe be inconsistent, carries out the consistance of all data blocks and recovers.For RAID5, the effect that recomputates all bands exactly with; For RAID1, be exactly again that synchronous all data blocks are to mirror drive.This global data can cause system boot process very very long (being in inconsistent state after perhaps powering on regard to whole laissez-faire magnetic battle array) synchronously.
If NVRAM (Nonvolatile memory) is arranged, at first, in NVRAM, preserve writing position information to a data block write operation, after write operation finishes, this information of deletion in NVRAM.Like this, when system boot, from NARAM, read the writing position information of preservation, these positional informations have write down the data block that does not successfully write, and system only need carry out getting final product synchronously to these data blocks, and magnetic battle array total data synchronously.The magnetic battle array that we use software RAID to make up at present, this has just drawn the bitmap file, is appreciated that the effect of bitmap file is equal to the effect of the NVRAM of above-mentioned professional magnetic battle array (above-mentioned scene is the little aspect that NVRAM uses certainly); Behind the power-down rebooting; Can start synchronizing thread, the bitmap file is arranged, can judge whether set through the bitmap file; If there is not set; Just explain whole zone power down that constantly, do not have the data of writing, it is just passable directly to skip this zone.
At present the method to the bitmap file backup is, when carrying out write operation, system can be set to 1 with pairing bitmap bits, writes in all disks of magnetic battle array reserved area synchronously and goes.Have only after the bitmap file Flushing success in the disk, just begin a normal data I write operation.
Since each band all to wait corresponding bitmap write back earlier could be real behind the disk the processing of writing, and the performance of disk and internal memory etc. are too wide in the gap, and are very big to performance loss, so consider and get around disk, so will change a kind of backup mode.
Summary of the invention
Technical assignment of the present invention provides and lets the readwrite performance of disk reach better state, can improve the method for a kind of RAID bitmap storage of disk performance.
Technical assignment of the present invention realizes several bitmaps being arranged just the corresponding several five equilibriums of data in magnetic disk in disk array by following mode, the just corresponding wherein data area of a five equilibrium of each bitmap is irrelevant with other data area; Bitmap is placed on the back of represented data area.
Disk is made up of the transmission time between seek time, rotational delay time and sector and the disk adapter interface service time; Wherein seek time accounts for about 70% to 80% of T.T., so seek time is crucial for some IO requests, particularly writes request; To constantly revise superblock and bitmap; Because these metadata informations are stored in the disk end at present, magnetic head wants tracking to terminal, and the distance that moves can be excessive; Staying a metadata reserved area in the centre of disk array is bitmap, and the disk end blocks just passable equally.
The position that logic is corresponding be to be in different cylinders on actual physical address, but the data corresponding relationship is consistent.Like this, for the operation of first half, need not move to magnetic head the end of disk, it is just passable to move on to position intermediate, has reduced the displacement of magnetic head, makes seek time reduce.And for the data of latter half, total displacement remains unchanged.But from whole magnetic disk, for the operation of metadata, total seek time can reduce much relatively originally, thereby can improve performance.
A position in the bitmap is the state in a zone of expression, if this zone is more little, just explains that this bitmap is accurate more, and synchronizing process just can be skipped more zone so, has reduced synchronous process.So a bitmap is the division of comparison coarseness, if think to show more accurately whether synchronous state, just need thinner division, also just need more a plurality of bitmap pages.
More bitmap is exactly that thinner division has several bitmaps just several five equilibriums of data in magnetic disk, and each bitmap is the data area of a corresponding part just, and is irrelevant with other data area.For example, two pages are arranged, modes of emplacement originally is all to be placed on the bottom to two bitmap pages, and new mode is to be divided into two parts to the data area of disk array earlier, and a bitmap is placed on the back of represented data area.In like manner, the modes of emplacement of four bitmaps is similar.Reason pushing away successively, and in the time of a plurality of again page, modes of emplacement is identical.
In addition, for RAID5, allow a dish and lost efficacy, so, can leave metadata simultaneously on two dishes according to this principle.If because a dish in these two dishes lost efficacy, metadata can also find from another dish, if these two dishes all lost efficacy, whole RAID 5 had just lost efficacy, and metadata is nonsensical.Can certainly select to put several dishes more.If be placed on two dishes, when rewriting metadata, just needn't all participate in by each disk, reduce the IO request of total system, thereby improved performance., so just can be stored in metadata on three dishes because can allow the inefficacy of two dishes for RAID6.For RAID1, at least also can be stored on two dishes.
When dish lost efficacy,, when adding HotSpare disk, just need write this HotSpare disk to metadata if this dish is a disk of depositing metadata; If not the disk of depositing metadata, can write metadata toward HotSpare disk.
Be based on the consideration of performance, let readwrite performance reach better state.Its core is to leave on the rational position with reasonable manner.The reasonable manner of mentioning is meant on the disk of only writing a part.The rational position of mentioning is meant the position that can influence readwrite performance.
RAID is the abbreviation of English Redundant Arrays of Inexpensive Disks, is translated into disk array.
The method of a kind of RAID bitmap storage of the present invention has the following advantages: let the readwrite performance of disk reach better state, improve disk performance; Thereby, have good value for applications.
Description of drawings
Below in conjunction with accompanying drawing the present invention is further specified.
Accompanying drawing 1, Fig. 2, Fig. 3, Fig. 4, Fig. 5, Fig. 6 are the data layout figure of disk array of the method for a kind of RAID bitmap storage.
Embodiment
Explanation at length below with reference to Figure of description and specific embodiment the method for a kind of RAID bitmap storage of the present invention being done.
Embodiment:
The method of a kind of RAID bitmap storage of the present invention has several bitmaps just the corresponding several five equilibriums of data in magnetic disk in disk array, the just corresponding wherein data area of a five equilibrium of each bitmap is irrelevant with other data area; Bitmap is placed on the back of represented data area.
Disk is made up of the transmission time between seek time, rotational delay time and sector and the disk adapter interface service time; Wherein seek time accounts for about 70% to 80% of T.T., so seek time is crucial for some IO requests, particularly writes request; Will constantly revise superblock and bitmap, because these metadata informations are stored in the disk end at present, magnetic head wants tracking to terminal; The distance that moves can be excessive, and like Fig. 1, staying a metadata reserved area in the centre of disk array is bitmap; The disk end blocks just passable, as shown in Figure 2 equally;
What showed among Fig. 2 is the corresponding position of logic, be to be in different cylinders on actual physical address, but the data corresponding relationship is consistent.Like this, for the operation of first half, need not move to magnetic head the end of disk, it is just passable to move on to position intermediate, has reduced the displacement of magnetic head, makes seek time reduce.And for the data of latter half, total displacement remains unchanged.But from whole magnetic disk, for the operation of metadata, the original relatively Fig. 1 of total seek time can reduce a lot, thereby can improve performance.
A position in the bitmap is the state in a zone of expression, if this zone is more little, just explains that this bitmap is accurate more, and synchronizing process just can be skipped more zone so, has reduced synchronous process.So a bitmap is the division of comparison coarseness, if think to show more accurately whether synchronous state, just need thinner division, also just need more a plurality of bitmap pages.
More bitmap is exactly that thinner division has several bitmaps just several five equilibriums of data in magnetic disk, and each bitmap is the data area of a corresponding part just, and is irrelevant with other data area.For example, two pages are arranged, modes of emplacement originally is shown in Figure 3 to be all to be placed on the bottom to two bitmap pages, and new mode Fig. 4 is divided into two parts to the data area of disk array earlier, and a bitmap is placed on the back of represented data area.In like manner, like Fig. 5 and shown in Figure 6, the modes of emplacement of four bitmaps is similar.Reason pushing away successively, and in the time of a plurality of again page, modes of emplacement is identical.
In addition, for RAID5, allow a dish and lost efficacy, so, can leave metadata simultaneously on two dishes according to this principle.If because a dish in these two dishes lost efficacy, metadata can also find from another dish, if these two dishes all lost efficacy, whole RAID 5 had just lost efficacy, and metadata is nonsensical.Can certainly select to put several dishes more.If be placed on two dishes, when rewriting metadata, just needn't all participate in by each disk, reduce the IO request of total system, thereby improved performance., so just can be stored in metadata on three dishes because can allow the inefficacy of two dishes for RAID6.For RAID1, at least also can be stored on two dishes.
When dish lost efficacy,, when adding HotSpare disk, just need write this HotSpare disk to metadata if this dish is a disk of depositing metadata; If not the disk of depositing metadata, can write metadata toward HotSpare disk.
The method of a kind of RAID bitmap storage of the present invention except that the described technical characterictic of instructions, is the known technology of those skilled in the art.

Claims (1)

1. the method for a RAID bitmap storage is characterized in that in disk array, having several bitmaps just the corresponding several five equilibriums of data in magnetic disk, and the just corresponding wherein data area of a five equilibrium of each bitmap is irrelevant with other data area; Bitmap is placed on the back of represented data area.
CN201210172126.8A 2012-05-30 2012-05-30 A kind of method of RAID bitmap storage Active CN102750111B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210172126.8A CN102750111B (en) 2012-05-30 2012-05-30 A kind of method of RAID bitmap storage

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210172126.8A CN102750111B (en) 2012-05-30 2012-05-30 A kind of method of RAID bitmap storage

Publications (2)

Publication Number Publication Date
CN102750111A true CN102750111A (en) 2012-10-24
CN102750111B CN102750111B (en) 2016-08-03

Family

ID=47030340

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210172126.8A Active CN102750111B (en) 2012-05-30 2012-05-30 A kind of method of RAID bitmap storage

Country Status (1)

Country Link
CN (1) CN102750111B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102981936A (en) * 2012-11-15 2013-03-20 浪潮电子信息产业股份有限公司 Method for reconstructing disk array data
CN103593302A (en) * 2013-11-22 2014-02-19 华为技术有限公司 Super block information processing method, super block information processing device and server
CN104516677A (en) * 2013-09-26 2015-04-15 北大方正集团有限公司 Disk data read and write method and disk memory device
CN110532136A (en) * 2019-08-30 2019-12-03 四川效率源信息安全技术股份有限公司 A kind of raid data reconstruction method based on metadata

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TW200809525A (en) * 2006-08-02 2008-02-16 Inventec Corp A method for eliminating the synchronous course of the RAID equipment
CN101408833A (en) * 2007-10-10 2009-04-15 英业达股份有限公司 Method for initializing synchronous course omitting RAID1 equipment
TW200917026A (en) * 2007-10-03 2009-04-16 Inventec Corp A method for eliminating the initialization synchronous course of the RAID1 equipment

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
TW200809525A (en) * 2006-08-02 2008-02-16 Inventec Corp A method for eliminating the synchronous course of the RAID equipment
TW200917026A (en) * 2007-10-03 2009-04-16 Inventec Corp A method for eliminating the initialization synchronous course of the RAID1 equipment
CN101408833A (en) * 2007-10-10 2009-04-15 英业达股份有限公司 Method for initializing synchronous course omitting RAID1 equipment

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102981936A (en) * 2012-11-15 2013-03-20 浪潮电子信息产业股份有限公司 Method for reconstructing disk array data
CN104516677A (en) * 2013-09-26 2015-04-15 北大方正集团有限公司 Disk data read and write method and disk memory device
CN104516677B (en) * 2013-09-26 2018-05-04 北大方正集团有限公司 Data in magnetic disk reading/writing method and disk storage device
CN103593302A (en) * 2013-11-22 2014-02-19 华为技术有限公司 Super block information processing method, super block information processing device and server
CN110532136A (en) * 2019-08-30 2019-12-03 四川效率源信息安全技术股份有限公司 A kind of raid data reconstruction method based on metadata
CN110532136B (en) * 2019-08-30 2023-05-02 四川效率源信息安全技术股份有限公司 Raid data recovery method based on metadata

Also Published As

Publication number Publication date
CN102750111B (en) 2016-08-03

Similar Documents

Publication Publication Date Title
US9116638B2 (en) Method and apparatus for reading and writing data in file system
CN103246478B (en) A kind of based on the disc array system of software PLC support without packet type overall situation HotSpare disk
CN102819408B (en) The implementation method of the RAID 0 of dynamic adjustment stripe depth and system
US20090276567A1 (en) Compensating for write speed differences between mirroring storage devices by striping
US20080052459A1 (en) Redundant array of independent disks system
CN103294412A (en) Implementing large block random write hot spare SSD for SMR RAID
CN105159622A (en) Method and system for shortening IO reading and writing time delay of SSD
KR20120093104A (en) Dynamic storage regions
US8862819B2 (en) Log structure array
CN103713973A (en) Mixed storage backup method and system based on HDD and SSD
TW201643690A (en) Data storage system and specific instruction executing method thereof
CN103150128A (en) Implementation method of solid state drive (SSD) and disk-based reliable mixed storage system
US20150234595A1 (en) Storage device
CN103186438A (en) Method of improving disk array data reconstruction efficiency
CN102750111A (en) Method for storing redundant array of independent disk (RAID) bitmaps
JP2012234609A (en) Data storage method and hybrid data storage apparatus
CN106371950B (en) Method and device for realizing RAID level conversion
CN101169705B (en) Method for implementing file class mirror-image under multiple hard disk based on nude file system
US10817480B2 (en) Hierarchical storage management system
US20090034107A1 (en) Redundant data on hard drive
CN102609224A (en) Redundant array of independent disk system and initializing method thereof
KR102152724B1 (en) Video managing apparatus and method of surveillance systems
US20100169555A1 (en) Method of writing data into flash memory based on file system
US20170199698A1 (en) Intra-storage device data tiering
CN107132996B (en) Intelligent thin provisioning-based storage method, module and system

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