CN114513547B - 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
- CN114513547B CN114513547B CN202011182825.1A CN202011182825A CN114513547B CN 114513547 B CN114513547 B CN 114513547B CN 202011182825 A CN202011182825 A CN 202011182825A CN 114513547 B CN114513547 B CN 114513547B
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 66
- 238000004590 computer program Methods 0.000 claims description 6
- 238000001514 detection method Methods 0.000 claims description 5
- 238000005192 partition Methods 0.000 claims description 5
- 230000003068 static effect Effects 0.000 claims description 5
- 230000003287 optical effect Effects 0.000 description 6
- 230000006870 function Effects 0.000 description 5
- 238000010586 diagram Methods 0.000 description 4
- 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
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 the current module as a target module; determining a support module in the distributed system according to the priority of the target module; and 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 service of the target module. By adopting the technical means, the high-priority service and the maximization of the system capacity of the whole machine 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 distributed system products, implementation of a function often requires that multiple business modules cooperate to complete. Wherein each module may be deployed in multiple nodes with each module node having a corresponding level of capability. When hardware resources are fixed, in the system deployment, the capability provided by the number of different service module deployments is balanced with each other in consideration of the coordination of the whole system capability.
However, in the long-term operation process of the system, the situation that part of nodes gradually fail may occur, and at this time, the service capability correspondingly provided by the nodes is unequal along with the different numbers of the node failures of different modules, so that the whole system capability is limited by the service module capability with the most failure, and resources are wasted.
Therefore, a method is urgently needed to maximize high priority traffic and overall system capacity.
Disclosure of Invention
The embodiment of the invention provides a node scheduling method, a node scheduling device, electronic equipment and a storage medium of a module, so as to realize high-priority service and complete machine system capacity maximization.
In a first aspect, an embodiment of the present invention provides a node scheduling method for a module, which is applicable to a distributed system, where 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 the current module as a target module;
determining a support module in the distributed system according to the priority of the target module;
and 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 service of the target module.
In a second aspect, an embodiment of the present invention further provides a node scheduling device for a module, which is applicable to a distributed system, where the distributed system includes at least two modules, each module includes at least one node, and the device includes:
the target module determining module is used for determining the current module as a target module if the current module detects a node scheduling trigger event;
the support module determining module is used for determining to request the support module in the distributed system according to the priority of the target module;
and the node support request sending module is used for 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 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 capable of running on the processor, where the processor implements a node scheduling method of a module according to any one of the embodiments of the present invention when the processor executes the program.
In a fourth aspect, an embodiment of the present invention further provides a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements a node scheduling method of a module according to any of the embodiments of the present invention.
The invention provides a node scheduling method of modules, which is applicable to 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 the current module as a target module; then determining a support module for requesting the target module in the distributed system according to the priority of the target module; and scheduling nodes to the target module through the support module, so that the service of the target module is efficiently processed. By adopting the technical means, the high-priority service and the maximization of the system capacity of the whole machine can be realized.
Drawings
Fig. 1 is a flow chart of a node scheduling method of a module according to a first embodiment of the present invention;
fig. 2 is a flow chart of a node scheduling method of 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 view of an apparatus according to a fourth embodiment of the present invention.
Detailed Description
The invention is described in further detail below with reference to the drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the invention and are not limiting thereof. It should be further noted that, for convenience of description, only some, but not all of the structures related to the present invention are shown in the drawings.
Before discussing exemplary embodiments in more detail, it should be mentioned that some exemplary embodiments are described as processes or methods depicted as flowcharts. Although a flowchart depicts steps as a sequential process, many of the steps may be implemented in parallel, concurrently, or with other steps. Furthermore, 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 figures. The processes may correspond to methods, functions, procedures, subroutines, and the like.
Example 1
Fig. 1 is a flow chart of a node scheduling method of a module according to an embodiment of the present invention, where the embodiment is applicable to a distributed system where the distributed system includes at least two modules, and each module includes at least one node when nodes of different modules are allocated. The method can be executed by a node scheduling device of a module, the device can be realized in a mode of software and/or hardware and can be integrated in electronic equipment, and the method specifically comprises the following steps:
and S110, if the current module detects the node scheduling trigger event, determining the current module as a target module.
In this embodiment, at least two modules exist in the distributed system to process different services in parallel, and exemplary modules for processing services in the distributed system of the video monitoring management platform include: the system comprises a camera access management module, a storage establishment module, a live establishment module, a user management module and a cloud deck management module. Each of the modules performs a different function, with each module performing tasks through 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 supporting requests in the distributed system.
In this embodiment, optionally, if the current module detects the node scheduling trigger event, determining that the current module is the target module includes:
determining one node as a main node in the nodes running in the current module, and taking the rest nodes as sub-nodes;
controlling the master node to send a node operation detection message to the partition node according to a preset time interval;
if at least one node running state in the main node or the sub-nodes is detected to be in a static state, determining that a node scheduling triggering event exists, and determining that the current module is a target module.
In this embodiment, the master node is one and only one in the current module, where the master node may be any node in the current module that is running, or may be the first node in the current module that is online. In this embodiment, if the master node fails, a node is redetermined 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 for judging whether the node receiving the message is operating. In this embodiment, the partition node may send keep-alive messages to the master node according to a preset time interval, so that the system determines the running state of each node.
In this embodiment, when the node running state is a static state, it is indicated that the node is currently in a fault, and there is a node scheduling trigger event, and the current module is determined as the target module. The advantage of this arrangement is that the target module to be supported can be found in time, so that the system capacity of handling the service is maximized.
In this embodiment, it may also be the case where an increase in the number of nodes is detected, in which case the nodes are converted from the failure state to the running state. At this time, the current module may be used to support other modules.
If the modules with higher priority than the current module in the distributed system need to be supported, the modules with high priority to be supported are ordered from large to small according to the order of priority, so that the supported modules meet N after being supported z ·C z ≤Max z The method comprises the steps of carrying out a first treatment on the surface of the Wherein N is z C for the number of nodes currently running by the supported module z Max, being the capacity level of supported modules z Is the maximum available capacity value for the supported module.
If the high priority module in the distributed system does not need to support, the module with the minimum capacity value is determined by comparing with the priority module, and the module is supported. Wherein, after support, N needs to be satisfied z ·C z ≤N m ·C m And (N) z +1)·C z ≥(N m -1)·C m And N is m ·C m ≤Max m The method comprises the steps of carrying out a first treatment on the surface of the Wherein N is z N is the number of nodes currently running in the supported module m The number of nodes currently running for the current module; c (C) z C for the capacity level of the supported module m Max, being the capacity level of the current module m The 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 low priority are supported. The modules with low priority are ordered according to the order of the priority, wherein the supported modules after being supported meet the following conditions: n (N) z ·C z ≤Max z The method comprises the steps of carrying out a first treatment on the surface of the Wherein N is z C for the number of nodes currently running by the supported module z Max, being the capacity level of supported modules z Is the maximum available capacity value for the supported module.
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 level of different modules in the distributed system, and the higher the priority, the higher the importance level of the service processed by the module, and thus the larger the remaining capacity value that needs to be guaranteed. Illustratively, the priority of the modules in the distributed system of the video surveillance management platform is from high to low: the device comprises a device access management module, a storage establishment module, a live establishment module, a user management module and a cloud deck establishment module.
In this embodiment, the support module refers to a module of a scheduled node in the distributed system, and may be other modules except for the target module.
And 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 service 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 nodes to support the target module. In this embodiment, the nodes of the support module are relatively redundant in processing the tasks of the module. Therefore, the support module can realize the purpose of balancing capacity values of the capacities among different modules as much as possible by scheduling the nodes of the module to process the business of the target module.
The embodiment of 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 the current module as a target module; then determining a support module for requesting the target module in the distributed system according to the priority of the target module; and scheduling nodes to the target module through the support module, so that the service of the target module is efficiently processed. By adopting the technical means, the high-priority service and the maximization of the system capacity of the whole machine can be realized.
Example two
Fig. 2 is a flow chart of a node scheduling method of a module according to a second embodiment of the present invention, where the method is further refined based on the first embodiment, and the method may be performed by a node scheduling device of a module, where the device may be implemented in a software and/or hardware manner and may be integrated in an electronic device, and specifically includes the following steps:
and S210, if the current module detects the node scheduling trigger event, determining the current module as a target module.
S220, determining whether a candidate module with a lower priority than 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 used as a candidate module.
If yes, executing S230; if not, S240 is performed.
And S230, determining a candidate module with a lower priority than the target module as a support module.
In this embodiment, the candidate module with the lowest priority is used as the support module from the candidate modules, and if the candidate module with the lowest priority cannot meet the node scheduling target of the target module, the candidate module with the lowest priority is determined from the candidate modules as the support module.
In this embodiment, optionally, the following formula is used to determine the supporting conditions:
N x ·C x ≤Max x and N is y ·C y ≥Min y ；
Wherein N is x N is the number of nodes currently running for the target module y The number of nodes currently running for the support module; c (C) x C is the capacity level of the target module y A capacity level for the capability of the support module; max (Max) x A maximum available capacity value for the target module; min (Min) y And the capacity value to be reserved is the minimum capacity value of the support module.
In this embodiment, the capacity level of the capability of the target module refers to the capacity of the capability of the target module to process the service. The capacity level of the capability of the support module refers to the capacity of the support module that is capable of handling traffic.
In this embodiment, the support module schedules its own node for support, so that the support module needs to be able to maintain the capacity value that needs to be kept at a minimum, and the current capacity value of the target module cannot exceed the current maximum available capacity value of the target module. The advantage of this arrangement is that the target module can be supported as much as possible when the low priority module is used as a support module, only the low priority support module needs to meet the capacity value of the minimum required reservation.
S240, determining whether a candidate module with priority equal to the priority of the target module exists in the distributed system; if so, determining the candidate module with the priority equal to the target module as a support module.
In this embodiment, optionally, the following formula is used to determine the supporting conditions:
N x ·C x ≤N y ·C y and (N) x +1)·C x ≥(N y -1)·C y ；
Wherein N is x N is the number of nodes currently running for the target module y The number of nodes currently running for the support module; c (C) x C is the capacity level of the target module y Is 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 module, that is, the capacity level of the support module with the same priority should be satisfied first, and then the capacity level of the target module should be supported. If the capacity level of the target module is larger than the capacity level of the support module by one node after one node is added, the support module stops calling the node to support the target module. The advantage of this arrangement is that the capacity values of the capacity between modules of the same priority are balanced as much as possible, so that different modules of the same priority can handle traffic efficiently.
In this embodiment, the candidate module with the priority lower than or equal to the priority of the target module in the distributed system supports the target module, so that the service of the service module with high priority can be ensured to be provided maximally, and the service capability needed by the user is higher.
Example III
Fig. 3 is a schematic structural diagram of a node scheduling device of a module according to a third embodiment of the present invention. The node scheduling device of the module provided by the embodiment of the invention can execute the node scheduling method of the module provided by any embodiment of the invention, and has the corresponding functional modules and beneficial effects of the execution method. As shown in fig. 3, the apparatus includes:
the target module determining module 310 is 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, according to the priority of the target module, a request for a support module in the distributed system;
and the node support request sending module 330 is configured to send 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 service of the target module.
In this embodiment, optionally, the target module determining module 310 is configured to:
determining one node from the running nodes in the current module as a main node, and taking the rest nodes as sub-nodes;
controlling the master node to send a node operation detection message to the partition node according to a preset time interval;
if at least one node running state in the main node or the sub node is detected to be switched to a static state, determining that a node scheduling triggering event exists, and determining that the current module is a target module.
In this embodiment, optionally, the support module determining module 320 is configured to:
determining whether there are candidate modules of lower priority than the target module for the distributed system;
if yes, determining the candidate module with the priority lower than that of the target module as a support module.
In this embodiment, optionally, the support module determining module 320 is configured to:
if not, the distributed system has a candidate module with priority equal to the priority of the target module;
if so, determining the candidate module with the priority equal to the target module as a support module.
In this embodiment, optionally, the following formula is used to determine the supporting conditions:
N x ·C x ≤Max x and N is y ·C y ≥Min y ；
Wherein N is x N is the number of nodes currently running for the target module y The number of nodes currently running for the support module; c (C) x C is the capacity level of the target module y To be the instituteCapacity level of the support module; max (Max) x A maximum available capacity value for the target module; min (Min) y And the capacity value to be reserved is the minimum capacity value of the support module.
In this embodiment, optionally, the following formula is used to determine the supporting conditions:
N x ·C x ≤N y ·C y and (N) x +1)·C x ≥(N y -1)·C y ；
Wherein N is x N is the number of nodes currently running for the target module y The number of nodes currently running for the support module; c (C) x C is the capacity level of the target module y Is the capacity level of the support module.
It will 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, which is not repeated herein.
Example IV
Fig. 4 is a schematic structural diagram of an apparatus provided in a fourth embodiment of the present invention, and fig. 4 shows a schematic structural diagram of an exemplary apparatus suitable for implementing an embodiment of the present invention. The device 12 shown in fig. 4 is merely an example and should not be construed as limiting the functionality and scope of use of embodiments of the present invention.
As shown in fig. 4, device 12 is in the form of a general purpose computing device. Components of device 12 may include, but are not limited to: one or more processors or processing units 16, a system memory 28, a bus 18 that connects the various system components, including the system memory 28 and the processing units 16.
Bus 18 represents one or more of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, a processor, and a local bus using any of a variety of bus architectures. By way of example, and not limitation, such architectures include Industry Standard Architecture (ISA) bus, micro channel architecture (MAC) bus, enhanced ISA bus, video Electronics Standards Association (VESA) local bus, and Peripheral Component Interconnect (PCI) bus.
Device 12 typically includes a variety of computer system readable media. Such media can be any available media that is accessible by device 12 and includes both volatile and nonvolatile media, removable and non-removable media.
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 or write to non-removable, nonvolatile magnetic media (not shown in FIG. 4, commonly referred to as a "hard disk drive"). Although not shown in fig. 4, a magnetic disk drive for reading from and writing to a removable non-volatile magnetic disk (e.g., a "floppy disk"), and an optical disk drive for reading from or writing to a removable non-volatile optical disk (e.g., a CD-ROM, DVD-ROM, or other optical media) may be provided. In such cases, each drive may be coupled to bus 18 through one or more data medium interfaces. The system memory 28 may include at least one program product having a set (e.g., at least one) of program modules 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 in, for example, 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 or some combination of which may include an implementation of a network environment. Program modules 42 generally perform the functions and/or methods of the embodiments described herein.
Device 12 may also communicate with one or more external devices 14 (e.g., keyboard, pointing device, display 24, etc.), one or more devices that enable a user to interact with device 12, and/or any devices (e.g., network card, modem, etc.) that enable device 12 to communicate with one or more other computing devices. Such communication may occur through an input/output (I/O) interface 22. Also, device 12 may communicate with one or more networks such as a Local Area Network (LAN), a Wide Area Network (WAN) and/or a public network, such as the Internet, via network adapter 20. As shown in fig. 4, network adapter 20 communicates with other modules of device 12 over bus 18. It should be appreciated that although not shown, other hardware and/or software modules may be used in connection with device 12, including, but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, data backup storage systems, and the like.
The processing unit 16 executes various functional applications and data processing by running a program stored in the system memory 28, for example, implementing a node scheduling method of a module provided in an embodiment of the present invention, including:
if the current module detects a node scheduling trigger event, determining the current module as a target module;
determining a support module in the distributed system according to the priority of the target module;
and 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 service of the target module.
Example five
The fifth embodiment of the present invention further provides a computer readable storage medium having stored thereon a computer program (or called computer executable instructions), which when executed by a processor, implements a node scheduling method of a module according to any of the foregoing embodiments, including:
if the current module detects a node scheduling trigger event, determining the current module as a target module;
determining a support module in the distributed system according to the priority of the target module;
and 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 service of the target module.
The computer storage media of embodiments of the invention may take the form of 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. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any 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 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.
The computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, either in baseband or as part of a carrier wave. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also 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 ++ 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 kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).
Note that the above is only a preferred embodiment of the present invention and the technical principle applied. 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, while the invention has been described in connection with the above embodiments, the invention is not limited to the embodiments, but may be embodied in many other equivalent forms without departing from the spirit or scope of the invention, which is set forth in the following claims.
Claims (9)
1. A node scheduling method of a module, which is suitable for use in a distributed system, where 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 the current module as a target module;
determining a support module in the distributed system according to the priority of the target module;
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 service of the target module;
wherein the determining, according to the priority of the target module, to request the support module in the distributed system includes:
determining whether there are candidate modules of lower priority than the target module for the distributed system;
if yes, determining the candidate module with the priority lower than that of the target module as a support module.
2. The method of claim 1, wherein determining the current module as the target module if the current module detects the node scheduling trigger event comprises:
determining one node as a main node in the nodes running in the current module, and taking the rest nodes as sub-nodes;
controlling the master node to send a node operation detection message to the partition node according to a preset time interval;
if at least one node running state in the main node or the sub-nodes is detected to be in a static state, determining that a node scheduling triggering event exists, and determining that the current module is a target module.
3. The method of claim 1, wherein after determining whether the distributed system has a candidate module having a priority lower than the priority of the target module, the method further comprises:
if not, determining whether the distributed system has a candidate module with priority equal to the priority of the target module;
if so, determining the candidate module with the priority equal to the target module as a support module.
4. The method of claim 1, wherein after the determining that the candidate module having a lower priority than the target module is a support module, the method further comprises:
the following formula is used to determine the conditions for support:
N x ·C x ≤Max x and N is y ·C y ≥Min y ；
Wherein N is x N is the number of nodes currently running for the target module y The number of nodes currently running for the support module; c (C) x C is the capacity level of the target module y A capacity level for the capability of the support module; max (Max) x A maximum available capacity value for the target module; min (Min) y And the capacity value to be reserved is the minimum capacity value of the support module.
5. The method of claim 3, wherein after the determining that the candidate module equal to the priority of the target module is a support module, the method further comprises:
the following formula is used to determine the conditions for support:
N x ·C x ≤N y ·C y and (N) x +1)·C x ≥(N y -1)·C y ；
Wherein N is x N is the number of nodes currently running for the target module y The number of nodes currently running for the support module; c (C) x C is the capacity level of the target module y Is the capacity level of the support module.
6. A node scheduling device of a module, adapted to be used in a distributed system, where the distributed system includes at least two modules, each module includes at least one node, and the device includes:
the target module determining module is used for determining the current module as a target module if the current module detects a node scheduling trigger event;
the support module determining module is used for determining to request the support module in the distributed system according to the priority of the target module;
the node support request sending module is used for 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 service of the target module;
wherein, the support module determining module is configured to:
determining whether there are candidate modules of lower priority than the target module for the distributed system;
if yes, determining the candidate module with the priority lower than that of the target module as a support module.
7. The apparatus of claim 6, wherein the target module determining module is configured to:
determining one node from the running nodes in the current module as a main node, and taking the rest nodes as sub-nodes;
controlling the master node to send a node operation detection message to the partition node according to a preset time interval;
if at least one node running state in the main node or the sub node is detected to be switched to a static state, determining that a node scheduling triggering event exists, and determining that the current module is a target module.
8. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements a node scheduling method for a module according to any one of claims 1-5 when executing the program.
9. A computer readable storage medium, on which a computer program is stored, characterized in that the program, when being executed by a processor, implements a node scheduling method of a module according to any of claims 1-5.
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 CN114513547A (en) | 2022-05-17 |
| CN114513547B true 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 |
|---|---|
| CN114513547A (en) | 2022-05-17 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109117260B (en) | Task scheduling method, device, equipment and medium | |
| US9558022B2 (en) | Automatic virtual machine termination in a cloud | |
| US11526386B2 (en) | System and method for automatically scaling a cluster based on metrics being monitored | |
| US20100275200A1 (en) | Interface for Virtual Machine Administration in Virtual Desktop Infrastructure | |
| US10645194B2 (en) | De-duplicating remote procedure calls | |
| US9069595B1 (en) | Systems and methods for overseas desktop software | |
| CN112650576A (en) | Resource scheduling method, device, equipment, storage medium and computer program product | |
| CN107682389B (en) | Method, terminal and computer readable storage medium for executing network request | |
| CN112134964A (en) | Controller distribution method, computer equipment, storage medium and network service system | |
| CN115904761A (en) | System on chip, vehicle and video processing unit virtualization method | |
| CN111625339A (en) | Cluster resource scheduling method, device, medium and computing equipment | |
| CN109343955B (en) | Recommendation service calling method, medium, device and computing equipment | |
| CN112395097A (en) | Message processing method, device, equipment and storage medium | |
| CN114513547B (en) | Module node scheduling method and device, electronic equipment and storage medium | |
| CN114785861B (en) | Service request forwarding system, method, computer equipment and storage medium | |
| CN113595887B (en) | Flow control method and device in mail system | |
| CN115220908A (en) | Resource scheduling method, device, electronic equipment and storage medium | |
| CN113946376A (en) | Load adjustment method and device, electronic equipment and storage medium | |
| CN114443325A (en) | Asynchronous retry method and system for interface call exception | |
| CN114327819A (en) | Task management method, device, equipment and storage medium | |
| CN113010280A (en) | Distributed task processing method, system, device, equipment and medium | |
| CN106484536B (en) | IO scheduling method, device and equipment | |
| US8671307B2 (en) | Task relay system, apparatus, and recording medium | |
| US10630550B2 (en) | Method for determining a primary management service for a client device in a hybrid management system based on client telemetry | |
| CN111767113A (en) | Method and device for realizing container eviction |
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 |