WO2019084917A1 - 存储系统可用容量计算方法及装置 - Google Patents

存储系统可用容量计算方法及装置 Download PDF

Info

Publication number
WO2019084917A1
WO2019084917A1 PCT/CN2017/109360 CN2017109360W WO2019084917A1 WO 2019084917 A1 WO2019084917 A1 WO 2019084917A1 CN 2017109360 W CN2017109360 W CN 2017109360W WO 2019084917 A1 WO2019084917 A1 WO 2019084917A1
Authority
WO
WIPO (PCT)
Prior art keywords
storage system
stripe
capacity
lorig
length
Prior art date
Application number
PCT/CN2017/109360
Other languages
English (en)
French (fr)
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 华为技术有限公司
Priority to PCT/CN2017/109360 priority Critical patent/WO2019084917A1/zh
Priority to CN201780011499.8A priority patent/CN109196458B/zh
Priority to EP17898328.4A priority patent/EP3553664B1/en
Publication of WO2019084917A1 publication Critical patent/WO2019084917A1/zh
Priority to US16/654,982 priority patent/US11385828B2/en

Links

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/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
    • 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/0604—Improving or facilitating administration, e.g. storage management
    • G06F3/0605—Improving or facilitating administration, e.g. storage management by facilitating the interaction with a user or administrator
    • 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/0604—Improving or facilitating administration, e.g. storage management
    • G06F3/0607—Improving or facilitating administration, e.g. storage management by facilitating the process of upgrading existing storage systems, e.g. for improving compatibility between host and storage device
    • 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/0608—Saving storage space on storage systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0629—Configuration or reconfiguration of storage systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0629—Configuration or reconfiguration of storage systems
    • G06F3/0631—Configuration or reconfiguration of storage systems by allocating resources to storage systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0629—Configuration or reconfiguration of storage systems
    • G06F3/0632—Configuration or reconfiguration of storage systems by initialisation or re-initialisation of storage systems
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/06—Digital input from, or digital output to, record carriers, e.g. RAID, emulated record carriers or networked record carriers
    • G06F3/0601—Interfaces specially adapted for storage systems
    • G06F3/0628—Interfaces specially adapted for storage systems making use of a particular technique
    • G06F3/0655—Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices
    • G06F3/0659—Command handling arrangements, e.g. command buffers, queues, command scheduling
    • 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/067—Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]
    • 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

Definitions

  • the present invention relates to the field of information technology, and in particular, to a storage system usable capacity calculation method and apparatus.
  • the storage system contains a large number of hard disks. In actual applications, the capacity of the hard disks in the storage system varies. In the prior art, in order to solve the problem that the capacity of the hard disk in the storage system is not uniform, the capacity of all the hard disks is converted into the capacity of the hard disk with the smallest capacity in the storage system to obtain the available capacity of the storage system. For example, a 0.6 terabyte (Terabyte, TB) hard disk, a 1.2 TB hard disk, and a 3.6 TB hard disk in a storage system. The storage system converts the capacity of a 1.2 TB hard disk and a 3.6 TB hard disk into 0.6 TB to obtain a storage system. The available capacity is 1.8TB. The storage system is configured according to a certain striping algorithm. The solution cannot obtain the preferred available capacity in the storage system, which seriously wastes the capacity of the hard disk in the storage system.
  • the present application provides a storage system capacity calculation method and apparatus for determining a preferred available capacity of a storage system to avoid waste of the storage system hard disk capacity.
  • the first aspect of the present application provides a storage system usable capacity calculation scheme, wherein the storage system includes an available hard disk group DG i , the number of hard disks in the available hard disk group DG i is N i , and the capacity of the hard disk D i in the DG i is The capacity CD x of the hard disk D x in CD i , DG x is larger than the capacity CD x +1 of the hard disk D x+1 in DG x+1 ; where i is an integer ranging from 1 to G, and G is an integer.
  • the solution further includes: the management device groups the available hard disks in the storage system, and obtains G available hard disk groups DG i for the G The available hard disk groups DG i are sorted.
  • the available hard disk is the hard disk except the hot spare disk in the storage system.
  • the management device corresponds to each stripe of the length of the candidate stripe from LORIG r to LORIG z .
  • the available capacity of the storage system determining the candidate stripe length LORIG P corresponding to the maximum of the available capacity of the storage system; wherein P is an integer from r to z.
  • the storage system data protection is implemented to improve the reliability of the storage system, and the maximum value of the available capacity in the storage system is determined.
  • the management device configures the stripe length of the storage system as LORIG P , thereby implementing storage system data protection and improving storage system reliability. At the same time, make full use of the storage capacity of the storage system.
  • the management device calculates the candidate stripe length of the storage system corresponding to the stripe of LORIG y
  • step 2a is performed;
  • step 2b When satisfied And when t is greater than 1 and not greater than G, step 2b is performed;
  • step 2c is performed;
  • Step 2a Calculate the available capacity of the storage system corresponding to the stripe length of the candidate stripe length LORIG y is Where V is the number of data strips in the strip;
  • Step 2b Calculate the available capacity of the storage system corresponding to the stripe length of the candidate stripe length LORIGy is
  • Step 2c Taking t+1 as a new t, performing step a, t is not greater than G. According to the number of data stripes in the V-strip, the available capacity of the data strip can be effectively stored in each of the stripe configuration storage systems, thereby fully utilizing the storage system to store user data and improving the utilization of the storage system hard disk capacity.
  • the management device calculates the candidate stripe length of the storage system corresponding to the stripe of LORIG y
  • step 2a is performed;
  • step 2b When satisfied And when t is greater than 1 and not greater than G, step 2b is performed;
  • step 2c is performed;
  • Step 2a Calculate the available capacity of the storage system corresponding to the stripe length of the candidate stripe length LORIG y is
  • Step 2b Calculate the available capacity of the storage system corresponding to the stripe length of the candidate stripe length LORIGy is
  • Step 2c Taking t+1 as a new t, performing step a, t is not greater than G.
  • the storage system further includes a hot spare disk, the hot spare disk capacity is a PC, and the hot spare disk is available. Capacity is Obtain the available capacity of the storage system hot spare disk while obtaining the maximum available capacity of the storage system.
  • the present application is also applicable to the capacity CD x of the hard disk D x in the DG x is equal to the capacity CD x +1 of the hard disk D x+1 in the DG x+1 , that is, the scenario in which the hard disk capacity in the storage system is the same.
  • a stripe whose length of the stripe length [r, z] that can be effectively configured in the storage system is a stripe using an erasure code algorithm.
  • the stripe length of [r, z] that can be effectively configured in the storage system is a stripe using a multi-copy algorithm, and the number of data strips in the stripe is 1.
  • the second aspect of the present application further provides a storage system including a controller and an available hard disk group DG i , the number of hard disks in the available hard disk group DG i is N i , and the capacity of the hard disk D i in the DG i CD i , DG a hard disk D x x x greater than the capacity of the CD in the DG x + D x + 1 hard disk capacity CD x + 1 1; and wherein each value of i is an integer from 1 to G, G, are integers, G is not less than 2 , x is an integer, and x is each integer from 1 to G-1; the length of the stripe that can be effectively configured in the storage system is [r, z], where r and z are positive integers, and z is greater than r;
  • the processor includes a processor and an interface, the processor and the interface are in communication, and the processor is configured to perform the aspects of the first aspect of the present application.
  • the third aspect of the present application further provides a storage system available capacity calculation device, which is applied to the storage system of the first aspect of the present application, where the storage system available capacity calculation device includes a plurality of units, and is used to perform the first application of the present application. Aspects of each program.
  • the storage system available capacity computing device is applied to the storage system of the first aspect of the present application.
  • the storage system available capacity computing device includes a processor and an interface, and the processor and the interface communicate, and the processor is configured to execute the first application. Aspects of each program.
  • the fourth aspect of the present application further provides a computer readable storage medium and a computer program product, the computer readable storage medium and the computer program product comprising computer instructions for implementing the aspects of the first aspect of the present application.
  • a fifth aspect of the present application provides a storage system usable capacity calculation solution, where the solution includes: the management device acquires information about an available hard disk, and groups the available hard disks to obtain G available hard disk groups DG i and G available hard disk groups. DG i sorting; wherein available hard disk group DG in the hard disk number i is N i, and DG capacity i in the hard disk of D i for the CD i, DG x hard disk D x capacity CD x is greater than the DG x + 1 is Hard disk D x+1 capacity CD x+1 ; where i is each integer from 1 to G, G is an integer, G is not less than 2, x is an integer, and x is a value of 1 to G-1 An integer; the length of the stripe that can be effectively configured in the storage system is [r, z], where r and z are positive integers, and z is greater than r; further, the management device obtains the candidate strip length LORIG y , where y takes Is an
  • various implementations of the fifth aspect of the present application may refer to various implementations of the first aspect of the present application. Accordingly, in accordance with the fifth aspect of the present application and various implementations thereof, a storage system, a storage system usable capacity computing device, a computer readable storage medium, and a computer program product are also provided.
  • a sixth aspect of the present application provides a storage system usable capacity calculation solution, where the solution includes: the management device acquires information about an available hard disk, and groups the available hard disks to obtain G available hard disk groups DG i and G available hard disk groups. DG i sorting; wherein available hard disk group DG in the hard disk number i is N i, and DG capacity i in the hard disk of D i for the CD i, DG x hard disk D x capacity CD x is greater than the DG x + 1 is Hard disk D x+1 capacity CD x+1 ; where i is each integer from 1 to G, G is an integer, G is not less than 2, x is an integer, and x is a value of 1 to G-1 An integer; the length of the stripe that can be effectively configured in the storage system is [r, z], where r and z are positive integers, and z is greater than r; further, the management device obtains the candidate strip length LORIG y , where Ly takes Is an integer
  • the strip length LORIG r to LORIG z corresponds to the maximum value of the available capacity of the storage system, thereby determining the maximum value from the available capacity of the storage system.
  • the management device further displays a candidate stripe length LORIG P corresponding to a maximum value among the available capacities of the storage system; wherein P is an integer ranging from r to z.
  • various implementations of the sixth aspect of the present application may refer to various implementations of the first aspect of the present application. Accordingly, in accordance with the sixth aspect of the present application and various implementations thereof, a storage system, a storage system usable capacity computing device, a computer readable storage medium, and a computer program product are also provided.
  • FIG. 1 is a schematic diagram of a storage system according to an embodiment of the present invention.
  • FIG. 2 is a schematic structural diagram of a controller according to an embodiment of the present invention.
  • FIG. 3 is a schematic diagram of storage capacity of a storage system according to an embodiment of the present invention.
  • FIG. 4 is a schematic diagram of storage capacity of a storage system according to an embodiment of the present invention.
  • FIG. 5 is a schematic diagram of storage capacity of a storage system according to an embodiment of the present invention.
  • FIG. 6 is a flowchart of a method according to an embodiment of the present invention.
  • FIG. 7 is a flowchart of calculating available capacity of a storage system according to an embodiment of the present invention.
  • FIG. 8 is a flowchart of calculating available capacity of a storage system according to an embodiment of the present invention.
  • FIG. 9 is a schematic diagram of results of available capacity of a storage system according to an embodiment of the present invention.
  • FIG. 10 is a schematic diagram of results of available capacity of a storage system according to an embodiment of the present invention.
  • FIG. 11 is a schematic structural diagram of a storage system capacity calculation apparatus according to an embodiment of the present invention.
  • the storage system in the embodiment of the present invention may be a storage array (such as Huawei). of 18000 series, V3 series), distributed file storage system (such as Huawei) of 9000 series), distributed block storage systems (such as Huawei of Series) and so on.
  • the storage array includes a storage controller 101 and a plurality of hard disks.
  • the hard disk includes a solid state disk (SSD), a mechanical hard disk, or a hybrid hard disk.
  • SSD solid state disk
  • mechanical hard disk such as HDD (Hard Disk Drive).
  • the controller 101 includes a central processing unit (CPU) 201, a memory 202 and an interface 203.
  • the memory 202 stores computer instructions.
  • the CPU 201 executes computer instructions in the memory 202 to manage and store the storage system. Access operation.
  • a Field Programmable Gate Array (FPGA) or other hardware may also be used to perform all operations of the CPU 201 in the embodiment of the present invention, or an FPGA or other hardware and the CPU 201 are used respectively. Part of the operation of the CPU of the embodiment of the present invention is performed.
  • the embodiments of the present invention collectively refer to a combination of the CPU 201 and the memory 202, and various implementations described above, and the processor communicates with the interface 203.
  • the storage system In order to improve reliability and prevent data loss, the storage system usually stores data in the form of strips when storing data, that is, writes in parallel on multiple memories (for example, multiple disks or multiple storage media). Strips.
  • Striping usually refers to the collection of multiple strips of multiple memories written in parallel when storing data.
  • a strip also known as a striping unit, consists of strips.
  • Strip length usually the number of strips a strip contains.
  • the type and number of strips included in a stripe can be determined by a striping algorithm, which can be an Erasure Coding (EC) or a multi-copy algorithm. For example, if the storage system uses the EC algorithm, the strips that make up a stripe need to be distributed on different hard disks.
  • a stripe consists of M data strips (data strips refer to strips containing source data) and N check strips (check strips refer to strips containing check data), and the stripe length is M+N.
  • the (M+N) block hard disk is required to store the strips in the stripe.
  • the EC algorithm is a Redundant Array of Independent Disks (RAID) algorithm, such as an EC stripe composed of a RAID 5 algorithm, the number of check strips is 1, and the EC strip consisting of a RAID 5 algorithm.
  • the length of the stripe is M+1; the number of strips consisting of RAID 6 algorithm, the number of strips is 2, and the stripe length of the EC strip consisting of RAID 6 algorithm is M+2.
  • the storage system uses a multi-copy mode algorithm to obtain striping, and in a stripe composed of multiple copies, the number of strips is equal to the number of copies.
  • the 3 copy algorithm that is, one strip contains 3 identical data strips, and 3 identical data strips are stored on three hard disks, in which case the stripe length is 3.
  • the stripe using the multi-copy algorithm one copy can be used as the data strip, and the other copy is used as the check strip. Therefore, in the stripe of the multi-copy algorithm, the number of data strips is 1.
  • Source data also known as user-written data, contains metadata.
  • the same striping algorithm can have different stripe lengths.
  • the RAID 6 algorithm in the EC algorithm can have strips of different lengths; the multi-copy algorithm can also have different number of copies.
  • a hot spare disk is a hard disk that stores data recovered when a hard disk failure occurs due to a hard disk failure in a storage system and data recovery is performed using a striping algorithm.
  • the available capacity of the storage system refers to the capacity of the storage system that can be used to store data in addition to the hot spare.
  • the principle of data reliability priority is generally adopted in the design of storage systems.
  • the reliability of the storage system may not be used to store data.
  • the available capacity of the storage system in different stripe length configurations has a maximum value.
  • the storage system hard disk capacity, the number of hard disks, and the striping algorithm the available capacity of the storage system corresponding to each strip length is calculated, and the stripe length corresponding to the maximum available capacity of the storage system is obtained as the optimal stripe. length.
  • the storage system includes 16 hard disks, which includes three 900 gigabyte (Gigabyte, GB) hard disks, five 1.8 TB hard disks, and eight 3.6 TB hard disks.
  • the stripe algorithm set by the storage system is RAID6 (that is, it contains two check strips), and two hot spare disks are required. Therefore, the number of hard disks that can be used to store strips is 14 and can be used except for the hot spare.
  • a hard disk that stores striped strips is called an available hard disk.
  • the storage system provides the user with the stripe length that the storage system can support according to factors such as storage performance and reliability, such as [5, 25], that is, the storage system supports a stripe length of 5 to 25.
  • the strips in the stripe need to be stored on different hard disks. Therefore, the stripe length is actually limited by the number of hard disks. Therefore, the actual stripe length that the storage system can configure cannot exceed the number of available hard disks.
  • the length of the stripe that the storage system can actually configure is called the stripe length that can be effectively configured. Taking the embodiment of the present invention as an example, the number of available hard disks is 14 except for two hot spare disks. Therefore, the effective length of the stripe is [5, 14], and the length of the stripe that can be effectively configured is 5 to 14.
  • An effectively configurable stripe length is the candidate stripe length.
  • the embodiment of the present invention provides a calculation algorithm for the available capacity of the storage system.
  • the storage system that can be obtained when different candidate stripe lengths are used according to the number of hard disks available in the storage system can be determined according to the number of available hard disks of the storage system. Capacity, such as the available capacity obtained when using different candidate stripe lengths of the RAID 6 algorithm. Since the available capacity values are obtained, the maximum slack length corresponding to the available capacity of the storage system can be determined, and the storage system is configured according to the determined stripe length, thereby improving the utilization of the storage system hard disk capacity.
  • FIG. 3 An application scenario of the embodiment of the present invention is as shown in FIG. 3 .
  • the storage vendor recommends a reasonable storage system configuration for the user, and displays information such as available capacity and unavailable capacity in the storage system corresponding to each candidate strip length.
  • the interface shown in Figure 3 is provided, and the number of hot spare disks and the type of striping algorithm (such as EC) are supported by the user.
  • the storage system is based on the length of the candidate EC strip and the hard disk information of the storage system. Therefore, the available capacity and the unavailable capacity corresponding to each candidate stripe length are calculated and displayed, and the maximum value of the available capacity of the storage system corresponding to the stripe length of all the candidate stripe lengths may be displayed, and further, the display may also be displayed.
  • the candidate stripe length corresponding to the maximum of the available capacity of the storage system.
  • the website or the application provided by the storage vendor can provide the foregoing operation to the user.
  • the specific implementation can calculate the storage corresponding to the length of each candidate strip by the server running the website or the application as the management device. Information such as available capacity and unavailable capacity in the system.
  • the structure of the management device can be referred to the structure shown in FIG. 2 and the corresponding implementation. Further, the management device further includes a display device.
  • the embodiment of the present invention can also provide the interface shown in FIG. 4, thereby providing greater flexibility for the user to select and configure the storage system.
  • the available hard disk capacity is displayed, such as 1.8TB, 3.6TB, 900GB.
  • the interface further provides the option of "Select Hard Disk Capacity C" and "Select Hard Disk Number" for the user to input the hard disk capacity and quantity.
  • the optional hard disk capacity presented in FIG. 4 can be omitted, and the hard disk capacity is directly presented in the “Select Hard Disk Capacity C” option.
  • the interface shown in Figure 4 It also includes a "further add” option for users to further select different hard drives and quantities.
  • the user selects the storage system through the interface shown in FIG.
  • the other options in the interface of FIG. 4 are as shown in FIG. 3, and details are not described herein again.
  • the user interface further provides a stripe correspondence from the candidate stripe length from LORIG r to LORIG z .
  • the available capacity and unavailable capacity interface of the storage system provides the storage system configuration option for the user, and the user selects the corresponding configured storage system.
  • the interfaces shown in FIG. 3 to FIG. 5 can also be integrated into the storage system itself, that is, the storage system itself provides the operations shown in FIG. 3 to FIG. 5. Specifically, an implementation can be calculated by the controller of the storage system as a management device.
  • the candidate stripe length stripe corresponds to the available capacity and the unavailable capacity in the storage system, and determines the stripe length corresponding to the maximum available capacity in the storage system, and the storage system configures the stripe to the length;
  • the management device of the storage system may calculate information such as available capacity and unavailable capacity in the storage system corresponding to the stripe length of each candidate stripe length, and determine the stripe corresponding to the maximum available capacity in the storage system. Length, the storage system will configure the stripe to this length.
  • the management device obtains the hard disk information in the storage system, and the hard disk information includes the capacity and quantity of the hard disk.
  • the management device obtains the hard disk information of the storage system, and specifically includes collecting hard disk information installed in the storage system or hard disk information of the storage system input by the user.
  • the management device selects the hard disk with the largest capacity from the storage system as the hot spare disk according to the obtained hard disk information. When the number of hard disks with the largest capacity in the storage system is less than the number of hot spare disks, the hot spare disks are continuously selected from the disks with the largest secondary capacity.
  • the management device groups the hard disks after the hot spare disks are deducted from the storage system, and then groups the available hard disks to obtain the available hard disk groups DG i .
  • the hot spare disk capacity is PC.
  • the number of hot spare disks is determined by the striping algorithm. For example, RAID6 requires two hot spare disks.
  • the hard disks with the same capacity are in the same available hard disk group DG i , and the number of hard disks in the available hard disk group DG i is N i .
  • the capacity of the hard disk Di in the available hard disk group DG i is CD i .
  • the management device to sort the available capacity of the hard disk drive group sequence of descending order of available hard disk group DG 1 to DG G, i.e., the capacity of a hard disk DG x CD x D X is larger than the hard disk D DG x + 1
  • the capacity of x+1 is CD x+1
  • the available hard disk group sequence is 1 to G.
  • i is each integer from 1 to G
  • G is an integer
  • G is not less than 2
  • x is an integer
  • x is each integer from 1 to G-1.
  • the effective length of the stripe in the storage system is [r,z], where r and z are positive integers and z is greater than r.
  • the management device performs the process shown in FIG. 6 according to the length of each of the stripe lengths [r, z] that can be effectively configured under the same striping algorithm:
  • LORIG y is the integer of each of the stripe lengths r to z that can be effectively configured.
  • the length of the candidate stripe is represented by LORIG y , that is, the candidate stripe length LORIG y is equal to the stripe length y that can be effectively configured.
  • LORIG y indicates that the stripe length y that can be effectively configured is used as the candidate stripe length, and the candidate stripe length LORIG y is obtained to obtain the effectively configured stripe length y.
  • the management device determines the stripe length LORIG P corresponding to the maximum value of the available capacity of the storage system according to the available stripe length of the storage system corresponding to each stripe length of the LORIG r to the LORIG z ; wherein P is a value An integer from r to z. Further, the management device configures the stripe length of the storage system as LORIG P, that is, configures the stripe length of the storage system as P.
  • the stripe lengths of [r, z] are all using the same striping algorithm, such as RAID 6.
  • the embodiment of the present invention calculates the available capacity of the storage system corresponding to the stripe length of the candidate strips from LORIG r to LORIG z , and determines the stripe length corresponding to the maximum value among the available capacity of the storage system, thereby improving the hard disk capacity in the storage system. Utilization.
  • step 602 specifically includes:
  • step 702b When satisfied And when t is greater than 1 and is not greater than G (denoted as Y & 1 ⁇ t ⁇ G), then step 702b is performed;
  • step 702c is performed;
  • Step 702b Calculate the available capacity of the storage system corresponding to the stripe length of the candidate stripe length LORIGy is
  • Step 702c Taking t+1 as a new t, step 701 is performed, and t is not greater than G.
  • step 702a the available capacity of the hot spare disk in the storage system is a PC
  • step 702b the available capacity of the hot spare disk in the storage system is
  • the available capacity of the hot spare disk in the storage system refers to the hard disk capacity of the hot spare disk in the storage system that can be used to store the data recovered by the stripe.
  • step 602 specifically includes:
  • Step 801 Determine whether the content is satisfied.
  • step 802b When satisfied And when t is greater than 1 and not greater than G (denoted as Y & 1 ⁇ t ⁇ G), then step 802b is performed;
  • step 802c is performed;
  • Step 802a Calculate the available capacity of the storage system corresponding to the stripe length of the candidate stripe length LORIG y
  • Step 802b Calculate the available capacity of the storage system corresponding to the stripe length of the candidate stripe length LORIGy
  • Step 802c Taking t+1 as a new t, step 801 is performed, and t is not greater than G.
  • step 802a the available capacity of the hot spare disk in the storage system is a PC
  • step 802b the available capacity of the hot spare disk in the storage system is
  • the available capacity of the hot spare disk in the storage system refers to the hard disk capacity of the hot spare disk in the storage system that can be used to store the data recovered by the stripe.
  • the available capacity of the storage system corresponding to the stripe length of each candidate stripe length can be calculated.
  • the storage system includes 16 hard disks as an example, including three 900 GB hard disks, five 1.8 TB hard disks, and eight 3.6 TB hard disks.
  • the storage system is set to RAID6 (that is, it contains two check strips). It requires two hot spare disks and selects two hard disks with the largest single disk capacity, that is, the hot spare disk capacity is 7.2TB (7200GB).
  • the hot spare disk has a usable capacity of 7200GB.
  • the hot spare disk has a usable capacity of 7200GB.
  • the hot spare disk has a usable capacity of 7200GB.
  • the hot spare disk has a usable capacity of 7200GB.
  • the hot spare disk has a usable capacity of 7200GB.
  • t represents the minimum value of the currently available hard disk group sequence
  • the initial value of t is 1
  • CD 1 * LCU 10 3.6 TB * 10 > (900 GB * 3 +1.8TB*5+3.6TB*6)
  • step 702c is executed
  • the minimum value of the currently available hard disk group sequence is 2, and step 701 is performed.
  • CD 2 * LCU 4 1.8 TB * 4 ⁇ (900 GB * 3 + 1.8 TB * 5)
  • step 702b is performed.
  • t represents the minimum value of the currently available hard disk group sequence
  • the initial value of t is 1
  • CD 1 * LCU 11 3.6 TB * 11 > (900 GB * 3 +1.8TB*5+3.6TB*6)
  • step 702c is executed
  • the minimum value of the currently available hard disk group sequence is 2
  • step 701 is performed.
  • CD 2 * LCU 5 1.8 TB * 5 ⁇ (900 GB * 3 + 1.8 TB * 5)
  • step 702b is performed.
  • t represents the minimum value of the currently available hard disk group sequence
  • the initial value of t is 1
  • CD 1 * LCU 12 3.6 TB * 12 > (900 GB * 3 +1.8TB*5+3.6TB*6)
  • step 702c is executed
  • the minimum value of the currently available hard disk group sequence is 2
  • step 701 is performed.
  • step 702b is performed.
  • t represents the minimum value of the currently available hard disk group sequence
  • the initial value of t is 1
  • CD 1 * LCU 13 3.6 TB * 13 > (900 GB * 3 +1.8TB*5+3.6TB*6)
  • step 702c is executed
  • the minimum value of the currently available hard disk group sequence is 2, and step 701 is performed.
  • CD 3 * LCU 2 900 GB * 2 ⁇ 900 GB * 3, step 702b is performed.
  • t represents the minimum value of the currently available hard disk group sequence
  • the initial value of t is 1
  • CD 1 * LCU 14 3.6 TB * 14 > (900 GB * 3 +1.8TB*5+3.6TB*6)
  • step 702c is executed
  • the minimum value of the currently available hard disk group sequence is 2, and step 701 is performed.
  • the available capacity, capacity utilization, and available capacity of the hot spare disk of the storage system corresponding to the stripe lengths 5 to 14 of the candidate strip lengths as shown in FIG. 9 are obtained.
  • the capacity utilization is the percentage of the available capacity of the storage system to the total capacity of the storage system. Therefore, in the embodiment of the present invention, the storage system is configured as a stripe with a stripe length of 9, and the storage system has the largest available capacity, that is, 25900 GB, and the capacity utilization rate reaches 63.95%.
  • the embodiment of the present invention calculates the available capacity of the storage system corresponding to the stripe whose candidate stripe length is 5 to 14 according to the flow shown in FIG. 6 and FIG. 7, and generates a graph shown by 10.
  • the embodiment of the present invention may start from the stripe of the candidate stripe length of 5, or may be the length of the candidate stripe. Start the calculation for the 14 strips. It is also possible to calculate the available capacity of the storage system corresponding to the stripe of the plurality of candidate stripe lengths in parallel. This embodiment of the present invention does not limit this.
  • the solution for calculating the available capacity of the storage system in the embodiment of the present invention can be used for the user to provide hard disk capacity planning for the user when purchasing the storage system.
  • the storage system is configured to: two 3.6TB hot spare disks, and RAID 6
  • the algorithm has a stripe length of 9, which improves the utilization of the hard disk capacity of the storage system.
  • the embodiment of the present invention is also applicable to the capacity CD x of the hard disk D x in the DG x is equal to the capacity CD x +1 of the hard disk D x+1 in the DG x+1 , that is, the scenario in which the hard disk capacity in the storage system is the same.
  • the embodiment of the present invention further provides a storage system available capacity calculation device, which is applied to the management device of the embodiment of the present invention.
  • the available capacity of the storage system further includes a computing device 110 and a sorting unit grouping unit; wherein the means for grouping of available hard disk storage system are grouped, obtaining G groups available hard DG i; sorting unit for the G The hard disk group DG i can be sorted.
  • the storage system available capacity computing device 110 further includes a determining unit, configured to determine a maximum value of the available capacity of the storage system according to the available capacity of the storage system corresponding to the stripe length of the candidate stripe lengths from LORIG r to LORIG z . Corresponding candidate strip length LORIG P ; where P is an integer from r to z.
  • the storage system available capacity computing device 110 further includes a configuration unit configured to configure the stripe length of the storage system as LORIG P .
  • the computing unit 1102 is specifically configured to perform the process shown in FIG. 7 or FIG. 8.
  • the storage system available capacity calculation device further includes a display unit for displaying various calculation results of the embodiment of the present invention.
  • the embodiments of the present invention further provide a description of the storage device available capacity calculation device. Reference may be made to the foregoing description of the embodiments of the present invention, and details are not described herein.
  • the storage capacity of the system is also applicable to the computing device 100 CD x DG x the capacity of hard disk D x equals DG x + 1 hard disks D x + 1 capacity CD x + 1, i.e. the same as the storage capacity of the hard disk system Scenes.
  • the storage system capacity computer device 100 shown in FIG. 11 may specifically be a management device.
  • the management device reference may be made to the foregoing description, and the obtaining unit 1101 and the computing unit 1102 correspond to the processor of the management device.
  • the storage system capacity computer device 100 can be a computer program containing computer instructions for implementing the functions of the acquisition unit 1101 and the computing unit 1102.
  • the computer program can be stored in a computer readable storage medium, or the computer program can also be used by a user in a server or downloaded.
  • the computer readable storage medium can be non-volatile or volatile.
  • the computing program is stored in the server for use by the user, and the computer processor in the computer program can be executed by the processor of the server.
  • the embodiments of the present invention further provide a computer readable storage medium and a computer program product, the computer readable storage medium and the computer program product comprising computer instructions for implementing various solutions described in the embodiments of the present invention.
  • the EC and multiple copies are used as the striping algorithm, but the striping algorithm in the embodiment of the present invention is not limited to the EC and multiple copies as the striping algorithm.
  • the disclosed apparatus and method may be implemented in other manners.
  • the division of the units described in the device embodiments described above is only one logical function division, and may be further divided in actual implementation, for example, multiple units or components may be combined or may 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 objectives of the embodiments of the present embodiment.
  • each functional unit in each embodiment of the present invention 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.

Abstract

一种存储系统容量计算方法，获取候选的分条长度LORIG y（601），计算所述候选的分条长度LORIG y的分条对应的存储系统的可用容量（602）。

Description

存储系统可用容量计算方法及装置 技术领域
本发明涉及信息技术领域，尤其涉及一种存储系统可用容量计算方法及装置。
背景技术
存储系统包含大量的硬盘，实际应用中，存储系统中的硬盘容量各异。现有技术为解决存储系统中硬盘容量不统一的问题，将所有硬盘的容量都折算为存储系统中容量最小的硬盘的容量从而获得存储系统的可用容量。例如，存储系统中1块0.6太字节(Terabyte，TB)硬盘，1块1.2TB硬盘，1块3.6TB硬盘，存储系统将1.2TB硬盘和3.6TB硬盘的容量折算为0.6TB，得到存储系统可用容量为1.8TB。存储系统再根据某一种分条算法进行配置，该方案无法获得存储系统中优选的可用容量，严重浪费存储系统中硬盘的容量。
发明内容
本申请提供了一种存储系统容量计算方法及装置，用于确定存储系统的优选的可用容量，以避免存储系统硬盘容量的浪费。
本申请的第一方面提供了一种存储系统可用容量计算方案，其中，存储系统包含可用硬盘组DGi，可用硬盘组DGi中硬盘数量为Ni,并且DGi中硬盘Di的容量为CDi，DGx中的硬盘Dx的容量CDx大于DGx+1中的硬盘Dx+1的容量CDx+1；其中i为取值1至G的每一个整数，G为整数，G不小于2，x为整数，并且x为取值1至G-1的每一个整数；存储系统中可有效配置的分条长度为[r,z]，其中r和z为正整数，z大于r；在该方案中，管理设备获取候选的分条长度LORIGy，其中y取值为可有效配置的分条长度r至z中的每一个整数，并且LORIGy＝y，LORIGy表示将可有效配置的分条长度y作为候选的分条长度；管理设备计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量，从而从存储系统可用容量中确定最大值，避免浪费存储系统中硬盘的容量。
结合本申请第一方面，在本申请第一方面的第一种实现方式中，该方案还包括管理设备对存储系统中的可用硬盘进行分组，获得G个可用硬盘组DGi，对所述G个可用硬盘组DGi进行排序。可用硬盘为存储系统中除热备盘外的硬盘。
结合本申请第一方面或本申请第一方面的第一种实现方式中，在第二种可能的实现方式中，管理设备根据候选的分条长度为LORIGr至LORIGz的每一个分条对应的存储系统的可用容量，确定存储系统的可用容量中的最大值对应的候选的分条长度LORIGP；其中P取值为r至z的一个整数。在实现存储系统数据保护，提高存储系统可靠性的同时，确定存储系统中的可用容量的最大值。
结合本申请第一方面的第二种可能实现方式，在第三种可能实现方式中，管理设备将存储系统的分条长度配置为LORIGP，从而在实现存储系统数据保护，提高存储系统可靠性的同时，充分利用存储系统的存储容量。
结合本申请第一方面或第一方面的第一至三种任一可能实现方式，在第四种可能实现方式中，管理设备计算候选的分条长度为LORIGy的分条对应的存储系 统的可用容量，具体包括：管理设备从t＝1开始执行步骤a：判断是否满足
Figure PCTCN2017109360-appb-000001
其中CDGi＝CDi*Ni；当t＝1时，LORIGy等于LCUy；当t不为1时，LCUy等于
Figure PCTCN2017109360-appb-000002
t表示当前可用硬盘组序列的最小值；
当满足
Figure PCTCN2017109360-appb-000003
并且t＝1，执行步骤2a；
当满足
Figure PCTCN2017109360-appb-000004
并且t大于1并且不大于G时，执行步骤2b；
当不满足
Figure PCTCN2017109360-appb-000005
并且t不大于G时，执行步骤2c；
步骤2a:计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量为
Figure PCTCN2017109360-appb-000006
其中，V为分条中数据条带的数量；
步骤2b：计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量为
Figure PCTCN2017109360-appb-000007
步骤2c：将t+1作为新的t，执行步骤a，t不大于G。根据V分条中数据条带的数量，确定每一种分条配置存储系统中能够有效存储数据条带的可用容量，从而充分利用存储系统存储用户数据，提高存储系统硬盘容量的利用率。
结合本申请第一方面或第一方面的第一至三种任一可能实现方式，在第五种可能实现方式中，管理设备计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量，具体包括：管理设备从t＝1开始执行步骤a：判断是否满足
Figure PCTCN2017109360-appb-000008
其中CDGi＝CDi*Ni；当t＝1时，LORIGy等于LCUy；当t不为1时，LCUy等于
Figure PCTCN2017109360-appb-000009
t表示当前可用硬盘组序列的最小值；
当满足
Figure PCTCN2017109360-appb-000010
并且t＝1，执行步骤2a；
当满足
Figure PCTCN2017109360-appb-000011
并且t大于1并且不大于G时，执行步骤2b；
当不满足
Figure PCTCN2017109360-appb-000012
并且t不大于G时，执行步骤2c；
步骤2a:计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量为
Figure PCTCN2017109360-appb-000013
步骤2b：计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量为
Figure PCTCN2017109360-appb-000014
步骤2c：将t+1作为新的t，执行步骤a，t不大于G。
结合本申请第一方面的第四种可能实现方式或第五种可能实现方式，在第六种可能实现方式中，存储系统还包括热备盘，热备盘容量为PC，热备盘的可用容量为
Figure PCTCN2017109360-appb-000015
在获得存储系统最大的可用容量的同时，获得存储系统热备盘可用容量。
本申请也适用于DGx中的硬盘Dx的容量CDx等于DGx+1中的硬盘Dx+1的容量CDx+1，即存储系统中硬盘容量相同的场景。
本申请第一方面的各种实现方式中，一种实现方式，存储系统中可有效配置的分条长度为[r,z]的分条为使用纠删码算法的分条。另一种实现方式中，存储系统中可有效配置的分条长度为[r,z]的分条为使用多副本算法的分条，分条中数据条带的数量为1。
本申请第二方面还提供了一种存储系统，存储系统包含控制器和可用硬盘组DGi，可用硬盘组DGi中硬盘数量为Ni,并且DGi中硬盘Di的容量CDi，DGx中的硬盘Dx的容量CDx大于DGx+1中的硬盘Dx+1的容量CDx+1；其中i为取值1至G的每一个整数，G为整数，G不小于2，x为整数，并且x为取值1至G-1的每一个整数；存储系统中可有效配置的分条长度为[r,z]，其中r和z为正整数，z大于r；控制器包含处理器和接口，处理器和接口通信，处理器用于执行本申请第一方面各方案。
相应地，本申请第三方面还提供了一种存储系统可用容量计算装置，应用于本申请第一方面的存储系统中，存储系统可用容量计算装置包含多个单元，用于执行本申请第一方面各方案。另一种实现，存储系统可用容量计算装置，应用于本申请第一方面的存储系统中，存储系统可用容量计算装置包含处理器和接口，处理器和接口通信，处理器用于执行本申请第一方面各方案。
相应地，本申请第四方面还提供了计算机可读存储介质和计算机程序产品，计算机可读存储介质和计算机程序产品中包含计算机指令用于实现本申请第一方面各方案。
本申请的第五方面提供了一种存储系统可用容量计算方案，其中，该方案包括：管理设备获取可用硬盘的信息，对可用硬盘分组得到G个可用硬盘组DGi，对G个可用硬盘组DGi进行排序；其中，可用硬盘组DGi中硬盘数量为Ni,并且DGi中硬盘Di的容量为CDi，DGx中的硬盘Dx的容量CDx大于DGx+1中的硬盘Dx+1的容量CDx+1；其中i为取值1至G的每一个整数，G为整数，G不小于2，x为整数，并且x为取值1至G-1的每一个整数；存储系统中可有效配置的分条长度为[r,z]，其中r和z为正整数，z大于r；进一步的，管理设备获取候选的分条长度LORIGy，其中y取值为可有效配置的分条长度r至z中的每一个整数，并且LORIGy＝y，LORIGy表示将可有效配置的分条长度y作为候选的分条长度；管理设备计算并显示候选的分条长度为LORIGy的分条对应的存储系统的可用容量，从而从存储系统可用容量中确定最大值。进一步的，本申请的第五方面的各种实现可以参考本申请的第一方面的各种实现。相应的，根据本申请的第五方面及其各种实现，还 提供了一种存储系统、存储系统可用容量计算装置、计算机可读存储介质和计算机程序产品。
本申请的第六方面提供了一种存储系统可用容量计算方案，其中，该方案包括：管理设备获取可用硬盘的信息，对可用硬盘分组得到G个可用硬盘组DGi，对G个可用硬盘组DGi进行排序；其中，可用硬盘组DGi中硬盘数量为Ni,并且DGi中硬盘Di的容量为CDi，DGx中的硬盘Dx的容量CDx大于DGx+1中的硬盘Dx+1的容量CDx+1；其中i为取值1至G的每一个整数，G为整数，G不小于2，x为整数，并且x为取值1至G-1的每一个整数；存储系统中可有效配置的分条长度为[r,z]，其中r和z为正整数，z大于r；进一步的，管理设备获取候选的分条长度LORIGy，其中Ly取值为可有效配置的分条长度r至z中的每一个整数，并且LORIGy＝y，LORIGy表示将可有效配置的分条长度y作为候选的分条长度；管理设备计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量，管理设备显示候选的分条长度LORIGr至LORIGz的分条对应的存储系统的可用容量的最大值，从而从存储系统可用容量中确定最大值。进一步的，管理设备还显示存储系统的可用容量中的最大值对应的候选的分条长度LORIGP；其中P为取值为r至z的一个整数。进一步的，本申请的第六方面的各种实现可以参考本申请的第一方面的各种实现。相应的，根据本申请的第六方面及其各种实现，还提供了一种存储系统、存储系统可用容量计算装置、计算机可读存储介质和计算机程序产品。
附图说明
图1为本发明实施例存储系统示意图；
图2为本发明实施例控制器结构示意图；
图3为本发明实施例存储系统存储容量示意图；
图4为本发明实施例存储系统存储容量示意图；
图5为本发明实施例存储系统存储容量示意图；
图6为本发明实施例方法流程图；
图7为本发明实施例计算存储系统可用容量流程图；
图8为本发明实施例计算存储系统可用容量流程图；
图9为本发明实施例存储系统可用容量结果示意图；
图10为本发明实施例存储系统可用容量结果示意图；
图11为本发明实施例存储系统容量计算装置结构示意图。
本发明实施例
如图1所示，本发明实施例中的存储系统，可以为存储阵列(如华为
Figure PCTCN2017109360-appb-000016
的
Figure PCTCN2017109360-appb-000017
18000系列，
Figure PCTCN2017109360-appb-000018
V3系列)，分布式文件存储系统(如华为
Figure PCTCN2017109360-appb-000019
的
Figure PCTCN2017109360-appb-000020
9000系列)，分布式块存储系统(如华为
Figure PCTCN2017109360-appb-000021
的
Figure PCTCN2017109360-appb-000022
系列)等。本发明实施例以存储阵列为例，存储阵列包括存储控制器101和多块硬盘，其中，硬盘包含固态硬盘(Solid State Disk,SSD)、机械硬盘或者混合硬盘等。机械硬盘如HDD(Hard Disk Drive)。
如图2所示，控制器101包含中央处理单元(Central Processing Unit,CPU)201、存储器202和接口203，存储器202中存储计算机指令，CPU201执行存储器202中的计算机指令对存储系统进行管理及数据访问操作。另外，为节省CPU201的计算资源，现场可编程门阵列(Field Programmable Gate Array,FPGA)或其他硬件也可以用于执行本发明实施例中CPU201全部操作，或者，FPGA或其他硬件与CPU201分别用于执行本发明实施例CPU的部分操作。为方便描述，本发明实施例统一用处理器来指CPU201和存储器202的组合，以及上述各种实现，处理器与接口203通信。
存储系统为提高可靠性，防止数据丢失，在存储数据的时候，通常会使用分条的形式存储数据，即在多个存储器上(例如多块磁盘或者多个存储介质上)上并行写入多个条带。
分条，通常指存储数据的时候，并行写入多个存储器的多个条带的集合。条带，也称为分条单元，分条由条带组成。分条长度，通常指一个分条包含的条带的数量。一个分条包含的条带的类型和数量可以由分条算法决定，分条算法可以为纠删码(Erasure Coding,EC)或多副本算法等。例如，存储系统使用EC算法，则构成一个分条的条带需要分布在不同的硬盘上。一个分条包含M个数据条带(数据条带指包含源数据的条带)和N个校验条带(检验条带指包含校验数据的条带)，分条长度为M+N，其中M和N均为整数，则需要(M+N)块硬盘存储分条中的条带。具体的，例如EC算法为独立硬盘冗余阵列(Redundant Array of Independent Disks，RAID)算法，例如RAID 5算法组成的EC分条，校验条带的数量为1，RAID 5算法组成的EC分条的分条长度为M+1；RAID 6算法组成的EC分条，校验条带的数量为2，RAID 6算法组成的EC分条的分条长度为M+2。还例如，存储系统使用多副本方式算法获得分条，在使用多副本构成的分条中，条带的数量等于副本数量。例如3副本算法，即一个分条中包含3份相同的数据条带，3份相同的数据条带分别存储在3块硬盘上，此种情况下，分条长度为3。在使用多副本算法的分条中，可以将其中1份副本作为数据条带，其他副本作为校验条带，因此多副本算法的分条中，数据条带的数量为1。源数据也称为用户写入数据，包含元数据。相同的分条算法可以有不同的分条长度，例如，EC算法中的RAID 6算法，可以有不同长度的分条；多副本算法也可以有不同的副本数量。
热备盘是存储系统中发生硬盘故障造成数据损失，使用分条算法进行数据恢复时，存储恢复出来的数据的硬盘。
存储系统的可用容量是指存储系统除热备盘外可以用于存储数据的硬盘容量。
存储系统设计中一般采用数据可靠性优先的原则。在使用分条算法保护的存储系统中，由于可靠性约束，可能导致存储系统中硬盘容量无法全部用来存储数据，不同分条长度配置下的存储系统的可用容量存在最大值。本发明实施例根据存储系统硬盘容量、硬盘数量以及分条算法，计算每种分条长度对应的存储系统的可用容量，进而得到存储系统可用容量最大值对应的分条长度作为最优的分条长度。
本发明实施例以存储系统包含16块硬盘为例，其中包含3块900吉字节(Gigabyte,GB)硬盘，5块1.8TB硬盘，8块3.6TB硬盘。存储系统设置的分条算法为RAID6(即包含2个校验条带)，需要2块热备盘，因此，可用于存储分条的条带的硬盘数量为14，除去热备盘外可用于存储分条的条带的硬盘称为可用硬盘。通常存储系统根据存储性能和可靠性等因素，会为用户提供存储系统可支持的分条长度，如[5,25]，即存储系统支持的分条长度为5到25。根据前面描述可知，分条中的条带需要存储在不同的硬盘上，因此，实际上分条长度要受硬盘数量的约束，因此，存储系统实际可以配置的分条长度不能超过可用硬盘的数量，存储系统实际可以配置的分条长度称为可有效配置的分条长度。以本发明实施例为例，除2块热备盘外，可用硬盘的数量为14。因此，可有效配置的分条长度为[5,14]，即可有效配置的分条长度为5至14。
本发明实施例中，为计算每一个可有效配置的分条长度对应的存储容量的值，从而确定所述存储系统的可用容量中的最大值对应的分条长度，本发明实施例以下称每一个可有效配置的分条长度为候选的分条长度。本发明实施例提供一种存储系统的可用容量的计算算法，可以根据存储系统可用硬盘的数量确定使用相同分条算法的情况下，采用不同的候选的分条长度时能够获得的存储系统的可用容量，例如使用RAID 6算法的不同候选的分条长度时获得的可用容量。由于获得了不同的可用容量值，因此可以确定出最大的存储系统可用容量所对应的分条长度，并根据所确定出的分条长度配置存储系统，从而提高存储系统硬盘容量的利用率。
本发明实施例一种应用场景如图3所示，存储厂商为用户推荐合理的存储系统配置，显示每种候选的分条长度对应的存储系统中的可用容量及不可用容量等信息。根据存储系统硬盘信息，提供如图3所示界面，支持用户输入热备盘数量M和分条算法类型(如EC)等，存储系统根据候选的EC分条长度和存储系统的硬盘信息等，从而计算并显示每种候选的分条长度对应的可用容量以及不可用容量等，还可以显示所有候选的分条长度的分条对应的存储系统的可用容量的最大值，进一步的，还可以显示存储系统的可用容量中的最大值对应的候选的分条长度。具体实现，可以由存储厂商提供的网站或应用为用户提供上述操作，在这种应用场景下，具体实现可以由运行该网站或应用的服务器作为管理设备计算每种候选的分条长度对应的存储系统中的可用容量及不可用容量等信息。管理设备的结构可参考图2所示的结构及相应实现。进一步的，管理设备还包括显示设备。
为进一步方便用户选择，本发明实施例还可以提供图4所示界面，从而为用户选择、配置存储系统提供更大的灵活性。在图4界面中呈现可选择的硬盘容量，如1.8TB，3.6TB，900GB，界面还进一步提供“选择硬盘容量C”的选项及“选择硬盘数量”的选项，供用户输入硬盘容量和数量。具体实现中，图4中呈现的可选择的硬盘容量可以省略，硬盘容量直接在“选择硬盘容量C”选项中呈现。为使用户可以选用不同容量的硬盘，图4所示的界面中 还包含“进一步添加”选项，供用户进一步选择不同容量的硬盘及数量。用户通过图4所示的界面选择存储系统。图4界面中的其他选项描述如图3所示，在此不再赘述。
为方便用户获得候选的分条长度对应的存储系统中的可用容量及不可用容量等信息，如图5所示，用户界面进一步提供从候选的分条长度为LORIGr至LORIGz的分条对应的存储系统的可用容量及不可用容量界面。图3至图5所示的界面为用户提供存储系统配置选项，用户选择相应的配置的存储系统。图3至图5所示的界面也可以集成到存储系统本身，即存储系统本身提供图3至图5所示的操作，具体的，一种实现可以由存储系统的控制器作为管理设备计算每种候选的分条长度的分条对应的存储系统中的可用容量及不可用容量等信息，确定存储系统中的可用容量最大值对应的分条长度，存储系统将分条配置为该长度；另一种实现，可以由存储系统的管理设备计算每种候选的分条长度的分条对应的存储系统中的可用容量及不可用容量等信息，确定存储系统中的可用容量最大值对应的分条长度，存储系统将分条配置为该长度。
在具体实现中，管理设备获取存储系统中硬盘信息，硬盘信息包含硬盘容量及数量。管理设备获取存储系统的硬盘信息具体包括收集存储系统中安装的硬盘信息或者用户输入的存储系统的硬盘信息。管理设备根据获得的硬盘信息，根据热备盘的数量，从存储系统中选择容量最大的硬盘作为热备盘。当存储系统中容量最大的硬盘的数量少于热备盘的数量，则从次容量最大的盘中继续选择热备盘。管理设备将存储系统中扣除热备盘后的硬盘进行分组，即将可用硬盘进行分组，获得可用硬盘组DGi。热备盘容量为PC，热备盘的数量由分条算法决定，如RAID6，则需要2块热备盘。其中，容量相同的硬盘在同一个可用硬盘组DGi，可用硬盘组DGi中的硬盘数量为Ni。可用硬盘组DGi中的硬盘Di的容量为CDi。管理设备根据可用硬盘组中硬盘容量从大到小的顺序对可用硬盘组进行排序依次为DG1到DGG，即DGx中的硬盘Dx的容量CDx大于DGx+1中的硬盘Dx+1的容量CDx+1，可用硬盘组序列为1到G。其中i为取值1至G的每一个整数，G为整数，G不小于2，x为整数，并且x为取值1至G-1的每一个整数。存储系统中可有效配置的分条长度为[r,z]，其中r和z为正整数，z大于r。管理设备根据相同分条算法下可有效配置的分条长度为[r,z]中的每一个分条长度执行如图6所示的流程：
601：获取候选的分条长度LORIGy。其中y取值为可有效配置的分条长度r至z中的每一个整数。为表述方便，用LORIGy表示候选的分条长度，即候选的分条长度LORIGy等于可有效配置的分条长度y。LORIGy表示将可有效配置的分条长度y作为候选的分条长度，获取候选的分条长度LORIGy即获取可有效配置的分条长度y。
602：计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量。
管理设备根据候选的分条长度为LORIGr至LORIGz的每一个分条对应的存储系统的可用容量，确定存储系统的可用容量中的最大值对应的分条长度LORIGP； 其中P为取值为r至z的一个整数。进一步的，管理设备将存储系统的分条长度配置为LORIGP，即将存储系统的分条长度配置为P。本发明实施例中分条长度为[r,z]的分条均使用相同的分条算法，例如RAID6。本发明实施例计算候选的分条长度为LORIGr至LORIGz的分条对应的存储系统的可用容量，确定存储系统的可用容量中选择最大值对应的分条长度，从而提高存储系统中硬盘容量的利用率。
其中一种实现方式，步骤602，如图7所示，具体包括：
步骤701：判断是否满足
Figure PCTCN2017109360-appb-000023
其中CDGi＝CDi*Ni；当t＝1时，LORIGy等于LCUy；当t不为1时，LCUy等于
Figure PCTCN2017109360-appb-000024
t表示当前可用硬盘组序列的最小值；t意味着当CDi*LCUy不满足上述条件时，则从可用硬盘组序列从小到大的顺序中选择下一个可用硬盘组作为当前可用硬盘组序列的最小值；
当满足
Figure PCTCN2017109360-appb-000025
并且t＝1(记为Y&t＝1)，则执行步骤702a；
当满足
Figure PCTCN2017109360-appb-000026
并且t大于1并且不大于G时(记为Y&1<t≤G)，则执行步骤702b；
当不满足
Figure PCTCN2017109360-appb-000027
并且t不大于G时(记为N&t≤G)，执行步骤702c；
步骤702a:计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量为
Figure PCTCN2017109360-appb-000028
其中，V为分条中数据条带的数量；由EC算法生成的长度为M+N的分条中，V＝M；在由多副本算法生成的分条中，V＝1。根据V分条中数据条带的数量，确定每一种分条配置存储系统中能够有效存储数据条带的容量，从而充分利用存储系统存储用户数据，提高存储系统硬盘容量的利用率。
步骤702b：计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量为
Figure PCTCN2017109360-appb-000029
步骤702c：将t+1作为新的t，执行步骤701，t不大于G。
在步骤702a中，存储系统中的热备盘可用容量为PC，在步骤702b中，存储系统中热备盘可用容量为
Figure PCTCN2017109360-appb-000030
存储系统中热备盘可用容量是指存储系统中热备盘可以用于存储分条恢复出来的数据的硬盘容量。
另一种实现方式，步骤602，如图8所示，具体包括：
步骤801：判断是否满足
Figure PCTCN2017109360-appb-000031
其中CDGi＝CDi*Ni；当t＝1时，LORIGy等于LCUy；当t不为1时，LCUy等于
Figure PCTCN2017109360-appb-000032
t表示当前可用硬盘组序列的最小值；t意味着当CDi*LCUy不满足上述条件时，则从可用硬盘组序列从小到大的顺序中选择下一个可用硬盘组作为当前可用硬盘组序列的最小值；
当满足
Figure PCTCN2017109360-appb-000033
并且t＝1(记为Y&t＝1)，则执行步骤802a；
当满足
Figure PCTCN2017109360-appb-000034
并且t大于1并且不大于G时(记为Y&1<t≤G)，则执行步骤802b；
当不满足
Figure PCTCN2017109360-appb-000035
并且t不大于G时(记为N&t≤G)，执行步骤802c；
步骤802a:计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量
Figure PCTCN2017109360-appb-000036
步骤802b：计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量
Figure PCTCN2017109360-appb-000037
步骤802c：将t+1作为新的t，执行步骤801，t不大于G。
在步骤802a中，存储系统中的热备盘可用容量为PC，在步骤802b中，存储系统中热备盘可用容量为
Figure PCTCN2017109360-appb-000038
存储系统中热备盘可用容量是指存储系统中热备盘可以用于存储分条恢复出来的数据的硬盘容量。
在图8所示的实施例中，可以计算每种候选的分条长度的分条对应的存储系统的可用容量。
本发明实施例以存储系统包含16块硬盘为例，其中包含3块900GB硬盘，5块1.8TB硬盘，8块3.6TB硬盘。存储系统设置为RAID6(即包含2个校验条带)，需要2块热备盘，选择单盘容量最大的2块硬盘，即热备盘容量为7.2TB(7200GB)。可用硬盘组DG1中的硬盘D1的容量CD1为3.6TB，可用硬盘组DG1中的硬盘数量为N1＝6；可用硬盘组DG2中的硬盘D2的容量CD2为1.8TB，可用硬盘组DG2中的硬盘数量为N1＝5；可用硬盘组DG3中的硬盘D3的容量CD3为900GB，可用硬盘组DG3中的硬盘数量为N1＝3。根据可用硬盘组中硬盘容量从大到小的顺序对可用硬盘组进行排序依次为DG1 到DG3。其中i为取值1至3的每一个整数，即i的取值为1、2和3。G＝3。可有效配置的分条长度为[5,14]，即r＝5,z＝14。结合图6及图7，分别计算候选的分条长度为5到14的分条对应的存储系统的可用容量。
根据图7所示的流程，1)计算候选的分条长度为5的分条对应的存储系统的可用容量，t表示当前可用硬盘组序列的最小值，t的初始值为1，CD1*LCU5＝3.6TB*5<(900GB*3+1.8TB*5+3.6TB*6),执行步骤702a,在候选的分条长度为5时，V＝3，可用容量
Figure PCTCN2017109360-appb-000039
Figure PCTCN2017109360-appb-000040
热备盘可用容量为7200GB。
2)计算候选的分条长度为6的存储系统的可用容量：t表示当前可用硬盘组序列的最小值，t的初始值为1，CD1*LCU6＝3.6TB*6<(900GB*3+1.8TB*5+3.6TB*6),执行步骤702a,在候选的分条长度为6时，V＝4，可用容量
Figure PCTCN2017109360-appb-000041
热备盘可用容量为7200GB。
3)计算候选的分条长度为7的存储系统的可用容量：t表示当前可用硬盘组序列的最小值，t的初始值为1，CD1*LCU7＝3.6TB*7<(900GB*3+1.8TB*5+3.6TB*6),执行步骤702a,在候选的分条长度为7时，V＝5，可用容量
Figure PCTCN2017109360-appb-000042
热备盘可用容量为7200GB。
4)计算候选的分条长度为8的存储系统的可用容量：t表示当前可用硬盘组序列的最小值，t的初始值为1，CD1*LCU8＝3.6TB*8<(900GB*3+1.8TB*5+3.6TB*6),执行步骤702a,在候选的分条长度为8时，V＝6，可用容量
Figure PCTCN2017109360-appb-000043
热备盘可用容量为7200GB。
5)计算候选的分条长度为9的存储系统的可用容量：t表示当前可用硬盘组序列的最小值，t的初始值为1，CD1*LCU9＝3.6TB*9<(900GB*3+1.8TB*5+3.6TB*6),执行步骤702a,在候选的分条长 度为9时，V＝7，可用容量
Figure PCTCN2017109360-appb-000044
热备盘可用容量为7200GB。
6)计算候选的分条长度为10的存储系统的可用容量：t表示当前可用硬盘组序列的最小值，t的初始值为1，CD1*LCU10＝3.6TB*10>(900GB*3+1.8TB*5+3.6TB*6),执行步骤702c,将t+1作为新的t，即新的t＝2，当前可用硬盘组序列的最小值为2，执行步骤701，
Figure PCTCN2017109360-appb-000045
Figure PCTCN2017109360-appb-000046
CD2*LCU4＝1.8TB*4<(900GB*3+1.8TB*5)，则执行步骤702b。在候选的分条长度为10时，V＝8，
Figure PCTCN2017109360-appb-000047
Figure PCTCN2017109360-appb-000048
Figure PCTCN2017109360-appb-000049
热备盘可用容量为
Figure PCTCN2017109360-appb-000050
Figure PCTCN2017109360-appb-000051
7)计算候选的分条长度为11的存储系统的可用容量：t表示当前可用硬盘组序列的最小值，t的初始值为1，CD1*LCU11＝3.6TB*11>(900GB*3+1.8TB*5+3.6TB*6),执行步骤702c,将t+1作为新的t，即新的t＝2，当前可用硬盘组序列的最小值为2，执行步骤701，
Figure PCTCN2017109360-appb-000052
Figure PCTCN2017109360-appb-000053
CD2*LCU5＝1.8TB*5<(900GB*3+1.8TB*5)，则执行步骤702b。在候选的分条长度为11时，V＝9，
Figure PCTCN2017109360-appb-000054
Figure PCTCN2017109360-appb-000055
Figure PCTCN2017109360-appb-000056
热备盘可用容量为
Figure PCTCN2017109360-appb-000057
Figure PCTCN2017109360-appb-000058
8)计算候选的分条长度为12的存储系统的可用容量：t表示当前可用 硬盘组序列的最小值，t的初始值为1，CD1*LCU12＝3.6TB*12>(900GB*3+1.8TB*5+3.6TB*6),执行步骤702c,将t+1作为新的t，即新的t＝2，当前可用硬盘组序列的最小值为2，执行步骤701，
Figure PCTCN2017109360-appb-000059
Figure PCTCN2017109360-appb-000060
则执行步骤702b。在候选的分条长度为12时，V＝10，
Figure PCTCN2017109360-appb-000061
Figure PCTCN2017109360-appb-000062
Figure PCTCN2017109360-appb-000063
热备盘可用容量为
Figure PCTCN2017109360-appb-000064
Figure PCTCN2017109360-appb-000065
9)计算候选的分条长度为13的存储系统的可用容量：t表示当前可用硬盘组序列的最小值，t的初始值为1，CD1*LCU13＝3.6TB*13>(900GB*3+1.8TB*5+3.6TB*6),执行步骤702c,将t+1作为新的t，即新的t＝2，当前可用硬盘组序列的最小值为2，执行步骤701,
Figure PCTCN2017109360-appb-000066
Figure PCTCN2017109360-appb-000067
CD2*LCU7＝1.8TB*7>(900GB*3+1.8TB*5)，则执行步骤702c，将t+1作为新的t，即新的t＝3，当前可用硬盘组序列的最小值为3，执行步骤701,
Figure PCTCN2017109360-appb-000068
CD3*LCU2＝900GB*2<900GB*3，执行步骤702b。在候选的分条长度为13时，V＝11，
Figure PCTCN2017109360-appb-000069
Figure PCTCN2017109360-appb-000070
热备盘可用容量为
Figure PCTCN2017109360-appb-000071
10)计算候选的分条长度为14的存储系统的可用容量：t表示当前可用硬盘组序列的最小值，t的初始值为1，CD1*LCU14＝3.6TB*14>(900GB*3+1.8TB*5+3.6TB*6),执行步骤702c,将t+1作为新的t， 即新的t＝2，当前可用硬盘组序列的最小值为2，执行步骤701,
Figure PCTCN2017109360-appb-000072
Figure PCTCN2017109360-appb-000073
CD2*LCU8＝1.8TB*8>(900GB*3+1.8TB*5)，则执行步骤702c，将t+1作为新的t，即新的t＝3，当前可用硬盘组序列的最小值为3，执行步骤701,
Figure PCTCN2017109360-appb-000074
CD3*LCU3＝900GB*3＝900GB*3，执行步骤702b。在候选的分条长度为14时，V＝12，
Figure PCTCN2017109360-appb-000075
Figure PCTCN2017109360-appb-000076
热备盘可用容量为
Figure PCTCN2017109360-appb-000077
根据图6和图7所示流程，获得如图9所示候选的分条长度5至14的分条对应的存储系统的可用容量、容量利用率以及热备盘的可用容量。其中，容量利用率为存储系统的可用容量与存储系统总容量的百分比。因此，本发明实施例中，将存储系统配置为分条长度为9的分条，存储系统的可用容量最大，即25900GB，容量利用率达到63.95％。本发明实施例根据图6和图7所示的流程计算候选的分条长度为5至14的分条对应的存储系统的可用容量，生成10所示图表。
本发明实施例在计算候选的分条长度为5至14的分条对应的存储系统的可用容量时，可以从候选的分条长度为5的分条开始计算，也可以从候选的分条长度为14的分条开始计算。还可以并行计算多个候选的分条长度的分条对应的存储系统的可用容量。本发明实施例对此不作限定。
本发明实施例计算存储系统可用容量的方案，可以用于用户在选购存储系统时为用户提供硬盘容量规划。本发明实施例计算存储系统可用容量的方案也可以用于配置存储系统的分条，在本发明实施例中，将存储系统配置为：2块3.6TB的热备盘，使用RAID6(2个校验条带)算法，分条长度为9，从而提高存储系统硬盘容量的利用率。
另外，本发明实施例也适用于DGx中的硬盘Dx的容量CDx等于DGx+1中的硬盘Dx+1的容量CDx+1，即存储系统中硬盘容量相同的场景。
基于上述实施例，如图11所示，本发明实施例进一步提供了一种存储系统可用容量计算装置，应用于本发明实施例的管理设备中。具体地，存储系统可用容量计算装置110包含获取单元1101和计算单元1102；其中，获取单元1101用于获取候选的分条长度LORIGy，其中y取值为可有效配置的分条长度r至z中的每一个整数，并且LORIGy＝y；计算单元1102用于计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量。进一步的，存储系统可用容量计算装置110还包括分组单元和排序单元；其中，分组单元用于对存储系统中的可用硬盘进行分组， 获得G个可用硬盘组DGi；排序单元用于对G个可用硬盘组DGi进行排序。进一步的，存储系统可用容量计算装置110还包含确定单元，用于根据候选的分条长度为LORIGr至LORIGz的分条对应的存储系统的可用容量，确定存储系统的可用容量中的最大值对应的候选的分条长度LORIGP；其中P为取值为r至z的一个整数。进一步的，存储系统可用容量计算装置110还包含配置单元，用于将存储系统的分条长度配置为LORIGP。可选的，计算单元1102具体用于执行图7或图8所示的流程。进一步的，存储系统可用容量计算装置还包括显示单元，用于显示本发明实施例各种计算结果。本发明实施例进一步提供了一种存储系统可用容量计算装置的具体实现可参考本发明实施例前面的描述，在此不再赘述。
同理，存储系统容量计算装置100也适用于DGx中的硬盘Dx的容量CDx等于DGx+1中的硬盘Dx+1的容量CDx+1，即存储系统中硬盘容量相同的场景。
如图11所示的存储系统容量计算机装置100，具体可以为管理设备，关于管理设备的描述可以参考前面描述，获取单元1101和计算单元1102对应管理设备的处理器。另一种实现，存储系统容量计算机装置100可以为计算机程序，计算机程序包含计算机指令用于实现获取单元1101和计算单元1102的功能。计算机程序可以存储在计算机可读存储介质中，或者计算机程序还可以服务器中供用户使用或下载。计算机可读存储介质可以为非易失性的也可以为易失性的。计算程序存储在服务器中供用户使用，具体可以为服务器的处理器执行计算机程序中的计算机指令。
相应的，本发明实施例还提供了计算机可读存储介质和计算机程序产品，计算机可读存储介质和计算机程序产品中包含计算机指令用于实现本发明实施例中描述的各种方案。
本发明实施例中以EC和多副本作为分条算法，但本发明实施例中的分条算法并不限于EC和多副本作为分条算法。
在本发明所提供的几个实施例中，应该理解到，所公开的装置、方法，可以通过其它的方式实现。例如，以上所描述的装置实施例所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，装置或单元的间接耦合或通信连接，可以是电性，机械或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例各方案的目的。
另外，在本发明各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。

Claims (34)

  1. 一种存储系统容量计算方法，其特征在于，存储系统包含可用硬盘组DGi，可用硬盘组DGi中硬盘数量为Ni,并且DGi中硬盘Di的容量为CDi，DGx中的硬盘Dx的容量CDx大于DGx+1中的硬盘Dx+1的容量CDx+1；其中i为取值1至G的每一个整数，G为整数，G不小于2，x为整数，并且x为取值1至G-1的每一个整数；所述存储系统中可有效配置的分条长度为[r,z]，其中r和z为正整数，z大于r；
    所述方法包括：
    管理设备获取候选的分条长度LORIGy，其中y取值为可有效配置的分条长度r至z中的每一个整数，并且LORIGy＝y；
    所述管理设备计算所述候选的分条长度LORIGy的分条对应的存储系统的可用容量。
  2. 根据权利要求1所述的方法，其特征在于，所述方法还包括：
    所述管理设备对所述存储系统中的可用硬盘进行分组，获得G个可用硬盘组DGi；
    所述管理设备对所述G个可用硬盘组DGi进行排序。
  3. 根据权利要求1或2所述的方法，其特征在于，所述方法还包括：
    所述管理设备根据候选的分条长度为LORIGr至LORIGz的每一个分条对应的存储系统的可用容量，确定所述存储系统的可用容量中的最大值对应的候选的分条长度LORIGP；其中P取值为r至z的一个整数。
  4. 根据权利要求3所述的方法，其特征在于，所述方法还包括：
    所述管理设备将所述存储系统的分条长度配置为LORIGP。
  5. 根据权利要求1至4任一所述的方法，其特征在于，所述管理设备计算所述候选的分条长度为LORIGy的分条对应的存储系统的可用容量，具体包括：所述管理设备从t＝1开始执行步骤a：判断是否满足
    Figure PCTCN2017109360-appb-100001
    其中CDGi＝CDi*Ni；当t＝1时，LORIGy等于LCUy；当t不为1时，LCUy等于
    Figure PCTCN2017109360-appb-100002
    t表示当前可用硬盘组序列的最小值；
    当满足
    Figure PCTCN2017109360-appb-100003
    并且t＝1，执行步骤2a；
    当满足
    Figure PCTCN2017109360-appb-100004
    并且t大于1并且不大于G时，执行步骤2b；
    当不满足
    Figure PCTCN2017109360-appb-100005
    并且t不大于G时，执行步骤2c；
    步骤2a:计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量为
    Figure PCTCN2017109360-appb-100006
    其中，V为分条中数据条带的数量；
    步骤2b：计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量 为
    Figure PCTCN2017109360-appb-100007
    步骤2c：将t+1作为新的t，执行步骤a，t不大于G。
  6. 根据权利要求1至4任一所述的方法，其特征在于，其特征在于，所述管理设备计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量，具体包括：所述管理设备从t＝1开始执行步骤a：判断是否满足
    Figure PCTCN2017109360-appb-100008
    其中CDGi＝CDi*Ni；当t＝1时，LORIGy等于LCUy；当t不为1时，LCUy等于
    Figure PCTCN2017109360-appb-100009
    t表示当前可用硬盘组序列的最小值；
    当满足
    Figure PCTCN2017109360-appb-100010
    并且t＝1，执行步骤2a；
    当满足
    Figure PCTCN2017109360-appb-100011
    并且t大于1并且不大于G时，执行步骤2b；
    当不满足
    Figure PCTCN2017109360-appb-100012
    并且t不大于G时，执行步骤2c；
    步骤2a:计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量为
    Figure PCTCN2017109360-appb-100013
    步骤2b：计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量为
    Figure PCTCN2017109360-appb-100014
    步骤2c：将t+1作为新的t，执行步骤a，t不大于G。
  7. 根据权利要求5或6所述的方法，其特征在于，所述存储系统还包括热备盘，所述热备盘容量为PC，所述热备盘的可用容量为
    Figure PCTCN2017109360-appb-100015
  8. 根据权利要求1至7所述的方法，其特征在于，所述存储系统中可有效配置的分条长度为[r,z]的分条为使用纠删码算法的分条。
  9. 根据权利要求1至7任一所述的方法，其特征在于，所述存储系统中可有效配置的分条长度为[r,z]的分条为使用多副本算法的分条。
  10. 一种存储系统，其特征在于，存储系统包含管理设备和可用硬盘组DGi，可用硬盘组DGi中硬盘数量为Ni,并且DGi中硬盘Di的容量为CDi，DGx中的硬盘Dx的容量CDx大于DGx+1中的硬盘Dx+1的容量CDx+1；其中i为取值1至G的每一个整数，G为整数，G不小于2，x为整数，并且x为取值1至G-1的每一个整数；所述存储系统中可有效配置的分条长度为[r,z]，其中r和z为正整数，z大于r；
    所述管理设备包含处理器和接口，所述处理器和所述接口通信，所述处理器用于：
    获取候选的分条长度LORIGy，其中y取值为可有效配置的分条长度r至z中的 每一个整数，并且LORIGy＝y；
    计算所述候选的分条长度为LORIGy的分条对应的存储系统的可用容量。
  11. 根据权利要求10所述的存储系统，其特征在于，所述处理器还用于：对所述存储系统中的可用硬盘进行分组，获得G个可用硬盘组DGi；
    对所述G个可用硬盘组DGi进行排序。
  12. 根据权利要求10或11所述的存储系统，其特征在于，所述处理器还用于：根据候选的分条长度为LORIGr至LORIGz的分条对应的存储系统的可用容量，确定存储系统的可用容量中的最大值对应的候选的分条长度LORIGP；其中P取值为r至z的一个整数。
  13. 根据权利要求9所述的存储系统，其特征在于，所述处理器还用于将所述存储系统的分条长度配置为LORIGP。
  14. 根据权利要求10至13任一所述的存储系统，其特征在于，所述处理器具
    Figure PCTCN2017109360-appb-100016
    当满足
    Figure PCTCN2017109360-appb-100017
    并且t大于1并且不大于G时，执行步骤2b；
    当不满足
    Figure PCTCN2017109360-appb-100018
    并且t不大于G时，执行步骤2c；
    步骤2a:计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量为
    Figure PCTCN2017109360-appb-100019
    其中，V为分条中数据条带的数量；
    步骤2b：计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量为
    Figure PCTCN2017109360-appb-100020
    步骤2c：将t+1作为新的t，执行步骤a，t不大于G。
  15. 根据权利要求10至13任一所述的存储系统，其特征在于，其特征在于，所述处理器具体用于：从t＝1开始执行步骤a：判断是否满足
    Figure PCTCN2017109360-appb-100021
    其中CDGi＝CDi*Ni；当t＝1时，LORIGy等于LCUy；当t不为1时，LCUy等于
    Figure PCTCN2017109360-appb-100022
    t表示当前可用硬盘组序列的最小值；
    当满足
    Figure PCTCN2017109360-appb-100023
    并且t＝1，执行步骤2a；
    当满足
    Figure PCTCN2017109360-appb-100024
    并且t大于1并且不大于G时，执行步骤2b；
    当不满足
    Figure PCTCN2017109360-appb-100025
    并且t不大于G时，执行步骤2c；
    步骤2a:计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量为
    Figure PCTCN2017109360-appb-100026
    步骤2b：计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量为
    Figure PCTCN2017109360-appb-100027
    步骤2c：将t+1作为新的t，执行步骤a，t不大于G。
  16. 根据权利要求14或15所述的存储系统，其特征在于，所述存储系统还包括热备盘，所述热备盘容量为PC，所述热备盘的可用容量为
    Figure PCTCN2017109360-appb-100028
  17. 根据权利要求10至16所述的存储系统，其特征在于，所述存储系统中可有效配置的分条长度为[r,z]的分条为使用纠删码算法的分条。
  18. 根据权利要求10至16所述的存储系统，其特征在于，所述存储系统中可有效配置的分条长度为[r,z]的分条为使用多副本算法的分条。
  19. 一种存储系统容量计算装置，其特征在于，所述装置应用于存储系统中，所述存储系统包含可用硬盘组DGi，可用硬盘组DGi中硬盘数量为Ni,并且DGi中硬盘Di的容量为CDi，DGx中的硬盘Dx的容量CDx大于DGx+1中的硬盘Dx+1的容量CDx+1；其中i为取值1至G的每一个整数，G为整数，G不小于2，x为整数，并且x为取值1至G-1的每一个整数；所述存储系统中可有效配置的分条长度为[r,z]，其中r和z为正整数，z大于r；
    所述装置包含获取单元和计算单元，其中：
    所述获取单元用于获取候选的分条长度LORIGy，其中y取值为可有效配置的分条长度r至z中的每一个整数，并且LORIGy＝y；
    所述计算单元用于计算所述候选的分条长度为LORIGy的分条对应的存储系统的可用容量。
  20. 根据权利要求19所述的装置，其特征在于，所述装置还包括分组单元和排序单元；其中，
    所述分组单元用于对所述存储系统中的可用硬盘进行分组，获得G个可用硬盘组DGi；
    所述排序单元用于对所述G个可用硬盘组DGi进行排序。
  21. 根据权利要求19或20所述的装置，其特征在于，所述装置还包括确定单元，用于根据候选的分条长度LORIGr至LORIGz的每一个分条对应的存储系统的可用容量，确定存储系统的可用容量中的最大值对应的候选的分条长度LORIGP；其中P取值为r至z的一个整数。
  22. 根据权利要求21所述的装置，其特征在于，所述装置还包括配置单元，用于将所述存储系统的分条长度配置为LORIGP。
  23. 根据权利要求19至22任一所述的装置，其特征在于，所述计算单元具体 用于：从t＝1开始执行步骤a：判断是否满足
    Figure PCTCN2017109360-appb-100029
    其中CDGi＝CDi*Ni；当t＝1时，LORIGy等于LCUy；当t不为1时，LCUy等于
    Figure PCTCN2017109360-appb-100030
    t表示当前可用硬盘组序列的最小值；
    当满足
    Figure PCTCN2017109360-appb-100031
    并且t＝1，执行步骤2a；
    当满足
    Figure PCTCN2017109360-appb-100032
    并且t大于1并且不大于G时，所执行步骤2b；
    当不满足
    Figure PCTCN2017109360-appb-100033
    并且t不大于G时，执行步骤2c；
    步骤2a:计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量为
    Figure PCTCN2017109360-appb-100034
    其中，V为分条中数据条带的数量；
    步骤2b：计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量为
    Figure PCTCN2017109360-appb-100035
    步骤2c：将t+1作为新的t，执行步骤a，t不大于G。
  24. 根据权利要求19至22任一所述的装置，其特征在于，所述计算单元具体用于：从t＝1开始执行步骤a：判断是否满足
    Figure PCTCN2017109360-appb-100036
    其中CDGi＝CDi*Ni；当t＝1时，LORIGy等于LCUy；当t不为1时，LCUy等于
    Figure PCTCN2017109360-appb-100037
    t表示当前可用硬盘组序列的最小值；
    当满足
    Figure PCTCN2017109360-appb-100038
    并且t＝1，执行步骤2a；
    当满足
    Figure PCTCN2017109360-appb-100039
    并且t大于1并且不大于G时，执行步骤2b；
    当不满足
    Figure PCTCN2017109360-appb-100040
    并且t不大于G时，执行步骤2c；
    步骤2a:计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量为
    Figure PCTCN2017109360-appb-100041
    步骤2b：计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量为
    Figure PCTCN2017109360-appb-100042
    步骤2c：将t+1作为新的t，执行步骤a，t不大于G。
  25. 根据权利要求23或24所述的装置，其特征在于，所述存储系统还包括热备盘，所述热备盘容量为PC，所述热备盘的可用容量为
    Figure PCTCN2017109360-appb-100043
  26. 根据权利要求19至25任一所述的装置，其特征在于，所述存储系统中可有效配置的分条长度为[r,z]的分条为使用纠删码算法的分条。
  27. 根据权利要求19至25任一所述的装置，其特征在于，所述存储系统中可有效配置的分条长度为[r,z]的分条为使用多副本算法的分条。
  28. 一种计算机可读存储介质，其特征在于，所述计算机可读存储介质存储用于计算存储系统可用容量的计算机指令，所述存储系统包含可用硬盘组DGi，可用硬盘组DGi中硬盘数量为Ni,并且DGi中硬盘Di的容量为CDi，DGx中的硬盘Dx的容量CDx大于DGx+1中的硬盘Dx+1的容量CDx+1；其中i为取值1至G的每一个整数，G为整数，G不小于2，x为整数，并且x为取值1至G-1的每一个整数；所述存储系统中可有效配置的分条长度为[r,z]，其中r和z为正整数，z大于r；
    其中，所述计算机可读存储介质包含第一计算机指令，用于获取候选的分条长度LORIGy，其中y取值为可有效配置的分条长度r至z中的每一个整数，并且LORIGy＝y；
    所述计算机可读存储介质包含第二计算机指令，用于计算所述候选的分条长度LORIGy的分条对应的存储系统的可用容量。
  29. 根据权利要求28所述的计算机可读存储介质，其特征在于，所述计算机可读存储介质还包含第三计算机指令，用于对所述存储系统中的可用硬盘进行分组，获得G个可用硬盘组DGi，对所述G个可用硬盘组DGi进行排序。
  30. 根据权利要求28或29所述的计算机可读存储介质，其特征在于，所述计算机可读存储介质还包含第四计算机指令，用于根据候选的分条长度LORIGr至LORIGz的每一个分条对应的存储系统的可用容量，确定存储系统的可用容量中的最大值对应的候选的分条长度LORIGP；其中P取值为r至z的一个整数。
  31. 根据权利要求30所述的计算机可读存储介质，其特征在于，所述计算机可读存储介质还包含第五计算机指令，用于将所述存储系统的分条长度配置为LORIGP。
  32. 根据权利要求28至31任一所述的装置，其特征在于，所述第二计算机指令具体用于：从t＝1开始执行步骤a：判断是否满足
    Figure PCTCN2017109360-appb-100044
    其中CDGi＝CDi*Ni；当t＝1时，LORIGy等于LCUy；当t不为1时，LCUy等于
    Figure PCTCN2017109360-appb-100045
    t表示当前可用硬盘组序列的最小值；
    当满足
    Figure PCTCN2017109360-appb-100046
    并且t＝1，执行步骤2a；
    当满足
    Figure PCTCN2017109360-appb-100047
    并且t大于1并且不大于G时，执行步骤2b；
    当不满足
    Figure PCTCN2017109360-appb-100048
    并且t不大于G时，执行步骤2c；
    步骤2a:计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量为
    Figure PCTCN2017109360-appb-100049
    其中，V为分条中数据条带的数量；
    步骤2b：计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量为
    Figure PCTCN2017109360-appb-100050
    步骤2c：将t+1作为新的t，执行步骤a，t不大于G。
  33. 根据权利要求28至31任一所述的计算机可读存储介质，其特征在于，所述第二计算机指令具体用于：从t＝1开始执行步骤a：判断是否满足
    Figure PCTCN2017109360-appb-100051
    其中CDGi＝CDi*Ni；当t＝1时，LORIGy等于LCUy；当t不为1时，LCUy等于
    Figure PCTCN2017109360-appb-100052
    t表示当前可用硬盘组序列的最小值；
    当满足
    Figure PCTCN2017109360-appb-100053
    并且t＝1，执行步骤2a；
    当满足
    Figure PCTCN2017109360-appb-100054
    并且t大于1并且不大于G时，执行步骤2b；
    当不满足
    Figure PCTCN2017109360-appb-100055
    并且t不大于G时，执行步骤2c；
    步骤2a:计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量为
    Figure PCTCN2017109360-appb-100056
    步骤2b：计算候选的分条长度为LORIGy的分条对应的存储系统的可用容量为
    Figure PCTCN2017109360-appb-100057
    步骤2c：将t+1作为新的t，执行步骤a，t不大于G。
  34. 根据权利要求32或33所述的计算机可读存储介质，其特征在于，所述存储系统还包括热备盘，所述热备盘容量为PC，所述热备盘的可用容量为
    Figure PCTCN2017109360-appb-100058
PCT/CN2017/109360 2017-11-03 2017-11-03 存储系统可用容量计算方法及装置 WO2019084917A1 (zh)

Priority Applications (4)

Application Number Priority Date Filing Date Title
PCT/CN2017/109360 WO2019084917A1 (zh) 2017-11-03 2017-11-03 存储系统可用容量计算方法及装置
CN201780011499.8A CN109196458B (zh) 2017-11-03 2017-11-03 存储系统可用容量计算方法及装置
EP17898328.4A EP3553664B1 (en) 2017-11-03 2017-11-03 Method and apparatus for calculating available capacity of storage system
US16/654,982 US11385828B2 (en) 2017-11-03 2019-10-16 Method and apparatus for calculating storage system available capacity

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
PCT/CN2017/109360 WO2019084917A1 (zh) 2017-11-03 2017-11-03 存储系统可用容量计算方法及装置

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US16/654,982 Continuation US11385828B2 (en) 2017-11-03 2019-10-16 Method and apparatus for calculating storage system available capacity

Publications (1)

Publication Number Publication Date
WO2019084917A1 true WO2019084917A1 (zh) 2019-05-09

Family

ID=64948910

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2017/109360 WO2019084917A1 (zh) 2017-11-03 2017-11-03 存储系统可用容量计算方法及装置

Country Status (4)

Country Link
US (1) US11385828B2 (zh)
EP (1) EP3553664B1 (zh)
CN (1) CN109196458B (zh)
WO (1) WO2019084917A1 (zh)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN114721585A (zh) * 2021-01-06 2022-07-08 伊姆西Ip控股有限责任公司 存储管理方法、设备和计算机程序产品
US11592988B2 (en) * 2021-01-12 2023-02-28 EMC IP Holding Company LLC Utilizing a hybrid tier which mixes solid state device storage and hard disk drive storage
US11842074B2 (en) * 2021-03-21 2023-12-12 Vast Data Ltd. Striping in a storage system
CN115237332A (zh) 2021-04-23 2022-10-25 伊姆西Ip控股有限责任公司 管理盘方法、电子设备和计算机程序产品

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060143379A1 (en) * 2004-12-27 2006-06-29 Ismail Khan I/O performance in RAID subsystem: adaptive maximum request size for LD
CN101685380A (zh) * 2008-09-27 2010-03-31 佛山市顺德区顺达电脑厂有限公司 磁盘阵列重组方法
CN102819408A (zh) * 2012-08-24 2012-12-12 记忆科技(深圳)有限公司 可动态调整条带深度的raid 0的实现方法及系统
CN105760254A (zh) * 2016-01-27 2016-07-13 四川效率源信息安全技术股份有限公司 一种基于raid1e的数据恢复方法

Family Cites Families (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP3702231B2 (ja) * 2002-01-31 2005-10-05 株式会社東芝 ディスクアレイ装置及び同装置における動的記憶容量拡張方法
US20060294300A1 (en) * 2005-06-22 2006-12-28 Seagate Technology Llc Atomic cache transactions in a distributed storage system
US8656131B2 (en) * 2008-10-31 2014-02-18 Dot Hill Systems Corporation Method and apparatus for expanding a virtual storage device
JP2010282281A (ja) * 2009-06-02 2010-12-16 Hitachi Ltd ディスクアレイ装置、及びその制御方法、並びにプログラム
CN101840360A (zh) * 2009-10-28 2010-09-22 创新科存储技术有限公司 Raid系统的快速重建方法及装置
CN102043685A (zh) * 2010-12-31 2011-05-04 成都市华为赛门铁克科技有限公司 独立磁盘冗余阵列系统及其数据恢复方法
US9569268B2 (en) * 2013-09-09 2017-02-14 EMC IP Holding Company LLC Resource provisioning based on logical profiles and objective functions
US20150199152A1 (en) * 2014-01-16 2015-07-16 Avalanche Technology, Inc. Method of managing redundant array of independent disks (raid) groups in a solid state disk array
CN106648469B (zh) * 2016-12-29 2020-01-17 华为技术有限公司 一种缓存数据处理方法、装置和存储控制器

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20060143379A1 (en) * 2004-12-27 2006-06-29 Ismail Khan I/O performance in RAID subsystem: adaptive maximum request size for LD
CN101685380A (zh) * 2008-09-27 2010-03-31 佛山市顺德区顺达电脑厂有限公司 磁盘阵列重组方法
CN102819408A (zh) * 2012-08-24 2012-12-12 记忆科技(深圳)有限公司 可动态调整条带深度的raid 0的实现方法及系统
CN105760254A (zh) * 2016-01-27 2016-07-13 四川效率源信息安全技术股份有限公司 一种基于raid1e的数据恢复方法

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3553664A4 *

Also Published As

Publication number Publication date
EP3553664B1 (en) 2022-07-27
CN109196458A (zh) 2019-01-11
EP3553664A1 (en) 2019-10-16
EP3553664A4 (en) 2020-04-29
CN109196458B (zh) 2020-12-01
US20200117386A1 (en) 2020-04-16
US11385828B2 (en) 2022-07-12

Similar Documents

Publication Publication Date Title
US10082965B1 (en) Intelligent sparing of flash drives in data storage systems
US10977124B2 (en) Distributed storage system, data storage method, and software program
US8112596B2 (en) Management apparatus, management method and storage management system
US9389975B2 (en) Method and apparatus to utilize large capacity disk drives
US9274714B2 (en) Method and system for managing storage capacity in a storage network
CN107250975B (zh) 数据存储系统和数据存储方法
JP4896593B2 (ja) 性能監視方法、計算機及び計算機システム
CN102369506B (zh) 存储系统及存储系统的利用率管理方法
WO2019084917A1 (zh) 存储系统可用容量计算方法及装置
US8775723B2 (en) Storage system and control method of storage system
US10825477B2 (en) RAID storage system with logical data group priority
US20080168228A1 (en) Virtualization engine and method, system, and computer program product for managing the storage of data
US20120260040A1 (en) Policy for storing data objects in a multi-tier storage system
JP5495828B2 (ja) 動的ページ再配置ストレージシステム管理
US8688935B1 (en) Storage system and method for snapshot space management
US8200722B2 (en) Method for shrinking a file system
EP2378410A2 (en) Method and apparatus to manage tier information
JP2009110346A (ja) 性能履歴の管理方法および性能履歴の管理システム
US11797387B2 (en) RAID stripe allocation based on memory device health
US10324794B2 (en) Method for storage management and storage device
US8131966B2 (en) System and method for storage structure reorganization
CN112486423A (zh) 一种分布式存储方法及装置
CN114924914B (zh) 磁盘分区表信息备份、恢复方法及系统
US9870152B2 (en) Management system and management method for managing data units constituting schemas of a database
WO2020082888A1 (zh) 存储系统中数据恢复方法、系统及装置

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: 17898328

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE