CN118051173A

CN118051173A - Storage process management method, device, equipment and medium

Info

Publication number: CN118051173A
Application number: CN202211460748.0A
Authority: CN
Inventors: 许勇; 徐瑚营; 陈诗浩; 丁强
Original assignee: Zhejiang Uniview Technologies Co Ltd
Current assignee: Zhejiang Uniview Technologies Co Ltd
Priority date: 2022-11-17
Filing date: 2022-11-17
Publication date: 2024-05-17

Abstract

The application discloses a management method, a device, equipment and a medium for a storage process. The method comprises the following steps: acquiring a candidate storage process in a target state in a target storage node; wherein the target state refers to a state in which no service is provided; selecting a first starting number of target storage processes from the candidate storage processes each time based on a first starting interval, and starting the target storage processes until all the candidate storage processes are started and only started once; and determining the next starting quantity in the next round according to the process starting result of the round, and/or determining the next starting interval in the next round according to the starting round of the next round and the starting interval of the first round, so as to start the next round of the candidate storage process until the preset round of stopping starting is reached. The technical scheme of the application improves the keep-alive efficiency of the storage process under the condition that the number of the fault storage processes in the distributed storage system is unknown and the service models of the storage processes are different.

Description

Storage process management method, device, equipment and medium

Technical Field

The present invention relates to the field of computer technologies, and in particular, to a method, an apparatus, a device, and a medium for managing a storage process.

Background

A distributed storage system (simply referred to as a "cluster") is typically composed of a plurality of storage nodes, each of which has a set of storage resource processes (Object Storage Device, osd processes) corresponding to the storage space.

Hardware or software errors may occur during cluster operation, resulting in failure of the osd process, so it is often necessary to set a keep-alive policy for the osd process. When the osd process is able to provide a service, it is in the up state and the process is present; when the service cannot be provided, in a down state, a process may or may not exist. And when the process exists and is in a down state, whether the process is in a normal starting preparation state or a fault blocking state is not distinguished.

In the prior art, the set keep-alive strategy is as follows: and the background osd process starts all the osd processes in the down state in batches according to the set fixed period. However, since the number of failures of the osd process is unknown and the cluster service model is unknown, if the osd process is not started (becomes up) in a fixed period, the osd process is restarted in the next period, so that the osd process is never started, and whether the osd process in the down state can be started normally cannot be judged.

Therefore, it is important to determine whether the osd process in the down state can be started normally.

Disclosure of Invention

The invention provides a storage process management method, a device, equipment and a medium, which are used for improving the keep-alive efficiency of a storage process under the conditions that the number of fault storage processes in a distributed storage system is unknown and the service models of the storage processes are different.

The method solves the problem that in a distributed storage system, multiple storage processes simultaneously fail and cannot be kept alive aiming at different service models.

According to an aspect of the present invention, there is provided a method of managing a storage process, the method including:

acquiring a candidate storage process in a target state in a target storage node; wherein the target state refers to a state in which no service is provided;

selecting a first starting number of target storage processes from the candidate storage processes each time based on a first starting interval, and starting the target storage processes until all the candidate storage processes are started and only started once;

And determining the next starting quantity in the next round according to the process starting result of the round, and/or determining the next starting interval in the next round according to the starting round of the next round and the starting interval of the first round, so as to start the next round of the candidate storage process until the preset round of stopping starting is reached.

According to another aspect of the present invention, there is provided a management apparatus for storing a process, the apparatus comprising:

the storage process acquisition module is used for acquiring a candidate storage process in a target state in the target storage node; wherein the target state refers to a state in which no service is provided;

the first starting module is used for selecting a first starting number of target storage processes from the candidate storage processes each time based on a first starting interval, and starting the target storage processes until all the candidate storage processes are started and only started once;

And the second starting module is used for determining the next starting quantity in the next round according to the process starting result of the round, and/or determining the next starting interval in the next round according to the starting round of the next round and the starting interval of the first round so as to start the next round of the candidate storage process until the starting is stopped in the preset round.

According to another aspect of the present invention, there is provided an electronic apparatus including:

at least one processor; and

A memory communicatively coupled to the at least one processor; wherein,

The memory stores a computer program executable by the at least one processor to enable the at least one processor to perform the method of managing a storage process according to any one of the embodiments of the present invention.

According to another aspect of the present invention, there is provided a computer readable storage medium storing computer instructions for causing a processor to implement a method for managing a storage process according to any one of the embodiments of the present invention when executed.

According to the technical scheme, a candidate storage process in a target state in a target storage node is obtained; wherein the target state refers to a state in which no service is provided; then, based on a first starting interval, selecting a first starting number of target storage processes from the candidate storage processes each time, and starting the target storage processes until all the candidate storage processes are started and only started once, so that the candidate storage processes are prevented from being in a continuous starting state to influence the normal starting of the storage processes; finally, determining the next starting quantity in the next round according to the process starting result of the round, and/or determining the next starting interval in the next round according to the starting round of the next round and the starting interval of the first round, so as to start the next round of the candidate storage process until the preset round of stopping starting is reached; the method and the device have the advantages that the keep-alive efficiency of the storage process is improved under the condition that the number of fault storage processes in the distributed storage system is unknown and the service models of the storage processes are different.

It should be understood that the description in this section is not intended to identify key or critical features of the embodiments of the invention or to delineate the scope of the invention. Other features of the present invention will become apparent from the description that follows.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings required for the description of the embodiments will be briefly described below, and it is apparent that the drawings in the following description are only some embodiments of the present invention, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.

FIG. 1 is a flow chart of a method for managing a storage process according to a first embodiment of the present invention;

FIG. 2 is a flow chart of a method for managing a storage process according to an embodiment of the present invention;

FIG. 3 is a schematic structural diagram of a management device for a storage process according to an embodiment of the present invention;

Fig. 4 is a schematic structural diagram of an electronic device implementing a method for managing a storage process according to an embodiment of the present invention.

Detailed Description

In order that those skilled in the art will better understand the present invention, a technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in which it is apparent that the described embodiments are only some embodiments of the present invention, not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the present invention without making any inventive effort, shall fall within the scope of the present invention.

It should be noted that the terms "candidate" and "target" and the like in the description of the present invention and the claims and the above-described drawings are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the invention described herein may be implemented in sequences other than those illustrated or otherwise described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus.

Example 1

Fig. 1 is a flowchart of a storage process management method provided in an embodiment of the present invention, where the method may be implemented by a storage process management device in a distributed storage system, where the storage process management device may be implemented in hardware and/or software, and the storage process management device may be configured in an electronic device having a storage process management method. As shown in fig. 1, the method includes:

S110, acquiring a candidate storage process in a target state in a target storage node; wherein the target state refers to a state in which no service is provided.

The scheme of the application is to reasonably manage the storage process in the distributed storage system. In the distributed storage system, a plurality of storage nodes exist, and each storage node has a group of storage processes corresponding to the storage space, and the storage processes can manage the corresponding storage space, such as reading data, writing data and the like of the storage space. The storage space can be a single or multiple physical disks, arrays, other storage systems, and can be used by the storage process in the form of a block device interface, and the size of the storage space can be the same or different. The storage nodes are connected through a network, and the storage processes in the storage nodes and between the storage nodes are communicated through connection established through network ports.

Specifically, in order to accurately manage the storage process, the candidate storage process in the target state in the target storage node is accurately acquired first, so that the candidate storage process in the target state can be conveniently operated subsequently, and whether the candidate storage process in the target state can be normally started or not is determined.

And S120, selecting a first starting number of target storage processes from the candidate storage processes each time based on a first starting interval, and starting the target storage processes until all the candidate storage processes are started and only started once.

The first starting interval may be a time when the operation target storage process starts in the first round of starting. The first boot up number is determined based on the number of storage processes in the target storage node, e.g., the first boot up number may be half of the number of all storage processes in the target storage node.

Specifically, candidate storage processes in a target state in the target storage node are obtained, a first starting number of target storage processes are selected from the candidate storage processes based on a first starting interval, the target storage processes are started, meanwhile, the started storage processes are marked as started once, so that the target storage processes are selected from the candidate storage processes next time to avoid the marked storage processes, and therefore all the candidate storage processes are ensured to be started once.

Optionally, the first starting interval is determined according to attribute information of a storage space corresponding to the storage process and management capability of the storage process. The first start interval may be determined according to the following formula:

Wherein T represents a first start interval, v represents a read speed of a storage space, m1 represents a number of unit capacities required by a storage process to manage the storage space, and m2 represents a number of unit capacities required by the storage process to manage written data objects; a represents the total capacity of the storage space corresponding to the storage process, b represents the storage space capacity of the storage process support management of unit capacity,/> C represents the data volume capacity of the data objects written by the storage process, d represents the average capacity of the individual data objects, and e represents the number of data objects that the storage process per unit capacity supports management.

Specifically, the attribute information of the storage space corresponding to the storage process and the management capability of the storage process include variables involved in the formula, the unit capacity is 1bit, m1 represents how many bits are needed for the storage process to manage the total capacity of the storage space, that is, m1 is equal to the total capacity of the storage space corresponding to osd divided by the capacity of the storage process managed by 1bit,Representing a first time required to be consumed for managing the total capacity of the storage space according to the read speed of the storage space; m2 represents how many bits are needed to store the current write data object of the process management storage space, i.e., m2 is equal to the number of data objects currently stored in the corresponding storage space of the osd divided by the number of storage objects managed by 1bit of the process, and is equal to the number of data objects currently stored in the osd corresponding storage space, i.e./>Representing a second time required to be consumed for managing all current written data objects according to the read speed of the storage space; adding the first time and the second time may be used as a time to start the candidate storage process in the first round. Where c/d represents the number of data objects that the osc is currently writing. Because the attribute information of the storage process corresponding to the storage space and the management capability of the storage process are different for different systems, that is, the number of data objects of the storage process support management of the storage space capacity and the bit capacity of the storage process support management of the unit capacity has different values for different systems, the attribute information of the storage process corresponding to the storage space and the management capability of the storage process are taken into consideration in the formula to obtain the first starting interval, so that the candidate storage process can normally complete the process of converting from the target state to the state of providing service in the first starting interval as much as possible, and further whether the candidate storage process fails or not is accurately judged.

In a possible embodiment, optionally, based on the first starting interval, a first starting number of target storage processes are selected from the candidate storage processes at a time, and the target storage processes are started until all the candidate storage processes are started and only started once, including steps A1-A6:

a1, determining a first list according to the candidate storage process;

a2, determining a second list according to the selected target storage process, and judging whether the selected storage process is in the second list or not when each selection is performed;

Step A3, if not, determining that the selected storage process is a target storage process, and adding the target storage process into the second list;

step A4, if not, judging whether the first list is equal to the second list;

Step A5, if the storage process is equal to the storage process, determining that all the candidate storage processes are started and only started once;

and step A6, if the first starting interval is not equal to the first starting interval, continuing to select the target storage process.

Wherein the first list may be a list of candidate storage processes. The second list may be a stored process in the first list that has completed a startup.

Specifically, a candidate storage process in a target state in a target storage node is obtained and put into a first list, then a first starting number of target storage processes are selected from the candidate storage processes, in order to avoid the state that the storage processes are always in the starting state due to the secondary starting of the storage processes, whether the selected storage processes are in a second list or not needs to be judged in the selection process, the storage processes which are not in the second list are used as the target storage processes, and the target storage processes are stored in the second list, so that when the subsequent operation of selecting the target storage processes based on the first starting interval is performed, the storage processes are compared with the second list, and the storage processes in the second list can be prevented from being started for the second time;

if the storage process is found to be in the second list, comparing whether the first list is equal to the second list, and if so, indicating that all candidate storage processes in the round are started and only started once, and the operation of selecting the target storage process based on the first starting interval cannot be continued, so that the storage process is prevented from being started for the second time; if the first list is not equal to the second list, and the storage process is not started, the operation of selecting the target storage process based on the first starting interval is continued.

After all candidate storage processes are started once, namely the process starting of the round is completed, the second list is emptied, the storage process which is successfully started in the round is determined, and the storage process which is successfully started in the round is deleted from the first list, so that the storage process which is successfully started in the next round is not started again in the process starting of the round, and the process starting efficiency is improved.

According to the technical scheme, whether the storage process is started or not can be accurately judged by judging whether the selected storage process is in the second list, so that the storage process is ensured to be started only once in one round; meanwhile, if the storage process is in the second list, whether all candidate storage processes are started and only started once can be effectively determined by comparing whether the first list is equal to the second list, namely whether the round is completed or not, so that the storage process can be efficiently started, the situation that the storage process is started for multiple times and is continuously in a starting state is avoided, and whether the storage process fails or not cannot be accurately determined.

S130, determining the next starting quantity in the next round according to the process starting result of the round, and/or determining the next starting interval in the next round according to the starting round of the next round and the starting interval of the first round, so as to start the next round of the candidate storage process until the starting is stopped in the preset round.

The process starting result of the present round may be a situation that the candidate storage process of the present round is started, for example, the process starting result of the present round may include the existence or non-existence of the storage process that is successfully started; and deleting the storage process which is successfully started from the candidate storage process to update the candidate storage process, so that the storage process is ensured not to be started for the second time, and the starting efficiency of the storage process is improved. The preset round can be determined according to the actual condition of the system.

Specifically, in the process starting flow, if all the candidate storage processes are successfully started and the preset round is not reached, starting is stopped, and because all the candidate storage processes are started, the candidate storage processes are normal, and starting is not required to be repeated again; in addition, if the candidate storage process is not started successfully after the preset round is finished, the storage process is indicated to have faults and needs to be repaired. The starting interval of each turn is increased, so that the next starting interval in the next turn is determined according to the starting interval of the next turn and the starting interval of the first turn as long as the process of the next turn is started; the next start number does not necessarily change, so the process start result of this round needs to be analyzed to determine whether to reduce the next start number.

Optionally, determining the next start interval in the next round according to the start round of the next round and the start interval of the first round includes:

Determining a next start interval for the next round according to the following formula:

Tⁿ＝T+(n-1)M

Wherein T ⁿ represents the next starting interval of the next round, T represents the first starting interval of the first round, N represents the starting round of the next round, N is 1-N, N is a preset round, M is an increment time interval, the increment time interval is determined according to the attribute information of the storage space corresponding to the storage process and the management capability of the storage process, V denotes the read speed of the memory space, m2 denotes the number of units of capacity required by the memory process to manage the written data objects,/>C represents the data volume capacity of the data objects written by the storage process, d represents the average capacity of the individual data objects, and e represents the number of data objects that the storage process per unit capacity supports management. c/d represents the number of data objects written, the unit capacity being 1bit.

Specifically, according to different application scenarios, the attribute information of the storage space corresponding to the storage process and the management capability of the storage process are different, for example, the corresponding storage space size, the current written data size, the number of written data objects and the like are different, so that the time from the state of not providing service to the state of providing service of the storage process is not a fixed value, and therefore the next starting interval in the next round needs to be accurately determined to ensure that the storage process can be started.

In a possible embodiment, optionally, determining the next start number in the next round according to the process start result of the present round includes steps B1-B3:

And B1, judging whether a storage process which is successfully started exists in the process starting result of the current round.

And B2, if the starting quantity does not exist, reducing the starting quantity in the round based on the preset reduction quantity, and determining the next starting quantity.

And B3, if the number of the starting times is equal to the starting number in the current round, determining that the next starting number is equal to the starting number in the current round.

The preset reduction amount may be determined according to the actual situation of the system, and is not specifically limited.

Specifically, the process starting result of the current round is obtained, whether a storage process which is successfully started exists in the process starting result of the current round is judged, if the storage process is not exist, the fact that the starting quantity of the selected current round is too large may influence the starting of the storage process is indicated, and therefore the next starting quantity is determined by subtracting the preset reduction quantity from the starting quantity of the current round is needed, so that the storage starting is not influenced because of too many target storage processes; if the starting data quantity exists, the starting data quantity in the current round is maintained for the next round, namely, the next starting data quantity is equal to the starting data quantity in the current round.

According to the technical scheme, whether the storage process which is successfully started exists in the process starting result of the round is judged, the next starting quantity is accurately determined, the problem that the storage process is successfully started due to too many starting quantities of the target storage processes is effectively avoided, and therefore whether the storage process fails or not is effectively judged.

According to the technical scheme, a candidate storage process in a target state in a target storage node is obtained; wherein the target state refers to a state in which no service is provided; then, based on a first starting interval, selecting a first starting number of target storage processes from the candidate storage processes each time, and starting the target storage processes until all the candidate storage processes are started and only started once, so that the candidate storage processes are prevented from being in a continuous starting state to influence the normal starting of the storage processes; finally, determining the next starting quantity in the next round according to the process starting result of the round, and/or determining the next starting interval in the next round according to the starting round of the next round and the starting interval of the first round, so as to start the next round of the candidate storage process until the preset round of stopping starting is reached; furthermore, the keep-alive efficiency of the storage process is improved under the condition that the number of fault storage processes in the distributed storage system is unknown and the service models of the storage processes are different.

Example two

Fig. 2 is a flowchart of a method for managing a storage process according to an embodiment of the present invention. The present embodiment is a possible implementation manner of a management method of a storage process, and specifically includes the following steps:

Referring to fig. 2, before acquiring a candidate storage process in a target state in a target storage node, in order to ensure that a process start procedure can be effectively performed, it is required to determine whether there is a process start procedure being executed according to a preset execution interval; if the process starting flow exists, the process starting flow needs to be continued to wait for the end of the ongoing process starting flow, namely the judgment is ended, the process starting flow is not executed, and the ongoing process starting flow is normally executed.

If not, starting a process starting flow, wherein the specific process is as follows:

1) And acquiring a candidate storage process in a target state, putting the candidate storage process into a first list, creating a second list, setting a first starting interval N, assigning N to a starting interval T, and setting the increment interval time as M.

2) Every T minutes, selecting a first starting number (K) of target storage processes from the first list, if the storage processes exist in the second list, skipping the storage processes, not starting, and storing the started storage processes in the second list until the first list is equal to the second list, wherein the first list indicates that the storage processes of the first list are all started once, which is called a round.

3) Determining the remaining round i, carrying out round g, deleting the storage process which is started successfully in the first list of the round from the first list to update the first list as the first list of the next round, and simultaneously emptying the second list, so that the storage process is prevented from being selected due to the fact that the storage process still exists in the second list, and misjudgment on the storage process is avoided; while operating g=g+1, i=i-1. If the first list has further candidate storage processes for the target state and there are no storage processes to delete, then k=k-1, otherwise K is unchanged. The modification for the start interval T is: t=n+g.

4) Repeating the processes of 2) and 3), and ending the process starting flow when the remaining round i is zero.

5) The next time the start-up procedure is performed, the operations of 1), 2), 3) and 4) are repeated.

According to the technical scheme, before the candidate storage process in the target state in the target storage node is acquired, whether the process starting flow is executed is judged according to the preset execution interval, so that the process starting flow can be effectively carried out, and the problem that the storage process is started for multiple times to influence the fault judgment of the storage process because the process starting flow is restarted when the process starting flow is carried out is avoided. When the process starting flow can be normally started, acquiring a candidate storage process in a target state in a target storage node; then, based on a first starting interval, selecting a first starting number of target storage processes from the candidate storage processes each time, and starting the target storage processes until all the candidate storage processes are started and only started once, so that the candidate storage processes are prevented from being in a continuous starting state to influence the normal starting of the storage processes; finally, determining the next starting quantity in the next round according to the process starting result of the round, and/or determining the next starting interval in the next round according to the starting round of the next round and the starting interval of the first round, so as to start the next round of the candidate storage process until the preset round of stopping starting is reached; under the condition that the number of fault storage processes in the distributed storage system is unknown and the service models of the storage processes are different, the keep-alive efficiency of the storage processes is improved.

Example III

Fig. 3 is a schematic structural diagram of a management device for a storage process according to an embodiment of the present invention. As shown in fig. 3, the apparatus includes:

A storage process obtaining module 210, configured to obtain a candidate storage process in a target state in a target storage node; wherein the target state refers to a state in which no service is provided;

The first starting module 220 is configured to select a first starting number of target storage processes from the candidate storage processes each time based on a first starting interval, and start the target storage processes until all candidate storage processes are started and only started once;

The second starting module 230 is configured to determine the next starting number in the next round according to the process starting result of the current round, and/or determine the next starting interval in the next round according to the starting round of the next round and the starting interval of the first round, so as to start the next round of the candidate storage process until a preset round of stopping starting is reached.

Optionally, the first starting interval is determined according to attribute information of a storage space corresponding to the storage process and management capability of the storage process;

The first starting number is determined according to the number of storage processes in the target storage node.

Optionally, the first start interval is determined according to the following formula:

Optionally, the second starting module includes a starting interval determining unit, specifically configured to:

determining a next start interval of the next round according to the following formula;

Tⁿ＝T+(n-1)M

Wherein T ⁿ represents the next starting interval of the next round, T represents the first starting interval of the first round, N represents the starting round of the next round, N is 1-N, N is a preset round, M is an increment time interval, the increment time interval is determined according to the attribute information of the storage space corresponding to the storage process and the management capability of the storage process, V denotes the read speed of the memory space, m2 denotes the number of units of capacity required by the memory process to manage the written data objects,/>C represents the data volume capacity of the data objects written by the storage process, d represents the average capacity of the individual data objects, and e represents the number of data objects that the storage process per unit capacity supports management.

Optionally, the second starting module includes a starting number determining unit, specifically configured to:

Judging whether a storage process which is successfully started exists in the process starting result of the current round;

If the starting quantity does not exist, reducing the starting quantity in the round based on the preset reduction quantity, and determining the next starting quantity;

If so, determining that the next starting number is equal to the starting number in the current round.

Optionally, the first starting module is specifically configured to:

Determining a first list according to the candidate storage process;

Determining a second list according to the selected target storage process, and judging whether the selected storage process is in the second list or not when each selection is performed;

If not, determining that the selected storage process is a target storage process, and adding the target storage process into the second list;

Otherwise, judging whether the first list is equal to a second list;

if so, determining that all candidate storage processes are started and starting only once;

if not, continuing to select the target storage process based on the first starting interval.

Optionally, the storage process obtaining module further includes a judging unit, specifically configured to:

judging whether a process starting flow is being executed according to a preset execution interval;

if the process starting flow does not exist, starting the process starting flow, and normally executing the process starting flow which is being executed;

Otherwise, the judgment is ended.

The management device for the storage process provided by the embodiment of the invention can execute the management method for the storage process provided by any embodiment of the invention, and has the corresponding functional modules and beneficial effects of the execution method.

The technical scheme of the application is used for acquiring, storing, using and processing the data, and the like, which accords with the relevant regulations of national laws and regulations and does not violate the popular public order.

Example IV

According to embodiments of the present disclosure, the present disclosure also provides an electronic device, a readable storage medium and a computer program product.

Fig. 4 is a schematic diagram of an electronic device that may be used to implement a method for managing a storage process according to an embodiment of the present invention. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. Electronic equipment may also represent various forms of mobile devices, such as personal digital processing, cellular telephones, smartphones, wearable devices (e.g., helmets, glasses, watches, etc.), and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be exemplary only, and are not meant to limit implementations of the inventions described and/or claimed herein.

As shown in fig. 4, the electronic device 10 includes at least one processor 11, and a memory, such as a Read Only Memory (ROM) 12, a Random Access Memory (RAM) 13, etc., communicatively connected to the at least one processor 11, in which the memory stores a computer program executable by the at least one processor, and the processor 11 may perform various appropriate actions and processes according to the computer program stored in the Read Only Memory (ROM) 12 or the computer program loaded from the storage unit 18 into the Random Access Memory (RAM) 13. In the RAM 13, various programs and data required for the operation of the electronic device 10 may also be stored. The processor 11, the ROM 12 and the RAM 13 are connected to each other via a bus 14. An input/output (I/O) interface 15 is also connected to bus 14.

Various components in the electronic device 10 are connected to the I/O interface 15, including: an input unit 16 such as a keyboard, a mouse, etc.; an output unit 17 such as various types of displays, speakers, and the like; a storage unit 18 such as a magnetic disk, an optical disk, or the like; and a communication unit 19 such as a network card, modem, wireless communication transceiver, etc. The communication unit 19 allows the electronic device 10 to exchange information/data with other devices via a computer network, such as the internet, and/or various telecommunication networks.

The processor 11 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of processor 11 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various specialized Artificial Intelligence (AI) computing chips, various processors running machine learning model algorithms, digital Signal Processors (DSPs), and any suitable processor, controller, microcontroller, etc. The processor 11 performs the respective methods and processes described above, for example, a management method of a storage process.

In some embodiments, the method of managing storage processes may be implemented as a computer program tangibly embodied on a computer-readable storage medium, such as storage unit 18. In some embodiments, part or all of the computer program may be loaded and/or installed onto the electronic device 10 via the ROM 12 and/or the communication unit 19. When the computer program is loaded into the RAM 13 and executed by the processor 11, one or more steps of the above-described management method of the storage process may be performed. Alternatively, in other embodiments, the processor 11 may be configured to perform the management method of the stored procedure in any other suitable way (e.g. by means of firmware).

Various implementations of the systems and techniques described here above can be implemented in digital electronic circuitry, integrated circuit systems, field Programmable Gate Arrays (FPGAs), application Specific Integrated Circuits (ASICs), application Specific Standard Products (ASSPs), systems On Chip (SOCs), complex Programmable Logic Devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs, the one or more computer programs may be executed and/or interpreted on a programmable system including at least one programmable processor, which may be a special purpose or general-purpose programmable processor, that may receive data and instructions from, and transmit data and instructions to, a storage system, at least one input device, and at least one output device.

A computer program for carrying out methods of the present invention may be written in any combination of one or more programming languages. These computer programs may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the computer programs, when executed by the processor, cause the functions/acts specified in the flowchart and/or block diagram block or blocks to be implemented. The computer program may execute entirely on the machine, partly on the machine, as a stand-alone software package, partly on the machine and partly on a remote machine or entirely on the remote machine or server.

In the context of the present invention, a computer-readable storage medium may be a tangible medium that can contain, or store a computer program for use by or in connection with an instruction execution system, apparatus, or device. The computer readable storage medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. Alternatively, the computer readable storage medium may be a machine readable signal medium. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

To provide for interaction with a user, the systems and techniques described here can be implemented on an electronic device having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) through which a user can provide input to the electronic device. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user may be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic input, speech input, or tactile input.

The systems and techniques described here can be implemented in a computing system that includes a background component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such background, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), wide Area Networks (WANs), blockchain networks, and the internet.

The computing system may include clients and servers. The client and server are typically remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The server can be a cloud server, also called a cloud computing server or a cloud host, and is a host product in a cloud computing service system, so that the defects of high management difficulty and weak service expansibility in the traditional physical hosts and VPS service are overcome.

It should be appreciated that various forms of the flows shown above may be used to reorder, add, or delete steps. For example, the steps described in the present invention may be performed in parallel, sequentially, or in a different order, so long as the desired results of the technical solution of the present invention are achieved, and the present invention is not limited herein.

The above embodiments do not limit the scope of the present invention. It will be apparent to those skilled in the art that various modifications, combinations, sub-combinations and alternatives are possible, depending on design requirements and other factors. Any modifications, equivalent substitutions and improvements made within the spirit and principles of the present invention should be included in the scope of the present invention.

Claims

1. A method of managing a storage process, comprising:

2. The method of claim 1, wherein the first initiation interval is determined according to attribute information of a storage space corresponding to the storage process and management capability of the storage process;

3. The method of claim 2, wherein the first initiation interval is determined according to the formula:

4. The method of claim 1, wherein determining the next start interval in the next round based on the start round of the next round and the start interval of the first round comprises:

Tⁿ＝T+(n-1)M；

5. The method of claim 1, wherein determining the next number of starts in the next round based on the process start result for the present round comprises:

6. The method of claim 1, wherein selecting a first boot number of target storage processes from the candidate storage processes at a time based on a first boot interval and booting the target storage processes until all candidate storage processes are booted and only booted once, comprises:

Determining a first list according to the candidate storage process;

Otherwise, judging whether the first list is equal to a second list;

7. The method of claim 1, wherein prior to acquiring the candidate storage process in the target state in the target storage node, the method further comprises:

if not, starting a process starting flow;

otherwise, the judgment is ended, and the executing process starting flow is normally executed.

8. A management apparatus for a storage process, comprising:

9. An electronic device, the electronic device comprising:

at least one processor; and

A memory communicatively coupled to the at least one processor; wherein,

The memory stores a computer program executable by the at least one processor to enable the at least one processor to perform the method of managing a storage process according to any one of claims 1-7.

10. A computer readable storage medium storing computer instructions for causing a processor to implement the method of managing a storage process according to any one of claims 1-7 when executed.