The present application claims priority to Chinese Patent Application No. 202010972953.X, filed Sep. 16, 2020, and entitled “Method, Electronic Device, and Computer Program Product for Selecting Backup Destination,” which is incorporated by reference herein in its entirety.
The implementations of the present disclosure generally relate to storage systems, and more particularly to a method, an electronic device, and a computer program product for selecting a storage device as a backup destination.
Many companies or enterprises generate large amounts of data every day. For security of data, data protection becomes more and more important. In this regard, a backup storage system can provide data protection so as to copy data to be backed up to one or more storage devices, thereby obtaining one or more data copies stored in different storage devices.
At present, it has been proposed to select a storage device subset that can be used as backup destinations based on states of multiple optional storage devices in a storage device set. For example, a score can be set for the state of each storage device in the storage device set, and various combination modes (for example, the modes based on permutation and combination) for generating a storage device subset can be determined. However, when there is a large number (for example, dozens or more) of storage devices, there will be tens or even hundreds of thousands of combination modes based on the number of backup copies. At this moment, when a backup destination is selected, a huge amount of computation will be involved, and therefore, it is impossible to provide users with recommendations for backup destinations in an effective manner.
Implementations of the present disclosure provide a technical solution for determining, in a storage device set, a storage device subset for data backup, and specifically provide a method, an electronic device, and a computer program product for storage management.
In a first aspect of the present disclosure, a method for selecting a backup destination for a backup task is provided. This method includes: receiving device information about storage devices in a storage device set, wherein the backup task is executed in the storage device set; receiving backup information about the backup task; acquiring a destination association relationship, wherein the destination association relationship describes an association relationship between a reference backup task in a reference storage device set and a reference backup destination of the reference backup task, the reference backup destination including a group of storage devices in a reference storage system; and selecting a backup destination for the backup task from the storage device set according to the destination association relationship and based on the device information and the backup information, the backup destination including a group of storage devices in the storage device set.
In a second aspect of the present disclosure, an electronic device is provided, including: at least one processor; and at least one memory storing computer program instructions, wherein the at least one memory and the computer program instructions are configured to cause, together with the at least one processor, the electronic device to perform an action for selecting a backup destination for a backup task. The action includes: receiving device information about storage devices in a storage device set, wherein the backup task is executed in the storage device set; receiving backup information about the backup task; acquiring a destination association relationship, wherein the destination association relationship describes an association relationship between a reference backup task in a reference storage device set and a reference backup destination of the reference backup task, the reference backup destination including a group of storage devices in a reference storage system; and selecting a backup destination for the backup task from the storage device set according to the destination association relationship and based on the device information and the backup information, the backup destination including a group of storage devices in the storage device set.
In a third aspect of the present disclosure, a computer program product is provided. The computer program product is tangibly stored on a non-volatile computer-readable medium and includes machine-executable instructions. The machine-executable instructions, when executed, cause a machine to execute steps of the method according to the first aspect.
It should be understood that the content described in this Summary is neither intended to limit key or essential features of the implementations of the present disclosure nor intended to limit the scope of the present disclosure. Other features of the present disclosure will become readily understandable through the following description.
The above and other objectives, features, and advantages of the implementations of the present disclosure will become readily understandable by reading the following detailed description with reference to the accompanying drawings. In the accompanying drawings, several implementations of the present disclosure are shown by way of example and not limitation.
Throughout all the accompanying drawings, the same or similar reference numerals are used to indicate the same or similar components.
The principles and spirit of the present disclosure will be described below with reference to several example implementations shown in the accompanying drawings. It should be understood that these implementations are described only for enabling a person skilled in the art to better understand and then implement the present disclosure, instead of limiting the scope of the present disclosure in any way. In the description and claims herein, unless otherwise defined, all technical and scientific terms used herein have meanings that are commonly understood by those of ordinary skill in the art to which the present disclosure belongs.
At present, the concept of a distributed storage system has been proposed, and a distributed storage system may include hundreds or even more storage devices. For example, these storage devices can be distributed all over the world. Firstly, an application environment for example implementations of the present disclosure will be described with reference to
Backup task 120 may specify the number of backup copies. For example, it may specify that 3 backup copies are required. The number of copies can be input by the user of the storage system, and the user can specify the number of copies in a service level agreement (SLA). For the convenience of description, hereinafter, the number of copies of 3 will be taken as an example for description. It should be understood that the implementations of the present disclosure can be applied to any other number of copies.
At this moment, 3 storage devices need to be selected from the N storage devices as the backup destinations. There may be multiple candidate subsets 130, and each candidate subset includes 3 storage devices. For example, candidate subset 130-1 may include storage devices 110-1, 110-2, and 110-3, . . . , and candidate subset 130-M may include storage devices 110-6, 110-7, and 110-N. Backup destination 140 may be selected from the multiple candidate subsets 130 so as to be used as the backup destination of backup task 120.
At present, it has been proposed to select a group of storage devices that can be used as backup destinations based on the states of multiple optional storage devices in the storage device set. For example, a score can be set for the state of each storage device in the storage device set, and the scores of various combination modes (for example, the modes based on permutation and combination) of generating a candidate subset of storage devices can be determined. However, when there is a large number (for example, dozens of or more) of storage devices, there will be tens or even hundreds of thousands of combination modes based on the number of backup copies. Assuming that there are N storage devices and X copies are expected to be stored, there can be CNX combination modes. For example, if N=1000 and X=3, the number of combination modes is
At this moment, when selecting a backup destination from a large number of combination modes, a huge amount of computation will be involved.
In view of the foregoing problems and other potential problems in the conventional solutions, the implementations of the present disclosure provide a technical solution for selecting a backup destination for a backup task from a storage device set. In the implementations of the present disclosure, a destination association relationship can be created based on the operation history of the current storage system or other similar storage systems. Then, when a backup task needs to be performed in the storage system, the current information about the storage system can be collected, and this current information can be input into the destination association relationship, so as to obtain a storage device that can be used as a backup destination.
Hereinafter, an overview of an example implementation 200 according to the present disclosure will be described with reference to
With the example implementation 200 of the present disclosure, destination association relationship 230 can be established directly based on historical experience that has been verified as valid. In this way, it is not necessary to determine the score for each combination mode one by one, but instead, the current device information 210 and backup information 220 are directly input into destination association relationship 230 to obtain one or more backup destinations. In this way, the computing resource and time overheads in the process of selecting the backup destination can be greatly reduced, and the backup destination can be determined in a faster and more effective manner.
Hereinafter, more details of an example implementation according to the present disclosure will be described with reference to
Device information 210 may include various aspects of contents. Hereinafter, more details about device information 210 will be described with reference to
In the context of the present disclosure, position 410 may be represented by the longitude and latitude or other coordinate information of the place where the storage device is located. Available storage space 412 represents the remaining storage space in the storage device. For example, it may be represented with the size (GB) of the available storage space. Alternatively and/or additionally, it may be represented with the percentage of the available storage space. Network bandwidth 414 of the storage device refers to the available bandwidth of the storage device, and this bandwidth may vary with the size of the data transmission load of the storage device. CPU usage rate 416 and the memory usage rate 418 of the storage device respectively represent the absolute value or percentage of the CPU and memory in the storage device that have been used. Exhaustion time 420 refers to how long until available storage space 412 in the storage device will be exhausted. Exhaustion time 420 may be determined based on the speed of data transmission to the storage device and available storage space 412.
It will be understood that
Returning to
It will be understood that
The specific contents of device information 210 and backup information 220 have been described above with reference to
As shown in
How to acquire destination association relationship 230 will be described by returning to
According to an example implementation of the present disclosure, the reference storage device set may be the storage device set in the current storage system. For example, destination association relationship 230 may be obtained based on the operation history data of the current storage system. Assume that the storage device set includes 1000 storage devices, and 500 backup tasks have been performed during the operation of the storage system. At this moment, training samples can be generated using feature vectors and historical backup destinations related to the execution of the 500 historical backup tasks, so as to obtain the association relationship between the backup destinations and the backup environment.
Specifically, feature vector 440 as shown in
Further, this destination association relationship 230 may be obtained based on feature vector 440 and the historical backup destination. According to an example implementation of the present disclosure, training operations can be performed based on various technologies currently known and/or to be developed in the future. According to an example implementation of the present disclosure, destination association relationship 230 can be obtained based on the convolutional neural network.
According to an example implementation of the present disclosure, reference backup information about a group of reference backup tasks in a reference storage device set can be determined. According to the format shown in
According to an example implementation of the present disclosure, destination association relationship 230 can be obtained in an iterative manner using the training samples. For example, this destination association relationship 230 may be realized based on convolutional neural network 520. After the training phase is completed, when reference feature vector 512 is input to the trained destination association relationship 230, backup destination 530 that is output is consistent with reference backup destination 514 in training sample 510.
According to an example implementation of the present disclosure, the training samples in the training set can be used to obtain destination association relationship 230. Test samples in a test set can be used to test whether destination association relationship 230 can obtain a correct output result. Further, destination association relationship 230 can be adjusted so that this association relationship can better match the test set.
The process of training destination association relationship 230 based on the historical data of the storage system itself has been described above. According to an example implementation of the present disclosure, destination association relationship 230 may also be obtained based on historical data of different storage systems. Assuming that there are two identical storage systems, historical data of one storage system can be used to obtain destination association relationship 230. Further, the obtained destination association relationships 230 may be used to select backup destinations in two different storage systems, respectively.
According to an example implementation of the present disclosure, the reference storage system used to provide training samples does not have to be identical to the current storage system, but instead, this reference storage system may be similar to the current storage system. For example, the reference storage device set included in the reference storage system may have a similar number of storage devices as the current storage device set. It can be set that the ratio of the numbers of storage devices in the two storage device set should satisfy a threshold range. For example, this threshold range can be represented as [1-4, 1+4], where 4 can be set to 0.005 and/or other values. The smaller the value of 4, the more similar the numbers of storage devices in the two storage device set. At this moment, destination association relationship 230 obtained based on the historical data of the reference storage system is more suitable for the current storage system.
It will be understood that the selection of the backup destination largely depends on the configurations of the storage devices of the storage system. Therefore, the reference storage system and the current storage system should have the same or similar device configurations. For example, it can be specified that the capacity of the reference storage device in the reference storage system should be similar to the capacity of the storage device of the current storage system, and it can be specified that the type of hard disk of the reference storage device is the same as that of the storage device, and so on. In this way, it can be ensured that all aspects of the configuration of the reference storage devices in the reference storage system that are used as the training basis are similar to those of the current storage system, so that destination association relationship 230 can be more suitable for the current storage system.
It will be understood that although the use of destination association relationship 230 from the reference storage system may lead to low accuracies in some cases, this destination association relationship 230 can output a more preferred backup destination in most cases. With the example implementation of the present disclosure, it is not necessary to train destination association relationship 230 respectively for each storage system, and thus the reusability of destination association relationship 230 can be greatly improved, and the time and computing resource overheads of the training phase can be reduced.
It will be understood that the number of storage devices included in the backup destination depends on the number of copies specified by the backup task. According to an example implementation of the present disclosure, the reference backup task used as the training sample and the backup task of the current storage system should specify the same number of copies. Assuming that the backup task of the current storage system specifies that 3 copies are needed, a historical backup task specifying 3 copies can be selected to generate a training sample.
According to an example implementation of the present disclosure, the number of backup copies of the reference backup task used as the training sample may be greater than the number of copies of the backup task of the current storage system. Assuming that the backup task of the current storage system specifies that 3 copies are needed, and assuming that no backup task specifying 3 copies has been performed in the past, a historical backup task specifying 4 copies can be selected to generate a training sample. The backup destination generated at this moment will involve 4 storage devices, and 3 storage devices can be selected from the 4 storage devices to serve as the backup destinations. Although the backup destination obtained at this moment may not be optimal, compared to the existing technical solutions of determining the backup destination in a completely manual selection manner and/or for each combination mode, this technical solution can make full use of the existing experience to serve future backup tasks.
The example of acquiring device information 210 and backup information 220 for a certain point in time and generating feature vector 440 has been described above. According to an example implementation of the present disclosure, device information 210 and backup information 220 within a certain preset time period can be received. At this moment, the obtained device information 210 and backup information 220 are both represented by time sequence data.
Similarly, corresponding backup information 220 may be generated based on backup tasks that are within a preset time period. At this moment, both the device information and the backup information in feature vector 440 will be represented in the form of time sequence. According to an example implementation of the present disclosure, in order to analyze the association relationship related to time sequence data in a more accurate manner, a long short-term memory network may be introduced into destination association relationship 230. Hereinafter, more details will be described with reference to
As shown in
It will be understood that although convolutional neural network 520 and long short-term memory network 710 exist at this moment, for external users, there is no need to know the internal details of destination association relationship 230, but instead, destination association relationship 230 can be used as a black box for training. That is, there is no need to train convolutional neural network 520 and long short-term memory network 710 independently, but instead, only training samples 510 are needed to enable destination association relationship 230 to receive the feature vector and output backup destination 530.
The details of the training process have been described above. After destination association relationship 230 has been obtained, a feature vector established using the device information and backup information about the current storage system can be input to this destination association relationship 230 to obtain a corresponding backup destination. At this moment, the backup destination output by destination association relationship 230 represents a group of storage devices that can be used as backup destinations. Specifically, when destination association relationship 230 as shown in
According to an example implementation of the present disclosure, multiple candidate backup destinations may be output based on destination association relationship 230. Further, the backup destination can be verified based on multiple indicators, and the multiple candidate backup destinations can be filtered based on preset performance requirements. For example, a preset performance requirement can be set based on the distance between storage devices. Specifically, the preset performance requirements may include: the distance between any two storage devices in the candidate backup destination is greater than a threshold distance (for example, 300 kilometers). Assuming that the candidate backup destination includes 3 storage devices, and the distance between any two of the devices is greater than the threshold distance, this candidate backup destination can be used as the backup destination. Otherwise, the candidate backup destination can be filtered out, and other suitable candidate backup destinations can be selected from the multiple candidate backup destinations.
It will be understood that the threshold distance can ensure that the storage devices in each candidate backup destination have different physical environments, thereby reducing the possibility of simultaneous failures (e.g., power outages, floods, mechanical shocks, etc.) of different storage devices. It will be understood that the specific value of the threshold distance listed here is only illustrative and is not intended to limit the scope of the present disclosure in any way. In other implementations, the threshold distance may be set to any value according to specific technical environments and performance requirements.
According to an example implementation of the present disclosure, it can be specified that the available resource amount of any storage device in a group of storage devices included in the candidate backup destination should be greater than a threshold resource amount. Specifically, the preset performance requirements can be set based on the available resources in the storage device. The preset performance requirements may include: an available resource amount of any storage device in the candidate backup destination is greater than a threshold resource amount. In this way, it is ensured that any candidate backup destination can complete data backup. For example, the available resource amount here may include the computing resource amount, the memory resource amount, storage capacities, network bandwidths, etc. of the storage device. According to an example implementation of the present disclosure, the threshold resource amount can be set based on the resource amount required by the backup task. In other implementations, the threshold resource amount may also be predetermined according to specific technical environment and performance requirements.
According to an example implementation of the present disclosure, it may be specified that a global balance degree associated with the candidate backup destination should be higher than a threshold balance degree. Here, the global balance degree indicates a usage balance degree of the storage device set in the situation where a storage device in the candidate backup destination is used for the backup task. It will be understood that the “usage balance degree” may refer to the balance degree of the “usage” of multiple storage devices in any aspect. For example, the “usage balance degree” may refer to the “usage balance degree” of the available storage capacity of the multiple storage devices, the “usage balance degree” of the input network bandwidth of the multiple storage devices, the “usage balance degree” of the processing resources of the multiple storage devices, the “usage balance degree” of the memory resources of the multiple storage devices, and so on.
The global balance degree of each candidate backup destination can be determined respectively, and then the final backup destination can be determined based on the global balance degree. According to an example implementation of the present disclosure, the global balance degree can be determined based on various methods. For example, the global balance degree of the candidate backup destination may be determined based on the usage metric of each storage device in the candidate backup destination and the time required to transmit backup data to each storage device in the candidate backup destination.
According to an example implementation of the present disclosure, it is expected that the usage rate of the multiple storage devices will increase uniformly, but it is not desirable that a certain storage device will be exhausted prematurely. Therefore, the usage metric can be used to measure the time when the storage device is exhausted. For example, it is possible to determine when the storage device is exhausted based on the remaining storage capacity in the storage device, the size of the source data to be backed up, and the daily growth rate of the source data. For example, the time when the ith storage device is exhausted can be determined based on the following Formula 1 and Formula 2:
where VEi represents the daily data growth of the ith storage device, i is a positive integer and i≤the number of storage devices N, n represents the number of pieces of source data with backups, SDSs represents the Sth source data, DDIi represents the daily data growth (for example, represented as a percentage) of the ith storage device, and DR represents the data repetition rate.
where ETFRi represents the predicted exhaustion time of the ith storage device, wherein VEi represents the daily data growth of the ith storage device, and RCi represents the available storage space on the ith storage device.
Further, the standard deviation related to the exhaustion time of each storage device can be determined based on the following Formula 3:
where σ1 represents the standard deviation related to the exhaustion time, N represents the number of storage devices, ETFR represents the predicted exhaustion time of the ith storage device, and ETFR represents an average value of exhaustion times of all the storage devices. It will be understood that the above Formulas 1 to 3 are only specific examples for determining the component of the global balance degree, which is related to the exhaustion time. According to an example implementation of the present disclosure, this component can be determined based on other formulas.
Hereinafter, more information about determining the transmission time will be introduced. According to an example implementation of the present disclosure, the time required to transmit source data to a certain storage device can be determined based on the bandwidth of each storage device. For example, the time for transmitting the source data to the ith storage device can be determined based on the following Formula 4:
where ETCi represents the time for transmitting the source data to the ith storage device, VEi represents the daily data growth of the ith storage device, and NBi represents the bandwidth of the ith storage device.
The standard deviation related to the transmission time of each storage device can be further determined based on Formula 5:
where σ2 represents the standard deviation related to the transmission time, N represents the number of storage devices, ETCi represents the predicted transmission time of the ith storage device, and
According to an example implementation of the present disclosure, the global balance degree function GE associated with each candidate backup destination can be determined based on the following Formula 6:
GE=σ1*v1+σ2*v2+v3 Formula 6
where v1 and v2 distributions represent custom weights, σ1 and σ2 are components determined according to the formulas described above, and v3 represents a custom offset value. It will be understood that Formula 6 here is only illustrative. According to an example implementation of the present disclosure, other formulas may also be used to determine the global balance degree function GE. For example, the global balance degree function GE can be determined based on the product of σ1 and σ2.
According to an example implementation of the present disclosure, the corresponding global balance degree function GE can be determined for multiple candidate backup destinations. The global balance degrees of the multiple candidate backup destinations can be ordered, and the candidate backup destination with the optimal global balance degree can be selected as the backup destination. According to an example implementation of the present disclosure, a threshold of the global balance degree can be specified, and it can be specified that candidate backup destinations higher than this threshold can be filtered out of the multiple candidate backup destinations. According to an example implementation of the present disclosure, this threshold can be set based on historical experience. According to an example implementation of the present disclosure, this threshold can be set based on the current state of each storage device.
It will be understood that the global balance degree here represents a difference between the usage of all the storage devices in the storage device set after a certain candidate backup destination is selected as the backup destination. The smaller the value of the global balance degree, the more helpful the selection of this candidate backup destination is to the usage balance of all the storage devices. With the example implementation of the present disclosure, it is possible to select, as much as possible, a candidate backup destination that is helpful to the usage balance of all the storage devices as the backup destination.
The method for performing the example implementations according to the present disclosure has been described above with reference to
Multiple components in example device 800 are connected to I/O interface 805, including: input unit 806, such as a keyboard and a mouse; output unit 807, such as various types of displays and speakers; storage unit 808, such as a magnetic disk and an optical disk; and communication unit 809, such as a network card, a modem, and a wireless communication transceiver. Communication unit 809 allows example device 800 to exchange information/data with other devices through a computer network such as the Internet and/or various telecommunication networks.
The various processes and processing described above, such as example methods or example processes, may be performed by CPU 801. For example, according to an example implementation of the present disclosure, various example methods or example processes can be implemented as computer software programs, which are tangibly contained in a machine-readable medium, such as storage unit 808. According to an example implementation of the present disclosure, part or all of the computer program may be loaded and/or installed on example device 800 via ROM 802 and/or communication unit 809. When the computer program is loaded into RAM 803 and executed by CPU 801, one or more steps of the example method or example process described above may be executed.
According to an example implementation of the present disclosure, an electronic device is provided, including: at least one processor; and at least one memory storing computer program instructions, wherein the at least one memory and the computer program instructions are configured to cause, together with the at least one processor, the electronic device to perform an action for selecting a backup destination for a backup task. The action includes: receiving device information about storage devices in a storage device set, wherein the backup task is executed in the storage device set; receiving backup information about the backup task; acquiring a destination association relationship, wherein the destination association relationship describes an association relationship between a reference backup task in a reference storage device set and a reference backup destination of the reference backup task, the reference backup destination including a group of storage devices in a reference storage system; and selecting a backup destination for the backup task from the storage device set according to the destination association relationship and based on the device information and the backup information, the backup destination including a group of storage devices in the storage device set.
According to an example implementation of the present disclosure, receiving the device information and the backup information further includes: receiving the device information and the backup information that are within a preset time period.
According to an example implementation of the present disclosure, the device information includes at least any one of the following: a position of the storage device, an available storage space of the storage device, a network bandwidth of the storage device, a CPU usage rate of the storage device, a memory usage rate of the storage device, an exhaustion time of the storage device, and so on.
According to an example implementation of the present disclosure, the backup information includes at least any one of the following: the number of backup copies specified by the backup task; a size of source data specified by the backup task; and a repetition rate of the source data.
According to an example implementation of the present disclosure, acquiring the destination association relationship includes: determining reference backup information about each reference backup task executed in the reference storage device set; determining reference device information about each reference storage device in the reference storage device set; and training the destination association relationship based on the reference backup information, the reference device information, and the reference backup destination of the reference backup task.
According to an example implementation of the present disclosure, the destination association relationship includes: a first network model based on a convolutional neural network, wherein the first network model is used to map the reference backup information and the reference device information to an internal feature vector; and a second network model based on a long short-term memory network, wherein the second network model is used to map the internal feature vector to the reference backup destination of the reference backup task.
According to an example implementation of the present disclosure, determining the backup destination includes: mapping the backup information and the device information to an internal feature vector based on the first network model; and mapping the internal feature vector to the backup destination based on the second network model.
According to an example implementation of the present disclosure, determining the backup destination further includes verifying the backup destination in response to the backup destination satisfying the following conditions: a distance between any two storage devices in the group of storage devices included in the backup destination is greater than a threshold distance; an available resource amount of any storage device in the group of storage devices included in the backup destination is greater than a threshold resource amount; and a global balance degree associated with the backup destination is higher than a threshold balance degree, wherein the global balance degree indicates a usage balance degree of the storage device set in the situation where a storage device in the backup destination is used for the backup task.
According to an example implementation of the present disclosure, the storage device set and the reference storage device set satisfy at least any one of the following: having the same or similar numbers of storage devices; and having the same or similar device models.
According to the example implementation of the present disclosure, the number of copies specified by the backup task is not higher than the number of copies specified by reference backup task.
According to an example implementation of the present disclosure, a computer program product is provided, the computer program product being tangibly stored on a non-volatile computer-readable medium and including machine-executable instructions which, when executed, cause a machine to execute the methods described above.
According to an example implementation of the present disclosure, a computer-readable medium is provided, the medium including machine-executable instructions which, when executed, cause a machine to execute the methods described above.
Through the implementations of the present disclosure, the amount of computation for selecting a backup destination can be greatly reduced, thereby improving the automation level and performance of the storage system.
As used herein, the term “include” and similar terms thereof should be understood as open-ended inclusion, i.e., “including but not limited to.” The term “based on” should be understood as “based at least in part on.” The term “one implementation” or “this implementation” should be understood as “at least one implementation.” The terms “first,” “second,” etc., may refer to different or the same objects. Other explicit and implicit definitions may also be included below.
As used herein, the term “determine” encompasses a variety of actions. For example, “determine” may include operating, computing, processing, exporting, surveying, searching (for example, searching in a table, a database, or another data structure), identifying, and the like. In addition, “determine” may include receiving (for example, receiving information), accessing (for example, accessing data in a memory), and the like. In addition, “determine” may include parsing, selecting, choosing, establishing, and the like.
It should be noted that the implementations of the present disclosure may be implemented by hardware, software, or a combination of software and hardware. The hardware part can be implemented using dedicated logic; the software part can be stored in a memory and executed by an appropriate instruction execution system, such as a microprocessor or dedicated design hardware. Those skilled in the art can understand that the above-mentioned devices and methods can be implemented by using computer-executable instructions and/or by being included in processor control code which, for example, is provided on a programmable memory or a data carrier such as an optical or electronic signal carrier.
In addition, although the operations of the method of the present disclosure are described in a specific order in the drawings, this does not require or imply that these operations must be performed in the specific order, or that all the operations shown must be performed to achieve the desired result. Rather, the order of execution of the steps depicted in the flowchart can be changed. Additionally or alternatively, some steps may be omitted, multiple steps may be combined into one step for execution, and/or one step may be decomposed into multiple steps for execution. It should also be noted that the features and functions of two or more apparatuses according to the present disclosure may be embodied in one apparatus. On the contrary, the features and functions of one apparatus described above can be embodied by further dividing the apparatus into multiple apparatuses.
Although the present disclosure has been described with reference to several specific implementations, it should be understood that the present disclosure is not limited to the specific implementations disclosed. The present disclosure is intended to cover various modifications and equivalent arrangements included within the spirit and scope of the appended claims.
Number | Date | Country | Kind |
---|---|---|---|
202010972953.X | Sep 2020 | CN | national |