Nothing Special   »   [go: up one dir, main page]

CN102104614A - Data access method and device - Google Patents

Data access method and device Download PDF

Info

Publication number
CN102104614A
CN102104614A CN2009102611600A CN200910261160A CN102104614A CN 102104614 A CN102104614 A CN 102104614A CN 2009102611600 A CN2009102611600 A CN 2009102611600A CN 200910261160 A CN200910261160 A CN 200910261160A CN 102104614 A CN102104614 A CN 102104614A
Authority
CN
China
Prior art keywords
bandwidth
disk
memory space
data access
access request
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
Application number
CN2009102611600A
Other languages
Chinese (zh)
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.)
Huawei Digital Technologies Chengdu Co Ltd
Original Assignee
Huawei Symantec Technologies 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 Huawei Symantec Technologies Co Ltd filed Critical Huawei Symantec Technologies Co Ltd
Priority to CN2009102611600A priority Critical patent/CN102104614A/en
Publication of CN102104614A publication Critical patent/CN102104614A/en
Pending legal-status Critical Current

Links

Images

Landscapes

  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The embodiment of the invention discloses a data access method and device, and the method comprises the following steps: receiving a data access request, wherein the data access request contains a storage space to be accessed; determining the bandwidth to be configured to the storage space to be accessed based on the preset correspondence between the storage space and the bandwidth; and when the current access flow can not reach the upper limit of the bandwidth distributed to the storage space to be accessed, handing down the data access request so as to access data. According to the invention, under the premise of not additionally arranging extra equipment, important application programs are ensured to have enough bandwidth for processing, and the resource distribution mode is more flexible, thus the method and device provided by the invention are suitable for the occasions with various application programs of different importance levels.

Description

A kind of data access method and device
Technical field
The present invention relates to field of storage, relate in particular to a kind of data access method and device.
Background technology
Because professional complexity; usually can handle multiple application program simultaneously on the application server; and all need to read and write disk, the disk here comprise the server local disk and by external storage array shine upon to the server logical unit (Logic Unit, LU) etc.With comparing at a high speed of CPU computing, the speed of disk access is then much lower, and this also becomes the key factor that influences application program capacity.And the limited and multiple factor of the access bandwidth of disk is relevant, link bandwidth between disk running speed, server and the storage array etc. for example, and rely on the performance of the raising application programs such as link bandwidth between disk running speed, server and the storage array can compare difficulty, can't unrestrictedly improve, have enough bandwidth to be handled so be necessary preferentially to guarantee the important use program.
For the scene of using local disk, prior art adopts the mode of creating logical volume usually, for the important use program, use a plurality of disks with raid-array (Redundant Array ofIndependent Disk, mode RAID) is created logical volume, will be to the output/input (Input/Output of disk, IO) request is shared on a plurality of disks, for inferior important use program, then use less disk, even a disk is created logical volume.Because the quantity of server local disk is less usually, so can't support the application program of multiple different brackets, and owing to need come estimated performance according to number of disks, and the performance sum of two disks twice of a disk not necessarily, so allocated bandwidth is not too directly perceived, accurately.
For the scene of using external storage array, usually use multistage storage in the prior art, be that application server connects many performances or the different memory device of specification simultaneously, the important use program division is deployed on the high memory device of performance, less important APD is deployed on the lower memory device of performance, do not disturb mutually to reach each business, guarantee the purpose of the performance of important application program.Yet this method need be bought many memory devices, and the mode underaction of resource allocation, the difficult situation that is applicable to the application program of multiple different important level.
Summary of the invention
The embodiment of the invention provides a kind of data access method and device, can be each application assigned disk bandwidth on application server, to guarantee the important use program enough bandwidth is arranged.
The data access method that the embodiment of the invention provides comprises: receive data access request, described data access request comprises memory space to be visited; In predefined corresponding relation, be defined as the bandwidth that described memory space to be visited disposes; Judge whether the current accessed flow is reached for the bandwidth upper limit that described object to be visited distributes, if, the described data access request of delay process then, otherwise, issue described data access request with visit data.
The DAA that the embodiment of the invention provides comprises:
Receiver module is used to receive data access request, and described data access request comprises memory space to be visited;
The bandwidth determination module is used for being defined as the bandwidth that described memory space to be visited disposes according to the corresponding relation between predefined memory space and the bandwidth;
Judge module is used to judge whether the current accessed flow is reached for the bandwidth upper limit of described memory allocation to be visited;
Processing module is judged the current accessed flow and is reached the described bandwidth upper limit if be used for judge module, the described data access request of delay process then, otherwise, issue described data access request with visit data.
As can be seen from the above technical solutions, the embodiment of the invention has the following advantages:
The embodiment of the invention obtains memory space to be visited from the data access request that receives, be defined as the bandwidth of this memory space configuration according to the corresponding relation between predefined memory space and the bandwidth, the going up of bandwidth that is reached for this memory space configuration when the current accessed flow prescribed a time limit, issuing this request gives disk with visit data, because the bandwidth of memory space to be visited configuration is predefined, when preestablishing the bandwidth of memory space, can set according to the importance of application program, thereby can guarantee is not needing to add under the situation of extras, and the important use program has enough bandwidth to handle.And allocated bandwidth is relatively more directly perceived, accurate, and resource distribution mode is more flexible, can be applicable to the situation of the application program of multiple different important level.
Description of drawings
In order to be illustrated more clearly in the technical scheme in the embodiment of the invention, the accompanying drawing of required use is done to introduce simply in will describing embodiment below, apparently, accompanying drawing in describing below only is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
Fig. 1 is embodiment schematic diagram of data access method in the embodiment of the invention;
Fig. 2 is another embodiment schematic diagram of data access method in the embodiment of the invention;
Fig. 3 is the structural representation of DAA embodiment in the embodiment of the invention;
Fig. 4 is the structural representation of another embodiment of DAA in the embodiment of the invention.
Embodiment
Below in conjunction with the accompanying drawing among the present invention, the technical scheme among the present invention is clearly and completely described, obviously, described embodiment only is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, the every other embodiment that those of ordinary skills are obtained under the prerequisite of not making creative work belongs to the scope of protection of the invention.
The embodiment of the invention provides a kind of data access method and device, can guarantee that the important use program has enough bandwidth access data.
See also Fig. 1, embodiment of data processing method comprises in the embodiment of the invention:
100, receive data access request, this data access request comprises memory space to be visited;
Concrete, when handling application program, usually need the read-write disk, described as step 100, receive data access request, in this data access request, can comprise data to be visited, for example: the data that data that read or requirement write, can also comprise memory space to be visited, for example: the disk that the disk of storage to be read or data demand write.
105, be defined as the bandwidth that described memory space to be visited disposes according to the corresponding relation between predefined memory space and the bandwidth;
Concrete, the corresponding relation between memory space and the bandwidth is predefined, can obtain the bandwidth that disposes into memory space according to this corresponding relation;
For instance, in advance application program is divided into important application program A, less important application program B and inessential application program C according to its importance, application A is deployed in disk 1, application program B is deployed in disk 2, application program C is deployed in disk 3;
And, be disk 1 configuration 50MB/S bandwidth in advance, be disk 2 configuration 30MB/S bandwidth, be disk 3 configuration 20MB/S bandwidth;
In step 100, can know that by the data access request that receives memory space to be visited is a disk 2, so according to above-mentioned corresponding relation, the bandwidth that disposes for disk 2 is 30MB/S;
Need to prove, the percentage of the total bandwidth that can also go out according to real-time statistics recently is disk 1, disk 2, disk 3 configured bandwidths, for example, be 50% of total bandwidth before disk 1 configuration purpose, be 30% of total bandwidth before disk 2 configuration purpose, for 20% of total bandwidth before disk 3 configuration purpose, do not limit at this.
110, be not reached on the bandwidth of memory allocation to be visited in limited time when the current accessed flow, issue this data access request with visit data;
For instance, the bandwidth that can be known as disk 2 distribution from step 105 is 30MB/S, because this data access request need be visited disk 2, so its flow can not reach the upper limit of bandwidth, 30MB/S.
If the flow of this data access request does not reach 30MB/S, illustrate that then disk 2 also has enough bandwidth to handle this data access request, issue this data access request so and give disk 2 with visit data.
As can be seen from the above technical solutions, the embodiment of the invention has the following advantages:
The embodiment of the invention obtains memory space to be visited from the data access request that receives, be defined as the bandwidth of this memory space configuration according to the corresponding relation between predefined memory space and the bandwidth, the going up of bandwidth that is reached for this memory space configuration when the current accessed flow prescribed a time limit, issuing this request gives disk with visit data, because the bandwidth of memory space to be visited configuration is predefined, when preestablishing the bandwidth of memory space, can set according to the importance of application program, thereby can guarantee is not needing to add under the situation of extras, and the important use program has enough bandwidth to handle.And allocated bandwidth is relatively more directly perceived, accurate, and resource distribution mode is more flexible, can be applicable to the situation of the application program of multiple different important level.
See also Fig. 2, another embodiment of data access method comprises in the embodiment of the invention:
200, be the corresponding memory space of application assigned, according to the bandwidth of the policy configurations memory space of setting;
Concrete, for application program is distributed corresponding memory space according to its importance, this memory space can be a disk, also can be the logical volume in the disk;
For instance, in advance application program is divided into important application program A, less important application program B and inessential application program C according to its importance, application A is deployed in disk 1, application program B is deployed in logical volume 21 in the disk 2, application program C is deployed in logical volume 22 in the disk 2;
With not being both for example among the embodiment 1, APD can be deployed on the disk, also can be deployed on the logical volume in the disk;
Behind the logical volume that APD is deployed in corresponding disk or the disk, be logical volume configured bandwidth in disk or the disk according to the strategy of setting again;
For instance, can be disk 1 configuration 50MB/S bandwidth, be the 21 configuration 30MB/S bandwidth of logical volume in the disk 2, be the 22 configuration 20MB/S bandwidth of logical volume in the disk 2, be understandable that, disk 1 deploy be application A, and application A is the highest application program of important level, think that the bandwidth of disk 1 configuration is more, to guarantee the important use program enough bandwidth access data can be arranged;
Need to prove, the percentage of the total bandwidth that can also go out according to real-time statistics recently is the logical volume 21 in disk 1, the disk 2, logical volume 22 configured bandwidths in the disk 2, for example, be 50% of total bandwidth before disk 1 configuration purpose, be 30% of total bandwidth before 21 configuration purpose of the logical volume in the disk 2, for 20% of total bandwidth before 22 configuration purpose of the logical volume in the disk 2, do not limit at this.
205, receive data access request, this data access request comprises memory space to be visited and scope;
Concrete, when handling application program, usually need the read-write disk, described as step 200, receive data access request, in this data access request, can comprise data to be visited, for example: the data that data that read or requirement write, can also comprise memory space to be visited, for example: the disk of storage to be read, the perhaps disk that writes of data demand.
In addition, this data access request can also comprise the scope of memory space to be visited, that is, and and the initial address of memory space and length.Because data to be read can be stored in the disk, also can be stored in the logical volume of disk, same, the data that requirement writes can write in the disk, also can write in the logical volume of disk, therefore, the logical volume in the data that write of logical volume in the disk that can know data place to be read according to the initial address and the length of memory space or the requirement disk that will be written into.
210, be defined as the bandwidth that described memory space to be visited disposes according to the corresponding relation between predefined memory space and the bandwidth;
Concrete, according to the bandwidth that in the step 200 is the logical volume configuration in each disk or the disk, can be defined as the current disk to be visited or the bandwidth of the configuration of the logical volume in the disk.
215, judge whether the current accessed flow is reached for the bandwidth upper limit of memory allocation to be visited, if then execution in step 220, otherwise, execution in step 225;
Concrete, according to the bandwidth of disk of determining in the step 200 current to be visited or the configuration of the logical volume in the disk, judge the current upper limit that whether flowing of access of the logical volume in this disk or the disk has been reached for the bandwidth of its configuration.
220, prolong the processing time of this data access request;
Concrete, if step 215 is judged and current the flowing of access of the logical volume in this disk or the disk has been reached for the upper limit of the bandwidth of its configuration, then prolong the processing time of this data access request;
For example, current data access request need be visited the logical volume 21 in the disk 2, bandwidth for logical volume 21 configurations is 30MB/S in advance, be that per second can be handled the IO request that flow is 30MB, and the flow of current I O request is 35MB, the upper limit that has surpassed bandwidth, then the current time can't be handled this IO request, needs time expand to handle.
225, issue this data access request with visit data;
Concrete, if step 215 is judged and current the flowing of access of the logical volume in this disk or the disk has not been reached for the upper limit of the bandwidth of its configuration, then issue this data access request with visit data.
As can be seen from the above technical solutions, the embodiment of the invention has the following advantages:
The embodiment of the invention obtains memory space to be visited from the data access request that receives, be defined as the bandwidth of this memory space configuration according to the corresponding relation between predefined memory space and the bandwidth, the going up of bandwidth that is reached for this memory space configuration when the current accessed flow prescribed a time limit, issuing this request gives disk with visit data, because the bandwidth of memory space to be visited configuration is predefined, when preestablishing the bandwidth of memory space, can set according to the importance of application program, thereby can guarantee is not needing to add under the situation of extras, and the important use program has enough bandwidth to handle.And allocated bandwidth is relatively more directly perceived, accurate, and resource distribution mode is more flexible, can be applicable to the situation of the application program of multiple different important level.
In addition, present embodiment increases step 200 on the basis of a last embodiment, be the corresponding memory space of application assigned, bandwidth according to the policy configurations memory space of setting, the effect of this step mainly is, owing to the important level of each application program may change along with the change of scene, and the embodiment of the invention can onlinely be adjusted into the bandwidth of the memory space configuration that application program disposes, to adapt to the needs of actual conditions.
See also Fig. 3, DAA embodiment comprises in the embodiment of the invention:
Receiver module 30 is used to receive data access request, and described data access request comprises memory space to be visited;
Concrete, when handling application program, usually need the read-write disk, that is, receive data access request, in this data access request, can comprise data to be visited, that is, the data that data that read or requirement write can also comprise memory space to be visited, be the disk of storage to be read, the perhaps disk that writes of data demand.
Bandwidth determination module 31 is used for being defined as the bandwidth that described memory space to be visited disposes according to the corresponding relation between predefined memory space and the bandwidth;
Concrete, the corresponding relation between memory space and the bandwidth is predefined, can obtain the bandwidth that disposes into memory space according to this corresponding relation;
For instance, in advance application program is divided into important application program A, less important application program B and inessential application program C according to its importance, application A is deployed in disk 1, application program B is deployed in disk 2, application program C is deployed in disk 3;
And, be disk 1 configuration 50MB/S bandwidth in advance, be disk 2 configuration 30MB/S bandwidth, be disk 3 configuration 20MB/S bandwidth;
Can know that from the data access request that receiver module 30 receives memory space to be visited is a disk 2, so according to above-mentioned corresponding relation, the bandwidth that disposes for disk 2 is 30MB/S;
Need to prove, the percentage of the total bandwidth that can also go out according to real-time statistics recently is disk 1, disk 2, disk 3 configured bandwidths, for example, be 50% of total bandwidth before disk 1 configuration purpose, be 30% of total bandwidth before disk 2 configuration purpose, for 20% of total bandwidth before disk 3 configuration purpose, do not limit at this.
Processing module 32 is used for not reaching this bandwidth upper limit when the current accessed flow, issues described data access request with visit data;
For instance, the bandwidth that can be known as disk 2 distribution from bandwidth determination module 31 is 30MB/S, because this data access request need be visited disk 2, its flow does not reach the upper limit of bandwidth, 30MB/S so just can issue described data access request with visit data.
As can be seen from the above technical solutions, the embodiment of the invention has the following advantages:
The embodiment of the invention obtains memory space to be visited from the data access request that receives, be defined as the bandwidth of this memory space configuration according to the corresponding relation between predefined memory space and the bandwidth, the going up of bandwidth that is reached for this memory space configuration when the current accessed flow prescribed a time limit, issuing this request gives disk with visit data, because the bandwidth of memory space to be visited configuration is predefined, when preestablishing the bandwidth of memory space, can set according to the importance of application program, thereby can guarantee is not needing to add under the situation of extras, and the important use program has enough bandwidth to handle.And allocated bandwidth is relatively more directly perceived, accurate, and resource distribution mode is more flexible, can be applicable to the situation of the application program of multiple different important level.
See also Fig. 4, another embodiment of DAA comprises in the embodiment of the invention:
Configuration module 40 is used to the corresponding memory space of application assigned, according to the bandwidth of the policy configurations memory space of setting;
Concrete, for application program is distributed corresponding memory space according to its importance, this memory space can be a disk, also can be the logical volume in the disk;
For instance, in advance application program is divided into important application program A, less important application program B and inessential application program C according to its importance, application A is deployed in disk 1, application program B is deployed in logical volume 21 in the disk 2, application program C is deployed in logical volume 22 in the disk 2;
With not being both for example among the embodiment 1, APD can be deployed on the disk, also can be deployed on the logical volume in the disk;
Behind the logical volume that APD is deployed in corresponding disk or the disk, be logical volume configured bandwidth in disk or the disk according to the strategy of setting again;
For instance, can be disk 1 configuration 50MB/S bandwidth, be the 21 configuration 30MB/S bandwidth of logical volume in the disk 2, be the 22 configuration 20MB/S bandwidth of logical volume in the disk 2, be understandable that, disk 1 deploy be application A, and application A is the highest application program of important level, think that the bandwidth of disk 1 configuration is more, to guarantee the important use program enough bandwidth access data can be arranged;
Need to prove, the percentage of the total bandwidth that can also go out according to real-time statistics recently is the logical volume 21 in disk 1, the disk 2, logical volume 22 configured bandwidths in the disk 2, for example, be 50% of total bandwidth before disk 1 configuration purpose, be 30% of total bandwidth before 21 configuration purpose of the logical volume in the disk 2, for 20% of total bandwidth before 22 configuration purpose of the logical volume in the disk 2, do not limit at this.
Receiver module 41 is used to receive data access request, and this data access request comprises memory space to be visited and scope;
Concrete, when handling application program, usually need the read-write disk, that is, receive data access request, in this data access request, can comprise data to be visited, that is, the data that data that read or requirement write can also comprise memory space to be visited, be the disk of storage to be read, the perhaps disk that writes of data demand;
In addition, this data access request can also comprise the scope of memory space to be visited, promptly, the initial address of memory space and length, because data to be read can be stored in the disk, also can be stored in the logical volume of disk, same, the data that requirement writes can write in the disk, also can write in the logical volume of disk, after the initial address and length according to memory space, can know the logical volume in the disk that data that logical volume in the disk at data place to be read or requirement write will be written into.
Bandwidth determination module 42 is used for being defined as the bandwidth that described memory space to be visited disposes according to the corresponding relation between predefined memory space and the bandwidth;
Processing module 43 is used for not reaching this bandwidth upper limit when the current accessed flow, issues described data access request with visit data;
Further, this processing module 43 can also be used for prescribing a time limit when the current accessed flow reaches on this bandwidth, prolongs the processing time of this data access request;
For instance, the bandwidth of distributing for disk 2 is 30MB/S, and the current accessed flow is 40MB/S, the upper limit that surpasses disk 2 bandwidth, just can prolong the processing time of this data access request, represent that per second can handle the flow of 30MB because bandwidth is 30MB/S,, then can handle the flow of 60MB if will the processing time extend to 2S.
As can be seen from the above technical solutions, the embodiment of the invention has the following advantages:
The embodiment of the invention obtains memory space to be visited from the data access request that receives, be defined as the bandwidth of this memory space configuration according to the corresponding relation between predefined memory space and the bandwidth, the going up of bandwidth that is reached for this memory space configuration when the current accessed flow prescribed a time limit, issuing this request gives disk with visit data, because the bandwidth of memory space to be visited configuration is predefined, when preestablishing the bandwidth of memory space, can set according to the importance of application program, thereby can guarantee is not needing to add under the situation of extras, and the important use program has enough bandwidth to handle.And allocated bandwidth is relatively more directly perceived, accurate, and resource distribution mode is more flexible, can be applicable to the situation of the application program of multiple different important level.
In addition, present embodiment increases configuration module 40 on the basis of a last embodiment, be the corresponding memory space of application assigned, bandwidth according to the policy configurations memory space of setting, the effect of this step mainly is, owing to the important level of each application program may change along with the change of scene, and the embodiment of the invention can onlinely be adjusted into the bandwidth of the memory space configuration that application program disposes, to adapt to the needs of actual conditions.
One of ordinary skill in the art will appreciate that all or part of step that realizes in the foregoing description method is to instruct relevant hardware to finish by program, described program can be stored in a kind of computer-readable recording medium, the above-mentioned storage medium of mentioning can be a read-only memory, disk or CD etc.
More than a kind of information processing method provided by the present invention and netscape messaging server Netscape are described in detail, for one of ordinary skill in the art, thought according to the embodiment of the invention, part in specific embodiments and applications all can change, in sum, this description should not be construed as limitation of the present invention.

Claims (10)

1. a data access method is characterized in that, comprising:
Receive data access request, described data access request comprises memory space to be visited;
Be defined as the bandwidth that described memory space to be visited disposes according to the corresponding relation between predefined memory space and the bandwidth;
Be not reached for when the current accessed flow on the bandwidth of described memory allocation to be visited in limited time, issue described data access request with visit data.
2. the method for claim 1 is characterized in that, also comprises:
Be the corresponding memory space of application assigned, according to the bandwidth of the policy configurations memory space of setting.
3. the method for claim 1 is characterized in that, also comprises: be reached for when the current accessed flow on the bandwidth of described memory allocation to be visited in limited time, prolong the processing time of described access request.
4. method as claimed in claim 1 or 2 is characterized in that described memory space comprises disk.
5. method as claimed in claim 1 or 2 is characterized in that, described data access request also comprises the initial address of memory space to be visited and the length of described data;
Described memory space comprises the logical volume in the disk.
6. a DAA is characterized in that, comprising:
Receiver module is used to receive data access request, and described data access request comprises memory space to be visited;
The bandwidth determination module is used for being defined as the bandwidth that described memory space to be visited disposes according to the corresponding relation between predefined memory space and the bandwidth;
Processing module is used for not being reached on the bandwidth of described memory allocation to be visited in limited time when the current accessed flow, issues described data access request with visit data.
7. device as claimed in claim 6 is characterized in that, also comprises:
Configuration module is used to the corresponding memory space of application assigned, according to the bandwidth of the policy configurations memory space of setting.
8. device as claimed in claim 6 is characterized in that, described processing module also is used for being reached on the bandwidth of described memory allocation to be visited in limited time when the current accessed flow, prolongs the processing time of described access request.
9. as claim 6 or 7 described devices, it is characterized in that described memory space comprises disk.
10. as claim 6 or 7 described devices, it is characterized in that described data access request also comprises the initial address of memory space to be visited and the length of described data;
Described memory space comprises the logical volume in the disk.
CN2009102611600A 2009-12-22 2009-12-22 Data access method and device Pending CN102104614A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2009102611600A CN102104614A (en) 2009-12-22 2009-12-22 Data access method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2009102611600A CN102104614A (en) 2009-12-22 2009-12-22 Data access method and device

Publications (1)

Publication Number Publication Date
CN102104614A true CN102104614A (en) 2011-06-22

Family

ID=44157140

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2009102611600A Pending CN102104614A (en) 2009-12-22 2009-12-22 Data access method and device

Country Status (1)

Country Link
CN (1) CN102104614A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103049213A (en) * 2011-10-17 2013-04-17 中国移动通信集团公司 Magnetic disc scheduling method and device
CN106202262A (en) * 2016-06-29 2016-12-07 联想(北京)有限公司 A kind of information processing method and electronic equipment
CN107612873A (en) * 2016-07-12 2018-01-19 阿里巴巴集团控股有限公司 One kind accesses and certificate delivery method, device
CN109062514A (en) * 2018-08-16 2018-12-21 郑州云海信息技术有限公司 A kind of band width control method based on NameSpace, device and storage medium
CN109246033A (en) * 2018-09-19 2019-01-18 郑州云海信息技术有限公司 A kind of request processing method, device, equipment and readable storage medium storing program for executing

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1429451A (en) * 2000-05-12 2003-07-09 提维股份有限公司 Method for improving bandwidth efficiency
CN101271435A (en) * 2008-05-20 2008-09-24 北京中星微电子有限公司 Method for access to external memory

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1429451A (en) * 2000-05-12 2003-07-09 提维股份有限公司 Method for improving bandwidth efficiency
CN101271435A (en) * 2008-05-20 2008-09-24 北京中星微电子有限公司 Method for access to external memory

Cited By (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103049213A (en) * 2011-10-17 2013-04-17 中国移动通信集团公司 Magnetic disc scheduling method and device
CN103049213B (en) * 2011-10-17 2016-01-20 中国移动通信集团公司 A kind of disk-scheduling method and device
CN106202262A (en) * 2016-06-29 2016-12-07 联想(北京)有限公司 A kind of information processing method and electronic equipment
CN107612873A (en) * 2016-07-12 2018-01-19 阿里巴巴集团控股有限公司 One kind accesses and certificate delivery method, device
CN107612873B (en) * 2016-07-12 2021-07-16 阿里巴巴集团控股有限公司 Access and certificate issuing method and device
CN109062514A (en) * 2018-08-16 2018-12-21 郑州云海信息技术有限公司 A kind of band width control method based on NameSpace, device and storage medium
CN109062514B (en) * 2018-08-16 2021-08-31 郑州云海信息技术有限公司 Bandwidth control method and device based on namespace and storage medium
CN109246033A (en) * 2018-09-19 2019-01-18 郑州云海信息技术有限公司 A kind of request processing method, device, equipment and readable storage medium storing program for executing
CN109246033B (en) * 2018-09-19 2022-02-18 郑州云海信息技术有限公司 Request processing method, device, equipment and readable storage medium

Similar Documents

Publication Publication Date Title
US8621141B2 (en) Method and system for wear leveling in a solid state drive
US8239613B2 (en) Hybrid memory device
US8706962B2 (en) Multi-tier storage system configuration adviser
US8838891B2 (en) SSD cache expansion using overprovisioned space
US8719495B2 (en) Concatenating a first raid with a second raid
CN101727293B (en) Method, device and system for setting SSD (solid State disk) storage
JP5075761B2 (en) Storage device using flash memory
US9542306B2 (en) Dynamic storage device provisioning
US8195971B2 (en) Solid state disk and method of managing power supply thereof and terminal including the same
US8296543B2 (en) Computer system management apparatus and management method for the computer system
CN105786400B (en) heterogeneous hybrid memory component, system and storage method
CN109358809B (en) RAID data storage system and method
US20220326872A1 (en) Method for selecting a data block to be collected in gc and storage device thereof
KR102585883B1 (en) Operating method of memory system and memory system
EP2784683B1 (en) Storage control program, storage control method, storage system and hierarchy control apparatus thereof
CN105117180A (en) Data storing method and device and solid state disc
CN103838676B (en) Data-storage system, date storage method and PCM bridges
CN101398749B (en) Static state attrition balancing method, device and system
CN105354152A (en) Nonvolatile memory and wear leveling method
CN102104614A (en) Data access method and device
US20110202743A1 (en) Method and interface for allocating storage capacities to plural pools
US8219757B2 (en) Apparatus and method for low touch cache management
CN104951243A (en) Storage expansion method and device in virtualized storage system
US8468303B2 (en) Method and apparatus to allocate area to virtual volume based on object access type
US9032150B2 (en) Storage apparatus and control method of storage apparatus

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C53 Correction of patent of invention or patent application
CB02 Change of applicant information

Address after: 611731 Chengdu high tech Zone, Sichuan, West Park, Qingshui River

Applicant after: Huawei Symantec Technologies Co., Ltd.

Address before: 611731 Chengdu high tech Zone, Sichuan, West Park, Qingshui River

Applicant before: Chengdu Huawei Symantec Technologies Co., Ltd.

COR Change of bibliographic data

Free format text: CORRECT: APPLICANT; FROM: CHENGDU HUAWEI SYMANTEC TECHNOLOGIES CO., LTD. TO: HUAWEI DIGITAL TECHNOLOGY (CHENGDU) CO., LTD.

C12 Rejection of a patent application after its publication
RJ01 Rejection of invention patent application after publication

Application publication date: 20110622