WO2019101087A1 - Procédé de détection de disque lent, et réseau de stockage - Google Patents

Procédé de détection de disque lent, et réseau de stockage Download PDF

Info

Publication number
WO2019101087A1
WO2019101087A1 PCT/CN2018/116608 CN2018116608W WO2019101087A1 WO 2019101087 A1 WO2019101087 A1 WO 2019101087A1 CN 2018116608 W CN2018116608 W CN 2018116608W WO 2019101087 A1 WO2019101087 A1 WO 2019101087A1
Authority
WO
WIPO (PCT)
Prior art keywords
disk
slow
probability
parameter
storage array
Prior art date
Application number
PCT/CN2018/116608
Other languages
English (en)
Chinese (zh)
Inventor
连涛
曹红强
仇幼成
Original Assignee
华为技术有限公司
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 华为技术有限公司 filed Critical 华为技术有限公司
Publication of WO2019101087A1 publication Critical patent/WO2019101087A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F11/00—Error detection; Error correction; Monitoring
    • G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance

Definitions

  • the present application relates to the field of computer technology, and more particularly to a slow disk detection method and a memory array.
  • a storage array typically includes a disk array. Affected by various factors, the disk in the disk array may have a slow response to input and output (I/O) in the latter part of the life cycle, and may even fail to respond to I/O. This type of disk is called a slow disk.
  • I/O input and output
  • the present application provides a slow disk detection method and a storage array, which can improve the accuracy of slow disk detection.
  • a slow disk detection method is provided, which is performed by a storage array, the storage array including at least one disk set, each disk set including at least one disk, the method comprising: detecting the storage array N disk parameter values of each disk in at least one disk set, wherein N is a positive integer greater than or equal to 2; calculating a slow disk probability of each disk according to the N disk parameter values of each disk; The slow disk in each disk set is judged according to the slow disk probability of each disk.
  • the above technical solution detects N disk parameter values of each disk in at least one disk set.
  • the result of slow disk detection is more accurate than the traditional method of slow disk detection based only on the factor of I/O average service time. .
  • the calculating, according to the N disk parameter values of each disk, a slow disk probability of each disk comprising: determining, by using each disk parameter value of each detected disk a parameter interval that falls within, wherein each of the disk parameters corresponds to at least one parameter interval; determining a probability corresponding to a parameter interval in which each disk parameter value of each detected disk falls, wherein each of the parameters The parameter interval in which the disk parameter values fall corresponds to a probability; calculating the slow disk probability of each disk according to the probability corresponding to the N disk parameters of each disk; determining according to the slow disk probability of each disk The slow disk in the disk set.
  • each disk parameter corresponding to each disk set corresponds to a weight
  • the slowness of each disk is calculated according to a probability corresponding to the N disk parameters of each disk.
  • the disk probability includes: calculating a slow disk probability of each disk according to a probability corresponding to the N disk parameters of each disk and a weight corresponding to the N disk parameters of each disk.
  • the probability corresponding to the N disk parameters of each disk may be weighted and summed according to the weight corresponding to the N disk parameters, and the total probability that each disk is a slow disk is determined.
  • the result of slow disk detection is more accurate by considering the N disk parameters of each disk.
  • each of the disk sets has the same disk characteristics.
  • the disk characteristics of the same disk set are the same, which is equivalent to the slow disk detection under the premise of eliminating the influence of the disk characteristics on the slow disk detection result, so that the result of the slow disk detection is more accurate.
  • At least one of the disk characteristics corresponding to different disk sets is different.
  • a storage array in a second aspect, includes at least one disk set, each disk set includes at least one disk, and the storage array includes: a detecting unit, configured to detect in the storage array N disk parameter values of each disk in at least one disk set, where N is a positive integer greater than or equal to 2; a computing unit configured to calculate each of the disks according to N disk parameter values of each disk The slow disk probability; the determining unit is configured to determine the slow disk in each disk set according to the slow disk probability of each disk.
  • the above technical solution detects N disk parameter values of each disk in at least one disk set.
  • the result of slow disk detection is more accurate than the traditional method of slow disk detection based only on the factor of I/O average service time. .
  • the calculating unit is specifically configured to: determine a parameter interval in which each disk parameter value of each detected disk falls, wherein each disk parameter corresponds to at least one a parameter interval; determining a probability corresponding to a parameter interval in which each disk parameter value of each of the detected disks falls, wherein the parameter interval in which each disk parameter value falls corresponds to a probability; Calculating the probability of the slow disk of each disk according to the probability corresponding to the N disk parameters of each disk; determining the slow disk in the disk set according to the slow disk probability of each disk.
  • each of the disk parameters corresponding to each disk set corresponds to a weight
  • the calculating unit is specifically configured to: according to the probability and location of the N disk parameters of each disk Calculate the slow disk probability of each disk by the weight corresponding to the N disk parameters of each disk.
  • the probability corresponding to the N disk parameters of each disk may be weighted and summed according to the weight corresponding to the N disk parameters, and the total probability that each disk is a slow disk is determined.
  • the result of slow disk detection is more accurate by considering the N disk parameters of each disk.
  • each of the disk sets has the same disk characteristics.
  • the disk characteristics of the same disk set are the same, which is equivalent to the slow disk detection under the premise of eliminating the influence of the disk characteristics on the slow disk detection result, so that the result of the slow disk detection is more accurate.
  • At least one of the disk characteristics corresponding to different disk sets is different.
  • a memory array comprising a processor and a memory, the memory for storing computer instructions, the processor for executing computer instructions stored in the memory, when the computer instructions are executed, The processor is operative to perform the method of any of the first aspect or the first aspect of the first aspect.
  • a computer storage medium comprising computer instructions that, when executed on a computer, cause the computer to perform the first aspect or any of the possible implementations of the first aspect Methods.
  • a computer program product comprising instructions for causing said computer to perform said first aspect or any of the possible implementations of the first aspect, when said computer program product is run on a computer Methods.
  • FIG. 1 is a diagram showing an example of the structure of a memory array to which an embodiment of the present invention is applicable.
  • FIG. 2 is a schematic flowchart of a slow disk detecting method according to an embodiment of the present invention.
  • FIG. 3 is a diagram showing an example of a grouping manner of a disk to be detected according to an embodiment of the present invention.
  • FIG. 4 is a schematic diagram of a slow disk probability model corresponding to an I/O average service time of a disk.
  • FIG. 5 is a schematic diagram of a slow disk probability model corresponding to the number of I/Os in which the I/O processing time exceeds a preset threshold.
  • FIG. 6 is a schematic structural diagram of a memory array according to an embodiment of the present invention.
  • FIG. 7 is a schematic structural diagram of a memory array according to an embodiment of the present invention.
  • FIG. 1 is a diagram showing an example of the structure of a memory array to which an embodiment of the present invention is applicable.
  • the disk array 100 can be located inside the disk frame 110.
  • the disk frame may include a plurality of disk slots, and each disk slot may have one disk 120 placed.
  • the disk mentioned in the present application may be, for example, a solid state drive (SSD), a serial advanced technology attachment (SATA) disk, and a serial attached small computer system interface (serial attached small computer system interface, SAS) disk, near-line SAS (near line-SAS, NL-SAS) disk, etc.
  • the storage array shown in FIG. 1 may be, for example, a redundant array of independent disks (RAID).
  • the embodiment of the invention provides a slow disk detection method, which can improve the accuracy of slow disk detection.
  • the embodiments of the present invention are described in detail below with reference to FIG.
  • FIG. 2 is a schematic flowchart of a slow disk detecting method according to an embodiment of the present invention.
  • the method of Figure 2 can be performed by a storage array, such as a processor in a storage array in which the disk is located.
  • the method of FIG. 2 may include steps 210-230, which are described in detail below.
  • step 210 N disk parameter values of each disk in at least one disk set in the storage array are detected, where N is a positive integer greater than or equal to 2.
  • the disks in the disk array can be divided into different disk sets according to different disk characteristics, and the disks in the disk set have the same disk characteristics.
  • the disk characteristics can be, for example, the hardware characteristics of the disk or the type of service stored on the disk.
  • the embodiment of the present invention does not specifically limit the type of hardware features of the disk, and the hardware features of the disk may be various.
  • the hardware features can include at least one of the following: type of disk, speed, protocol type.
  • the disk type may include, for example, at least one of the following types: SSD, SATA, SAS, NL-SAS, and the like.
  • the rotational speed of the disk may include, for example, at least one of the following rotational speeds: 5400 rpm, 7200 rpm, 10,000 rpm, 15,000 rpm.
  • the protocol type of the disk may include, for example, at least one of the following protocols: a non-volatile memory express (NVME) protocol, an internet small computer system interface (ISCSI) protocol, and an advanced technology accessory. (advanced technology attachment, ATA) agreement.
  • NVME non-volatile memory express
  • ISCSI internet small computer system interface
  • ATA advanced technology accessory.
  • the type of service stored on the disk may be, for example, when the disk is allocated to the upper layer application, and the data generated by the upper layer application is stored on the disk, and different upper layer applications may generate different data. Types of.
  • the type of service stored on the disk can be selected as the disk domain to which the disk belongs, and the hardware characteristics of the disk are selected as the type and/or speed of the disk.
  • the disk to be detected can be divided into four detection domains (also referred to as disk sets) as shown in FIG.
  • the disk in the detection domain 1 meets the following conditions: the disk domain to which it belongs is disk domain 0, the disk is SAS disk, and the disk speed is 10,000 rpm.
  • the disk in the detection domain 2 meets the following conditions: the disk domain to which it belongs is disk domain 0, the disk is SAS disk, and the disk speed is 15000 rpm.
  • the disk in the detection domain 3 meets the following conditions: the disk domain to which it belongs is the disk domain 1 and the disk is the SDD disk.
  • the disk in the detection domain 4 meets the following conditions: the disk domain to which it belongs is the disk domain 2, and the disk is the NVME disk.
  • the disk domain to which it belongs is the disk domain 1
  • the disk is the SDD disk.
  • the disk in the detection domain 4 meets the following conditions: the disk domain to which it belongs is the disk domain 2, and the disk is the NVME disk.
  • at least one of the corresponding disk characteristics in different detection domains (disk sets) may have different disk characteristics.
  • the hard disk in the detection domain 1 - detection domain 4 may be sequentially detected. Alternatively, it is also possible to perform slow disk detection on the disks in the four detection domains in parallel.
  • the object detected by the slow disk is selected as a hardware feature of the disk and/or a disk set having the same service type stored on the disk. And detecting multiple parameter values for the disk in the disk set, so that the result of the slow disk detection is more accurate.
  • the N disk parameter values of each disk can be N factors for measuring whether the disk is a slow disk.
  • the N disk parameters may include, for example, some or all of the following factors: I/O average service time, I/O processing time exceeding the preset threshold, and number of unresponsive I/Os. Wait.
  • the average I/O service time can be, for example, the average time that the disk itself needs to process a single I/O.
  • the number of I/Os whose I/O processing time exceeds a preset threshold can be, for example, the time that the disk processing I/O exceeds the setting.
  • the number of I/Os of the threshold time, and the number of unresponsive I/Os may be, for example, the number of I/Os that are not responding to all I/Os of the disk.
  • step 220 the slow disk probability of each disk is calculated according to the N disk parameter values of each disk.
  • the parameter interval in which each disk parameter value of each disk detected may be determined, wherein each disk parameter may correspond to at least one parameter interval.
  • the slow disk probability of each disk can be calculated by the probability corresponding to the parameter interval in which each disk parameter value of each disk falls. Detailed description will be made below in conjunction with specific embodiments.
  • Figure 4 is a slow disk probability model corresponding to the I/O average service time of the disk. As shown in FIG. 4, when the I/O average service time of the disk is in the interval 0-S 1 , the probability that the disk is a slow disk is x%. When the I/O average service time of the disk is in the interval S 1 -S 2 , the probability that the disk is a slow disk is y%. When the I/O average service time of the disk is in the interval S 2 -S 3 , the probability that the disk is a slow disk is z%. As can be seen from Figure 4, as the average I/O service time of the disk is longer, the probability that the disk is a slow disk is greater. Therefore, the disk I/O average service time can be used as a measure of whether a disk is a slow disk.
  • FIG. 5 is a slow disk probability model corresponding to the number of I/Os in which the I/O processing time exceeds a preset threshold. As shown in FIG. 5, the probability that the number of I/Os in the normal disk exceeds t 3 (the set threshold time) by the total number of I/Os is p% (also referred to as slow disk).
  • the probability that the I/O processing time in the slow disk exceeds t 3 (the set threshold time) by the total number of I/Os is m%.
  • the number of I/Os in which the I/O processing time in the slow disk exceeds the preset threshold is greater than the number of I/Os in the normal disk that exceeds the preset threshold. The greater the probability that the disk is a slow disk. . Therefore, the number of I/Os that the I/O processing time exceeds the preset threshold can be used as a measure of whether the disk is a slow disk.
  • the probability that each of the N disks is a slow disk under K factors can be weighted and summed to determine the total probability that each disk is a slow disk.
  • x 1% probability that D 1 is represented by slow disk y 1% D 1 represents the probability of the disk at a slower factor 2 at a factor.
  • x 2 % represents the probability that D 1 is a slow disk under factor 1
  • y 2 % represents the probability that D 1 is a slow disk under factor 2, and so on.
  • x 1 % represents the probability that D 1 is a slow disk under factor 1
  • w 1 represents the weight of factor 1
  • y 1 % represents the probability that D 1 is a slow disk under factor 2
  • w 2 represents the weight of factor 2 value.
  • step 230 the slow disk in each disk set is determined according to the slow disk probability of each disk.
  • N disk parameter values of each disk in at least one disk set are detected.
  • the result of slow disk detection is more accurate than the traditional method of slow disk detection based only on the factor of I/O average service time. .
  • the slow disk probability of each disk mentioned in step 230 may be the probability that the disk is a slow disk in one detection period, and may also include the probability that the disk is a slow disk in each detection period in multiple detection periods.
  • the suspected slow disk corresponding to each detection period may be selected from each disk according to the probability that each disk is a slow disk in each detection cycle of a plurality of detection cycles and a preset threshold. Then, the slow disk can be determined from the suspected slow disks corresponding to the multiple detection cycles (for example, the number of suspected disks in each disk is greater than the preset number of times, or the disk having the largest number of suspected disks in each disk is determined to be slow. plate).
  • the suspected slow disk corresponding to each detection period described above can be understood as a disk whose total probability of slow disks is greater than a preset threshold in each detection period (hereinafter, the probability that the disk is a slow disk in a certain detection period)
  • the condition that is greater than the preset threshold is called condition one).
  • the suspected slow disk corresponding to each cycle may be a slow disk or multiple slow disks. If a disk is a suspected slow disk corresponding to a certain detection period, the detection cycle may also be referred to as a slow cycle of the disk, indicating that the disk has a slow I/O response time during the detection cycle.
  • the embodiment of the present invention does not directly determine the slow disk detection result of a certain detection period as the final slow disk detection result, but comprehensively determines whether the slow disk is included in the disk to be detected based on the slow disk detection result of the multiple detection cycles. This slow disk detection method will make the slow disk detection result more accurate.
  • the above suspected slow disk corresponding to each detection cycle is determined based on the condition one above.
  • the suspected slow disk corresponding to the detection period may also be determined by considering various other conditions. For example, it may be determined whether the data of the detection period satisfies the following condition 2: the probability of the disk with the highest probability of concentration in each disk is greater than the U (U is greater than 1) times of other disks in the disk set. If the condition 2 is not satisfied, it is determined that there is no suspected slow disk in the detection period; if the condition two is satisfied, it is determined whether there is a disk that satisfies the condition 1 in the detection period; if yes, the disk is determined as the detection The suspected slow disk corresponding to the cycle.
  • condition 2 the probability of the disk with the highest probability of concentration in each disk is greater than the U (U is greater than 1) times of other disks in the disk set. If the condition 2 is not satisfied, it is determined that there is no suspected slow disk in the detection period; if the condition two is satisfied, it is determined whether there is
  • condition three it may be determined whether the data of the detection period satisfies the following condition three: at least L (L is a positive integer not less than 1) disks in the disk set to undertake data services. If the condition 3 is not satisfied, it is determined that there is no suspected slow disk in the detection period; if the condition three is satisfied, it is determined whether there is a disk that satisfies the condition 1 in the detection period; if yes, the disk is determined as the detection The suspected slow disk corresponding to the cycle. It should be noted that the foregoing condition 1, condition 2, and condition three may be combined in any combination, and the embodiment of the present invention is not limited thereto.
  • the slow disk detecting method provided by the embodiment of the present invention is described in detail above with reference to FIG. 2 to FIG. 5 .
  • the memory array provided by the embodiment of the present invention will be described in detail below with reference to FIG. 6 .
  • the memory array of Figure 6 can be used to perform the various steps above.
  • the memory array of FIG. 6 may include a detecting unit 610, a calculating unit 620, and a determining unit 630.
  • the detecting unit 610 is configured to detect N disk parameter values of each disk in the at least one disk set in the storage array, where N is a positive integer greater than or equal to 2.
  • the calculating unit 620 is configured to calculate a slow disk probability of each disk according to the N disk parameter values of each disk.
  • the determining unit 630 is configured to determine, according to the slow disk probability of each disk, the slow disk in each disk set.
  • the calculating unit 620 may be specifically configured to: determine a parameter interval in which each disk parameter value of each detected disk falls, wherein each of the disk parameters corresponds to at least a parameter interval; determining a probability corresponding to a parameter interval in which each of the detected disk parameter values falls, wherein the parameter interval in which each disk parameter value falls corresponds to a probability; Calculating the probability of the slow disk of each disk according to the probability corresponding to the N disk parameters of each disk; determining the slow disk in the disk set according to the slow disk probability of each disk.
  • each disk parameter corresponding to each disk set corresponds to a weight
  • the calculating unit 620 is further configured to: respond to the N disk parameters of each disk.
  • the probability of the disk and the weight corresponding to the N disk parameters of each disk calculate the slow disk probability of each disk.
  • each of the disk sets has the same disk characteristics.
  • At least one of the disk characteristics corresponding to different disk sets is different.
  • FIG. 7 is a schematic structural diagram of a memory array according to an embodiment of the present invention.
  • the memory array 700 of Figure 7 can perform the slow disk detection method described in any of the embodiments of Figures 2 through 5.
  • the memory array 700 of FIG. 7 can include a memory 710 and a processor 720.
  • Memory 710 can be used to store programs.
  • the processor 720 can be configured to execute a program stored in the memory 710. When the program stored in the memory 710 is executed, the processor 720 can be used to execute the slow disk detection method described in any of the above embodiments.
  • the term "and/or” is merely an association relationship describing an associated object, indicating that there may be three relationships.
  • a and/or B may indicate that A exists separately, and A and B exist simultaneously, and B cases exist alone.
  • the character "/" in this article generally indicates that the contextual object is an "or" relationship.
  • the computer program product includes one or more computer instructions.
  • the computer can be a general purpose computer, a special purpose computer, a computer network, or other programmable device.
  • the computer instructions can be stored in a computer readable storage medium or transferred from one computer readable storage medium to another computer readable storage medium, for example, the computer instructions can be from a website site, computer, server or data center Transmission to another website site, computer, server or data center via wired (eg coaxial cable, fiber optic, digital subscriber line (DSL)) or wireless (eg infrared, wireless, microwave, etc.).
  • the computer readable storage medium can be any available media that can be accessed by a computer or a data storage device such as a server, data center, or the like that includes one or more available media.
  • the usable medium may be a magnetic medium (for example, a floppy disk, a hard disk, a magnetic tape), an optical medium (such as a digital video disc (DVD)), or a semiconductor medium (such as a solid state disk (SSD)).
  • a magnetic medium for example, a floppy disk, a hard disk, a magnetic tape
  • an optical medium such as a digital video disc (DVD)
  • a semiconductor medium such as a solid state disk (SSD)
  • the disclosed systems, devices, and methods may be implemented in other manners.
  • the device embodiments described above are merely illustrative.
  • the division of the unit is only a logical function division.
  • there may be another division manner for example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored or not executed.
  • the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, and may be in an electrical, mechanical or other form.
  • the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of the embodiment.
  • each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
  • the functions, if implemented in the form of software functional units and sold or used as separate products, may be stored in a computer readable storage medium.
  • the technical solution of the present application which is essential or contributes to the prior art, or a part of the technical solution, may be embodied in the form of a software product, which is stored in a storage medium, including
  • the instructions are used to cause a computer device (which may be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods described in various embodiments of the present application.
  • the foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and the like, which can store program code. .

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • Quality & Reliability (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Debugging And Monitoring (AREA)

Abstract

La présente invention concerne un procédé de détection de disque lent, et un réseau de stockage. Le procédé est mis en œuvre par le réseau de stockage. Le réseau de stockage comprend au moins un ensemble de disques, chaque ensemble de disques comprenant au moins un disque. Le procédé comprend les étapes consistant : à détecter N valeurs de paramètre de disque de chaque disque dudit ensemble de disques dans le réseau de stockage (210), N étant un nombre entier positif supérieur ou égal à 2 ; à calculer une probabilité de disque lent de chaque disque en fonction des N valeurs de paramètre de disque du disque (220) ; et à déterminer un disque lent dans chaque ensemble de disques en fonction de la probabilité de disque lent de chaque disque (230). L'invention détecte les N valeurs de paramètre de disque de chaque disque dudit ensemble de disques, afin de prendre en considération de multiples valeurs de paramètre de disque de chaque disque pendant un processus de détection de disque lent, ce qui permet d'améliorer la précision des résultats de détection de disque lent.
PCT/CN2018/116608 2017-11-22 2018-11-21 Procédé de détection de disque lent, et réseau de stockage WO2019101087A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201711170428.0 2017-11-22
CN201711170428.0A CN109815037B (zh) 2017-11-22 2017-11-22 慢盘检测方法和存储阵列

Publications (1)

Publication Number Publication Date
WO2019101087A1 true WO2019101087A1 (fr) 2019-05-31

Family

ID=66601044

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/116608 WO2019101087A1 (fr) 2017-11-22 2018-11-21 Procédé de détection de disque lent, et réseau de stockage

Country Status (2)

Country Link
CN (1) CN109815037B (fr)
WO (1) WO2019101087A1 (fr)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112416639A (zh) * 2020-11-16 2021-02-26 新华三技术有限公司成都分公司 一种慢盘检测方法、装置、设备及存储介质
CN117806890A (zh) * 2024-02-28 2024-04-02 四川省华存智谷科技有限责任公司 一种基于分布式存储的慢盘检测处理方法

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112241343B (zh) * 2019-07-19 2024-02-23 深信服科技股份有限公司 一种慢盘检测方法、装置、电子设备及可读存储介质
CN111984481A (zh) * 2020-08-14 2020-11-24 苏州浪潮智能科技有限公司 一种基于分布式存储的慢盘检测方法及装置
CN115934003B (zh) * 2023-03-09 2023-05-16 浪潮电子信息产业股份有限公司 磁盘阵列中的慢盘识别方法、装置、设备及可读存储介质

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103810062A (zh) * 2014-03-05 2014-05-21 华为技术有限公司 慢盘检测方法和装置
CN106354590A (zh) * 2015-07-17 2017-01-25 中兴通讯股份有限公司 磁盘检测方法和装置
CN106407052A (zh) * 2015-07-31 2017-02-15 华为技术有限公司 一种检测磁盘的方法及装置
CN106407051A (zh) * 2015-07-31 2017-02-15 华为技术有限公司 一种检测慢盘的方法及装置
CN106557389A (zh) * 2015-09-29 2017-04-05 成都华为技术有限公司 一种慢盘检测方法和装置
CN106897178A (zh) * 2017-02-21 2017-06-27 曲阜师范大学 一种基于极限学习机的慢盘检测方法及系统

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7971093B1 (en) * 2008-01-16 2011-06-28 Network Appliance, Inc. Apparatus and method to proactively address hard disk drive inefficiency and failure
JP2010009442A (ja) * 2008-06-30 2010-01-14 Fujitsu Ltd ディスクアレイシステム、ディスク制御装置及びその再構築処理方法

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103810062A (zh) * 2014-03-05 2014-05-21 华为技术有限公司 慢盘检测方法和装置
CN106354590A (zh) * 2015-07-17 2017-01-25 中兴通讯股份有限公司 磁盘检测方法和装置
CN106407052A (zh) * 2015-07-31 2017-02-15 华为技术有限公司 一种检测磁盘的方法及装置
CN106407051A (zh) * 2015-07-31 2017-02-15 华为技术有限公司 一种检测慢盘的方法及装置
CN106557389A (zh) * 2015-09-29 2017-04-05 成都华为技术有限公司 一种慢盘检测方法和装置
CN106897178A (zh) * 2017-02-21 2017-06-27 曲阜师范大学 一种基于极限学习机的慢盘检测方法及系统

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112416639A (zh) * 2020-11-16 2021-02-26 新华三技术有限公司成都分公司 一种慢盘检测方法、装置、设备及存储介质
CN117806890A (zh) * 2024-02-28 2024-04-02 四川省华存智谷科技有限责任公司 一种基于分布式存储的慢盘检测处理方法
CN117806890B (zh) * 2024-02-28 2024-05-03 四川省华存智谷科技有限责任公司 一种基于分布式存储的慢盘检测处理方法

Also Published As

Publication number Publication date
CN109815037A (zh) 2019-05-28
CN109815037B (zh) 2021-07-20

Similar Documents

Publication Publication Date Title
WO2019101087A1 (fr) Procédé de détection de disque lent, et réseau de stockage
US10175909B2 (en) Extent migration in multi-tier storage systems
US9866573B2 (en) Dynamic malicious application detection in storage systems
US20180184232A1 (en) Detecting trigger conditions to dynamically update a model based on sensor data in a fog computing environment
US9906543B2 (en) Automated abnormality detection in service networks
US11204827B2 (en) Using a machine learning module to determine when to perform error checking of a storage unit
US7917677B2 (en) Smart profiler
JP6640242B2 (ja) ハイブリッドストレージシステム内のサービス品質を改善するためのシステム及び方法
US10310937B2 (en) Dynamically restoring disks based on array properties
AU2016351383A1 (en) Performance monitoring in a distributed storage system
US20110093679A1 (en) Identifying Dynamically Changing Virtual Storage Devices
US20230057068A1 (en) Request throttling using pi-es controller
JP2017215966A (ja) 記憶デバイスにおける性能変動を制限するための技術
US11836067B2 (en) Hyper-converged infrastructure (HCI) log system
US9552263B2 (en) System, apparatus, and method to dynamically change system recoveries based on system load
US20120047264A1 (en) System and method to dynamically allocate electronic mailboxes
TW201822054A (zh) 網路攻擊模式之判斷裝置、判斷方法及其電腦程式產品
JP2018532184A (ja) 頻繁に使用されるイメージセグメントをキャッシュからプロビジョニングするためのシステム及び方法
US9135191B1 (en) Techniques for storage network bandwidth management
US10853512B2 (en) System and method of operating an information handling system with a management controller
CN111831389A (zh) 一种数据处理方法、装置以及存储介质
US11144427B2 (en) Storage system performance models based on empirical component utilization
EP4222599A1 (fr) Procédés et systèmes de détection d'indisponibilité de ressources multiples pour un système de dispositifs informatiques en réseau et d'identification de cause racine
US11277375B1 (en) Sender policy framework (SPF) configuration validator and security examinator
EP3339810A1 (fr) Détection de conditions de déclenchement pour la mise à jour dynamique d'un modèle basé sur des données de capteur dans un environnement informatique de brouillard

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 18880725

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 18880725

Country of ref document: EP

Kind code of ref document: A1