CN113806092A - Storage device management method, system, device and medium - Google Patents
Storage device management method, system, device and medium Download PDFInfo
- Publication number
- CN113806092A CN113806092A CN202111100847.3A CN202111100847A CN113806092A CN 113806092 A CN113806092 A CN 113806092A CN 202111100847 A CN202111100847 A CN 202111100847A CN 113806092 A CN113806092 A CN 113806092A
- Authority
- CN
- China
- Prior art keywords
- shared information
- feature matching
- initiator
- determining
- scheduling center
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000007726 management method Methods 0.000 title claims abstract description 16
- 239000013598 vector Substances 0.000 claims abstract description 51
- 239000003999 initiator Substances 0.000 claims description 67
- 238000000034 method Methods 0.000 claims description 15
- 230000004044 response Effects 0.000 claims description 9
- 238000004590 computer program Methods 0.000 claims description 8
- 230000004048 modification Effects 0.000 abstract description 9
- 238000012986 modification Methods 0.000 abstract description 9
- 238000012423 maintenance Methods 0.000 description 6
- 238000010586 diagram Methods 0.000 description 3
- 230000006870 function Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000012545 processing Methods 0.000 description 2
- 238000011084 recovery Methods 0.000 description 2
- 238000004458 analytical method Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000014509 gene expression Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
- G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
- G06F9/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
- G06F9/5016—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals the resource being the memory
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The invention discloses a storage device management method, which comprises the following steps: responding to a first-level dispatching center receiving shared information uploaded by an edge node, and sending the shared information to other edge nodes, wherein the shared information comprises a fault repairing scheme and a feature matching vector of the edge node; responding to the other edge nodes receiving the shared information, acquiring the feature matching vectors of the nodes and calculating the similarity of the feature matching vectors and the feature matching vectors in the shared information; and responding to the similarity not less than the threshold value, and the other edge nodes locally reserve the fault repairing scheme in the shared information. The invention also discloses a system, a computer device and a readable storage medium. The scheme provided by the invention can realize the sharing of the fault modification scheme among the edge nodes, thereby achieving the capability of quickly positioning and solving the problem.
Description
Technical Field
The invention relates to the field of fault processing, in particular to a storage device management method, a system, a device and a storage medium.
Background
In a big data era, the data volume and the storage equipment are increased rapidly, and the management and upgrading work of the storage equipment is increasingly complicated. In order to facilitate the unified management of the storage devices, a relatively perfect intelligent storage management platform has been developed at present, so as to implement the unified monitoring and management of the storage devices, and provide the functions of disaster recovery backup, hard disk failure prediction, performance analysis, automatic deployment, and the like. The existing solution is that when the storage device fails, the fault can be located, corresponding development or maintenance personnel can be found according to the located fault, and the problem can be solved according to the solution in hands of the personnel. And thus a waste of labor and time costs. All lack a quick and effective way to handle faults.
Disclosure of Invention
In view of the above, in order to overcome at least one aspect of the above problems, an embodiment of the present invention provides a storage device management method, including:
responding to a first-level dispatching center receiving shared information uploaded by an edge node, and sending the shared information to other edge nodes, wherein the shared information comprises a fault repairing scheme and a feature matching vector of the edge node;
responding to the other edge nodes receiving the shared information, acquiring the feature matching vectors of the nodes and calculating the similarity of the feature matching vectors and the feature matching vectors in the shared information;
and responding to the similarity not less than the threshold value, and the other edge nodes locally reserve the fault repairing scheme in the shared information.
In some embodiments, in response to the primary scheduling center receiving the shared information uploaded by the edge node, the primary scheduling center issues the shared information to other edge nodes, and the method further includes:
responding to a sharing request received by a primary scheduling center, determining a secondary scheduling center according to parameters corresponding to the sharing request, and returning the secondary scheduling center to an initiator of the sharing request;
the initiator sends a sharing request to the secondary dispatching center node again;
responding to the second-level scheduling center receiving the sharing request, determining a cache node and returning the cache node to the initiator;
and the initiator sends the shared information to the cache node so as to upload the shared information to a primary scheduling center through the cache node.
In some embodiments, determining a secondary scheduling center according to a parameter corresponding to the sharing request further includes:
determining an area according to the IP address of the initiator;
and determining the secondary dispatching centers returned to the initiator according to the loads corresponding to the secondary dispatching centers in the area.
In some embodiments, the initiator sends the shared information to the cache node, further comprising:
determining a plurality of feature matching items and acquiring the error times corresponding to each feature matching item;
and constructing a feature matching vector by using the error times of each feature matching item.
Based on the same inventive concept, according to another aspect of the present invention, an embodiment of the present invention further provides a storage device management system, including:
the primary dispatching center module is configured to respond to the fact that the primary dispatching center receives shared information uploaded by edge nodes, and issue the shared information to other edge nodes, wherein the shared information comprises a fault repairing scheme and feature matching vectors of the edge nodes;
the computing module is configured to respond to the fact that the other edge nodes receive the shared information, obtain feature matching vectors of the nodes and compute similarity between the feature matching vectors and the feature matching vectors in the shared information;
and the saving module is configured to respond to that the similarity is not less than a threshold value, and the other edge nodes keep the fault repairing scheme in the shared information locally.
In some embodiments, the primary dispatch center module is further configured to:
responding to a sharing request received by a primary scheduling center, determining a secondary scheduling center according to parameters corresponding to the sharing request, and returning the secondary scheduling center to an initiator of the sharing request;
the initiator sends a sharing request to the secondary dispatching center node again;
responding to the second-level scheduling center receiving the sharing request, determining a cache node and returning the cache node to the initiator;
and the initiator sends the shared information to the cache node so as to upload the shared information to a primary scheduling center through the cache node.
In some embodiments, the primary dispatch center module is further configured to:
determining an area according to the IP address of the initiator;
and determining the secondary dispatching centers returned to the initiator according to the loads corresponding to the secondary dispatching centers in the area.
In some embodiments, the primary dispatch center module is further configured to:
determining a plurality of feature matching items and acquiring the error times corresponding to each feature matching item;
and constructing a feature matching vector by using the error times of each feature matching item.
Based on the same inventive concept, according to another aspect of the present invention, an embodiment of the present invention further provides a computer apparatus, including:
at least one processor; and
a memory storing a computer program operable on the processor, wherein the processor executes the program to perform the steps of:
responding to a first-level dispatching center receiving shared information uploaded by an edge node, and sending the shared information to other edge nodes, wherein the shared information comprises a fault repairing scheme and a feature matching vector of the edge node;
responding to the other edge nodes receiving the shared information, acquiring the feature matching vectors of the nodes and calculating the similarity of the feature matching vectors and the feature matching vectors in the shared information;
and responding to the similarity not less than the threshold value, and the other edge nodes locally reserve the fault repairing scheme in the shared information.
In some embodiments, in response to the primary scheduling center receiving the shared information uploaded by the edge node, the primary scheduling center issues the shared information to other edge nodes, and the method further includes:
responding to a sharing request received by a primary scheduling center, determining a secondary scheduling center according to parameters corresponding to the sharing request, and returning the secondary scheduling center to an initiator of the sharing request;
the initiator sends a sharing request to the secondary dispatching center node again;
responding to the second-level scheduling center receiving the sharing request, determining a cache node and returning the cache node to the initiator;
and the initiator sends the shared information to the cache node so as to upload the shared information to a primary scheduling center through the cache node.
In some embodiments, determining a secondary scheduling center according to a parameter corresponding to the sharing request further includes:
determining an area according to the IP address of the initiator;
and determining the secondary dispatching centers returned to the initiator according to the loads corresponding to the secondary dispatching centers in the area.
In some embodiments, the initiator sends the shared information to the cache node, further comprising:
determining a plurality of feature matching items and acquiring the error times corresponding to each feature matching item;
and constructing a feature matching vector by using the error times of each feature matching item.
Based on the same inventive concept, according to another aspect of the present invention, an embodiment of the present invention further provides a computer-readable storage medium storing a computer program which, when executed by a processor, performs the steps of:
responding to a first-level dispatching center receiving shared information uploaded by an edge node, and sending the shared information to other edge nodes, wherein the shared information comprises a fault repairing scheme and a feature matching vector of the edge node;
responding to the other edge nodes receiving the shared information, acquiring the feature matching vectors of the nodes and calculating the similarity of the feature matching vectors and the feature matching vectors in the shared information;
and responding to the similarity not less than the threshold value, and the other edge nodes locally reserve the fault repairing scheme in the shared information.
In some embodiments, in response to the primary scheduling center receiving the shared information uploaded by the edge node, the primary scheduling center issues the shared information to other edge nodes, and the method further includes:
responding to a sharing request received by a primary scheduling center, determining a secondary scheduling center according to parameters corresponding to the sharing request, and returning the secondary scheduling center to an initiator of the sharing request;
the initiator sends a sharing request to the secondary dispatching center node again;
responding to the second-level scheduling center receiving the sharing request, determining a cache node and returning the cache node to the initiator;
and the initiator sends the shared information to the cache node so as to upload the shared information to a primary scheduling center through the cache node.
In some embodiments, determining a secondary scheduling center according to a parameter corresponding to the sharing request further includes:
determining an area according to the IP address of the initiator;
and determining the secondary dispatching centers returned to the initiator according to the loads corresponding to the secondary dispatching centers in the area.
In some embodiments, the initiator sends the shared information to the cache node, further comprising:
determining a plurality of feature matching items and acquiring the error times corresponding to each feature matching item;
and constructing a feature matching vector by using the error times of each feature matching item.
The invention has one of the following beneficial technical effects: the scheme provided by the invention can realize the sharing of the fault modification scheme among the edge nodes, thereby achieving the capability of quickly positioning and solving the problem. The problems and solutions stored according to the matching degree of the characteristic values are most probably the problems encountered currently or in the future, so that the time for positioning the problems and solving the problems is greatly saved.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other embodiments can be obtained by using the drawings without creative efforts.
FIG. 1 is a flowchart illustrating a storage device management method according to an embodiment of the present invention;
FIG. 2 is a schematic structural diagram of a storage device management system according to an embodiment of the present invention;
FIG. 3 is a schematic structural diagram of a computer device provided in an embodiment of the present invention;
fig. 4 is a schematic structural diagram of a computer-readable storage medium according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the following embodiments of the present invention are described in further detail with reference to the accompanying drawings.
It should be noted that all expressions using "first" and "second" in the embodiments of the present invention are used for distinguishing two entities with the same name but different names or different parameters, and it should be noted that "first" and "second" are merely for convenience of description and should not be construed as limitations of the embodiments of the present invention, and they are not described in any more detail in the following embodiments.
According to an aspect of the present invention, an embodiment of the present invention provides a storage device management method, as shown in fig. 1, which may include the steps of:
s1, responding to the shared information uploaded by the edge node received by the primary dispatching center, and sending the shared information to other edge nodes, wherein the shared information comprises a fault repairing scheme and a feature matching vector of the edge node;
s2, responding to the shared information received by other edge nodes, acquiring the feature matching vector of the node and calculating the similarity with the feature matching vector in the shared information;
s3, responding to the similarity not less than the threshold, the other edge nodes keep the fault repairing scheme in the shared information locally.
The scheme provided by the invention can realize the sharing of the fault modification scheme among the edge nodes, thereby achieving the capability of quickly positioning and solving the problem. The problems and solutions stored according to the matching degree of the characteristic values are most probably the problems encountered currently or in the future, so that the time for positioning the problems and solving the problems is greatly saved.
In some embodiments, S1, in response to the primary scheduling center receiving the shared information uploaded by the edge node, issuing the shared information to other edge nodes, further includes:
responding to a sharing request received by a primary scheduling center, determining a secondary scheduling center according to parameters corresponding to the sharing request, and returning the secondary scheduling center to an initiator of the sharing request;
the initiator sends a sharing request to the secondary dispatching center node again;
responding to the second-level scheduling center receiving the sharing request, determining a cache node and returning the cache node to the initiator;
and the initiator sends the shared information to the cache node so as to upload the shared information to a primary scheduling center through the cache node.
In some embodiments, determining a secondary scheduling center according to a parameter corresponding to the sharing request further includes:
determining an area according to the IP address of the initiator;
and determining the secondary dispatching centers returned to the initiator according to the loads corresponding to the secondary dispatching centers in the area.
Specifically, after the fault of the edge node is repaired, the maintenance personnel may initiate a request to the primary scheduling center. And the primary scheduling center selects a secondary scheduling center of the area to which the maintainer belongs according to the IP address of the maintainer and the request content of the maintainer, and tells the maintainer to initiate a request to the equipment. The secondary dispatching center can select a proper cache server for the maintenance personnel to provide service. The selection basis comprises: device IP, maintenance staff distance, request content, server load conditions. And the secondary dispatching center returns the IP address of the server to the maintenance personnel. And the maintenance personnel sends content including equipment IP, solutions and the like to the cache server according to the IP address. And finally, the cache server uploads the solution to a primary scheduling center.
The solution is uploaded to the primary scheduling center through the cache server without uploading at an edge node, so that the situation that the solution cannot be uploaded all the time due to network faults is prevented.
After the primary dispatching center receives the solution, the solution is distributed to each secondary dispatching center node through a network distribution technology and then distributed to the edge nodes by the secondary dispatching center nodes, and sharing to each edge node is achieved.
In some embodiments, the initiator sends the shared information to the cache node, further comprising:
determining a plurality of feature matching items and acquiring the error times corresponding to each feature matching item;
and constructing a feature matching vector by using the error times of each feature matching item.
Specifically, after receiving the shared solution, the edge node first performs characteristic value matching, and performs different processing on the message according to the matching result of the characteristic values. And (4) adopting Euclidean algorithm to calculate the similarity of the storage equipment according to the characteristic value acquisition and matching principle.
In some embodiments, the feature value obtaining and matching rules may be as follows:
acquiring configuration information of a local storage device, including: CPU configuration, internal memory, hard disk configuration, software version, storage disk type, storage disk capacity, external plug-in card configuration and the like.
And constructing a storage device vector according to the error times caused by the configuration information of the storage device.
The similarity between the storage devices is calculated according to the euclidean algorithm.
For example, the error times caused by the configuration of the CPU, the internal memory, the configuration of the hard disk, the software version, the type of the storage disk, the capacity of the storage disk, and the configuration of the add-in card are (1, 1, 2, 2, 3, 3, 0), respectively; the error times caused by CPU configuration, internal memory, hard disk configuration, software version, storage disk model, storage disk capacity and external card configuration are (1, 1, 1, 1, 1, 0). Then, according to the Euclidean algorithm, the similarity of the edge nodes A and B is obtained as follows:
if the similarity of the edge nodes is more than or equal to 0.85, judging that the matching of the characteristic values of the two edge nodes is successful; otherwise the match fails.
It should be noted that, the feature matching mainly uses the CPU configuration, the internal memory, the hard disk configuration, the software version, the storage disk type, the storage disk capacity, the external card configuration, and the like as main features, and new features may be added and the weight may be recalculated if necessary in the later stage. And performing summation operation according to the weights of the characteristics, and determining whether the received information is reserved or not by taking the obtained result as a judgment basis.
In some embodiments, after matching the feature values, if the matching is successful, the shared information is saved in a local failure solution warehouse, when the system fails, firstly, the solution is retrieved in the local failure solution warehouse according to the error reporting information, and if the same problem is matched, the corresponding solution is executed. According to the scheme, if the fault can be repaired, the fault is not reported, and if the fault is not solved, the fault is reported, and the current solution is provided for reference.
If the matching fails, the distributed shared information is deleted and is not stored.
The scheme provided by the invention can realize the sharing of the fault modification scheme among the edge nodes, thereby achieving the capability of quickly positioning and solving the problem. The problems and solutions stored according to the matching degree of the characteristic values are most probably the problems encountered currently or in the future, so that the time for positioning the problems and solving the problems is greatly saved.
Based on the same inventive concept, according to another aspect of the present invention, an embodiment of the present invention further provides a storage device management system 400, as shown in fig. 2, including:
the primary scheduling center module 401 is configured to respond to a primary scheduling center receiving shared information uploaded by an edge node, and issue the shared information to other edge nodes, where the shared information includes a fault repairing scheme and feature matching vectors of the edge nodes;
a calculating module 402, configured to, in response to the other edge nodes receiving the shared information, obtain feature matching vectors of their own nodes and calculate similarity with the feature matching vectors in the shared information;
a saving module 403, configured to, in response to the similarity being not less than the threshold, the other edge nodes locally keep the failure recovery scheme in the shared information.
In some embodiments, the primary dispatch center module 401 is further configured to:
responding to a sharing request received by a primary scheduling center, determining a secondary scheduling center according to parameters corresponding to the sharing request, and returning the secondary scheduling center to an initiator of the sharing request;
the initiator sends a sharing request to the secondary dispatching center node again;
responding to the second-level scheduling center receiving the sharing request, determining a cache node and returning the cache node to the initiator;
and the initiator sends the shared information to the cache node so as to upload the shared information to a primary scheduling center through the cache node.
In some embodiments, the primary dispatch center module 401 is further configured to:
determining an area according to the IP address of the initiator;
and determining the secondary dispatching centers returned to the initiator according to the loads corresponding to the secondary dispatching centers in the area.
In some embodiments, the primary dispatch center module 401 is further configured to:
determining a plurality of feature matching items and acquiring the error times corresponding to each feature matching item;
and constructing a feature matching vector by using the error times of each feature matching item.
The scheme provided by the invention can realize the sharing of the fault modification scheme among the edge nodes, thereby achieving the capability of quickly positioning and solving the problem. The problems and solutions stored according to the matching degree of the characteristic values are most probably the problems encountered currently or in the future, so that the time for positioning the problems and solving the problems is greatly saved.
Based on the same inventive concept, according to another aspect of the present invention, as shown in fig. 3, an embodiment of the present invention further provides a computer apparatus 501, comprising:
at least one processor 520; and
a memory 510, the memory 510 storing a computer program 511 executable on the processor, the processor 520 executing the program to perform the steps of:
s1, responding to the shared information uploaded by the edge node received by the primary dispatching center, and sending the shared information to other edge nodes, wherein the shared information comprises a fault repairing scheme and a feature matching vector of the edge node;
s2, responding to the shared information received by other edge nodes, acquiring the feature matching vector of the node and calculating the similarity with the feature matching vector in the shared information;
s3, responding to the similarity not less than the threshold, the other edge nodes keep the fault repairing scheme in the shared information locally.
In some embodiments, in response to the primary scheduling center receiving the shared information uploaded by the edge node, the primary scheduling center issues the shared information to other edge nodes, and the method further includes:
responding to a sharing request received by a primary scheduling center, determining a secondary scheduling center according to parameters corresponding to the sharing request, and returning the secondary scheduling center to an initiator of the sharing request;
the initiator sends a sharing request to the secondary dispatching center node again;
responding to the second-level scheduling center receiving the sharing request, determining a cache node and returning the cache node to the initiator;
and the initiator sends the shared information to the cache node so as to upload the shared information to a primary scheduling center through the cache node.
In some embodiments, determining a secondary scheduling center according to a parameter corresponding to the sharing request further includes:
determining an area according to the IP address of the initiator;
and determining the secondary dispatching centers returned to the initiator according to the loads corresponding to the secondary dispatching centers in the area.
In some embodiments, the initiator sends the shared information to the cache node, further comprising:
determining a plurality of feature matching items and acquiring the error times corresponding to each feature matching item;
and constructing a feature matching vector by using the error times of each feature matching item.
The scheme provided by the invention can realize the sharing of the fault modification scheme among the edge nodes, thereby achieving the capability of quickly positioning and solving the problem. The problems and solutions stored according to the matching degree of the characteristic values are most probably the problems encountered currently or in the future, so that the time for positioning the problems and solving the problems is greatly saved.
Based on the same inventive concept, according to another aspect of the present invention, as shown in fig. 4, an embodiment of the present invention further provides a computer-readable storage medium 601, where the computer-readable storage medium 601 stores computer program instructions 610, and the computer program instructions 610 are executed by a processor to perform the following steps:
s1, responding to the shared information uploaded by the edge node received by the primary dispatching center, and sending the shared information to other edge nodes, wherein the shared information comprises a fault repairing scheme and a feature matching vector of the edge node;
s2, responding to the shared information received by other edge nodes, acquiring the feature matching vector of the node and calculating the similarity with the feature matching vector in the shared information;
s3, responding to the similarity not less than the threshold, the other edge nodes keep the fault repairing scheme in the shared information locally.
In some embodiments, in response to the primary scheduling center receiving the shared information uploaded by the edge node, the primary scheduling center issues the shared information to other edge nodes, and the method further includes:
responding to a sharing request received by a primary scheduling center, determining a secondary scheduling center according to parameters corresponding to the sharing request, and returning the secondary scheduling center to an initiator of the sharing request;
the initiator sends a sharing request to the secondary dispatching center node again;
responding to the second-level scheduling center receiving the sharing request, determining a cache node and returning the cache node to the initiator;
and the initiator sends the shared information to the cache node so as to upload the shared information to a primary scheduling center through the cache node.
In some embodiments, determining a secondary scheduling center according to a parameter corresponding to the sharing request further includes:
determining an area according to the IP address of the initiator;
and determining the secondary dispatching centers returned to the initiator according to the loads corresponding to the secondary dispatching centers in the area.
In some embodiments, the initiator sends the shared information to the cache node, further comprising:
determining a plurality of feature matching items and acquiring the error times corresponding to each feature matching item;
and constructing a feature matching vector by using the error times of each feature matching item.
The scheme provided by the invention can realize the sharing of the fault modification scheme among the edge nodes, thereby achieving the capability of quickly positioning and solving the problem. The problems and solutions stored according to the matching degree of the characteristic values are most probably the problems encountered currently or in the future, so that the time for positioning the problems and solving the problems is greatly saved.
Finally, it should be noted that, as will be understood by those skilled in the art, all or part of the processes of the methods of the above embodiments may be implemented by a computer program, which may be stored in a computer-readable storage medium, and when executed, may include the processes of the embodiments of the methods described above.
Further, it should be appreciated that the computer-readable storage media (e.g., memory) herein can be either volatile memory or nonvolatile memory, or can include both volatile and nonvolatile memory.
Those of skill would further appreciate that the various illustrative logical blocks, modules, circuits, and algorithm steps described in connection with the disclosure herein may be implemented as electronic hardware, computer software, or combinations of both. To clearly illustrate this interchangeability of hardware and software, various illustrative components, blocks, modules, circuits, and steps have been described above generally in terms of their functionality. Whether such functionality is implemented as software or hardware depends upon the particular application and design constraints imposed on the overall system. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the disclosed embodiments of the present invention.
The foregoing is an exemplary embodiment of the present disclosure, but it should be noted that various changes and modifications could be made herein without departing from the scope of the present disclosure as defined by the appended claims. The functions, steps and/or actions of the method claims in accordance with the disclosed embodiments described herein need not be performed in any particular order. Furthermore, although elements of the disclosed embodiments of the invention may be described or claimed in the singular, the plural is contemplated unless limitation to the singular is explicitly stated.
It should be understood that, as used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly supports the exception. It should also be understood that "and/or" as used herein is meant to include any and all possible combinations of one or more of the associated listed items.
The numbers of the embodiments disclosed in the embodiments of the present invention are merely for description, and do not represent the merits of the embodiments.
It will be understood by those skilled in the art that all or part of the steps for implementing the above embodiments may be implemented by hardware, or may be implemented by a program instructing relevant hardware, and the program may be stored in a computer-readable storage medium, and the above-mentioned storage medium may be a read-only memory, a magnetic disk or an optical disk, etc.
Those of ordinary skill in the art will understand that: the discussion of any embodiment above is meant to be exemplary only, and is not intended to intimate that the scope of the disclosure, including the claims, of embodiments of the invention is limited to these examples; within the idea of an embodiment of the invention, also technical features in the above embodiment or in different embodiments may be combined and there are many other variations of the different aspects of the embodiments of the invention as described above, which are not provided in detail for the sake of brevity. Therefore, any omissions, modifications, substitutions, improvements, and the like that may be made without departing from the spirit and principles of the embodiments of the present invention are intended to be included within the scope of the embodiments of the present invention.
Claims (10)
1. A storage device management method, comprising the steps of:
responding to a first-level dispatching center receiving shared information uploaded by an edge node, and sending the shared information to other edge nodes, wherein the shared information comprises a fault repairing scheme and a feature matching vector of the edge node;
responding to the other edge nodes receiving the shared information, acquiring the feature matching vectors of the nodes and calculating the similarity of the feature matching vectors and the feature matching vectors in the shared information;
and responding to the similarity not less than the threshold value, and the other edge nodes locally reserve the fault repairing scheme in the shared information.
2. The method of claim 1, wherein in response to a primary scheduling center receiving shared information uploaded by an edge node, issuing the shared information to other edge nodes, further comprising:
responding to a sharing request received by a primary scheduling center, determining a secondary scheduling center according to parameters corresponding to the sharing request, and returning the secondary scheduling center to an initiator of the sharing request;
the initiator sends a sharing request to the secondary dispatching center node again;
responding to the second-level scheduling center receiving the sharing request, determining a cache node and returning the cache node to the initiator;
and the initiator sends the shared information to the cache node so as to upload the shared information to a primary scheduling center through the cache node.
3. The method of claim 2, wherein determining a secondary scheduling center according to a parameter corresponding to the shared request further comprises:
determining an area according to the IP address of the initiator;
and determining the secondary dispatching centers returned to the initiator according to the loads corresponding to the secondary dispatching centers in the area.
4. The method of claim 2, wherein the initiator sends the shared information to the caching node, further comprising:
determining a plurality of feature matching items and acquiring the error times corresponding to each feature matching item;
and constructing a feature matching vector by using the error times of each feature matching item.
5. A storage device management system, comprising:
the primary dispatching center module is configured to respond to the fact that the primary dispatching center receives shared information uploaded by edge nodes, and issue the shared information to other edge nodes, wherein the shared information comprises a fault repairing scheme and feature matching vectors of the edge nodes;
the computing module is configured to respond to the fact that the other edge nodes receive the shared information, obtain feature matching vectors of the nodes and compute similarity between the feature matching vectors and the feature matching vectors in the shared information;
and the saving module is configured to respond to that the similarity is not less than a threshold value, and the other edge nodes keep the fault repairing scheme in the shared information locally.
6. The system of claim 5, wherein the primary dispatch center module is further configured to:
responding to a sharing request received by a primary scheduling center, determining a secondary scheduling center according to parameters corresponding to the sharing request, and returning the secondary scheduling center to an initiator of the sharing request;
the initiator sends a sharing request to the secondary dispatching center node again;
responding to the second-level scheduling center receiving the sharing request, determining a cache node and returning the cache node to the initiator;
and the initiator sends the shared information to the cache node so as to upload the shared information to a primary scheduling center through the cache node.
7. The system of claim 6, wherein the primary dispatch center module is further configured to:
determining an area according to the IP address of the initiator;
and determining the secondary dispatching centers returned to the initiator according to the loads corresponding to the secondary dispatching centers in the area.
8. The system of claim 6, wherein the primary dispatch center module is further configured to:
determining a plurality of feature matching items and acquiring the error times corresponding to each feature matching item;
and constructing a feature matching vector by using the error times of each feature matching item.
9. A computer device, comprising:
at least one processor; and
memory storing a computer program operable on the processor, characterized in that the processor executes the program to perform the steps of the method according to any of claims 1-4.
10. A computer-readable storage medium, in which a computer program is stored which, when being executed by a processor, is adapted to carry out the steps of the method according to any one of claims 1-4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111100847.3A CN113806092A (en) | 2021-09-18 | 2021-09-18 | Storage device management method, system, device and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111100847.3A CN113806092A (en) | 2021-09-18 | 2021-09-18 | Storage device management method, system, device and medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113806092A true CN113806092A (en) | 2021-12-17 |
Family
ID=78939794
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111100847.3A Pending CN113806092A (en) | 2021-09-18 | 2021-09-18 | Storage device management method, system, device and medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113806092A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118101651A (en) * | 2024-02-23 | 2024-05-28 | 中国人民公安大学 | Distributed system for realizing low retention of service high-availability data |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110430071A (en) * | 2019-07-19 | 2019-11-08 | 云南电网有限责任公司信息中心 | Service node fault self-recovery method, apparatus, computer equipment and storage medium |
| CN110597946A (en) * | 2019-08-05 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Case storage method, device, equipment and storage medium |
| CN111355610A (en) * | 2020-02-25 | 2020-06-30 | 网宿科技股份有限公司 | Exception handling method and device based on edge network |
| CN111800299A (en) * | 2020-07-08 | 2020-10-20 | 广州市品高软件股份有限公司 | Operation maintenance system and method of edge cloud |
| CN112291085A (en) * | 2020-10-10 | 2021-01-29 | 北京金山云网络技术有限公司 | Fault positioning method, device, equipment and medium |
-
2021
- 2021-09-18 CN CN202111100847.3A patent/CN113806092A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110430071A (en) * | 2019-07-19 | 2019-11-08 | 云南电网有限责任公司信息中心 | Service node fault self-recovery method, apparatus, computer equipment and storage medium |
| CN110597946A (en) * | 2019-08-05 | 2019-12-20 | 腾讯科技（深圳）有限公司 | Case storage method, device, equipment and storage medium |
| CN111355610A (en) * | 2020-02-25 | 2020-06-30 | 网宿科技股份有限公司 | Exception handling method and device based on edge network |
| CN111800299A (en) * | 2020-07-08 | 2020-10-20 | 广州市品高软件股份有限公司 | Operation maintenance system and method of edge cloud |
| CN112291085A (en) * | 2020-10-10 | 2021-01-29 | 北京金山云网络技术有限公司 | Fault positioning method, device, equipment and medium |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN118101651A (en) * | 2024-02-23 | 2024-05-28 | 中国人民公安大学 | Distributed system for realizing low retention of service high-availability data |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101729412B (en) | Distributed level cluster method and system of geographic information service | |
| CN111193605B (en) | Fault positioning method and device and storage medium | |
| CN109150572B (en) | Method, device and computer readable storage medium for realizing alarm association | |
| CN112769605B (en) | Heterogeneous multi-cloud operation and maintenance management method and hybrid cloud platform | |
| CN111355610A (en) | Exception handling method and device based on edge network | |
| WO2020211561A1 (en) | Data processing method and device, storage medium and electronic device | |
| CN113361054B (en) | Route optimization method and system for power information physical system | |
| CN112764920A (en) | Edge application deployment method, device, equipment and storage medium | |
| CN112003721A (en) | Method and device for realizing high availability of large data platform management node | |
| CN114091610A (en) | Intelligent decision method and device | |
| CN113806092A (en) | Storage device management method, system, device and medium | |
| CN113656252B (en) | Fault positioning method, device, electronic equipment and storage medium | |
| CN113852476A (en) | Method, device and system for determining abnormal event associated object | |
| CN117729576A (en) | Alarm monitoring method, device, equipment and storage medium | |
| CN115242794B (en) | Method and system for regulating and controlling cloud service link path planning and fault multi-activity | |
| CN112579402A (en) | Method and device for positioning faults of application system | |
| CN116260703A (en) | Distributed message service node CPU performance fault self-recovery method and device | |
| CN115705259A (en) | Fault processing method, related device and storage medium | |
| CN114285730A (en) | Method and device for determining fault root cause and related equipment | |
| CN116976859B (en) | Intelligent campus management dormitory warranty maintenance method and system based on big data application | |
| CN118012662B (en) | Distributed fault restoration method, intelligent computing cloud operating system and computing platform | |
| CN117909418B (en) | Deep learning model storage consistency method, computing subsystem and computing platform | |
| CN117544479A (en) | Alarm source determining method, device, equipment and storage medium based on cloud core network | |
| CN117851127A (en) | Semantic model fault processing method and device, electronic equipment and storage medium | |
| CN116976859A (en) | Intelligent campus management dormitory warranty maintenance method and system based on big data application |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |