Method, system, device and program for creating and scheduling GPFS (General Purpose File System) storage file system

Abstract

The invention discloses a GPFS storage file system creation scheduling method, system, device and program, and the method comprises the steps: grouping DA in a GPFS storage cluster based on a preset rule, and endowing each DA with a capacity weight; when a file system creation order is received, obtaining the remaining available capacity of the GPFS storage cluster; wherein when the residual available capacity is greater than or equal to the file system, screening the DA groups meeting the requirements; creating a virtual disk set on each DA in the DA group meeting the requirement according to a preset capacity weight; and creating a file system based on the virtual disk set. Through the processing scheme disclosed by the invention, the problems of long time consumption and easy omission caused by manually confirming whether the GPFS storage cluster can create the file system or not are solved; a user only pays attention to a small number of necessary parameters when creating the file system, the problem that part of parameters need to be repeatedly configured is solved, and the user operation workload is reduced; the problem that manual screening of the available DA of the GPFS storage cluster is long in time consumption and prone to missing is solved.

Description

Technical Field

[0001] The present invention relates to the field of communication technology, and in particular to a GPFS storage file system creation scheduling method, system, device and program. Background Art

[0002] GPFS (General Parallel File System) is a distributed, shared, parallel cluster file system that supports simultaneous access to a single file system or a group of file systems from multiple nodes. GPFS can be used under AIX, Linux, and Windows operating systems and IBM Power, Intel / AMD x86 architectures, and is widely used by HPC users around the world.

[0003] There are two ways to create a file system on GPFS storage. One is to create it through the GPFS management command set, and the other is to create it using the GPFS built-in WEB page. Both methods require adding various configuration attributes. The difference is that the latter method provides a configuration guidance page, and configuration parameters are relatively more convenient.

[0004] Recovery group (RG) is the basic organizational structure used by GPFS Native RAID. Conceptually, a recovery group is equivalent to the internal GPFS of a hardware disk controller. In a recovery group, individual JBOD disks are defined as pdisks and assigned to declustered arrays (DA). Each pdisk can only belong to one cluster array within a recovery group. In the DA of a pdisk, a virtual disk (vdisk) is defined, and the virtual disk is equivalent to a RAID lun on a hardware hard disk controller. Multiple associated virtual disks form a virtual disk set (vdiskset), and a file system is composed of one or more virtual disk sets. Therefore, before creating a file system, you need to determine the DA where the virtual disk set is located. For the two methods of creating a file system mentioned above, the number of virtual disk sets contained in the file system and the DA to which the virtual disk set belongs must be manually specified.

[0005] When creating file storage through the GPFS storage web page / management command set, you need to pay attention to many parameter setting details. The creation process is too complicated for unfamiliar users, and some parameters are not of concern to users. In addition, each time a file system is created, the configuration needs to be repeated. When creating file systems in batches, the operation is cumbersome and unnecessary.

[0006] In addition, when there are multiple GPFS storage clusters in the environment, users need to confirm the cluster status one by one to select the appropriate cluster to create a file system. As the number of clusters increases, the corresponding decision-making time will also increase linearly.

[0007] It can be seen that the above existing file system creation method still has inconveniences and defects in use, and is in urgent need of further improvement. How to create a new GPFS storage file system creation scheduling method has become a goal that the industry urgently needs to improve. Summary of the invention

[0008] In view of this, an embodiment of the present disclosure provides a GPFS storage file system creation scheduling method, which at least partially solves the problems existing in the prior art.

[0009] In a first aspect, an embodiment of the present disclosure provides a GPFS storage file system creation scheduling method, the method comprising the following steps:

[0010] The DAs in the GPFS storage cluster are grouped based on preset rules, and capacity weights are assigned to each DA.

[0011] When receiving an order to create a file system, the remaining available capacity of the GPFS storage cluster is obtained; when the remaining available capacity is greater than or equal to the file system, the DA group that meets the requirements is selected;

[0012] Create a virtual disk set on each DA in the DA group that meets the requirements according to the preset capacity weight;

[0013] A file system is created based on the virtual disk set.

[0014] According to a specific implementation of the embodiment of the present disclosure, grouping DAs in the GPFS storage cluster based on a preset rule includes the following steps:

[0015] The GPFS storage cluster is divided into a first group and a second group; wherein the first group includes 2 DAs, and the capacity weights are 1 and 2 respectively; the second group includes 2 DAs, and the capacity weights are 1 and 3 respectively.

[0016] According to a specific implementation of the embodiment of the present disclosure, the method further includes:

[0017] When the remaining available capacity is less than the file system, the user is notified that no GPFS storage cluster is available to create the file system.

[0018] According to a specific implementation of the embodiment of the present disclosure, when the remaining available capacity is greater than or equal to the file system, screening DA groups that meet the requirements includes:

[0019] The file system capacity is allocated according to the capacity weight of the DA in each group, and whether the capacity of the DA in each group is greater than or equal to the allocated file system capacity is checked one by one; when the capacity of each DA in the group is greater than or equal to the allocated file system capacity, the group passes the screening.

[0020] According to a specific implementation of the embodiment of the present disclosure, the method further includes:

[0021] When all the groups fail to pass the screening, the user is notified that there is no available DA for creating the file system.

[0022] According to a specific implementation of the embodiment of the present disclosure, the method further includes:

[0023] When there are two or more groups that pass the screening, the DA with the largest remaining capacity is selected to create a virtual disk set.

[0024] In a second aspect, an embodiment of the present disclosure provides a GPFS storage file system creation scheduling system, the system comprising:

[0025] The proxy module is configured to group the DAs in the GPFS storage cluster based on preset rules and assign a capacity weight to each DA;

[0026] The scheduling module is configured to obtain the remaining available capacity of the GPFS storage cluster when receiving an order to create a file system; wherein, when the remaining available capacity is greater than or equal to the file system, filter the DA group that meets the requirements;

[0027] Creating a virtual disk set on each DA in the DA group that meets the requirements according to a preset capacity weight; and,

[0028] A file system is created based on the virtual disk set.

[0029] According to a specific implementation of the embodiment of the present disclosure, the system further includes:

[0030] The judgment module is configured to screen DA groups that meet the requirements when the remaining available capacity is greater than or equal to the file system, including:

[0031] The file system capacity is allocated according to the capacity weight of the DA in each group, and whether the capacity of the DA in each group is greater than or equal to the allocated file system capacity is checked one by one; when the capacity of each DA in the group is greater than or equal to the allocated file system capacity, the group passes the screening.

[0032] In a third aspect, an embodiment of the present disclosure further provides an electronic device, the electronic device comprising:

[0033] at least one processor; and,

[0034] a memory communicatively connected to the at least one processor; wherein,

[0035] The memory stores instructions that can be executed by the at least one processor, and when the instructions are executed by the at least one processor, the at least one processor creates a scheduling method for the GPFS storage file system as described in any one of the first aspect or any one of the implementations of the first aspect.

[0036] In a fourth aspect, an embodiment of the present disclosure further provides a computer program product, comprising a computer program stored on a non-transitory computer-readable storage medium, wherein the computer program comprises program instructions, and when the program instructions are executed by a computer, the computer executes the GPFS storage file system creation scheduling method in the aforementioned first aspect or any implementation of the first aspect.

[0037] The GPFS storage file system creation scheduling method in the disclosed embodiment solves the problem that manual confirmation of whether a GPFS storage cluster can create a file system is time-consuming and prone to omissions; the user only pays attention to a small number of necessary parameters when creating a file system, which solves the problem that some parameters need to be repeatedly configured, reducing the user's operation workload; and solves the problem that manual screening of available DAs in a GPFS storage cluster is time-consuming and prone to omissions. The purpose of the present invention is to provide a configuration-based scheduling algorithm to facilitate users to create file systems on multiple GPFS storage clusters, so that users can ignore many setting details and create a usable file system that meets the requirements. BRIEF DESCRIPTION OF THE DRAWINGS

[0038] The above is only an overview of the technical solution of the present invention. In order to more clearly understand the technical means of the present invention, the present invention is further described in detail below in conjunction with the accompanying drawings and specific implementation methods.

[0039] Figure 1 A schematic diagram of a GPFS storage file system creation scheduling method provided in an embodiment of the present disclosure;

[0040] Figure 2 A scheduling process timing diagram provided for an embodiment of the present disclosure;

[0041] Figure 3 A schematic diagram of the logical structure of a GPFS storage cluster file system provided in an embodiment of the present disclosure;

[0042] Figure 4 A schematic diagram of a GPFS storage file system creation scheduling system structure provided in an embodiment of the present disclosure;

[0043] Figure 5 A schematic diagram of an electronic device provided in an embodiment of the present disclosure. DETAILED DESCRIPTION

[0044] The embodiments of the present disclosure are described in detail below with reference to the accompanying drawings.

[0045] The following describes the embodiments of the present disclosure through specific examples, and those skilled in the art can easily understand other advantages and effects of the present disclosure from the contents disclosed in this specification. Obviously, the described embodiments are only a part of the embodiments of the present disclosure, rather than all of the embodiments. The present disclosure can also be implemented or applied through other different specific embodiments, and the details in this specification can also be modified or changed in various ways based on different viewpoints and applications without departing from the spirit of the present disclosure. It should be noted that the following embodiments and features in the embodiments can be combined with each other without conflict. Based on the embodiments in the present disclosure, all other embodiments obtained by ordinary technicians in the field without making creative work are within the scope of protection of the present disclosure.

[0046] It should be noted that various aspects of the embodiments within the scope of the appended claims are described below. It should be apparent that the aspects described herein may be embodied in a wide variety of forms, and any specific structure and / or function described herein is merely illustrative. Based on the present disclosure, it should be understood by those skilled in the art that an aspect described herein may be implemented independently of any other aspect, and two or more of these aspects may be combined in various ways. For example, any number of aspects described herein may be used to implement a device and / or practice a method. In addition, other structures and / or functionalities other than one or more of the aspects described herein may be used to implement this device and / or practice this method.

[0047] Additionally, in the following description, specific details are provided to facilitate a thorough understanding of the examples. However, it will be understood by those skilled in the art that the aspects described may be practiced without these specific details.

[0048] An embodiment of the present invention provides a GPFS storage file system creation scheduling method, which consists of two parts: one is a scheduling module deployed on a management platform, which completes the scheduling between multiple GPFS storage clusters; the other is an agent module deployed on each GPFS storage cluster, which provides interaction between the scheduling module and the GPFS management command set and scheduling between each DA in the cluster.

[0049] Since the scheduling algorithm of the present invention is based on configuration, it is first necessary to install the proxy module on all GPFS storage clusters in the environment; after the installation is complete, change the configuration file of the proxy module, and write the DA and DA grouping method required to be used in the cluster into the configuration file; after all configuration files are changed, use the scheduling module on the management platform to manage each GPFS storage cluster separately, so as to obtain the information required for the interaction between the scheduling module and the proxy module.

[0050] After completing the above steps, the user only needs to specify the file system name and required capacity on the management platform to create a usable file system. The scheduling module will first filter out all GPFS storage clusters with sufficient remaining capacity based on capacity information; then sort the filtered storage clusters by remaining capacity to select the storage cluster with the largest remaining capacity; then the scheduling module passes the file system name, required capacity and other data to the agent module via SSH, and the agent module filters the available DA groups based on the configuration file; finally, the DA group with the largest remaining capacity is selected as the DA to which each virtual disk set belongs.

[0051] The key technical points of the present invention are:

[0052] 1. The proxy module is installed on each GPFS storage cluster in the environment;

[0053] 2. In the configuration file of each proxy module, configure the DA that the GPFS storage cluster expects to use and the grouping method between DAs;

[0054] 3. The scheduling module manages each GPFS storage cluster.

[0055] Figure 1 A schematic diagram of the GPFS storage file system creation scheduling method process provided in an embodiment of the present disclosure.

[0056] Figure 2 For Figure 1 The corresponding GPFS storage file system creates a scheduling method timing diagram.

[0057] Figure 3 A schematic diagram of the logical structure of a GPFS storage cluster file system provided in an embodiment of the present disclosure.

[0058] like Figure 1 As shown, at step S110, DAs in the GPFS storage cluster are grouped based on preset rules, and a capacity weight is assigned to each DA.

[0059] In an embodiment of the present invention, the grouping of DAs in the GPFS storage cluster based on preset rules includes the following steps: dividing the GPFS storage cluster into a first group and a second group; wherein the first group contains 2 DAs, and the capacity weights are 1 and 2 respectively; the second group contains 2 DAs, and the capacity weights are 1 and 3 respectively.

[0060] More specifically, the process proceeds to step S120.

[0061] At step S120, when an order to create a file system is received, the remaining available capacity of the GPFS storage cluster is obtained; wherein, when the remaining available capacity is greater than or equal to the file system, DA groups that meet the requirements are screened.

[0062] In an embodiment of the present invention, the method further includes: when the remaining available capacity is less than the file system, notifying the user that no GPFS storage cluster can create the file system.

[0063] In the embodiment of the present invention, when the remaining available capacity is greater than or equal to the file system, screening the DA group that meets the requirements includes:

[0064] The file system capacity is allocated according to the capacity weight of the DA in each group, and whether the capacity of the DA in each group is greater than or equal to the allocated file system capacity is checked one by one; when the capacity of each DA in the group is greater than or equal to the allocated file system capacity, the group passes the screening.

[0065] In the embodiment of the present invention, the method further includes: when all the groups fail to pass the screening, notifying the user that there is no available DA for creating the file system.

[0066] Next, go to step S130.

[0067] In step S130 , a virtual disk set is created on each DA in the DA group that meets the requirements according to the preset capacity weight.

[0068] In the embodiment of the present invention, the method further includes: when the number of groups that pass the screening is greater than or equal to 2, selecting the DA with the largest remaining capacity to create a virtual disk set.

[0069] Next, go to step S140.

[0070] In step S140, a file system is created based on the virtual disk set.

[0071] More specifically, the present invention is described in detail below by way of examples.

[0072] Example 1:

[0073] Take the example of creating file system B on a single GPFS storage cluster A with four DAs:

[0074] 1) The proxy module has been installed on cluster A;

[0075] 2) In the configuration file, two of the DAs are configured as DA group F, and the capacity weights of the two DAs in group F are 1 and 2 respectively. The other two DAs are configured as DA group G, and the capacity weights of the two DAs in group G are 1 and 3.

[0076] 3) The user places an order on the management platform to create a 120G file system B;

[0077] 4) The scheduling module obtains the remaining available capacity of cluster A through the proxy module. If the remaining available capacity is greater than or equal to 120G, step 5) is executed. Otherwise, the user is notified that there is no GPFS storage cluster to create file system B.

[0078] 5) The scheduling module sends a command to the proxy module to create a 120G file system B;

[0079] 6) The proxy module checks whether the remaining available capacity of the DA with a capacity weight of 1 in group F is greater than or equal to 40G, and whether the remaining available capacity of the DA with a capacity weight of 2 is greater than or equal to 80G. If both are passed, group F passes the screening;

[0080] 7) The proxy module checks whether the remaining available capacity of the DA with a capacity weight of 1 in group G is greater than or equal to 30G, and whether the remaining available capacity of the DA with a capacity weight of 3 is greater than or equal to 90G. If both are passed, group G passes the screening;

[0081] 8) If both the groups in step 6) and step 7) fail to pass the screening, the user is notified that there is no available DA for creating file system B, otherwise, step 9) is executed;

[0082] 9) Select the group with the largest remaining available capacity from the groups that pass the screening, and create a virtual disk set on each DA in the group. For example, if group F has the largest remaining available capacity or only group F passes the screening, then create a 40G virtual disk set on the DA with a capacity weight of 1, and create an 80G virtual disk set on the DA with a capacity weight of 2. If group G has the largest remaining available capacity or only group G passes the screening, then the same applies;

[0083] 10) Create file system B using the two virtual disk sets created in step 9).

[0084] Example 2:

[0085] Take the creation of file system C on GPFS storage cluster A with two DAs and GPFS storage cluster B with two DAs as an example:

[0086] 1) The proxy module has been installed on cluster A and cluster B;

[0087] 2) In the agent module configuration file of cluster A, the two DAs are configured as DA group D and DA group E respectively, and in the agent module configuration file of cluster B, the two DAs are configured as DA group F and DA group G respectively;

[0088] 3) The user places an order on the management platform to create a 120G file system B;

[0089] 4) The scheduling module obtains the remaining available capacity of cluster A and cluster B through the proxy module. If there is no cluster with a remaining available capacity greater than or equal to 120G, the user is notified that there is no GPFS storage cluster to create file system C. Otherwise, step 5) is executed;

[0090] 5) The scheduling module sends a command to create a 120G file system C to the proxy module of the cluster with the largest remaining available capacity;

[0091] 6) The proxy module checks whether the remaining available capacity of the two DAs in the cluster is greater than or equal to 120G. If the remaining available capacity is less than 120G, the user is notified that there is no available DA for creating file system C. Otherwise, step 7 is executed;

[0092] 7) The proxy module checks whether the remaining available capacity of the DA with a capacity weight of 1 in group G is greater than or equal to 30G, and whether the remaining available capacity of the DA with a capacity weight of 3 is greater than or equal to 90G. If both are passed, group G passes the screening;

[0093] 8) The proxy module selects the DA with the largest remaining capacity to create a 120G virtual disk set;

[0094] 9) Create file system C using the virtual disk set created in step 8).

[0095] The GPFS storage file system creation scheduling method proposed in the present invention has the following advantages:

[0096] 1. Solved the problem of manual confirmation of whether the GPFS storage cluster can create a file system, which takes a long time and is prone to omissions;

[0097] 2. When creating a file system, users only need to pay attention to a small number of necessary parameters, which solves the problem of repeated configuration of some parameters and reduces the user's operation workload;

[0098] 3. Solved the problem of time-consuming and easy omissions in manually screening available DAs in GPFS storage clusters;

[0099] Figure 4 The GPFS storage file system creation scheduling system 400 provided by the present invention is shown, including an agent module 410 and a scheduling module 420.

[0100] The proxy module 410 is used to group the DAs in the GPFS storage cluster based on preset rules and assign a capacity weight to each DA;

[0101] The scheduling module 420 is used to obtain the remaining available capacity of the GPFS storage cluster when receiving an order to create a file system; wherein, when the remaining available capacity is greater than or equal to the file system, filter the DA group that meets the requirements;

[0102] Creating a virtual disk set on each DA in the DA group that meets the requirements according to a preset capacity weight; and,

[0103] A file system is created based on the virtual disk set.

[0104] In an embodiment of the present invention, the system also includes: a judgment module 4201 is used to screen DA groups that meet the requirements when the remaining available capacity is greater than or equal to the file system, including: allocating the file system capacity according to the capacity weight of the DA in each group, and checking one by one whether the capacity of the DA in each group is greater than or equal to the allocated file system capacity; wherein, when the capacity of each DA in the group is greater than or equal to the allocated file system capacity, the group passes the screening.

[0105] See also Figure 5 The present disclosure also provides an electronic device 50, which includes:

[0106] at least one processor; and,

[0107] a memory communicatively connected to the at least one processor; wherein,

[0108] The memory stores instructions that can be executed by the at least one processor, and the instructions are executed by the at least one processor so that the at least one processor can execute the GPFS storage file system creation scheduling method in the aforementioned method embodiment.

[0109] The embodiment of the present disclosure also provides a non-transitory computer-readable storage medium, which stores computer instructions, and the computer instructions are used to enable the computer to execute the GPFS storage file system creation scheduling method in the aforementioned method embodiment.

[0110] The embodiments of the present disclosure also provide a computer program product, which includes a computer program stored on a non-transitory computer-readable storage medium. The computer program includes program instructions, which, when executed by a computer, enable the computer to execute the GPFS storage file system creation scheduling method in the aforementioned method embodiment.

[0111] Reference below Figure 5 , which shows a schematic diagram of the structure of an electronic device 50 suitable for implementing the embodiment of the present disclosure. The electronic device in the embodiment of the present disclosure may include, but is not limited to, mobile terminals such as mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), vehicle-mounted terminals (such as vehicle-mounted navigation terminals), etc., and fixed terminals such as digital TVs, desktop computers, etc. Figure 5 The electronic device shown is only an example and should not bring any limitation to the functions and scope of use of the embodiments of the present disclosure.

[0112] like Figure 5 As shown, the electronic device 50 may include a processing device (e.g., a central processing unit, a graphics processing unit, etc.) 501, which can perform various appropriate actions and processes according to a program stored in a read-only memory (ROM) 502 or a program loaded from a storage device 508 into a random access memory (RAM) 503. In the RAM 503, various programs and data required for the operation of the electronic device 50 are also stored. The processing device 501, the ROM 502, and the RAM 503 are connected to each other via a bus 504. An input / output (I / O) interface 505 is also connected to the bus 504.

[0113] Typically, the following devices may be connected to the I / O interface 505: input devices 506 including, for example, a touch screen, a touchpad, a keyboard, a mouse, an image sensor, a microphone, an accelerometer, a gyroscope, etc.; output devices 507 including, for example, a liquid crystal display (LCD), a speaker, a vibrator, etc.; storage devices 508 including, for example, a magnetic tape, a hard disk, etc.; and communication devices 509. The communication device 509 may allow the electronic device 50 to communicate with other devices wirelessly or by wire to exchange data. Although the electronic device 50 with various devices is shown in the figure, it should be understood that it is not required to implement or have all the devices shown. More or fewer devices may be implemented or have alternatively.

[0114] In particular, according to an embodiment of the present disclosure, the process described above with reference to the flowchart can be implemented as a computer software program. For example, an embodiment of the present disclosure includes a computer program product, which includes a computer program carried on a computer-readable medium, and the computer program contains program code for executing the method shown in the flowchart. In such an embodiment, the computer program can be downloaded and installed from a network through a communication device 509, or installed from a storage device 508, or installed from a ROM 502. When the computer program is executed by the processing device 501, the above-mentioned functions defined in the method of the embodiment of the present disclosure are executed.

[0115] It should be noted that the computer-readable medium disclosed above may be a computer-readable signal medium or a computer-readable storage medium or any combination of the above two. The computer-readable storage medium may be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, device or device, or any combination of the above. More specific examples of computer-readable storage media may include, but are not limited to: an electrical connection with one or more wires, a portable computer disk, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disk read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the above. In the present disclosure, a computer-readable storage medium may be any tangible medium containing or storing a program that may be used by or in combination with an instruction execution system, device or device. In the present disclosure, a computer-readable signal medium may include a data signal propagated in a baseband or as part of a carrier wave, in which a computer-readable program code is carried. This propagated data signal may take a variety of forms, including but not limited to an electromagnetic signal, an optical signal, or any suitable combination of the above. The computer readable signal medium may also be any computer readable medium other than a computer readable storage medium, which may send, propagate or transmit a program for use by or in conjunction with an instruction execution system, apparatus or device. The program code contained on the computer readable medium may be transmitted using any suitable medium, including but not limited to: wires, optical cables, RF (radio frequency), etc., or any suitable combination of the above.

[0116] The computer-readable medium may be included in the electronic device, or may exist independently without being incorporated into the electronic device.

[0117] The computer-readable medium carries one or more programs. When the one or more programs are executed by the electronic device, the electronic device: obtains at least two Internet Protocol addresses; sends a node evaluation request including the at least two Internet Protocol addresses to a node evaluation device, wherein the node evaluation device selects an Internet Protocol address from the at least two Internet Protocol addresses and returns it; receives the Internet Protocol address returned by the node evaluation device; wherein the obtained Internet Protocol address indicates an edge node in a content distribution network.

[0118] Alternatively, the computer-readable medium carries one or more programs, and when the one or more programs are executed by the electronic device, the electronic device: receives a node evaluation request including at least two Internet Protocol addresses; selects an Internet Protocol address from the at least two Internet Protocol addresses; and returns the selected Internet Protocol address; wherein the received Internet Protocol address indicates an edge node in a content distribution network.

[0119] Computer program code for performing the operations of the present disclosure may be written in one or more programming languages, or a combination thereof, including object-oriented programming languages, such as Java, Smalltalk, C++, and conventional procedural programming languages, such as "C" or similar programming languages. The program code may be executed entirely on the user's computer, partially on the user's computer, as a separate software package, partially on the user's computer and partially on a remote computer, or entirely on a remote computer or server. In cases involving a remote computer, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (e.g., through the Internet using an Internet service provider).

[0120] The flow chart and block diagram in the accompanying drawings illustrate the possible architecture, function and operation of the system, method and computer program product according to various embodiments of the present disclosure. In this regard, each square box in the flow chart or block diagram can represent a module, a program segment or a part of a code, and the module, the program segment or a part of the code contains one or more executable instructions for realizing the specified logical function. It should also be noted that in some implementations as replacements, the functions marked in the square box can also occur in a sequence different from that marked in the accompanying drawings. For example, two square boxes represented in succession can actually be executed substantially in parallel, and they can sometimes be executed in the opposite order, depending on the functions involved. It should also be noted that each square box in the block diagram and / or flow chart, and the combination of the square boxes in the block diagram and / or flow chart can be implemented with a dedicated hardware-based system that performs a specified function or operation, or can be implemented with a combination of dedicated hardware and computer instructions.

[0121] The units involved in the embodiments described in the present disclosure may be implemented by software or hardware. The name of a unit does not limit the unit itself in some cases. For example, the first acquisition unit may also be described as a "unit for acquiring at least two Internet Protocol addresses".

[0122] It should be understood that various parts of the present disclosure may be implemented in hardware, software, firmware, or a combination thereof.

[0123] The above is only a specific implementation of the present disclosure, but the protection scope of the present disclosure is not limited thereto. Any changes or substitutions that can be easily thought of by a person skilled in the art within the technical scope disclosed in the present disclosure should be included in the protection scope of the present disclosure. Therefore, the protection scope of the present disclosure should be based on the protection scope of the claims.

Claims

1. A GPFS storage file system creation scheduling method, characterized in that: The method comprises the following steps: The DAs in the GPFS storage cluster are grouped based on preset rules, and capacity weights are assigned to each DA. When receiving an order to create a file system, the remaining available capacity of the GPFS storage cluster is obtained; when the remaining available capacity is greater than or equal to the file system, the DA group that meets the requirements is selected; Create a virtual disk set on each DA in the DA group that meets the requirements according to the preset capacity weight; A file system is created based on the virtual disk set.

2. The GPFS storage file system creation scheduling method according to claim 1, characterized in that: The method of grouping DAs in the GPFS storage cluster based on a preset rule includes the following steps: The GPFS storage cluster is divided into a first group and a second group; wherein the first group includes 2 DAs, and the capacity weights are 1 and 2 respectively; the second group includes 2 DAs, and the capacity weights are 1 and 3 respectively.

3. The GPFS storage file system creation scheduling method according to claim 1, characterized in that: The method further comprises: When the remaining available capacity is less than the file system, the user is notified that no GPFS storage cluster is available to create the file system.

4. The GPFS storage file system creation scheduling method according to claim 1, characterized in that: When the remaining available capacity is greater than or equal to the file system, filter the DA groups that meet the requirements, including: The file system capacity is allocated according to the capacity weight of the DA in each group, and whether the capacity of the DA in each group is greater than or equal to the allocated file system capacity is checked one by one; when the capacity of each DA in the group is greater than or equal to the allocated file system capacity, the group passes the screening.

5. The GPFS storage file system creation scheduling method according to claim 4, characterized in that: The method further comprises: When all the groups fail to pass the screening, the user is notified that there is no available DA for creating the file system.

6. The GPFS storage file system creation scheduling method according to claim 4, characterized in that: The method further comprises: When there are two or more groups that pass the screening, the DA with the largest remaining capacity is selected to create a virtual disk set.

7. A GPFS storage file system creation scheduling system, characterized in that: The system comprises: The proxy module is configured to group the DAs in the GPFS storage cluster based on preset rules and assign a capacity weight to each DA; The scheduling module is configured to obtain the remaining available capacity of the GPFS storage cluster when receiving an order to create a file system; wherein, when the remaining available capacity is greater than or equal to the file system, filter the DA group that meets the requirements; Creating a virtual disk set on each DA in the DA group that meets the requirements according to a preset capacity weight; and, A file system is created based on the virtual disk set.

8. The GPFS storage file system creation scheduling system according to claim 7, characterized in that: The system further comprises: The judgment module is configured to screen DA groups that meet the requirements when the remaining available capacity is greater than or equal to the file system, including: The file system capacity is allocated according to the capacity weight of the DA in each group, and whether the capacity of the DA in each group is greater than or equal to the allocated file system capacity is checked one by one; when the capacity of each DA in the group is greater than or equal to the allocated file system capacity, the group passes the screening.

9. An electronic device, characterized in that: The electronic device includes: at least one processor; and, a memory communicatively connected to the at least one processor; wherein, The memory stores instructions that can be executed by the at least one processor, and when the instructions are executed by the at least one processor, the at least one processor executes the GPFS storage file system creation scheduling method as described in any one of claims 1 to 6.

10. A computer program product, characterized in that The computer program product includes a computer program stored on a non-transitory computer-readable storage medium, and the computer program includes program instructions. When the program instructions are executed by a computer, the computer executes the GPFS storage file system creation scheduling method as described in any one of claims 1 to 6.

Images