CN107391040A - A kind of method and device of storage array disk I O scheduling - Google Patents
A kind of method and device of storage array disk I O scheduling Download PDFInfo
- Publication number
- CN107391040A CN107391040A CN201710630586.3A CN201710630586A CN107391040A CN 107391040 A CN107391040 A CN 107391040A CN 201710630586 A CN201710630586 A CN 201710630586A CN 107391040 A CN107391040 A CN 107391040A
- Authority
- CN
- China
- Prior art keywords
- data
- data block
- cryptographic hash
- hash
- mapped
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0602—Interfaces specially adapted for storage systems specifically adapted to achieve a particular effect
- G06F3/061—Improving I/O performance
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0629—Configuration or reconfiguration of storage systems
- G06F3/0632—Configuration or reconfiguration of storage systems by initialisation or re-initialisation of storage systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
- G06F3/0646—Horizontal data movement in storage systems, i.e. moving data in between storage devices or systems
- G06F3/0647—Migration mechanisms
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
- G06F3/0601—Interfaces specially adapted for storage systems
- G06F3/0668—Interfaces specially adapted for storage systems adopting a particular infrastructure
- G06F3/0671—In-line storage system
- G06F3/0683—Plurality of storage devices
- G06F3/0689—Disk arrays, e.g. RAID, JBOD
Abstract
The invention discloses a kind of method of storage array disk I O scheduling; this method can first calculate the cryptographic Hash of I/O data; and I/O data is mapped on Hash ring according to the cryptographic Hash; the data block on Hash ring is mapped in advance further according to sequential search set in advance, in the data block is stored data in；Method provided by the present invention, I/O data can be allowed to have identical probability distribution in each data block of logical volume, when I/O data is more, it is possible to ensure that I/O data is evenly distributed in each data block of logical volume, i.e., balanced is distributed I/O data on multiple disks；Present invention also offers a kind of device of storage array disk I O scheduling, equally with above-mentioned beneficial effect.
Description
Technical field
The present invention relates to field of data storage, more particularly to a kind of method and device of storage array disk I O scheduling.
Background technology
With today's society science and technology development, at this stage most enterprises use magnetic disc array storage data.
It is in order to allow data being distributed in disk array evenly, i.e., fully sharp when using magnetic disc array storage data
With the performance of multiple disks in disk array, disk can be divided into the data block of amount of storage very little, then by multiple different disks
Data chunk stores into logical volume to data.
In the prior art, the method for IO (input/output) scheduling is typically to be sent to disk battle array in I/O data
After row, while the logical address of the I/O data can be also sent, disk array can be according to the logical address according to setting in advance
Fixed corresponding relation inquires the data block corresponding to the logical address, and according to the type of the I/O data to the data block
Operated.
But in existing technology, generally can not sufficiently utilize the performance of each disk, i.e., can not be balanced by IO
Data distribution is on multiple disks.
The content of the invention
It is an object of the invention to provide a kind of method of storage array disk I O scheduling, each disk can be made full use of
Performance；Present invention also offers I/O data multiple by a kind of device of storage array disk I O scheduling, can be balanced be distributed in
On disk.
In order to solve the above technical problems, the present invention provides a kind of method of storage array disk I O scheduling, methods described bag
Include：
Calculate the cryptographic Hash of the I/O data got；
The I/O data is mapped in the space corresponding to the Hash ring of logical volume according to the cryptographic Hash, the logic
Volume includes the data block of multiple disks；
The sky of the Hash ring is mapped to previously according to the cryptographic Hash of each data block according to sequential query set in advance
Between in data block；
By the data storage got in the data block inquired.
Optionally, it is described be mapped to according to sequential query set in advance previously according to the cryptographic Hash of each data block described in
Data block in the space of Hash ring includes：
First cryptographic Hash previously according to each data block is inquired about according to clockwise direction and is mapped to the Hash ring
Data block in space.
Optionally, the cryptographic Hash of each data block is according to the product ID of disk where each data block and each
The cryptographic Hash that the numbering of the individual data block is calculated.
Optionally, it is characterised in that the logical volume includes the data block of whole disks.
Present invention also offers a kind of device of storage array disk I O scheduling, described device includes：
Computing module：For calculating the cryptographic Hash of the I/O data got；
Mapping block：For the I/O data to be mapped to the sky of the Hash ring corresponding to logical volume according to the cryptographic Hash
Between in, the logical volume includes the data block of multiple disks；
Enquiry module：For being mapped to institute previously according to the cryptographic Hash of each data block according to sequential query set in advance
State the data block in the space of Hash ring；
Memory module：For by the data storage got in the data block inquired.
Optionally, the enquiry module is specifically used for：
First cryptographic Hash previously according to each data block is inquired about according to clockwise direction and is mapped to the Hash ring
Data block in space.
Optionally, the enquiry module is specifically used for：
First cryptographic Hash previously according to each data block is inquired about according to clockwise direction and is mapped to the Hash ring
Data block in space, the cryptographic Hash of each data block are the product ID of disk and each according to where each data block
The cryptographic Hash that the numbering of the individual data block is calculated.
Optionally, it is characterised in that the mapping block is specifically used for：
The I/O data is mapped in the space corresponding to the Hash ring of logical volume according to the cryptographic Hash, the logic
Volume includes the data block of whole disks.
Present invention also offers a kind of method of storage array disk I O scheduling, methods described includes：
Calculate the cryptographic Hash of the I/O data got；
The I/O data is mapped in the space corresponding to the Hash ring of logical volume according to the cryptographic Hash, the logic
Volume includes the data block of multiple disks；
The sky of the Hash ring is mapped to previously according to the cryptographic Hash of each data block according to sequential query set in advance
Between in data block；
Data are read from the data block inquired.
Present invention also offers a kind of device of storage array disk I O scheduling, described device includes：
Computing module：For calculating the cryptographic Hash of the I/O data got；
Mapping block：For the I/O data to be mapped to the sky of the Hash ring corresponding to logical volume according to the cryptographic Hash
Between in, the logical volume includes the data block of multiple disks；
Enquiry module：For being mapped to institute previously according to the cryptographic Hash of each data block according to sequential query set in advance
State the data block in the space of Hash ring；
Read module：For reading data from the data block inquired.
A kind of method of storage array disk I O scheduling provided by the present invention, the cryptographic Hash of I/O data can be first calculated,
And I/O data is mapped on Hash ring according to the cryptographic Hash, Hash is mapped in advance further according to sequential search set in advance
Data block on ring, in the data block is stored data in.Method provided by the present invention, I/O data can be allowed to have identical
Probability distribution in each data block of logical volume, when I/O data is more, it is possible to ensure that I/O data is uniformly distributed
In each data block of logical volume, i.e., balanced is distributed I/O data on multiple disks.Simultaneously because hash algorithm when
Between complexity be 0 (1), the schedule speed of I/O data can be greatly improved, so as to further improve the performance of whole storage system,
And when some disk is damaged or new addition disk needs to do Data Migration, can only it migrate and the damage
The related data of disk that is bad or newly adding, and all data in storage system are migrated without overall.This hair
It is bright to additionally provide a kind of device of storage array disk I O scheduling, equally with above-mentioned beneficial effect, no longer repeated herein.
Present invention also offers a kind of method and device of storage array disk I O scheduling, with the above method and device class
Seemingly, after the data block is inquired, data can be read from the data block inquired.Side provided by the present invention
Method and device, equally with above-mentioned beneficial effect, no longer repeated herein.
Brief description of the drawings
, below will be to embodiment or existing for the clearer explanation embodiment of the present invention or the technical scheme of prior art
The required accompanying drawing used is briefly described in technology description, it should be apparent that, drawings in the following description are only this hair
Some bright embodiments, for those of ordinary skill in the art, on the premise of not paying creative work, can be with root
Other accompanying drawings are obtained according to these accompanying drawings.
The flow chart for the first storage array disk I/O dispatching method that Fig. 1 is provided by the embodiment of the present invention；
Fig. 2 is the structured flowchart of the first storage array disk I/O dispatching device provided in an embodiment of the present invention；
The flow chart for second of storage array disk I/O dispatching method that Fig. 3 is provided by the embodiment of the present invention；
Fig. 4 is the structured flowchart of second of storage array disk I/O dispatching device provided in an embodiment of the present invention.
Embodiment
The core of the present invention is to provide a kind of method of storage array disk I O scheduling.In the prior art, typically exist
I/O data is sent to after disk array, while can also send the logical address of the I/O data, and disk array can basis
The logical address inquires the data block corresponding to the logical address according to corresponding relation set in advance, and according to the IO numbers
According to type the data block is operated.But in the prior art, typically order stores data in disk,
The disk that can thus come above is filled with, but the disk come below is also not used.Thus not
The performance of each disk can sufficiently be utilized, i.e., can not be balanced by I/O data distribution on multiple disks.
And a kind of method of storage array disk I O scheduling provided by the present invention, it can first calculate the Hash of I/O data
Value, and I/O data is mapped on Hash ring according to the cryptographic Hash, it is mapped in advance further according to sequential search set in advance
Data block on Hash ring, in the data block is stored data in.Method provided by the present invention, I/O data can be allowed to have
Identical probability distribution is in each data block of logical volume, when I/O data is more, it is possible to ensure that I/O data is uniform
It is distributed in each data block of logical volume, i.e., balanced is distributed I/O data on multiple disks.Simultaneously because hash algorithm
Time complexity be 0 (1), the schedule speed of I/O data can be greatly improved, so as to further improving whole storage system
Performance, and when some disk be damaged it is either new add disk and need to do Data Migration when, can only migrate with
The data for the disk correlation that the damage either newly adds, and all data in storage system are moved without overall
Move.
In order that those skilled in the art more fully understand the present invention program, with reference to the accompanying drawings and detailed description
The present invention is described in further detail.Obviously, described embodiment is only part of the embodiment of the present invention, rather than
Whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art are not making creative work premise
Lower obtained every other embodiment, belongs to the scope of protection of the invention.
It refer to Fig. 1, the flow for the first storage array disk I/O dispatching method that Fig. 1 is provided by the embodiment of the present invention
Figure, this method include：
S101：Calculate the cryptographic Hash of the I/O data got.
In embodiments of the present invention, when server is needed to storage array data storage, can be sent out to the storage array
The data and an I/O data that needs store are sent, the number for storage can be inquired according to the I/O data in subsequent step
According to block.
In this step, accounting counts stating the cryptographic Hash of I/O data in, to inquire about corresponding data block in following step.
S102：I/O data is mapped in the space corresponding to the Hash ring of logical volume according to cryptographic Hash, logical volume includes
The data block of multiple disks.
In embodiments of the present invention, conventional hash algorithm has 232Individual space, each space correspond to a cryptographic Hash,
Above-mentioned 232Individual space can use 0 to 232- 1 numeral is numbered, then by above-mentioned 232Individual space is linked in sequence into according to numeral
One ring, the ring are Hash ring, have 2 on the Hash ring32Individual space, each space both correspond to a cryptographic Hash.
In this step, can also be according to the cryptographic Hash by the I/O data after the cryptographic Hash to I/O data is calculated
It is mapped in Hash ring in corresponding space.
In embodiments of the present invention, each logical volume corresponds to a Hash ring, and server is when issuing I/O data pair
I/O data is issued to logical volume.The logical volume is the internal storage location that server can identify on software view, server
Will be considered that logical volume is exactly the memory headroom for storage.But final data can be stored in the memory headroom of each disk,
Be pushed into physical layer from software view, can include the data block of multiple physical disks in logical volume, the data block in advance from
A part of memory headroom marked off in the memory headroom of disk, it can be used for storing data.Further, in order to more preferable
The performance of each disk is played, logical volume can be allowed to include the data block of whole disks in storage array, and in order to by number
According to being distributed in the internal memory centre of each disk evenly, each magnetic that can further set a logical volume to include
The quantity of the data block of disk is equal, i.e., separates identical quantity from each disk, and the data chunks of formed objects is into logic
Volume.
S103：The sky of Hash ring is mapped to previously according to the cryptographic Hash of each data block according to sequential query set in advance
Between in data block.
In this step, because Hash ring may be constructed an annular space, the order set in advance generally has edge
Either inquire about data block in the counterclockwise direction clockwise, can be first nearest data block of inquiry or
Any number of data blocks such as second data block of inquiry either the 3rd data block, are not specifically limited herein, but by
In inquiring about the most rapid also most convenient simultaneously of first data block, so being first data block of inquiry under normal conditions.
In embodiments of the present invention, the cryptographic Hash of each data block can be precalculated, and according to the Hash of each data block
Each data block is mapped among each space on Hash ring by value in advance.
When calculating the cryptographic Hash of each data block, the cryptographic Hash of the identification information of each data block can be calculated.Due to depositing
Store up each disk in array No. SN, i.e. product ID is globally unique, so generally with the production of data block place disk
Product sequence number addend is according to identification information of the block number as the data block.It is of course also possible to other letters with other data blocks
The identification information as the data block is ceased, as long as mark action can be played, is not specifically limited in embodiments of the present invention.
S104：By the data storage got in the data block inquired.
In this step, in the data block that the data Cun Chudao that can be sent server is inquired by above-mentioned steps.
A kind of method for storage array disk I O scheduling that the embodiment of the present invention is provided, IO can be allowed using hash algorithm
Data have identical probability distribution in each data block of logical volume, when I/O data is more, it is possible to ensure I/O data
It is evenly distributed in each data block of logical volume, i.e., balanced is distributed I/O data on multiple disks.Simultaneously because breathe out
The time complexity of uncommon algorithm is 0 (1), can greatly improve the schedule speed of I/O data, so as to further improve whole storage
The performance of system, and when some disk is damaged or new addition disk needs to do Data Migration, can be only
The data related to the disk that the damage either newly adds are migrated, and all data in storage system are entered without overall
Row Data Migration.
The first storage array disk I/O dispatching device provided in an embodiment of the present invention is introduced below, is described below
I O scheduling device can be mutually to should refer to above-described I O scheduling method.
Fig. 2 be the first storage array disk I/O dispatching device provided in an embodiment of the present invention structured flowchart, reference picture
2, I O scheduling device can include：
Computing module 100：For calculating the cryptographic Hash of the I/O data got.
Mapping block 200：For the I/O data to be mapped to the Hash ring corresponding to logical volume according to the cryptographic Hash
Space in, the logical volume includes the data block of multiple disks.
Enquiry module 300：For being mapped according to cryptographic Hash of the sequential query set in advance previously according to each data block
To the data block in the space of the Hash ring.
Memory module 400：For by the data storage got in the data block inquired.
In embodiments of the present invention, the enquiry module 300 can be specifically used for：
First cryptographic Hash previously according to each data block is inquired about according to clockwise direction and is mapped to the Hash ring
Data block in space.
In embodiments of the present invention, the enquiry module 300 can be specifically used for：
First cryptographic Hash previously according to each data block is inquired about according to clockwise direction and is mapped to the Hash ring
Data block in space, the cryptographic Hash of each data block are the product ID of disk and each according to where each data block
The cryptographic Hash that the numbering of the individual data block is calculated.
In embodiments of the present invention, the mapping block 200 can be specifically used for：
The I/O data is mapped in the space corresponding to the Hash ring of logical volume according to the cryptographic Hash, the logic
Volume includes the data block of whole disks.
The I O scheduling device of the present embodiment is used to realize foregoing I O scheduling method, therefore the specific reality in I O scheduling device
The embodiment part of the visible I O scheduling method hereinbefore of mode is applied, for example, computing module 100, mapping block 200, inquires about mould
Block 300, memory module 400, it is respectively used to realize step S101, S102, S103 and S104 in above-mentioned I O scheduling method, so,
Its embodiment is referred to the description of corresponding various pieces embodiment, will not be repeated here.
It refer to Fig. 3, the flow for second of storage array disk I/O dispatching method that Fig. 3 is provided by the embodiment of the present invention
Figure, this method include：
S201：Calculate the cryptographic Hash of the I/O data got.
S202：I/O data is mapped in the space corresponding to the Hash ring of logical volume according to institute's cryptographic Hash, logical volume bag
Include the data block of multiple disks.
S203：Institute's Hash ring is mapped to previously according to the cryptographic Hash of each data block according to sequential query set in advance
Data block in space.
S204：Data are read from the data block inquired.
In embodiments of the present invention, can be to the storage array when server needs to read data from storage array
An I/O data is sent, and performs above-mentioned S201 to S204.
S201 to S203 is identical with S101 in above-described embodiment to S103, contributes to introduce and how to be looked for according to I/O data
Corresponding data block, detail are described in detail, no longer repeated herein in the above-described embodiments.
In embodiments of the present invention, after data block is inquired, the number of data block storage can be read from data block
According to.
Second of storage array disk I/O dispatching device provided in an embodiment of the present invention is introduced below, is described below
I O scheduling device can be mutually to should refer to above-described I O scheduling method.
Fig. 4 be second of storage array disk I/O dispatching device provided in an embodiment of the present invention structured flowchart, reference picture
4, I O scheduling device can include：
Computing module 100：For calculating the cryptographic Hash of the I/O data got.
Mapping block 200：For the I/O data to be mapped to the Hash ring corresponding to logical volume according to the cryptographic Hash
Space in, the logical volume includes the data block of multiple disks；
Enquiry module 300：For being mapped according to cryptographic Hash of the sequential query set in advance previously according to each data block
To the data block in the space of the Hash ring；
Read module 500：For reading data from the data block inquired.
The I O scheduling device of the present embodiment is used to realize foregoing I O scheduling method, therefore the specific reality in I O scheduling device
The embodiment part of the visible I O scheduling method hereinbefore of mode is applied, for example, computing module 100, mapping block 200, inquires about mould
Block 300, memory module 500, it is respectively used to realize step S201, S202, S203 and S204 in above-mentioned I O scheduling method, so,
Its embodiment is referred to the description of corresponding various pieces embodiment, will not be repeated here.
Each embodiment is described by the way of progressive in this specification, what each embodiment stressed be with it is other
The difference of embodiment, between each embodiment same or similar part mutually referring to.For dress disclosed in embodiment
For putting, because it is corresponded to the method disclosed in Example, so description is fairly simple, related part is referring to method part
Explanation.
Professional further appreciates that, with reference to the unit of each example of the embodiments described herein description
And algorithm steps, can be realized with electronic hardware, computer software or the combination of the two, in order to clearly demonstrate hardware and
The interchangeability of software, the composition and step of each example are generally described according to function in the above description.These
Function is performed with hardware or software mode actually, application-specific and design constraint depending on technical scheme.Specialty
Technical staff can realize described function using distinct methods to each specific application, but this realization should not
Think beyond the scope of this invention.
Directly it can be held with reference to the step of method or algorithm that the embodiments described herein describes with hardware, processor
Capable software module, or the two combination are implemented.Software module can be placed in random access memory (RAM), internal memory, read-only deposit
Reservoir (ROM), electrically programmable ROM, electrically erasable ROM, register, hard disk, moveable magnetic disc, CD-ROM or technology
In any other form of storage medium well known in field.
Detailed Jie has been carried out to the method and device of a kind of storage array disk I O scheduling provided by the present invention above
Continue.Specific case used herein is set forth to the principle and embodiment of the present invention, and the explanation of above example is only
It is the method and its core concept for being used to help understand the present invention.It should be pointed out that for those skilled in the art
For, under the premise without departing from the principles of the invention, some improvement and modification can also be carried out to the present invention, these improve and repaiied
Decorations are also fallen into the protection domain of the claims in the present invention.
Claims (10)
- A kind of 1. method of storage array disk I O scheduling, it is characterised in that methods described includes：Calculate the cryptographic Hash of the I/O data got；The I/O data is mapped in the space corresponding to the Hash ring of logical volume according to the cryptographic Hash, the logical volume bag Include the data block of multiple disks；It is mapped to according to sequential query set in advance previously according to the cryptographic Hash of each data block in the space of the Hash ring Data block；By the data storage got in the data block inquired.
- 2. according to the method for claim 1, it is characterised in that it is described according to sequential query set in advance previously according to each The data block that the cryptographic Hash of individual data block is mapped in the space of the Hash ring includes：The space of the Hash ring is mapped to according to first cryptographic Hash previously according to each data block of clockwise direction inquiry In data block.
- 3. according to the method for claim 2, it is characterised in that the cryptographic Hash of each data block is according to each data The cryptographic Hash that the product ID of disk and the numbering of each data block where block are calculated.
- 4. according to the method described in any one of claims 1 to 3 claim, it is characterised in that the logical volume is included all The data block of disk.
- 5. a kind of device of storage array disk I O scheduling, it is characterised in that described device includes：Computing module：For calculating the cryptographic Hash of the I/O data got；Mapping block：For the I/O data to be mapped to the space of the Hash ring corresponding to logical volume according to the cryptographic Hash In, the logical volume includes the data block of multiple disks；Enquiry module：For being mapped to the Kazakhstan previously according to the cryptographic Hash of each data block according to sequential query set in advance Data block in the space of uncommon ring；Memory module：For by the data storage got in the data block inquired.
- 6. device according to claim 5, it is characterised in that the enquiry module is specifically used for：The space of the Hash ring is mapped to according to first cryptographic Hash previously according to each data block of clockwise direction inquiry In data block.
- 7. device according to claim 6, it is characterised in that the enquiry module is specifically used for：The space of the Hash ring is mapped to according to first cryptographic Hash previously according to each data block of clockwise direction inquiry In data block, the cryptographic Hash of each data block is the product ID of disk and each institute according to where each data block State the cryptographic Hash that the numbering of data block is calculated.
- 8. according to the device described in any one of claim 5 to 7 claim, it is characterised in that the mapping block is specifically used In：The I/O data is mapped in the space corresponding to the Hash ring of logical volume according to the cryptographic Hash, the logical volume bag Include the data block of whole disks.
- A kind of 9. method of storage array disk I O scheduling, it is characterised in that methods described includes：Calculate the cryptographic Hash of the I/O data got；The I/O data is mapped in the space corresponding to the Hash ring of logical volume according to the cryptographic Hash, the logical volume bag Include the data block of multiple disks；It is mapped to according to sequential query set in advance previously according to the cryptographic Hash of each data block in the space of the Hash ring Data block；Data are read from the data block inquired.
- 10. a kind of device of storage array disk I O scheduling, it is characterised in that described device includes：Computing module：For calculating the cryptographic Hash of the I/O data got；Mapping block：For the I/O data to be mapped to the space of the Hash ring corresponding to logical volume according to the cryptographic Hash In, the logical volume includes the data block of multiple disks；Enquiry module：For being mapped to the Kazakhstan previously according to the cryptographic Hash of each data block according to sequential query set in advance Data block in the space of uncommon ring；Read module：For reading data from the data block inquired.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710630586.3A CN107391040A (en) | 2017-07-28 | 2017-07-28 | A kind of method and device of storage array disk I O scheduling |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710630586.3A CN107391040A (en) | 2017-07-28 | 2017-07-28 | A kind of method and device of storage array disk I O scheduling |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN107391040A true CN107391040A (en) | 2017-11-24 |
Family
ID=60342857
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710630586.3A Pending CN107391040A (en) | 2017-07-28 | 2017-07-28 | A kind of method and device of storage array disk I O scheduling |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107391040A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108304460A (en) * | 2017-12-25 | 2018-07-20 | 中国电力科学研究院有限公司 | A kind of localization method and system improving database |
| CN110058822A (en) * | 2019-04-26 | 2019-07-26 | 北京计算机技术及应用研究所 | A kind of disk array transverse direction expanding method |
| CN110083312A (en) * | 2019-04-28 | 2019-08-02 | 联想(北京)有限公司 | Disk expansion method, device and computer equipment |
| CN110377647A (en) * | 2019-07-30 | 2019-10-25 | 江门职业技术学院 | One kind being based on distributed data base demand information querying method and system |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102857560A (en) * | 2012-08-15 | 2013-01-02 | 华数传媒网络有限公司 | Multi-service application orientated cloud storage data distribution method |
| CN104050270A (en) * | 2014-06-23 | 2014-09-17 | 成都康赛信息技术有限公司 | Distributed storage method based on consistent Hash algorithm |
| CN105159604A (en) * | 2015-08-20 | 2015-12-16 | 浪潮(北京)电子信息产业有限公司 | Disk data read-write method and system |
| CN106572153A (en) * | 2016-10-21 | 2017-04-19 | 乐视控股（北京）有限公司 | Data storage method and device of cluster |
| US20170212705A1 (en) * | 2016-01-26 | 2017-07-27 | Netapp, Inc. | Dynamic Weighting for Distributed Parity Device Layouts |
-
2017
- 2017-07-28 CN CN201710630586.3A patent/CN107391040A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102857560A (en) * | 2012-08-15 | 2013-01-02 | 华数传媒网络有限公司 | Multi-service application orientated cloud storage data distribution method |
| CN104050270A (en) * | 2014-06-23 | 2014-09-17 | 成都康赛信息技术有限公司 | Distributed storage method based on consistent Hash algorithm |
| CN105159604A (en) * | 2015-08-20 | 2015-12-16 | 浪潮(北京)电子信息产业有限公司 | Disk data read-write method and system |
| US20170212705A1 (en) * | 2016-01-26 | 2017-07-27 | Netapp, Inc. | Dynamic Weighting for Distributed Parity Device Layouts |
| CN106572153A (en) * | 2016-10-21 | 2017-04-19 | 乐视控股（北京）有限公司 | Data storage method and device of cluster |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108304460A (en) * | 2017-12-25 | 2018-07-20 | 中国电力科学研究院有限公司 | A kind of localization method and system improving database |
| CN108304460B (en) * | 2017-12-25 | 2022-10-25 | 中国电力科学研究院有限公司 | Improved database positioning method and system |
| CN110058822A (en) * | 2019-04-26 | 2019-07-26 | 北京计算机技术及应用研究所 | A kind of disk array transverse direction expanding method |
| CN110058822B (en) * | 2019-04-26 | 2022-06-24 | 北京计算机技术及应用研究所 | Transverse expansion method for disk array |
| CN110083312A (en) * | 2019-04-28 | 2019-08-02 | 联想(北京)有限公司 | Disk expansion method, device and computer equipment |
| CN110083312B (en) * | 2019-04-28 | 2021-01-15 | 联想(北京)有限公司 | Disk capacity expansion method and device and computer equipment |
| CN110377647A (en) * | 2019-07-30 | 2019-10-25 | 江门职业技术学院 | One kind being based on distributed data base demand information querying method and system |
| CN110377647B (en) * | 2019-07-30 | 2022-07-29 | 江门职业技术学院 | Demand information query method and system based on distributed database |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10474631B2 (en) | Method and apparatus for content derived data placement in memory | |
| CA2766231C (en) | Namespace file system accessing an object store | |
| CN107391040A (en) | A kind of method and device of storage array disk I O scheduling | |
| CN105138476B (en) | A kind of date storage method and system based on the storage of hadoop isomeries | |
| CN103136243B (en) | File system duplicate removal method based on cloud storage and device | |
| CN107506447A (en) | A kind of small documents reading/writing method and system based on local file system | |
| US9235611B1 (en) | Data growth balancing | |
| CN103473298B (en) | Data archiving method and device and storage system | |
| JP2012531675A5 (en) | ||
| CN103902698A (en) | Data storage system and data storage method | |
| CN101777016A (en) | Snapshot storage and data recovery method of continuous data protection system | |
| CN103902702A (en) | Data storage system and data storage method | |
| US20180089266A1 (en) | Direct table association in in-memory databases | |
| GB2476536A (en) | Modified B+ tree to map logical addresses to physical addresses in NAND flash memory | |
| CN106406759A (en) | Data storage method and device | |
| CN104951462B (en) | Method and system for managing database | |
| CN104182508A (en) | Data processing method and data processing device | |
| CN106775474A (en) | A kind of Nand Flash abrasion equilibrium methods, device and memory | |
| CN105389367A (en) | Power network graphic multi-tense and multi-level distributed storage method based on Mongo database | |
| CN107665255A (en) | Method, apparatus, equipment and the storage medium of key value database data change | |
| CN102662869A (en) | Method and device for access to memory of virtual machine and finders | |
| CN112148217B (en) | Method, device and medium for caching deduplication metadata of full flash memory system | |
| CN106406762A (en) | A repeated data deleting method and device | |
| CN109471843A (en) | A kind of metadata cache method, system and relevant apparatus | |
| CN103473258A (en) | Cloud storage file system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20171124 |
|
| RJ01 | Rejection of invention patent application after publication |