CN114513547A - Module node scheduling method and device, electronic equipment and storage medium - Google Patents
Module node scheduling method and device, electronic equipment and storage medium Download PDFInfo
- Publication number
- CN114513547A CN114513547A CN202011182825.1A CN202011182825A CN114513547A CN 114513547 A CN114513547 A CN 114513547A CN 202011182825 A CN202011182825 A CN 202011182825A CN 114513547 A CN114513547 A CN 114513547A
- Authority
- CN
- China
- Prior art keywords
- module
- node
- determining
- support
- target
- 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.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 63
- 238000004590 computer program Methods 0.000 claims description 8
- 238000001514 detection method Methods 0.000 claims description 5
- 230000003068 static effect Effects 0.000 claims description 5
- 230000006870 function Effects 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 6
- 238000010586 diagram Methods 0.000 description 5
- 239000013307 optical fiber Substances 0.000 description 2
- 230000002093 peripheral effect Effects 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 238000003491 array Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000007774 longterm Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000008707 rearrangement Effects 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
Landscapes
- Multi Processors (AREA)
- Hardware Redundancy (AREA)
Abstract
The embodiment of the invention discloses a node scheduling method and device of a module, electronic equipment and a storage medium. The method is suitable for a distributed system, wherein the distributed system comprises at least two modules, each module comprises at least one node, and the method comprises the following steps: if the current module detects a node scheduling trigger event, determining that the current module is a target module; determining to request a support module in the distributed system according to the priority of the target module; sending, by the target module, a node support request to the support module to schedule a node of the support module to process traffic of the target module. By adopting the technical means, the maximization of high-priority service and the maximization of the complete machine system capacity can be realized.
Description
Technical Field
The embodiment of the invention relates to the technical field of cross-cluster modules, in particular to a node scheduling method and device of a module, electronic equipment and a storage medium.
Background
In a distributed system product, the realization of one function often needs the cooperation of a plurality of business modules. Each module can be deployed in multiple nodes, and each module node has a corresponding capability level. Under the condition that hardware resources are fixed, when the system is deployed, considering the coordination of the whole system capacity, the capacities correspondingly provided by the number of different service module deployments are balanced with each other.
However, in the process of long-term operation of the system, a situation that some nodes gradually fail may occur, and at this time, with the difference in the number of node failures of different modules, the service capabilities correspondingly provided by the different modules may not be equal, so that the capability of the entire system is limited by the capability of the service module with the largest failure, and resources are wasted.
Therefore, a method is urgently needed to maximize the high-priority service and the capability of the whole system as much as possible.
Disclosure of Invention
The embodiment of the invention provides a node scheduling method and device of a module, electronic equipment and a storage medium, so as to realize maximization of high-priority service and complete machine system capacity.
In a first aspect, an embodiment of the present invention provides a method for scheduling nodes of modules, which is applicable to a distributed system, where the distributed system includes at least two modules, and each module includes at least one node, and the method includes:
if the current module detects a node scheduling trigger event, determining that the current module is a target module;
determining to request a support module in the distributed system according to the priority of the target module;
sending, by the target module, a node support request to the support module to schedule a node of the support module to process traffic of the target module.
In a second aspect, an embodiment of the present invention further provides a node scheduling apparatus for modules, which is applied to a distributed system, where the distributed system includes at least two modules, each module includes at least one node, and the apparatus includes:
the target module determining module is used for determining the current module as the target module if the current module detects the node scheduling trigger event;
the supporting module determining module is used for determining to request the supporting module in the distributed system according to the priority of the target module;
a node support request sending module, configured to send a node support request to the support module through the target module, so as to schedule a node of the support module to process a service of the target module.
In a third aspect, an embodiment of the present invention further provides an electronic device, including a memory, a processor, and a computer program stored in the memory and executable on the processor, where the processor executes the computer program to implement the node scheduling method of the module according to any one of the embodiments of the present invention.
In a fourth aspect, the embodiment of the present invention further provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements a node scheduling method of the module according to any of the embodiments of the present invention.
The invention provides a node scheduling method of a module, which is suitable for a distributed system, wherein the distributed system comprises at least two modules, each module comprises at least one node, and the method comprises the following steps: if the current module detects a node scheduling trigger event, determining that the current module is a target module; then determining a support module requesting a target module in the distributed system according to the priority of the target module; the support module schedules the nodes to the target module, and further, the service of the target module is processed efficiently. By adopting the technical means, the maximization of high-priority service and the maximization of the complete machine system capacity can be realized.
Drawings
Fig. 1 is a schematic flowchart of a node scheduling method for a module according to an embodiment of the present invention;
fig. 2 is a schematic flowchart of a node scheduling method for a module according to a second embodiment of the present invention;
fig. 3 is a schematic structural diagram of a node scheduling apparatus of a module according to a third embodiment of the present invention;
fig. 4 is a schematic structural diagram of an apparatus provided in the fourth embodiment of the present invention.
Detailed Description
The present invention will be described in further detail with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting of the invention. It should be further noted that, for the convenience of description, only some of the structures related to the present invention are shown in the drawings, not all of the structures.
Before discussing exemplary embodiments in more detail, it should be noted that some exemplary embodiments are described as processes or methods depicted as flowcharts. Although a flowchart may describe the steps as a sequential process, many of the steps can be performed in parallel, concurrently or simultaneously. In addition, the order of the steps may be rearranged. The process may be terminated when its operations are completed, but may have additional steps not included in the figure. The processes may correspond to methods, functions, procedures, subroutines, subprograms, and the like.
Example one
Fig. 1 is a schematic flow chart of a module node scheduling method according to an embodiment of the present invention, which is applicable to a situation of node allocation of different modules in a distributed system, and is applicable to the distributed system, where the distributed system includes at least two modules, and each module includes at least one node. The method can be executed by a node scheduling apparatus of a module, which can be implemented in software and/or hardware, and can be integrated in an electronic device, and specifically includes the following steps:
and S110, if the current module detects a node scheduling trigger event, determining that the current module is a target module.
In this embodiment, at least two modules exist in the distributed system to process different services in parallel, and for example, the modules for processing the services in the distributed system of the video monitoring management platform include: the device comprises a camera access management module, a storage establishment module, a live establishment module, a user management module and a holder management module. Each module performs a different function, and each module performs tasks via nodes within the module. In this embodiment, the current module may be any one of at least two modules in the distributed system. The node scheduling trigger event is a trigger instruction for scheduling nodes between different modules. The target module is a module for requesting support in the distributed system.
In this embodiment, optionally, if the current module detects a node scheduling trigger event, determining that the current module is the target module includes:
determining one node as a main node from the nodes running in the current module, and taking the other nodes as sub-nodes;
controlling the main node to send a node operation detection message to the sub-nodes according to a preset time interval;
and if the condition that at least one node running state in the main node or the sub-nodes is a static state is detected, determining that a node scheduling trigger event exists, and determining that the current module is a target module.
In this embodiment, there is only one master node in the current module, where the master node may be any one of the nodes currently running in the current module, or may be the first node on line in the current module. In this embodiment, if the master node fails, one node is determined again from the sub-nodes in the current module as the master node.
In this embodiment, the preset time interval is preset by a module in the distributed system. The node operation detection message is used for judging whether the node receiving the message is operating. In this embodiment, the sub-nodes may also send keep-alive messages to the master node according to a preset time interval, so that the system determines the operating state of each node.
In this embodiment, when the node operating state is a static state, it indicates that the node is currently in a fault, a node scheduling trigger event exists, and the current module is determined as the target module. The advantage of this arrangement is that target modules that need to be supported can be discovered in time, so that the capacity of the system for processing services is maximized.
In this embodiment, it may also be a case where an increase in the number of nodes is detected, and in this case, a node is converted from a fault state to a running state. At this point, the current module may be used to support other modules.
If the priority in the distributed system is higher than that of the current moduleIf the modules with the priority need to be supported, the modules with the high priority needing to be supported are sorted from big to small according to the order of the priority, so that the supported modules meet the requirement of N after being supportedz·Cz≤Maxz(ii) a Wherein N iszNumber of nodes currently being operated for supported modules, CzBeing capacity level of supported module, MaxzIs the maximum available capacity value for the supported module.
If the high-priority module in the distributed system does not need to be supported, the module with the minimum capacity value is determined by comparing the high-priority module with the high-priority module, and the module is supported. Wherein N is required to be satisfied after the supportz·Cz≤Nm·CmAnd (N)z+1)·Cz≥(Nm-1)·CmAnd N ism·Cm≤Maxm(ii) a Wherein N iszNumber of nodes currently being operated for supported modules, NmThe number of the nodes currently running for the current module; czCapacity level of supported module, CmFor capacity level of current module, MaxmThe maximum available capacity value for the current module.
If the modules with the same priority in the distributed system do not need to be supported, the modules with the lower priority are supported. Sorting the modules with low priority according to the order of the priority, wherein the supported modules meet the following requirements: n is a radical ofz·Cz≤Maxz(ii) a Wherein N iszNumber of nodes currently being operated for supported modules, CzIs the capability capacity level, Max, of the supported modulezIs the maximum available capacity value for the supported module.
And S120, determining to request the support module in the distributed system according to the priority of the target module.
In this embodiment, the priority refers to the importance of different modules in the distributed system, and the higher the priority, the higher the importance of the service processed by the module is, the larger the remaining capacity value needs to be ensured. Illustratively, the priority of the modules in the distributed system of the video surveillance management platform is from high to low as: the device access management module, the storage establishment module, the live establishment module, the user management module and the holder establishment module.
In this embodiment, the support module refers to a module of a scheduled node in the distributed system, and may be a module other than the target module.
S130, sending a node support request to the support module through the target module so as to schedule the node of the support module to process the business of the target module.
In this embodiment, the node support request is a message instruction for instructing other modules in the distributed system to schedule the node to support the target module. In this embodiment, the nodes supporting the module are relatively redundant in processing the tasks of the module. Therefore, the support module can process the service of the target module by scheduling the node of the support module, and the aim of balancing the capacity value among different modules as much as possible is fulfilled.
The embodiment of the present invention provides a node scheduling method for a module, which is applicable to a distributed system, wherein the distributed system includes at least two modules, each module includes at least one node, and the method includes: if the current module detects a node scheduling trigger event, determining that the current module is a target module; then determining a support module requesting a target module in the distributed system according to the priority of the target module; the support module schedules the nodes to the target module, and further, the service of the target module is processed efficiently. By adopting the technical means, the maximization of high-priority service and the maximization of the complete machine system capacity can be realized.
Example two
Fig. 2 is a schematic flow chart of a module node scheduling method according to a second embodiment of the present invention, which is a further refinement of the first embodiment, and the method may be executed by a module node scheduling apparatus, and the apparatus may be implemented in a software and/or hardware manner, and may be integrated in an electronic device, and specifically includes the following steps:
s210, if the current module detects a node scheduling trigger event, determining that the current module is a target module.
S220, determining whether the candidate module with the priority lower than that of the target module exists in the distributed system.
In this embodiment, different modules are compared in the distributed system according to the order of priority, and if a module with a priority lower than that of the target module exists, the module is taken as a candidate module.
If yes, go to S230; if not, go to S240.
And S230, determining the candidate module with the priority lower than that of the target module as a support module.
In this embodiment, the candidate module with the lowest priority is used as the support module, and if the candidate module with the lowest priority cannot meet the node scheduling target of the target module, the candidate module with the second lowest priority is determined as the support module from the candidate modules.
In this embodiment, optionally, the following formula is adopted to determine the supporting condition:
Nx·Cx≤Maxxand N isy·Cy≥Miny；
Wherein N isxThe number of nodes currently running for the target module, NyThe number of nodes currently running for the support module; cxIs the capacity level of the target module, CyIs a capacity level of the support module; max (maximum of ten)xA maximum available capacity value for the target module; minyA minimum reserved capacity value for the support module.
In this embodiment, the capacity level of the target module refers to a capacity of the target module capable of processing a service. The capacity level of a support module refers to the capacity of the support module's capacity to handle traffic.
In this embodiment, the support module schedules its own node for support, which needs to ensure that the support module can maintain the minimum capacity value that needs to be reserved and the current capacity value of the target module cannot exceed the current maximum available capacity value of the target module. This has the advantage that when a module of low priority is used as a support module, the target module can be supported as much as possible, and only the support module of low priority needs to satisfy the minimum capacity value to be reserved.
S240, determining whether the candidate modules with the priority equal to that of the target module exist in the distributed system; if so, determining the candidate module equal to the priority of the target module as the support module.
In this embodiment, optionally, the following formula is adopted to determine the supporting condition:
Nx·Cx≤Ny·Cyand (N)x+1)·Cx≥(Ny-1)·Cy；
Wherein N isxThe number of nodes currently running for the target module, NyThe number of nodes currently running for the support module; cxIs the capacity level of the target module, CyIs the capacity level of the support module.
In this embodiment, if the support modules are determined from the candidate modules with the same priority, the capacity value of the target module needs to be less than or equal to the capacity level of the support modules, that is, the capacity level of the support modules with the same priority should be satisfied first, and then the capacity level of the target module should be supported. And if the capacity level of the target module is larger than the capacity level of the support module with one less node after the target module is added with one node, the support module stops calling the node support target module. The advantage of this arrangement is to balance the capacity values between the modules of the same priority as much as possible, so that the different modules of the same priority can process the traffic efficiently.
In this embodiment, the candidate modules with the priority lower than or equal to the priority of the target module in the distributed system support the target module, so that it can be ensured that the service of the high-priority service module is provided to the maximum extent, and the service capability most needed by the user is higher.
EXAMPLE III
Fig. 3 is a schematic structural diagram of a node scheduling apparatus of a module according to a third embodiment of the present invention. The module node scheduling device provided by the embodiment of the invention can execute the module node scheduling method provided by any embodiment of the invention, and has corresponding functional modules and beneficial effects of the execution method. As shown in fig. 3, the apparatus includes:
a target module determining module 310, configured to determine that the current module is a target module if the current module detects a node scheduling trigger event;
a support module determining module 320, configured to determine to request a support module in the distributed system according to the priority of the target module;
a node support request sending module 330, configured to send a node support request to the support module through the target module, so as to schedule a node of the support module to process a service of the target module.
In this embodiment, optionally, the target module determining module 310 is configured to:
determining one node as a main node from the nodes running in the current module, and taking the other nodes as sub-nodes;
controlling the main node to send a node operation detection message to the sub-nodes according to a preset time interval;
and if the situation that at least one node running state in the main node or the sub-nodes is switched to the static state is detected, determining that a node scheduling trigger event exists, and determining that the current module is the target module.
In this embodiment, optionally, the support module determining module 320 is configured to:
determining whether there is a candidate module of lower priority than the target module in the distributed system;
if yes, determining the candidate module with the priority lower than that of the target module as the support module.
In this embodiment, optionally, the support module determining module 320 is configured to:
if not, whether the candidate module with the priority equal to that of the target module exists in the distributed system or not is judged;
if so, determining the candidate module equal to the priority of the target module as the support module.
In this embodiment, optionally, the following formula is adopted to determine the supporting condition:
Nx·Cx≤Maxxand N isy·Cy≥Miny；
Wherein N isxNumber of nodes currently running for the target module, NyThe number of nodes currently running for the support module; cxIs the capability capacity level, C, of the target moduleyIs a capacity level of the support module; max (maximum of ten)xA maximum available capacity value for the target module; minyA minimum reserved capacity value for the support module.
In this embodiment, optionally, the following formula is adopted to determine the supporting condition:
Nx·Cx≤Ny·Cyand (N)x+1)·Cx≥(Ny-1)·Cy；
Wherein, NxThe number of nodes currently running for the target module, NyThe number of nodes currently running for the support module; cxIs the capability capacity level, C, of the target moduleyIs the capacity level of the support module.
It can be clearly understood by those skilled in the art that, for convenience and brevity of description, the specific working process of the above-described apparatus may refer to the corresponding process in the foregoing method embodiment, and is not described herein again.
Example four
Fig. 4 is a schematic structural diagram of an apparatus according to a fourth embodiment of the present invention, and fig. 4 is a schematic structural diagram of an exemplary apparatus suitable for implementing the embodiment of the present invention. The device 12 shown in fig. 4 is only an example and should not bring any limitation to the function and scope of use of the embodiments of the present invention.
As shown in FIG. 4, device 12 is in the form of a general purpose computing device. The components of device 12 may include, but are not limited to: one or more processors or processing units 16, a system memory 28, and a bus 18 that couples various system components including the system memory 28 and the processing unit 16.
The system memory 28 may include computer system readable media in the form of volatile memory, such as Random Access Memory (RAM)30 and/or cache memory 32. Device 12 may further include other removable/non-removable, volatile/nonvolatile computer system storage media. By way of example only, storage system 34 may be used to read from and write to non-removable, nonvolatile magnetic media (not shown in FIG. 4, and commonly referred to as a "hard drive"). Although not shown in FIG. 4, a magnetic disk drive for reading from and writing to a removable, nonvolatile magnetic disk (e.g., a "floppy disk") and an optical disk drive for reading from or writing to a removable, nonvolatile optical disk (e.g., a CD-ROM, DVD-ROM, or other optical media) may be provided. In these cases, each drive may be connected to bus 18 by one or more data media interfaces. System memory 28 may include at least one program product having a set (e.g., at least one) of program modules that are configured to carry out the functions of embodiments of the invention.
A program/utility 40 having a set (at least one) of program modules 42 may be stored, for example, in system memory 28, such program modules 42 including, but not limited to, an operating system, one or more application programs, other program modules, and program data, each of which examples or some combination thereof may comprise an implementation of a network environment. Program modules 42 generally carry out the functions and/or methodologies of embodiments described herein.
The processing unit 16 executes various functional applications and data processing by running a program stored in the system memory 28, for example, to implement a node scheduling method of a module provided by an embodiment of the present invention, including:
if the current module detects a node scheduling trigger event, determining that the current module is a target module;
determining to request a support module in the distributed system according to the priority of the target module;
sending, by the target module, a node support request to the support module to schedule a node of the support module to process traffic of the target module.
EXAMPLE five
An embodiment of the present invention further provides a computer-readable storage medium, where a computer program (or referred to as a computer-executable instruction) is stored, and when the program is executed by a processor, the method for node scheduling of a module according to any of the above embodiments may be implemented, where the method includes:
if the current module detects a node scheduling trigger event, determining that the current module is a target module;
determining to request a support module in the distributed system according to the priority of the target module;
sending, by the target module, a node support request to the support module to schedule a node of the support module to process traffic of the target module.
Computer storage media for embodiments of the invention may employ any combination of one or more computer-readable media. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having 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. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for embodiments of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
It is to be noted that the foregoing is only illustrative of the preferred embodiments of the present invention and the technical principles employed. It will be understood by those skilled in the art that the present invention is not limited to the particular embodiments described herein, but is capable of various obvious changes, rearrangements and substitutions as will now become apparent to those skilled in the art without departing from the scope of the invention. Therefore, although the present invention has been described in greater detail by the above embodiments, the present invention is not limited to the above embodiments, and may include other equivalent embodiments without departing from the spirit of the present invention, and the scope of the present invention is determined by the scope of the appended claims.
Claims (10)
1. A node scheduling method for modules is applicable to a distributed system, wherein the distributed system includes at least two modules, each module includes at least one node, and the method includes:
if the current module detects a node scheduling trigger event, determining that the current module is a target module;
determining to request a support module in the distributed system according to the priority of the target module;
sending, by the target module, a node support request to the support module to schedule a node of the support module to process traffic of the target module.
2. The method of claim 1, wherein determining that the current module is the target module if the current module detects the node scheduling triggering event comprises:
determining one node as a main node from the nodes running in the current module, and taking the other nodes as sub-nodes;
controlling the main node to send a node operation detection message to the sub-nodes according to a preset time interval;
and if the condition that at least one node running state in the main node or the sub-nodes is a static state is detected, determining that a node scheduling trigger event exists, and determining that the current module is a target module.
3. The method of claim 1, wherein determining to request a support module in the distributed system based on the priority of the target module comprises:
determining whether there is a candidate module of lower priority than the target module in the distributed system;
if yes, determining the candidate module with the priority lower than that of the target module as the support module.
4. The method of claim 3, wherein after determining whether the candidate module having a lower priority than the target module exists in the distributed system, the method further comprises:
if not, determining whether the distributed system has a candidate module with the priority equal to that of the target module;
if so, determining the candidate module equal to the priority of the target module as the support module.
5. The method of claim 3, wherein after determining that the candidate module having a lower priority than the target module is a support module, the method further comprises:
the condition of support is determined using the following formula:
Nx·Cx≤Maxxand N isy·Cy≥Miny；
Wherein N isxThe number of nodes currently running for the target module, NyThe number of nodes currently running for the support module; cxIs the capacity level of the target module, CyIs a capacity level of the support module; max (maximum of ten)xA maximum available capacity value for the target module; minyA minimum reserved capacity value for the support module.
6. The method of claim 4, wherein after determining that the candidate module equal to the priority of the target module is a support module, the method further comprises:
the condition of support is determined using the following formula:
Nx·Cx≤Ny·Cyand (N)x+1)·Cx≥(Ny-1)·Cy；
Wherein N isxThe number of nodes currently running for the target module, NyThe number of nodes currently running for the support module; cxIs the capacity level of the target module, CyIs the capacity level of the support module.
7. A node scheduling apparatus of modules, adapted to be used in a distributed system, wherein the distributed system includes at least two modules, each module includes at least one node, the apparatus includes:
the target module determining module is used for determining the current module as the target module if the current module detects the node scheduling trigger event;
the supporting module determining module is used for determining to request the supporting module in the distributed system according to the priority of the target module;
a node support request sending module, configured to send a node support request to the support module through the target module, so as to schedule a node of the support module to process a service of the target module.
8. The apparatus of claim 7, wherein the goal module determining module is configured to:
determining one node as a main node from the nodes running in the current module, and taking the other nodes as sub-nodes;
controlling the main node to send a node operation detection message to the sub-nodes according to a preset time interval;
and if the situation that at least one node running state in the main node or the sub-nodes is switched to the static state is detected, determining that a node scheduling trigger event exists, and determining that the current module is the target module.
9. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the node scheduling method of the module according to any of claims 1-6 when executing the program.
10. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out a method for node scheduling of a module according to any one of claims 1 to 6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011182825.1A CN114513547B (en) | 2020-10-29 | 2020-10-29 | Module node scheduling method and device, electronic equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011182825.1A CN114513547B (en) | 2020-10-29 | 2020-10-29 | Module node scheduling method and device, electronic equipment and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114513547A true CN114513547A (en) | 2022-05-17 |
| CN114513547B CN114513547B (en) | 2024-02-13 |
Family
ID=81547273
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011182825.1A Active CN114513547B (en) | 2020-10-29 | 2020-10-29 | Module node scheduling method and device, electronic equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114513547B (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103888310A (en) * | 2013-09-04 | 2014-06-25 | 中寰卫星导航通信有限公司 | Monitor processing method and system |
| CN107943559A (en) * | 2017-11-21 | 2018-04-20 | 广东奥飞数据科技股份有限公司 | A kind of big data resource scheduling system and its method |
| WO2020000944A1 (en) * | 2018-06-25 | 2020-01-02 | 星环信息科技（上海）有限公司 | Preemptive scheduling based resource sharing use method, system and |
| CN111464601A (en) * | 2020-03-24 | 2020-07-28 | 新浪网技术(中国)有限公司 | Node service scheduling system and method |
-
2020
- 2020-10-29 CN CN202011182825.1A patent/CN114513547B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103888310A (en) * | 2013-09-04 | 2014-06-25 | 中寰卫星导航通信有限公司 | Monitor processing method and system |
| CN107943559A (en) * | 2017-11-21 | 2018-04-20 | 广东奥飞数据科技股份有限公司 | A kind of big data resource scheduling system and its method |
| WO2020000944A1 (en) * | 2018-06-25 | 2020-01-02 | 星环信息科技（上海）有限公司 | Preemptive scheduling based resource sharing use method, system and |
| CN111464601A (en) * | 2020-03-24 | 2020-07-28 | 新浪网技术(中国)有限公司 | Node service scheduling system and method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114513547B (en) | 2024-02-13 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11526386B2 (en) | System and method for automatically scaling a cluster based on metrics being monitored | |
| US11070650B2 (en) | De-duplicating remote procedure calls | |
| CN109766172B (en) | Asynchronous task scheduling method and device | |
| CN112650576A (en) | Resource scheduling method, device, equipment, storage medium and computer program product | |
| US9942160B2 (en) | Efficient logging of processing peaks in control systems | |
| CN112395097A (en) | Message processing method, device, equipment and storage medium | |
| CN113382056A (en) | Data reporting method, device, equipment, storage medium and system | |
| CN111625339A (en) | Cluster resource scheduling method, device, medium and computing equipment | |
| CN107342929B (en) | Method, device and system for sending new message notification | |
| CN111541762A (en) | Data processing method, management server, device and storage medium | |
| CN109343955B (en) | Recommendation service calling method, medium, device and computing equipment | |
| CN104184817A (en) | Download optimizing method and device and terminal | |
| CN110275701B (en) | Data processing method, device, medium and computing equipment | |
| CN114513547B (en) | Module node scheduling method and device, electronic equipment and storage medium | |
| CN114327819B (en) | Task management method, device, equipment and storage medium | |
| CN113535439B (en) | Service request processing method, device, equipment and storage medium | |
| CN115220908A (en) | Resource scheduling method, device, electronic equipment and storage medium | |
| CN106484536B (en) | IO scheduling method, device and equipment | |
| US20220276901A1 (en) | Batch processing management | |
| CN113946376A (en) | Load adjustment method and device, electronic equipment and storage medium | |
| CN111459653B (en) | Cluster scheduling method, device and system and electronic equipment | |
| CN113595887A (en) | Flow control method and device in mail system | |
| CN115767448B (en) | Message sending method, device, equipment and storage medium | |
| CN111767113A (en) | Method and device for realizing container eviction | |
| CN113778711B (en) | Event processing method and device, electronic equipment and storage medium |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |