CN112764684A - Hard disk performance identification method and system of storage system - Google Patents
Hard disk performance identification method and system of storage system Download PDFInfo
- Publication number
- CN112764684A CN112764684A CN202110091171.XA CN202110091171A CN112764684A CN 112764684 A CN112764684 A CN 112764684A CN 202110091171 A CN202110091171 A CN 202110091171A CN 112764684 A CN112764684 A CN 112764684A
- Authority
- CN
- China
- Prior art keywords
- hard disk
- read
- time
- determining
- write requests
- 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.)
- Withdrawn
Links
- 238000000034 method Methods 0.000 title claims abstract description 41
- 230000008569 process Effects 0.000 abstract description 6
- 238000010586 diagram Methods 0.000 description 4
- 238000011156 evaluation Methods 0.000 description 4
- 230000004044 response Effects 0.000 description 3
- 238000004590 computer program Methods 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000009466 transformation Effects 0.000 description 1
- 238000000844 transformation Methods 0.000 description 1
Images
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/0653—Monitoring storage devices or 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/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
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Human Computer Interaction (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention discloses a method and a system for identifying the performance of a hard disk of a storage system, wherein the method comprises the following steps: sequentially accessing each hard disk on the RAID strip, and issuing a plurality of read-write requests to each hard disk; determining the busy time of each hard disk for respectively completing a plurality of read-write requests, and determining the average service time based on the number of processing units of each hard disk and the corresponding busy time; one or more hard disks with an average service time below a threshold are determined to be poor in performance and an alarm and/or kick out from the RAID stripe is performed. The method can accurately evaluate the IO processing capability of the multiprocessor architecture hard disk, and timely identify and process the low-performance hard disk to maintain the normal operation of the storage system.
Description
Technical Field
The present invention relates to the field of performance evaluation, and more particularly, to a method and system for identifying hard disk performance of a storage system.
Background
The current storage system is a RAID (hard disk array) composed of hard disks to provide data storage services. RAID is divided according to strip as granularity, and read-write IO (input/output) of RAID to strip is distributed in all hard disks in RAID. The performance difference of a single hard disk can cause the performance difference of strip, which causes slow cache issue of the storage system, affects host IO, and even causes full cache, which causes service interruption. Therefore, the storage system generally adopts a background polling hard disk performance mode to identify the hard disk with poor performance in advance.
At present, most of the performance evaluation of the hard disk adopts an average time delay evaluation mode, namely, the performance difference of the hard disk is represented by the time delay of a single IO. However, the current hard disk, especially SSD (solid state disk), adopts a multiprocessor architecture, and the delay of a single IO cannot truly reflect the IO processing capability of the hard disk.
Aiming at the problem that the single IO time delay in the prior art cannot reflect the processing capability of a hard disk of a multiprocessor framework, no effective solution is available at present.
Disclosure of Invention
In view of this, an object of the embodiments of the present invention is to provide a method and a system for identifying the performance of a hard disk of a storage system, which can accurately evaluate the IO processing capability of a hard disk with a multiprocessor architecture, and identify and process a low-performance hard disk in time to maintain the normal operation of the storage system.
In view of the foregoing, a first aspect of the embodiments of the present invention provides a method for identifying hard disk performance of a storage system, including the following steps:
sequentially accessing each hard disk on the RAID strip, and issuing a plurality of read-write requests to each hard disk;
determining the busy time of each hard disk for respectively completing a plurality of read-write requests, and determining the average service time based on the number of processing units of each hard disk and the corresponding busy time;
one or more hard disks with an average service time below a threshold are determined to be poor in performance and an alarm and/or kick out from the RAID stripe is performed.
In some embodiments, issuing a plurality of read-write requests to each hard disk includes: and issuing a plurality of read-write requests to all processing units of each hard disk in parallel.
In some embodiments, determining the busy time for each hard disk to respectively complete a plurality of read and write requests includes:
after issuing a plurality of read-write requests, respectively recording the starting time of each read-write request;
after completing a plurality of read-write requests, respectively recording the end time of each read-write request;
determining a working time period based on the starting time and the ending time of each read-write request;
and determining the busy time of each hard disk based on the working time period of each read-write request.
In some embodiments, determining the busy time of each hard disk based on the work time period of each read-write request comprises: and taking the length of the union of the working time periods of each read-write request as the busy time, wherein the length of the overlapped part of the working time periods of different read-write requests is calculated in the busy time and is only calculated once.
In some embodiments, determining the average service time based on the number of processing units per hard disk and the corresponding busy time comprises: the quotient of the busy time and the number of processing units is determined as the average service time.
A second aspect of an embodiment of the present invention provides a hard disk performance identification system for a storage system, including:
a processor; and
a memory storing program code executable by the processor, the program code when executed performing the steps of:
sequentially accessing each hard disk on the RAID strip, and issuing a plurality of read-write requests to each hard disk;
determining the busy time of each hard disk for respectively completing a plurality of read-write requests, and determining the average service time based on the number of processing units of each hard disk and the corresponding busy time;
one or more hard disks with an average service time below a threshold are determined to be poor in performance and an alarm and/or kick out from the RAID stripe is performed.
In some embodiments, issuing a plurality of read-write requests to each hard disk includes: and issuing a plurality of read-write requests to all processing units of each hard disk in parallel.
In some embodiments, determining the busy time for each hard disk to respectively complete a plurality of read and write requests includes:
after issuing a plurality of read-write requests, respectively recording the starting time of each read-write request;
after completing a plurality of read-write requests, respectively recording the end time of each read-write request;
determining a working time period based on the starting time and the ending time of each read-write request;
and determining the busy time of each hard disk based on the working time period of each read-write request.
In some embodiments, determining the busy time of each hard disk based on the work time period of each read-write request comprises: and taking the length of the union of the working time periods of each read-write request as the busy time, wherein the length of the overlapped part of the working time periods of different read-write requests is calculated in the busy time and is only calculated once.
In some embodiments, determining the average service time based on the number of processing units per hard disk and the corresponding busy time comprises: the quotient of the busy time and the number of processing units is determined as the average service time.
The invention has the following beneficial technical effects: according to the method and the system for identifying the hard disk performance of the storage system, provided by the embodiment of the invention, each hard disk on the RAID strip is sequentially accessed, and a plurality of read-write requests are issued to each hard disk; determining the busy time of each hard disk for respectively completing a plurality of read-write requests, and determining the average service time based on the number of processing units of each hard disk and the corresponding busy time; one or more hard disks with average service time lower than a threshold value are determined to be poor in performance, and an alarm and/or a technical scheme of kicking out from a RAID strip is executed, so that the IO processing capacity of the hard disks with the multiprocessor architecture can be accurately evaluated, and the low-performance hard disks can be identified and processed in time to maintain the normal operation of the storage system.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.
FIG. 1 is a schematic flow chart of a hard disk performance identification method of a storage system according to the present invention;
FIG. 2 is a schematic diagram illustrating a processor operating condition of a first hard disk according to the hard disk performance identification method of the storage system of the present invention;
FIG. 3 is a schematic diagram of a processor operating condition of a second hard disk according to the hard disk performance identification method of the storage system provided by the present invention;
fig. 4 is a schematic view of an IO response time period of a first hard disk of the hard disk performance identification method of the storage system according to the present invention;
fig. 5 is one of schematic diagrams of IO response time periods of a second hard disk of the hard disk performance identification method of the storage system according to the present invention;
fig. 6 is a second schematic diagram of an IO response time period of the second hard disk according to the hard disk performance identification method of the storage system provided by the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the following embodiments of the present invention are described in further detail with reference to the accompanying drawings.
It should be noted that all expressions using "first" and "second" in the embodiments of the present invention are used for distinguishing two entities with the same name but different names or different parameters, and it should be noted that "first" and "second" are merely for convenience of description and should not be construed as limitations of the embodiments of the present invention, and they are not described in any more detail in the following embodiments.
In view of the above, a first aspect of the embodiments of the present invention provides an embodiment of a hard disk performance identification method for identifying and processing a low-performance hard disk in time to maintain a storage system in normal operation. Fig. 1 is a schematic flow chart illustrating a hard disk performance identification method of a storage system according to the present invention.
The method for identifying the hard disk performance of the storage system, as shown in fig. 1, includes the following steps:
step S101, sequentially accessing each hard disk on the RAID strip, and issuing a plurality of read-write requests to each hard disk;
step S103, determining the busy time of each hard disk for respectively completing a plurality of read-write requests, and determining the average service time based on the number of processing units of each hard disk and the corresponding busy time;
step S105, determining one or more hard disks with average service time lower than a threshold value as poor performance, and executing alarm and/or kicking from the RAID stripe.
It will be understood by those skilled in the art that all or part of the processes of the methods of the embodiments described above can be implemented by a computer program, which can be stored in a computer-readable storage medium, and when executed, can include the processes of the embodiments of the methods described above. The storage medium may be a magnetic disk, an optical disk, a read-only memory (ROM), a Random Access Memory (RAM), or the like. Embodiments of the computer program may achieve the same or similar effects as any of the preceding method embodiments to which it corresponds.
In some embodiments, issuing a plurality of read-write requests to each hard disk includes: and issuing a plurality of read-write requests to all processing units of each hard disk in parallel.
In some embodiments, determining the busy time for each hard disk to respectively complete a plurality of read and write requests includes:
after issuing a plurality of read-write requests, respectively recording the starting time of each read-write request;
after completing a plurality of read-write requests, respectively recording the end time of each read-write request;
determining a working time period based on the starting time and the ending time of each read-write request;
and determining the busy time of each hard disk based on the working time period of each read-write request.
In some embodiments, determining the busy time of each hard disk based on the work time period of each read-write request comprises: and taking the length of the union of the working time periods of each read-write request as the busy time, wherein the length of the overlapped part of the working time periods of different read-write requests is calculated in the busy time and is only calculated once.
In some embodiments, determining the average service time based on the number of processing units per hard disk and the corresponding busy time comprises: the quotient of the busy time and the number of processing units is determined as the average service time.
The following further illustrates embodiments of the invention in terms of specific examples.
The traditional evaluation mode of the average time delay of the hard disk cannot reflect the real IO processing capability of the hard disk in the multiprocessor hard disk. For example, for the multiprocessor hard disk shown in fig. 2, after the CPU fails, the processing delay of a single IO of the hard disk is not weakened, and the processing delay of the multiprocessor hard disk shown in fig. 3 is almost the same, although none of the CPUs in fig. 3 fails. On the other hand, for hard disks with different processor numbers, the average IO delay of the hard disks with less processor number is equal to or even greater than that of the hard disks with more processor numbers.
Let the average delay of IO in fig. 2 and 3 be the same, both being t. The hard disk in the multiprocessor architecture of fig. 3 processes 4 IOs in time t, and thus has a processing capacity 4 times that of fig. 2 (in fig. 2, only 1 IO is processed in time t because only 1 CPU is in operation). Therefore, the average time delay of a single IO cannot really represent the processing capacity of the hard disk. Embodiments of the present invention aim to eliminate this inaccuracy.
First, the method for calculating the defined average service time according to the embodiment of the present invention is as follows:
hard disk average service time AST (average service time) () hard disk IO busy time BT (busy time)/number of IO C (count)
The busy time of the hard disk IO refers to the time when the hard disk has IO, and the calculation rule of the busy time BT is as follows. Fig. 4 is an operational timeline of fig. 2. Taking fig. 4 as an example, if the hard disk in fig. 4 responds to 1 IO, the busy time of the hard disk in fig. 2 is t. The average service time AST of the hard disk is t/1.
In contrast, FIG. 5 is the operational timeline of FIG. 3. Taking fig. 5 as an example, if the hard disk in fig. 5 responds to 4 IOs within time t, that is, 4 IOs respond at the same time and the consumed time is the same, the busy time of the hard disk in fig. 3 is t, and the average service time AST of the hard disk is t/4, so that it can be seen that the average service time of the hard disk in fig. 3 is 1/4 of the hard disk in fig. 2, and the performance of the hard disk in fig. 3 is 4 times of the performance of the hard disk in fig. 2 by using the method for evaluating the average service time.
In another case, if the working timeline of fig. 3 is not fig. 5 but fig. 6, the hard disk 4 IOs in fig. 6 are not responded to at the same time. Specifically, the time consumed by IO1 is t1, the time consumed by IO2 is t2, the time consumed by IO3 is t3, and the time consumed by IO4 is t4, wherein IO1 and IO2 have an intersection, the intersection time is t, the busy time BT of the hard disk is equal to (t1+ t2+ t3+ t4-t), and the intersection time is subtracted from the busy time to represent the duration of the hard disk responding to IO.
In this scenario, the average service time AST of the hard disk is (t1+ t2+ t3+ t 4-t)/4.
It can be seen from the foregoing embodiments that, in the hard disk performance identification method of the storage system provided in the embodiments of the present invention, each hard disk on a RAID stripe is sequentially accessed, and a plurality of read-write requests are issued to each hard disk; determining the busy time of each hard disk for respectively completing a plurality of read-write requests, and determining the average service time based on the number of processing units of each hard disk and the corresponding busy time; one or more hard disks with average service time lower than a threshold value are determined to be poor in performance, and an alarm and/or a technical scheme of kicking out from a RAID strip is executed, so that the IO processing capacity of the hard disks with the multiprocessor architecture can be accurately evaluated, and the low-performance hard disks can be identified and processed in time to maintain the normal operation of the storage system.
It should be particularly noted that, the steps in the embodiments of the hard disk performance identification method of the storage system described above may be mutually intersected, replaced, added, and deleted, so that the hard disk performance identification method of the storage system based on these reasonable permutation and combination transformations shall also belong to the scope of the present invention, and shall not limit the scope of the present invention to the described embodiments.
In view of the above, according to a second aspect of the embodiments of the present invention, an embodiment of a hard disk performance identification system for identifying and processing a low-performance hard disk in time to maintain a storage system in which the storage system is operating normally is provided. The system comprises:
a processor; and
a memory storing program code executable by the processor, the program code when executed performing the steps of:
sequentially accessing each hard disk on the RAID strip, and issuing a plurality of read-write requests to each hard disk;
determining the busy time of each hard disk for respectively completing a plurality of read-write requests, and determining the average service time based on the number of processing units of each hard disk and the corresponding busy time;
one or more hard disks with an average service time below a threshold are determined to be poor in performance and an alarm and/or kick out from the RAID stripe is performed.
In some embodiments, issuing a plurality of read-write requests to each hard disk includes: and issuing a plurality of read-write requests to all processing units of each hard disk in parallel.
In some embodiments, determining the busy time for each hard disk to respectively complete a plurality of read and write requests includes:
after issuing a plurality of read-write requests, respectively recording the starting time of each read-write request;
after completing a plurality of read-write requests, respectively recording the end time of each read-write request;
determining a working time period based on the starting time and the ending time of each read-write request;
and determining the busy time of each hard disk based on the working time period of each read-write request.
In some embodiments, determining the busy time of each hard disk based on the work time period of each read-write request comprises: and taking the length of the union of the working time periods of each read-write request as the busy time, wherein the length of the overlapped part of the working time periods of different read-write requests is calculated in the busy time and is only calculated once.
In some embodiments, determining the average service time based on the number of processing units per hard disk and the corresponding busy time comprises: the quotient of the busy time and the number of processing units is determined as the average service time.
As can be seen from the foregoing embodiments, in the system provided in the embodiments of the present invention, each hard disk on the RAID stripe is sequentially accessed, and a plurality of read-write requests are issued to each hard disk; determining the busy time of each hard disk for respectively completing a plurality of read-write requests, and determining the average service time based on the number of processing units of each hard disk and the corresponding busy time; one or more hard disks with average service time lower than a threshold value are determined to be poor in performance, and an alarm and/or a technical scheme of kicking out from a RAID strip is executed, so that the IO processing capacity of the hard disks with the multiprocessor architecture can be accurately evaluated, and the low-performance hard disks can be identified and processed in time to maintain the normal operation of the storage system.
It should be particularly noted that the above-mentioned embodiment of the system adopts an embodiment of the hard disk performance identification method of the storage system to specifically describe the working process of each module, and those skilled in the art can easily think that these modules are applied to other embodiments of the hard disk performance identification method of the storage system. Of course, since the steps in the embodiment of the method for identifying the hard disk performance of the storage system may be mutually intersected, replaced, added, or deleted, these reasonable permutations and combinations should also belong to the scope of the present invention, and should not limit the scope of the present invention to the embodiment.
The foregoing is an exemplary embodiment of the present disclosure, but it should be noted that various changes and modifications could be made herein without departing from the scope of the present disclosure as defined by the appended claims. The functions, steps and/or actions of the method claims in accordance with the disclosed embodiments described herein need not be performed in any particular order. Furthermore, although elements of the disclosed embodiments of the invention may be described or claimed in the singular, the plural is contemplated unless limitation to the singular is explicitly stated.
Those of ordinary skill in the art will understand that: the discussion of any embodiment above is meant to be exemplary only, and is not intended to intimate that the scope of the disclosure, including the claims, of embodiments of the invention is limited to these examples; within the idea of an embodiment of the invention, also technical features in the above embodiment or in different embodiments may be combined and there are many other variations of the different aspects of an embodiment of the invention as described above, which are not provided in detail for the sake of brevity. Therefore, any omissions, modifications, substitutions, improvements, and the like that may be made without departing from the spirit and principles of the embodiments of the present invention are intended to be included within the scope of the embodiments of the present invention.
Claims (10)
1. A method for identifying hard disk performance of a storage system is characterized by periodically executing the following steps:
sequentially accessing each hard disk on the RAID strip, and issuing a plurality of read-write requests to each hard disk;
determining the busy time of each hard disk for respectively completing the plurality of read-write requests, and determining the average service time based on the number of processing units of each hard disk and the corresponding busy time;
and determining one or more hard disks with the average service time lower than a threshold value as poor performance, and executing an alarm and/or kicking out from the RAID stripe.
2. The method of claim 1, wherein issuing a plurality of read and write requests to each of the hard disks comprises: and parallelly issuing a plurality of read-write requests to all processing units of each hard disk.
3. The method of claim 1, wherein determining the busy time for each hard disk to respectively complete the plurality of read and write requests comprises:
after a plurality of read-write requests are issued, respectively recording the starting time of each read-write request;
after the plurality of read-write requests are completed, respectively recording the end time of each read-write request;
determining a working time period based on the starting time and the ending time of each read-write request;
and determining the busy time of each hard disk based on the work time period of each read-write request.
4. The method of claim 3, wherein determining the busy time for each hard disk based on the work time period for each read/write request comprises: and taking the length of the union set of the working time periods of each read-write request as the busy time, wherein the length of the overlapped part of the working time periods of different read-write requests is calculated in the busy time and is only calculated once.
5. The method of claim 1, wherein determining an average service time based on the number of processing units per hard disk and the corresponding busy time comprises: determining the quotient of the busy time and the number of processing units as the average service time.
6. A hard disk performance recognition system for a storage system, comprising:
a processor; and
a memory storing program code executable by the processor, the program code when executed performing the steps of:
sequentially accessing each hard disk on the RAID strip, and issuing a plurality of read-write requests to each hard disk;
determining the busy time of each hard disk for respectively completing the plurality of read-write requests, and determining the average service time based on the number of processing units of each hard disk and the corresponding busy time;
and determining one or more hard disks with the average service time lower than a threshold value as poor performance, and executing an alarm and/or kicking out from the RAID stripe.
7. The system of claim 6, wherein issuing a plurality of read and write requests to each of the hard disks comprises: and parallelly issuing a plurality of read-write requests to all processing units of each hard disk.
8. The system of claim 6, wherein determining the busy time for each hard disk to respectively complete the plurality of read and write requests comprises:
after a plurality of read-write requests are issued, respectively recording the starting time of each read-write request;
after the plurality of read-write requests are completed, respectively recording the end time of each read-write request;
determining a working time period based on the starting time and the ending time of each read-write request;
and determining the busy time of each hard disk based on the work time period of each read-write request.
9. The system of claim 8, wherein determining the busy time for each hard disk based on the work time period for each read/write request comprises: and taking the length of the union set of the working time periods of each read-write request as the busy time, wherein the length of the overlapped part of the working time periods of different read-write requests is calculated in the busy time and is only calculated once.
10. The system of claim 6, wherein determining an average service time based on the number of processing units per hard disk and the corresponding busy time comprises: determining the quotient of the busy time and the number of processing units as the average service time.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110091171.XA CN112764684A (en) | 2021-01-22 | 2021-01-22 | Hard disk performance identification method and system of storage system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110091171.XA CN112764684A (en) | 2021-01-22 | 2021-01-22 | Hard disk performance identification method and system of storage system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112764684A true CN112764684A (en) | 2021-05-07 |
Family
ID=75706860
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110091171.XA Withdrawn CN112764684A (en) | 2021-01-22 | 2021-01-22 | Hard disk performance identification method and system of storage system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112764684A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115083506A (en) * | 2022-06-22 | 2022-09-20 | 上海威固信息技术股份有限公司 | Solid state disk storage performance testing method and system, image storage device and hard disk |
| CN116700633A (en) * | 2023-08-08 | 2023-09-05 | 成都领目科技有限公司 | IO delay monitoring method, device and medium for RAID array hard disk |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110297601A (en) * | 2019-06-06 | 2019-10-01 | 清华大学 | Solid state hard disk array construction method, electronic equipment and storage medium |
| CN110308875A (en) * | 2019-06-27 | 2019-10-08 | 深信服科技股份有限公司 | Data read-write method, device, equipment and computer readable storage medium |
| CN110502188A (en) * | 2019-08-01 | 2019-11-26 | 苏州浪潮智能科技有限公司 | A kind of date storage method and device based on data base read-write performance |
-
2021
- 2021-01-22 CN CN202110091171.XA patent/CN112764684A/en not_active Withdrawn
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110297601A (en) * | 2019-06-06 | 2019-10-01 | 清华大学 | Solid state hard disk array construction method, electronic equipment and storage medium |
| CN110308875A (en) * | 2019-06-27 | 2019-10-08 | 深信服科技股份有限公司 | Data read-write method, device, equipment and computer readable storage medium |
| CN110502188A (en) * | 2019-08-01 | 2019-11-26 | 苏州浪潮智能科技有限公司 | A kind of date storage method and device based on data base read-write performance |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115083506A (en) * | 2022-06-22 | 2022-09-20 | 上海威固信息技术股份有限公司 | Solid state disk storage performance testing method and system, image storage device and hard disk |
| CN116700633A (en) * | 2023-08-08 | 2023-09-05 | 成都领目科技有限公司 | IO delay monitoring method, device and medium for RAID array hard disk |
| CN116700633B (en) * | 2023-08-08 | 2023-11-03 | 成都领目科技有限公司 | IO delay monitoring method, device and medium for RAID array hard disk |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8214608B2 (en) | Behavioral monitoring of storage access patterns | |
| WO2017012392A1 (en) | Disk check method and apparatus | |
| CN112764684A (en) | Hard disk performance identification method and system of storage system | |
| CN110597655B (en) | Migration and erasure code-based reconstruction coupling rapid prediction repair method and device | |
| US20220327018A1 (en) | Behavior-driven die management on solid-state drives | |
| CN111124263B (en) | Method, electronic device and computer program product for managing a plurality of discs | |
| CN110727404A (en) | Data deduplication method and device based on storage end and storage medium | |
| CN110727685A (en) | Data compression method, equipment and storage medium based on Cassandra database | |
| CN111061690B (en) | RAC-based database log file reading method and device | |
| CN108829355B (en) | Garbage recovery method and device | |
| US20160092140A1 (en) | Storage device management in computing systems | |
| CN109542341B (en) | Read-write IO monitoring method, device, terminal and computer readable storage medium | |
| CN117251275B (en) | Multi-application asynchronous I/O request scheduling method, system, equipment and medium | |
| CN113064553A (en) | Data storage method, device, equipment and medium | |
| CN110348245B (en) | Data integrity protection method, system and device based on NVM and storage medium | |
| US20150113244A1 (en) | Concurrently accessing memory | |
| CN110908587A (en) | Method and device for storing time sequence data | |
| CN106610883B (en) | Detection method and device | |
| CN115359834A (en) | Disk arbitration region detection method, device, equipment and readable storage medium | |
| CN115793957A (en) | Method and device for writing data and computer storage medium | |
| CN109542687B (en) | RAID level conversion method and device | |
| CN112905121A (en) | Data brushing method and system | |
| US20170147450A1 (en) | Information processing device, information processing method, and program recording medium | |
| CN116820333B (en) | SSDRAID-5 continuous writing method based on multithreading | |
| CN116149574B (en) | RAID array management method and device, RAID card and storage medium |
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 | ||
| WW01 | Invention patent application withdrawn after publication | ||
| WW01 | Invention patent application withdrawn after publication |
Application publication date: 20210507 |