Volume unloading method, device and electronic device

Abstract

The embodiments of this specification disclose a volume unloading method, device and electronic device. The method includes: obtaining multiple volume identifiers, the volume identifiers are used to identify the volumes to be unloaded, and the volumes to be unloaded are mounted on a bare metal server; traversing the multiple volume identifiers; for each traversed volume identifier, performing a volume unloading operation according to the volume identifier, and determining whether the volume to be unloaded corresponding to the volume identifier is the last volume of the target bare metal server, and if so, adding the volume identifier to a queue; wherein the volume to be unloaded corresponding to the volume identifier is mounted on the target bare metal server; sending an information deletion request to the switch, the information deletion request includes the volume identifier in the queue, and is used to instruct the switch to delete the partition information corresponding to each volume identifier in the queue. The embodiments of this specification can improve the efficiency of volume unloading.

Description

Technical Field

[0001] The embodiments of the present specification relate to the field of computer technology, and in particular to a volume unloading method, device and electronic device. Background Art

[0002] Storage Area Network (SAN) has been widely used by combining hardware storage technology and network technology to solve the growing data storage and management problems. The storage area network may include a host, a switch and multiple bare metal servers. The host communicates with the bare metal server through the switch. The switch has a partitioning function (zone function). The partitioning function can logically divide the devices in the storage area network (such as bare metal servers) into different partitions. So that devices in the same partition can directly access each other, and devices in different partitions cannot directly access each other. The switch can store partition information.

[0003] The volume in the host is mounted on the bare metal server. In the related art, when the last volume of each bare metal server is unloaded, an information deletion request can be sent to the switch to instruct the switch to delete the partition information corresponding to the volume. In this way, when the last volume of multiple bare metal servers is unloaded, multiple information deletion requests need to be sent to the switch, which affects the efficiency of unloading the volume. Summary of the invention

[0004] The embodiments of the present specification provide a volume unloading method, device and electronic device to improve the volume unloading efficiency.

[0005] A first aspect of an embodiment of the present specification provides a volume unloading method, including:

[0006] Acquire multiple volume identifiers, where the volume identifiers are used to identify volumes to be unmounted, and the volumes to be unmounted are mounted on a bare metal server;

[0007] Traversing the multiple volume identifiers; for each traversed volume identifier, performing a volume unloading operation according to the volume identifier, and determining whether the volume to be unloaded corresponding to the volume identifier is the last volume of the target bare metal server, and if so, adding the volume identifier to a queue; wherein the volume to be unloaded corresponding to the volume identifier is mounted on the target bare metal server;

[0008] An information deletion request is sent to the switch, wherein the information deletion request includes the volume identifiers in the queue and is used to instruct the switch to delete the partition information corresponding to each volume identifier in the queue.

[0009] A second aspect of the embodiments of this specification provides a volume unloading device, including:

[0010] An acquisition unit, used for acquiring a plurality of volume identifiers, where the volume identifiers are used for identifying volumes to be unmounted, and the volumes to be unmounted are mounted on a bare metal server;

[0011] A traversal unit, used for traversing the multiple volume identifiers; for each traversed volume identifier, performing a volume unloading operation according to the volume identifier, and determining whether the volume to be unloaded corresponding to the volume identifier is the last volume of the target bare metal server, and if so, adding the volume identifier to a queue; wherein the volume to be unloaded corresponding to the volume identifier is mounted on the target bare metal server;

[0012] The sending unit is used to send an information deletion request to the switch, wherein the information deletion request includes the volume identifier in the queue and is used to instruct the switch to delete the partition information corresponding to each volume identifier in the queue.

[0013] According to a third aspect of the embodiments of this specification, an electronic device is provided, including:

[0014] at least one processor;

[0015] A memory storing program instructions, wherein the program instructions are configured to be suitable for being executed by the at least one processor, and the program instructions include instructions for executing the method as described in the first aspect.

[0016] The technical solution provided in the embodiments of this specification can collect multiple volume identifiers related to partition information deletion and send them to the switch for partition information deletion processing, thereby reducing the processing pressure of the switch and improving the efficiency of unloading volumes. BRIEF DESCRIPTION OF THE DRAWINGS

[0017] In order to more clearly illustrate the embodiments of this specification or the technical solutions in the prior art, the drawings required for use in the embodiments or the description of the prior art will be briefly introduced below. The drawings described below are only some embodiments recorded in this specification. For ordinary technicians in this field, other drawings can be obtained based on these drawings without paying creative labor.

[0018] Figure 1 This is a flow chart of a volume unloading method in an embodiment of this specification;

[0019] Figure 2 This is a schematic diagram of the structure of a roll unloading device in an embodiment of this specification;

[0020] Figure 3 It is a schematic diagram of the structure of an electronic device in an embodiment of this specification. DETAILED DESCRIPTION

[0021] The following will be combined with the drawings in the embodiments of this specification to clearly and completely describe the technical solutions in the embodiments of this specification. Obviously, the described embodiments are only part of the embodiments of this specification, not all of the embodiments. Based on the embodiments in this specification, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of this specification.

[0022] In the above-mentioned related technologies, for example, when it is necessary to uninstall bare metal server A, uninstall bare metal server B, and uninstall the last volume of bare metal server C, an information deletion request R1 can be sent to the switch to instruct the switch to delete the partition information corresponding to the last volume in bare metal server A; after the deletion is successful, an information deletion request R2 can be sent to the switch to instruct the switch to delete the partition information corresponding to the last volume in bare metal server B; after the deletion is successful, an information deletion request R3 can be sent to the switch to instruct the switch to delete the partition information corresponding to the last volume in bare metal server C. Since each information deletion request is only used to delete the partition information of one volume, the efficiency of unloading the volume is not high.

[0023] The embodiment of the present specification provides a storage area network (SAN). The storage area network may include a host, a switch, a plurality of bare metal servers, and a management platform. The host may include a centralized storage device or a business device. The switch has a partitioning function (zone function). The partitioning function may logically divide the devices (such as bare metal servers) in the storage area network into different partitions. So that the devices in the same partition can directly access each other, and the devices in different partitions cannot directly access each other. The switch may store partition information. The switch may store partition information (zone information) related to the partition. The switch may include a fiber switch. The bare metal server (Bare Metal Server, BMS) is a server without an operating system installed, which can provide exclusive services to tenants and has excellent computing performance. The bare metal server can be used to provide storage services, etc. In order to facilitate the management of storage space, the storage space in the bare metal server can be logically divided into one or more (Volumes). Through the switch, the host can operate the data in the volume. The management platform may be a desktop, a laptop, a server or a server cluster. The management platform can communicate with the host and the switch. The management platform can be used to manage volumes in the bare metal server (e.g., mounting volumes, unmounting volumes, etc.). Specifically, cloud computing management software can be installed in the management platform. For example, the cloud computing management software can include OpenStack software, etc. Using the cloud computing management software, the management platform can manage volumes in the bare metal server. For example, using the cinder component in the OpenStack software, the management platform can manage volumes in the bare metal server.

[0024] The embodiment of the present specification provides a volume unloading method, which can be applied to a management platform.

[0025] See also Figure 1 The volume unloading method may include the following steps.

[0026] Step S11: Acquire multiple volume identifiers, where the volume identifiers are used to identify volumes to be unmounted, and the volumes to be unmounted are mounted on a bare metal server.

[0027] In some embodiments, a volume identification data table may be provided on the management platform. The volume identification data table may be used to store volume identifications of volumes to be unloaded. Specifically, the volume identification data table may include multiple batches of volume identifications. Each batch of volume identifications may include volume identifications of multiple volumes to be unloaded, and the volumes to be unloaded may be mounted on a bare metal server. The volumes to be unloaded corresponding to each volume identification in each batch of volume identifications may be mounted on the same or different bare metal servers.

[0028] The multiple batches of volume identifiers in the volume identifier data table may correspond to multiple different time periods. In practice, the volume identifiers of the volumes to be unmounted may be obtained; and the volume identifiers obtained within the same time period may be used as a batch of volume identifiers in the volume identifier data table. For example, a volume identifier input by a user may be received. Alternatively, a volume identifier list may be provided, and the volume identifier list may include the volume identifiers of the volumes mounted on each bare metal server in the storage area network, and a volume identifier may be selected from the volume identifier list. For example, the volume identifiers obtained in the morning may be used as a batch of volume identifiers in the volume identifier data table; and the volume identifiers obtained in the afternoon may be used as another batch of volume identifiers in the volume identifier data table.

[0029] In some embodiments, a batch of volume identifications may be read from a volume identification data table.

[0030] Step S13: traverse the multiple volume identifiers; for each traversed volume identifier, perform a volume unloading operation according to the volume identifier, and determine whether the volume to be unloaded corresponding to the volume identifier is the last volume of the target bare metal server. If so, add the volume identifier to the queue; wherein the volume to be unloaded corresponding to the volume identifier is mounted on the target bare metal server.

[0031] In some embodiments, each volume identification in the batch of volume identifications read may be iterated through.

[0032] In some embodiments, for each volume identifier traversed, a volume unloading operation may be performed according to the volume identifier to unload the volume to be unloaded corresponding to the volume identifier. For each volume identifier traversed, it may also be determined whether the volume to be unloaded corresponding to the volume identifier is the last volume of the target bare metal server; if so, the volume identifier may be added to a queue; if not, no action may be performed. The queue may include at least one volume identifier. In the queue, the volume to be unloaded corresponding to the volume identifier is the last volume of the bare metal server.

[0033] Specifically, the number of volumes of the target bare metal server can be queried; based on the number of volumes, it can be determined whether the volume to be unloaded corresponding to the volume identifier is the last volume of the target bare metal server. If the number of volumes is equal to 1, it can be determined that the volume to be unloaded corresponding to the volume identifier is the last volume of the target bare metal server. If the number of volumes is greater than 1, it can be determined that the volume to be unloaded corresponding to the volume identifier is not the last volume of the target bare metal server.

[0034] Step S15: Sending an information deletion request to the switch, wherein the information deletion request includes the volume identifiers in the queue, and is used to instruct the switch to delete the partition information corresponding to each volume identifier in the queue.

[0035] In some embodiments, after the traversal is completed, an information deletion request may be sent to the switch, and the information deletion request may include the volume identifier in the queue. The switch may receive the information deletion request; and may delete the partition information (zone information) corresponding to each volume identifier in the queue. The partition information corresponding to the volume identifier may include the partition information of the bare metal server where the volume to be uninstalled corresponding to the volume identifier is located. In this way, the bare metal server can be recycled.

[0036] In some embodiments, after sending the information deletion request to the switch, the steps of reading a batch of volume identifiers from the volume identifier data table, traversing the volume identifiers, and sending the information deletion request to the switch can be continued until the multiple batches of volume identifiers in the volume identifier data table are read. In this way, all volume identifiers involved in partition information deletion within a certain period of time can be collected together and sent to the switch in stages for partition information deletion processing, thereby reducing the processing pressure of the switch and improving the efficiency of unloading volumes.

[0037] The volume unloading method of the embodiment of this specification can obtain multiple volume identifiers, the volume identifiers are used to identify the volumes to be unloaded, and the volumes to be unloaded are mounted on the bare metal server; the multiple volume identifiers can be traversed; for each traversed volume identifier, the volume unloading operation is performed according to the volume identifier, and it is determined whether the volume to be unloaded corresponding to the volume identifier is the last volume of the target bare metal server. If so, the volume identifier is added to the queue; wherein the volume to be unloaded corresponding to the volume identifier is mounted on the target bare metal server; an information deletion request can be sent to the switch, and the information deletion request includes the volume identifier in the queue, which is used to instruct the switch to delete the partition information corresponding to each volume identifier in the queue. In this way, multiple volume identifiers involving partition information deletion can be collected together and sent to the switch for partition information deletion processing, thereby reducing the processing pressure of the switch and improving the efficiency of volume unloading.

[0038] This specification embodiment provides a volume unloading device. Figure 2The volume unloading device may include the following units.

[0039] An acquisition unit 21 is used to acquire multiple volume identifiers, where the volume identifiers are used to identify volumes to be unmounted, and the volumes to be unmounted are mounted on a bare metal server;

[0040] The traversal unit 23 is used to traverse the multiple volume identifiers; for each traversed volume identifier, perform a volume unloading operation according to the volume identifier, and determine whether the volume to be unloaded corresponding to the volume identifier is the last volume of the target bare metal server, and if so, add the volume identifier to the queue; wherein the target bare metal server is mounted with the volume to be unloaded corresponding to the volume identifier;

[0041] The sending unit 25 is used to send an information deletion request to the switch, wherein the information deletion request includes the volume identifiers in the queue and is used to instruct the switch to delete the partition information corresponding to each volume identifier in the queue.

[0042] See also Figure 3 The embodiments of this specification also provide an electronic device.

[0043] The electronic device may include a memory and a processor.

[0044] In this embodiment, the memory includes but is not limited to dynamic random access memory (DRAM) and static random access memory (SRAM), etc. The memory can be used to store computer instructions.

[0045] In this embodiment, the processor may be implemented in any suitable manner. For example, the processor may take the form of a microprocessor or processor and a computer-readable medium storing computer-readable program code (such as software or firmware) executable by the (micro)processor, a logic gate, a switch, an application specific integrated circuit (ASIC), a programmable logic controller, and an embedded microcontroller, etc. The processor may be used to execute the computer instructions to implement Figure 1 The corresponding embodiment.

[0046] It should be noted that each embodiment in this specification is described in a progressive manner, and the same or similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for device embodiments and electronic device embodiments, since they are basically similar to method embodiments, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment. In addition, it is understandable that after reading this specification document, those skilled in the art can think of any combination of some or all of the embodiments listed in this specification without creative work, and these combinations are also within the scope of disclosure and protection of this specification.

[0047] In the 1990s, improvements to a technology could be clearly distinguished as hardware improvements (for example, improvements to the circuit structure of diodes, transistors, switches, etc.) or software improvements (improvements to the method flow). However, with the development of technology, many improvements to the method flow today can be regarded as direct improvements to the hardware circuit structure. Designers almost always obtain the corresponding hardware circuit structure by programming the improved method flow into the hardware circuit. Therefore, it cannot be said that an improvement in a method flow cannot be implemented using a hardware entity module. For example, a programmable logic device (PLD) (such as a field programmable gate array (FPGA)) is such an integrated circuit whose logical function is determined by the user's programming of the device. Designers can "integrate" a digital system on a PLD by programming it themselves, without having to ask a chip manufacturer to design and produce a dedicated integrated circuit chip. Moreover, nowadays, instead of manually making integrated circuit chips, this kind of programming is mostly implemented by "logic compiler" software, which is similar to the software compiler used when developing and writing programs, and the original code before compilation must also be written in a specific programming language, which is called hardware description language (HDL). There is not only one HDL, but many kinds, such as ABEL (Advanced Boolean Expression Language), AHDL (Altera Hardware Description Language), Confluence, CUPL (Cornell University Programming Language), HDCal, JHDL (Java Hardware Description Language), Lava, Lola, MyHDL, PALASM, RHDL (Ruby Hardware Description Language), etc. The most commonly used ones are VHDL (Very-High-Speed ​​Integrated Circuit Hardware Description Language) and Verilog. Those skilled in the art should also know that it is only necessary to program the method flow slightly in the above-mentioned hardware description languages ​​and program it into the integrated circuit, and then it is easy to obtain the hardware circuit that implements the logic method flow.

[0048] The systems, devices, modules or units described in the above embodiments may be implemented by computer chips or entities, or by products with certain functions. A typical implementation device is a computer. Specifically, the computer may be, for example, a personal computer, a laptop computer, a cellular phone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.

[0049] It can be known from the above description of the implementation mode that the technicians in this field can clearly understand that the present specification can be implemented by means of software plus the necessary general hardware platform. Based on such an understanding, the technical solution of the present specification can be essentially or the part that contributes to the prior art can be embodied in the form of a software product, which can be stored in a storage medium, such as ROM / RAM, a disk, an optical disk, etc., including a number of instructions for a computer device (which can be a personal computer, a server, or a network device, etc.) to execute the methods described in each embodiment of the present specification or some parts of the embodiments.

[0050] This specification can be used in many general or special computer system environments or configurations, such as personal computers, server computers, handheld or portable devices, tablet devices, multiprocessor systems, microprocessor-based systems, set-top boxes, programmable consumer electronic devices, network PCs, minicomputers, mainframe computers, and distributed computing environments that include any of the above systems or devices.

[0051] This specification may be described in the general context of computer-executable instructions executed by a computer, such as program modules. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform specific tasks or implement specific abstract data types. This specification may also be practiced in distributed computing environments where tasks are performed by remote processing devices connected through a communication network. In a distributed computing environment, program modules may be located in local and remote computer storage media, including storage devices.

[0052] Although the present specification is described through embodiments, those skilled in the art will appreciate that there are many modifications and changes to the present specification without departing from the spirit of the present specification, and it is intended that the appended claims include these modifications and changes without departing from the spirit of the present specification.

Claims

1. A volume unloading method, comprising: Acquire multiple volume identifiers, where the volume identifiers are used to identify volumes to be unloaded, and the volumes to be unloaded are mounted on a bare metal server; wherein acquiring multiple volume identifiers includes: reading a batch of volume identifiers from a volume identifier data table, where the volume identifier data table includes multiple batches of volume identifiers, each batch of volume identifiers includes volume identifiers of multiple volumes to be unloaded, and the multiple batches of volume identifiers included in the volume identifier data table are mounted on different bare metal servers; Traversing the multiple volume identifiers; for each traversed volume identifier, performing a volume unloading operation according to the volume identifier, and determining whether the volume to be unloaded corresponding to the volume identifier is the last volume of the target bare metal server, and if so, adding the volume identifier to a queue; wherein the target bare metal server is mounted with the volume to be unloaded corresponding to the volume identifier; traversing the multiple volume identifiers includes: traversing each volume identifier in a batch of volume identifiers read; An information deletion request is sent to the switch, wherein the information deletion request includes the volume identifiers in the queue and is used to instruct the switch to delete the partition information corresponding to each volume identifier in the queue.

2. The method according to claim 1, after sending the information deletion request to the switch, the method further comprises: The steps of reading a batch of volume identifiers from the volume identifier data table, traversing the volume identifiers, and sending an information deletion request to the switch are continued until the multiple batches of volume identifiers in the volume identifier data table are read.

3. The method according to claim 1, wherein the multiple batches of volume identifiers correspond to multiple different time periods.

4. The method according to claim 1, wherein determining whether the to-be-unmounted volume corresponding to the volume identifier is the last volume of the target bare metal server comprises: Query the volume quantity of the target bare metal server; According to the volume quantity, it is determined whether the to-be-unmounted volume corresponding to the volume identifier is the last volume of the target bare metal server.

5. The method according to claim 4, wherein the step of determining whether the to-be-unmounted volume corresponding to the volume identifier is the last volume of the target bare metal server comprises: If the volume quantity is equal to 1, it is determined that the to-be-unmounted volume corresponding to the volume identifier is the last volume of the target bare metal server.

6. The method according to claim 4, wherein the step of determining whether the to-be-unmounted volume corresponding to the volume identifier is the last volume of the target bare metal server comprises: If the volume quantity is greater than 1, it is determined that the to-be-unmounted volume corresponding to the volume identifier is not the last volume of the target bare metal server.

7. The method according to claim 1, wherein in the queue, the volume to be uninstalled corresponding to the volume identifier is the last volume of the bare metal server.

8. A volume unloading device, comprising: An acquisition unit is used to acquire multiple volume identifiers, where the volume identifiers are used to identify volumes to be unloaded, and the volumes to be unloaded are mounted on a bare metal server; wherein acquiring multiple volume identifiers includes: reading a batch of volume identifiers from a volume identifier data table, where the volume identifier data table includes multiple batches of volume identifiers, each batch of volume identifiers includes volume identifiers of multiple volumes to be unloaded, and the multiple batches of volume identifiers included in the volume identifier data table are mounted on different bare metal servers; A traversal unit is used to traverse the multiple volume identifiers; for each traversed volume identifier, perform a volume unloading operation according to the volume identifier, and determine whether the volume to be unloaded corresponding to the volume identifier is the last volume of the target bare metal server, and if so, add the volume identifier to a queue; wherein the target bare metal server is mounted with the volume to be unloaded corresponding to the volume identifier; the traversing the multiple volume identifiers includes: traversing each volume identifier in a batch of volume identifiers read; The sending unit is used to send an information deletion request to the switch, wherein the information deletion request includes the volume identifier in the queue and is used to instruct the switch to delete the partition information corresponding to each volume identifier in the queue.

9. An electronic device, comprising: at least one processor; A memory storing program instructions, wherein the program instructions are configured to be executed by the at least one processor, and the program instructions include instructions for executing the method according to any one of claims 1 to 7.

Images