A logical volume access method, device, equipment and medium
Patent Information
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- CHINA TELECOM DIGITAL INTELLIGENCE TECH CO LTD
- Filing Date
- 2022-10-25
- Publication Date
- 2026-06-26
Smart Images

Figure CN116048382B_ABST
Abstract
Description
Technical Field
[0001] This application relates to the field of cloud computing storage, and in particular to a logical volume access method, apparatus, device, and medium. Background Technology
[0002] A physical volume (PV) is an actual physical hard drive or partition. Multiple physical volumes are combined to form a volume group (VG). Physical volumes within the same volume group can be different partitions of the same hard drive or different partitions on different hard drives. Generally, a volume group can be thought of as a single logical hard drive. A volume group can be a single logical hard drive, and this drive must be partitioned before it can be used; this "partition" is usually called a logical volume (LV). Logical volumes can be formatted and have data written to them.
[0003] In existing technologies, cluster logical volume activation and deactivation are as follows: Activation is mainly used to obtain relevant attribute information of the logical volume, such as metadata, capacity, and base information; deactivation is performed after use to indicate that the task has been completed and no further tasks are using the logical volume, allowing for deactivation operations. Multiple application programs on the same host may perform concurrent activation or deactivation operations, causing some applications to encounter errors when using the logical volume. Summary of the Invention
[0004] In view of this, this application proposes a logical volume access method, apparatus, device, and medium. The logical volume access method proposed in this application solves the problem of activation and deactivation operations of the same logical volume in a concurrent multi-task scenario at the application layer on a host. It enables secure access to shared logical volumes among multiple tasks, so that no errors or exceptions occur when concurrent tasks use logical volume information, thereby ensuring the smooth operation of concurrent tasks at the upper layer.
[0005] In typical scenarios, such as telecom cloud scenarios, the concurrent use management of LVM logical volumes in virtualization platforms improves the efficiency of virtualization management. It provides another new method to solve the problem of concurrent tasks accessing shared logical volumes, improves the efficiency of virtualization storage logical volume management, and overcomes logical volume access error messages caused by multi-task concurrency.
[0006] To achieve the above objectives, one aspect of this application provides a logical volume access method applied at the application layer, comprising: calling a target logical volume activation interface of a daemon process; executing a target logical volume access task after the target logical volume activation interface returns; and calling a target logical volume deactivation interface of the daemon process.
[0007] Furthermore, the daemon process is used to receive the target logical volume activation request from the application layer, and to determine whether the target logical volume is activated by the counting lock of the target logical volume. If not, the target logical volume is activated and the reference count of the target logical volume is set to 1; if so, the reference count of the target logical volume is incremented by 1.
[0008] Furthermore, the daemon process is used to receive the target logical volume deactivation request from the application layer, decrement the reference count of the target logical volume by 1, and determine whether the reference count of the target logical volume is 0. If so, the target logical volume is deactivated.
[0009] Furthermore, the counting lock is a globally unique memory lock and / or a file lock.
[0010] Furthermore, the application layer communicates with the daemon process via pipe or socket.
[0011] Furthermore, the daemon process responds to only one access request from the application layer at a time.
[0012] Furthermore, the daemon process has a logging module and an error handling module. The logging module is used to record task execution logs, and the error handling module is used to exit task execution.
[0013] For the same purpose, a second aspect of this application also provides a logical volume access device, characterized in that it includes: an application module and a guardian module;
[0014] The application module is configured to call the target logical volume activation interface of the daemon module.
[0015] After the target logical volume activation interface returns, the target logical volume access task is executed.
[0016] Call the target logical volume deactivation interface of the daemon module;
[0017] The guardian module is configured to receive a target logical volume activation request from the application layer, determine whether the target logical volume is activated by using the target logical volume's reference lock, and if not, activate the target logical volume and set its reference count to 1; if yes, increment the target logical volume's reference count by 1, and / or receive a target logical volume deactivation request from the application layer, decrement the target logical volume's reference count by 1, and determine whether the target logical volume's reference count is 0; if yes, deactivate the target logical volume.
[0018] For the same purpose, a third aspect of this application also provides a computer device, comprising:
[0019] At least one processor; and a memory storing computer instructions executable on the processor, which, when executed by the processor, implement the steps of the method described above.
[0020] For the same purpose, a fourth aspect of this application also provides a computer-readable storage medium storing a computer program that, when executed by a processor, implements the steps of the above-described method.
[0021] This application has at least the following beneficial effects: This application proposes a logical volume access method, apparatus, device, and medium, applied at the application layer, comprising: calling a target logical volume activation interface of a daemon process; after the target logical volume activation interface returns, executing the target logical volume access task; calling a target logical volume deactivation interface of a daemon process, wherein the daemon process is used to receive a target logical volume activation request from the application layer, determine whether the target logical volume is activated through the target logical volume's reference lock, if not, activate the target logical volume and set the reference count of the target logical volume to 1; if yes, increment the reference count of the target logical volume by 1; the daemon process is used to receive a target logical volume deactivation request from the application layer, decrement the reference count of the target logical volume by 1, and determine whether the reference count of the target logical volume is 0, if yes, deactivate the target logical volume. The method proposed in this application enables the upper application layer to perform concurrent multi-task operations and processing, greatly improving the concurrency of upper application tasks and increasing task processing efficiency. It also solves the error scenarios during task execution, improves the management efficiency of upper-layer applications such as virtualization and the continuous stability of business, and significantly improves performance by storing reference counts in memory. Attached Figure Description
[0022] To more clearly illustrate the technical solutions in the embodiments of this application or the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings described below are only some embodiments of this application. For those skilled in the art, other embodiments can be obtained based on these drawings without creative effort.
[0023] Figure 1 This is a schematic diagram of an embodiment of a logical volume access method in the prior art;
[0024] Figure 2 This is a flowchart of a logical volume access method in some embodiments of this application;
[0025] Figure 3 This is a schematic diagram of a logical volume access device in some embodiments of this application;
[0026] Figure 4This is a schematic diagram of an embodiment of a computer device according to some embodiments of this application;
[0027] Figure 5 This is a schematic diagram of a computer-readable storage medium in some embodiments of this application. Detailed Implementation
[0028] The following describes embodiments of this application. However, it should be understood that the disclosed embodiments are merely examples, and other embodiments may take various alternative forms.
[0029] Furthermore, it should be noted that all uses of the terms "first" and "second" in the embodiments of this application are for the purpose of distinguishing two entities or parameters with the same name but different names. Therefore, "first" and "second" are merely for convenience of expression and should not be construed as limitations on the embodiments of this application. Subsequent embodiments will not elaborate on this point further. The terms "comprising," "including," or any other variations thereof are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements may include not only those elements but also elements not expressly listed or inherent to those processes, methods, articles, or apparatuses.
[0030] One or more embodiments of this application will now be described with reference to the accompanying drawings.
[0031] Figure 1 This is a schematic diagram of an embodiment of a logical volume access method in the prior art.
[0032] like Figure 1 As shown, when task A executes, it first needs to obtain access permissions to the target logical volume, i.e., activate the target logical volume, and then perform the access operation. At the same time, task B also needs to obtain access permissions to the target logical volume and perform its access operation. After task A completes its access operation to the target logical volume, it needs to deactivate the target logical volume. However, if task B's access to the target logical volume is not yet complete, it will cause a system error or exception. In other situations, such as when task A and task B access the same resource on the target logical volume, the lack of a synchronization mechanism for resource access will also cause system errors or exceptions.
[0033] In typical scenarios, such as telecom cloud scenarios, the concurrent use management of LVM logical volumes in virtualization platforms improves the efficiency of virtualization management. It provides another new method to solve the problem of concurrent tasks accessing shared logical volumes, improves the efficiency of virtualization storage logical volume management, and overcomes logical volume access error messages caused by multi-task concurrency.
[0034] To address the activation and deactivation operations of the same logical volume in concurrent multi-tasking scenarios at the application layer on a host, this solution enables secure access to shared logical volumes among multiple tasks, preventing errors and exceptions when concurrent tasks use logical volume information, thereby ensuring the smooth execution of concurrent operations at the upper layer.
[0035] Based on the above objectives, the first aspect of this application provides an embodiment of a logical volume access method. Figure 2 The diagram shown is a flowchart illustrating a logical volume access method in some embodiments of this application. For example... Figure 2 As shown, an embodiment of this application provides a logical volume access method applied at the application layer, comprising the following steps:
[0036] Call the target logical volume activation interface of the daemon process;
[0037] The daemon process encapsulates operations such as activation and deactivation of logical volumes and provides API interfaces for command-line and application-layer access. Application-layer programs notify the daemon process of specific activation and deactivation operations through the API interface. In the embodiments of this application, there can be one or more application-layer programs, but there is only one daemon process corresponding to the target logical volume. Its implementation can be as a program process or as a system service. Therefore, the meaning of "process" in the daemon process in this application is not limited to the narrow understanding of a process.
[0038] After the target logical volume activation interface returns, the target logical volume access task is executed;
[0039] After the target logical volume activation interface returns, the application layer program obtains access permissions to the target logical volume, and can therefore perform access tasks on the target logical volume, such as read, write, and delete operations.
[0040] Call the target logical volume deactivation interface of the daemon process.
[0041] After accessing the target logical volume, the application-layer program releases its access permissions by calling the target logical volume deactivation interface of the daemon process. As mentioned earlier, there are multiple application-layer programs, and the applications accessing the target logical volume are also not unique. Therefore, even after one application-layer program calls the deactivation function, the target logical volume may still be open to other application-layer programs.
[0042] The daemon process receives the target logical volume activation request from the application layer, determines whether the target logical volume is activated by the target logical volume's reference count lock, and if not, activates the target logical volume and sets the reference count of the target logical volume to 1; if so, it increments the reference count of the target logical volume by 1.
[0043] The daemon process is used to receive the target logical volume deactivation request from the application layer, decrement the reference count of the target logical volume by 1, and determine whether the reference count of the target logical volume is 0. If it is, the target logical volume is deactivated.
[0044] The daemon process provides the actual activation and deactivation. Internally, it uses a memory lock on a single logical volume to access usage counts and performs the actual activation and deactivation based on the count information.
[0045] The daemon internally queries the lock corresponding to the logical volume, acquires the memory lock corresponding to the logical volume, and uses file or memory locks on the current host to synchronize access to the logical volume reference count. Before accessing, the lock corresponding to this logical volume is acquired first.
[0046] If it's an activation operation, check if the logical volume is active. If not, activate the logical volume and set the reference count in memory to 1. If the logical volume is already active, read the memory reference count, increment it by 1, and modify the data in memory.
[0047] If a deactivation operation is performed, it is determined whether the logical volume is active. If it is not active, the reference count in memory is directly set to 0. If it is active, the reference count in memory is decremented by 1. If the reference count reaches 0 after decrementing by 1, the actual deactivation process is performed.
[0048] After processing is complete, the memory lock corresponding to the logical volume is released, and no lock information of the logical volume is held when the corresponding task is executed at the application layer.
[0049] The daemon internally stores memory lock information for each logical volume and the active reference count information for each logical volume. For logical volume activation or deactivation, it first acquires the memory lock corresponding to the logical volume; the memory lock is used to achieve synchronized and mutually exclusive access to the reference count of the logical volume. After acquiring the logical volume lock, the reference count in the corresponding memory is modified. Before activation, if the logical volume is already activated, the reference count in memory is incremented by 1; otherwise, the logical volume is activated, and the corresponding memory reference count is set to 1. During deactivation, the used reference count is decremented by 1. It is then checked whether the used count has decreased to 0. If it has, the actual deactivation operation is performed; otherwise, no deactivation operation is performed.
[0050] This application provides a novel method for resolving concurrent use of clustered logical volumes using memory counting. When the application layer program calls the activation or deactivation API interface, the API parameters include the names of the volume group and the logical volume. It checks the logical volume's relevant information and passes it to the command line or API interface. The command line or API interface then notifies the daemon process to make an interface call. Responding to the call request from the application layer program, the daemon process internally queries the lock corresponding to the logical volume, acquires the corresponding memory lock, and uses a file or memory lock on the current host to synchronize access to the logical volume's reference count. It first attempts to acquire this lock; after acquiring the lock, it checks whether the logical volume is active. If not, it activates the logical volume and modifies the reference count in memory to 1. If the logical volume is already active, it reads the memory reference count and increments it by 1.
[0051] After the upper-layer application returns from the command line or API call, it executes the current operation task, such as accessing the logical volume, reading information, and other tasks related to accessing the logical volume.
[0052] The upper-layer application calls the logical volume information release process, notifying the daemon process via command line or API to make an interface call. The daemon process responds to the call request from the application layer program, internally querying the lock corresponding to the logical volume, acquiring the corresponding memory lock, and using a file or memory lock on the current host to synchronize access to the logical volume's reference count. It first attempts to acquire this lock; after acquiring the lock, it performs deactivation processing, checking whether the logical volume is active. If it is not active, it directly sets the reference count in memory to 0; if it is active, it performs deactivation processing and decrements the reference count in memory by 1; if the reference count is reduced to 0, it performs actual deactivation processing.
[0053] A background daemon process centrally manages logical volumes, providing a separate daemon that can run as a background service. Command-line and API communication occurs via sockets or pipes with this daemon process; reference counting is used to access and modify logical volumes by acquiring globally unique logical volume memory locks; and the actual activation and deactivation of logical volumes are handled within the daemon process.
[0054] The application layer provides access to logical volumes via command line and API. For example, when accessing via command line, a command line can be encapsulated with different parameters to handle activation and deactivation, such as: LV_opt [active,deactivate] vg_name / lv_name mode, where opt indicates activation or deactivation, vg_name or lv_name represents the name or ID of the volume group or logical volume, and mode indicates the activation permissions, which can be either shareable or exclusive. Therefore, different application programs can access the logical volume simultaneously or exclusively, avoiding access conflicts or anomalies to the same resource within the logical volume.
[0055] The daemon implements logical volume management and synchronization algorithms in memory using reference counting. It prioritizes acquiring the memory lock corresponding to the target logical volume to prevent multiple concurrent tasks from synchronizing with the logical volume. Under the protection of the logical volume memory lock, it checks the reference count of the logical volume. Using the reference count, it determines whether to perform actual activation and deactivation operations.
[0056] After the interface returns, the upper-layer application continues to execute its own tasks. This design avoids concurrent operations of multiple tasks in the upper layer, thereby improving the processing performance and efficiency of the upper-layer business.
[0057] Furthermore, the counting lock is a globally unique memory lock and / or a file lock. The counting lock in this application can be a globally unique memory lock, thus improving access speed and efficiency compared to file locks; it can also be a file lock, thus maintaining the access count information of the target logical volume even after a system restart; or it can simultaneously use memory locks and file locks, synchronizing the counting information of memory locks and file locks in real time, combining the advantages of high efficiency and continuity.
[0058] The daemon manages the counting locks and reference counts of logical volumes using a Map / dictionary: Keys and values are stored accordingly. The key is a constant, which is the identifier ID of the target logical volume; the value is a variable used to store the reference count of the target logical volume. A map data structure is used to ensure a one-to-one correspondence, with the name or identifier ID of the logical volume as the key and the lock and reference count as the value.
[0059] Logical volumes and their memory locks can be stored using a Map / dictionary, and logical volumes and reference counts are also stored using a Map / dictionary data structure.
[0060] Furthermore, the application layer communicates with the daemon process via pipe or socket.
[0061] After the application layer calls the API and command line, it will notify the daemon process via RPC. This is all done in a single daemon process on the server host. After the daemon process completes the activation or deactivation operation of the target logical volume, it will notify the application layer program of the activation or deactivation result via RPC.
[0062] Furthermore, the daemon process responds to only one access request from the application layer at a time. This approach avoids queued calls to the daemon's access interface between different programs at the application layer or between different threads of the same application, thus mitigating errors or exceptions caused by interface calls.
[0063] Furthermore, the daemon process includes a logging module and an error handling module. The logging module records task execution logs, while the error handling module exits task execution. The logging module records important information during the daemon process's access to or activation / deactivation of the counting lock. Simultaneously, the error handling module, while auditing the logs, handles fatal exceptions or errors, exits task execution, forces the counting lock to be set to 0, and closes access to the target logical volume.
[0064] This application provides a novel method for managing logical volumes within a virtualization platform, including a synchronized method for activating and deactivating logical volumes. This method significantly improves the concurrent tasks of upper-layer applications, avoids errors in logical volume access caused by concurrent operations, and enhances the efficiency of virtualization management and configuration.
[0065] Existing processing models cannot guarantee concurrency in logical volume usage or ensure data security during activation and deactivation. Current technologies rely on logical volume tag storage reference counting, which involves I / O operations. The counting lock proposed in this application can be implemented in memory, improving access speed.
[0066] The method proposed in this application enables the upper application layer to perform concurrent multi-task operations and processing, greatly improving the concurrency of upper application tasks and increasing task processing efficiency. It also solves the error scenarios during task execution and improves the management efficiency of upper-layer applications such as virtualization and the continuous stability of business operations.
[0067] A second aspect of the embodiments of this application provides a logical volume access device. Figure 3 The diagram shown is a schematic representation of an embodiment of a logical volume access device according to some embodiments of this application. For example... Figure 3 As shown, a logical volume access device in some embodiments of this application includes: an application module and a guardian module;
[0068] The application module is configured to call the target logical volume activation interface of the guardian module. After the target logical volume activation interface returns, the target logical volume access task is executed, and the target logical volume deactivation interface of the guardian module is called.
[0069] The guardian module is configured to receive a target logical volume activation request from the application layer, determine whether the target logical volume is activated by using the target logical volume's reference lock, and if not, activate the target logical volume and set its reference count to 1; if yes, increment the target logical volume's reference count by 1, and / or receive a target logical volume deactivation request from the application layer, decrement the target logical volume's reference count by 1, and determine whether the target logical volume's reference count is 0; if yes, deactivate the target logical volume.
[0070] For the same purpose, a third aspect of the embodiments of this application proposes a computer device. Figure 4 The diagram shown illustrates an embodiment of a computer device according to some embodiments of this application. For example... Figure 4 As shown, an embodiment of a computer device in some embodiments of this application includes the following modules: at least one processor 021; and a memory 022 storing computer instructions 023 that can be executed on the processor 021, which, when executed by the processor 021, implement the steps of the method described above.
[0071] This application also provides a computer-readable storage medium. Figure 5 The diagram shown illustrates an embodiment of a computer-readable storage medium according to some embodiments of this application. For example... Figure 5 As shown, computer-readable storage medium 031 stores a computer program 032 that, when executed by a processor, performs the methods described above.
[0072] Finally, it should be noted that those skilled in the art will understand that all or part of the processes in the above embodiments can be implemented by a computer program instructing related hardware. The program for setting system parameters can be stored in a computer-readable storage medium. When executed, the program can include the processes of the embodiments of the above methods. The storage medium for the program can be a magnetic disk, optical disk, read-only memory (ROM), or random access memory (RAM), etc. The above computer program embodiments can achieve the same or similar effects as any of the corresponding foregoing method embodiments.
[0073] Furthermore, the method disclosed in the embodiments of this application can also be implemented as a computer program executed by a processor, which can be stored in a computer-readable storage medium. When the computer program is executed by the processor, it performs the functions defined in the method disclosed in the embodiments of this application.
[0074] Furthermore, the above-described method steps and system units can also be implemented using a controller and a computer-readable storage medium for storing a computer program that enables the controller to perform the functions of the above-described steps or units.
[0075] Those skilled in the art will also understand that the various exemplary logic blocks, modules, circuits, and algorithm steps described in conjunction with the disclosure herein can be implemented as electronic hardware, computer software, or a combination of both. To clearly illustrate this interchangeability between hardware and software, the functionality of the various illustrative components, blocks, modules, circuits, and steps has been generally described. Whether this functionality is implemented as software or hardware depends on the specific application and the design constraints imposed on the system as a whole. Those skilled in the art can implement the functionality in various ways for each specific application, but such implementation decisions should not be construed as departing from the scope of the embodiments disclosed in this application.
[0076] In one or more exemplary designs, functionality may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the functionality may be stored as one or more instructions or code on or transmitted via a computer-readable medium. Computer-readable media include computer storage media and communication media, including any medium that facilitates the transfer of a computer program from one location to another. Storage media may be any available medium accessible to a general-purpose or special-purpose computer. By way of example, and not limitation, computer-readable media may include RAM, ROM, EEPROM, CD-ROM or other optical disc storage devices, disk storage devices or other magnetic storage devices, or any other medium that may be used to carry or store the required program code in the form of instructions or data structures and is accessible to a general-purpose or special-purpose computer or a general-purpose or special-purpose processor. Furthermore, any connection may be appropriately referred to as computer-readable media. For example, if software is transmitted from a website, server, or other remote source using coaxial cable, fiber optic cable, twisted pair, digital subscriber line (DSL), or wireless technologies such as infrared, radio, and microwave, then the aforementioned coaxial cable, fiber optic cable, twisted pair, or wireless technologies such as infrared, radio, and microwave are all included in the definition of media. As used herein, disks and optical discs include compact discs (CDs), laser discs, optical discs, digital multifunction discs (DVDs), floppy disks, and Blu-ray discs, where disks typically reproduce data magnetically, while optical discs reproduce data optically using lasers. Combinations of the above should also be included within the scope of computer-readable media.
[0077] The above are exemplary embodiments disclosed in this application. However, it should be noted that various changes and modifications can be made without departing from the scope of the embodiments disclosed in this application as defined by the claims. The functions, steps, and / or actions of the methods according to the disclosed embodiments described herein do not need to be performed in any particular order. Furthermore, although the elements disclosed in the embodiments of this application may be described or claimed individually, they may be understood as multiple unless explicitly limited to a singular number.
[0078] It should be understood that, as used herein, the singular form “a” is intended to include the plural form as well, unless the context clearly supports an exception. It should also be understood that, as used herein, “and / or” refers to any and all possible combinations of one or more of the associated listed items.
[0079] The example numbers disclosed in the above application are for descriptive purposes only and do not represent the superiority or inferiority of the examples.
[0080] Those skilled in the art will understand that all or part of the steps of the above embodiments can be implemented by hardware or by a program instructing related hardware. The program can be stored in a computer-readable storage medium, such as a read-only memory, a disk, or an optical disk.
[0081] Those skilled in the art should understand that the discussion of any of the above embodiments is merely exemplary and is not intended to imply that the scope of the disclosure of the embodiments of this application (including the claims) is limited to these examples; under the concept of the embodiments of this application, the technical features of the above embodiments or different embodiments can also be combined, and there are many other variations of different aspects of the embodiments of this application as described above, which are not provided in detail for the sake of brevity. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the embodiments of this application should be included within the protection scope of the embodiments of this application.
Claims
1. A logical volume access method, applied at the application layer, characterized in that, include: Call the target logical volume activation interface of the daemon process; After the target logical volume activation interface returns, the target logical volume access task is executed; Call the target logical volume deactivation interface of the daemon process; The daemon process is used to receive the target logical volume activation request from the application layer, and to determine whether the target logical volume is activated by the counting lock of the target logical volume. If not, the target logical volume is activated and the reference count of the target logical volume is set to 1; if so, the reference count of the target logical volume is incremented by 1. and / or The daemon process is used to receive the target logical volume deactivation request from the application layer, decrement the reference count of the target logical volume by 1, and determine whether the reference count of the target logical volume is 0. If so, the target logical volume is deactivated.
2. The method according to claim 1, characterized in that, The counting lock is a globally unique memory lock and / or file lock.
3. The method according to claim 1, characterized in that, The application layer communicates with the daemon process via pipe or socket.
4. The method according to claim 3, characterized in that, The daemon process responds to only one access request from the application layer at a time.
5. The method according to claim 1, characterized in that, The daemon process has a logging module and an error handling module. The logging module is used to record task execution logs, and the error handling module is used to exit task execution.
6. A logical volume access device, characterized in that, include: Application module and guardian module; The application module is configured to call the target logical volume activation interface of the daemon module. After the target logical volume activation interface returns, the target logical volume access task is executed. Call the target logical volume deactivation interface of the daemon module; The guardian module is configured to receive a target logical volume activation request from the application layer, determine whether the target logical volume is activated by using the target logical volume's reference lock, and if not, activate the target logical volume and set its reference count to 1; if yes, increment the target logical volume's reference count by 1. And / or to receive a deactivation request for the target logical volume from the application layer, decrement the reference count of the target logical volume by 1, and determine whether the reference count of the target logical volume is 0. If so, deactivate the target logical volume.
7. A computer device, characterized in that, include: At least one processor; as well as A memory storing computer instructions executable on the processor, which, when executed by the processor, implement the steps of the method according to any one of claims 1-5.
8. A computer-readable storage medium storing a computer program, characterized in that, When the computer program is executed by a processor, it implements the steps of the method according to any one of claims 1-5.