CN114780306A - Job scheduling processing method and system and electronic equipment - Google Patents
Job scheduling processing method and system and electronic equipment Download PDFInfo
- Publication number
- CN114780306A CN114780306A CN202210460838.3A CN202210460838A CN114780306A CN 114780306 A CN114780306 A CN 114780306A CN 202210460838 A CN202210460838 A CN 202210460838A CN 114780306 A CN114780306 A CN 114780306A
- Authority
- CN
- China
- Prior art keywords
- scheduling service
- service node
- scheduling
- job
- jobs
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Responding to the occurrence of a fault, e.g. fault tolerance
- G06F11/16—Error detection or correction of the data by redundancy in hardware
- G06F11/20—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements
- G06F11/202—Error detection or correction of the data by redundancy in hardware using active fault-masking, e.g. by switching out faulty elements or by switching in spare elements where processing functionality is redundant
- G06F11/2023—Failover techniques
-
- 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/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
Abstract
The embodiment of the application discloses a processing method and a system for job scheduling and electronic equipment, wherein the method comprises the following steps: distributing the jobs to one or more scheduling service nodes; when the scheduling service nodes initiate operation execution based on respective operation, recording the respective operation of the scheduling service nodes to obtain operation records; when a registration request sent by a scheduling service node is received, updating the running time of the scheduling service node, wherein the registration request is sent at intervals of a preset time interval when the scheduling service node executes respective jobs; performing polling detection according to the running time of the scheduling service node to determine whether the scheduling service node with the fault exists; when the first scheduling service node is detected to be out of order, determining a second scheduling service node which is not out of order, and determining the job executed on the first scheduling service node according to the job record to obtain a first job set; and the second scheduling service node executes the jobs in the first job set so as to improve the operation and maintenance efficiency of the batch scheduling system.
Description
Technical Field
The present invention relates to the field of computers, and in particular, to a method, a system, and an electronic device for processing job scheduling.
Background
With the development and progress of science and technology, the amount of work that needs to be completed by a business system is continuously increased, and batch job scheduling gradually receives attention of people.
When a node for providing scheduling service in the scheduling system fails, the scheduling service stops to cause that the job cannot be normally executed, and the batch processing stops. Often, manual intervention is required to process in order to resume batch processing. However, the operation and maintenance efficiency of the batch scheduling system is low by restoring the batch processing in a manual intervention processing mode.
Disclosure of Invention
In view of this, the present application provides a method, a system, and an electronic device for processing job scheduling, so as to improve the operation and maintenance efficiency of a batch scheduling system.
In a first aspect, the present application provides a method for processing job scheduling, including:
distributing the jobs to one or more scheduling service nodes;
when one or more scheduling service nodes initiate operation execution based on respective operation, recording the respective operation of one or more scheduling service nodes to obtain operation records;
when a registration request sent by a scheduling service node is received, updating the running time of the scheduling service node; the registration request is sent every preset time interval when one or more scheduling service nodes execute respective jobs;
performing polling detection according to the running time of one or more scheduling service nodes to determine whether a scheduling service node with a fault exists or not;
when the first scheduling service node is detected to be out of order, determining a second scheduling service node which is not out of order, and determining the job executed on the first scheduling service node according to the job record to obtain a first job set;
and sending the first job set to the second scheduling service node so that the second scheduling service node executes the jobs in the first job set.
In a possible implementation manner, when it is detected that the first scheduling service node fails, determining a second scheduling service node that does not fail includes:
and when the first scheduling service node is detected to be failed, determining a second scheduling service node which is not failed according to the running time of one or more scheduling service nodes.
In one possible implementation, the method further includes:
before the third scheduling service node executes the first job and quits, deleting a record corresponding to the first job in the job record; the third scheduling service node is any one of the one or more scheduling service nodes, and the first job is any one of jobs executed on the third scheduling service node.
In a possible implementation manner, distributing a job to one or more scheduling service nodes specifically includes:
and distributing the jobs to one or more scheduling service nodes in response to the triggering conditions of the job execution.
In a second aspect, the present application provides a processing system for job scheduling, the system includes a scheduling management module, a scheduling service module, and a heartbeat processing module, wherein:
the scheduling management module is used for distributing jobs to one or more scheduling service nodes in the scheduling service module;
the heartbeat processing module is used for: when one or more scheduling service nodes initiate job execution based on respective jobs, recording the respective jobs of the one or more scheduling service nodes to obtain job records; when a registration request sent by a scheduling service node is received, updating the running time of the scheduling service node; the registration request is sent every preset time interval when one or more scheduling service nodes execute respective jobs; performing polling detection according to the running time of one or more scheduling service nodes to determine whether a scheduling service node with a fault exists or not; when the first scheduling service node is detected to be out of order, determining a second scheduling service node which is not out of order, and determining the operation executed on the first scheduling service node according to the operation record to obtain a first operation set;
the scheduling management module is further used for sending the first job set to the second scheduling service node so that the second scheduling service node executes the jobs in the first job set.
In a possible implementation manner, the heartbeat processing module is specifically configured to: and when the first scheduling service node is detected to be failed, determining a second scheduling service node which is not failed according to the running time of one or more scheduling service nodes.
In one possible implementation, the heartbeat processing module is further configured to: before the third scheduling service node executes the first job and quits, deleting a record corresponding to the first job in the job record; the third scheduling service node is any one of the one or more scheduling service nodes, and the first job is any one of jobs executed on the third scheduling service node.
In a possible implementation manner, the scheduling management module is specifically configured to: and distributing the jobs to one or more scheduling service nodes in response to the triggering conditions of the job execution.
In a third aspect, the present application provides an electronic device, which includes a processor and a memory, where the memory stores codes, and the processor is configured to call the codes stored in the memory to execute any one of the above methods.
In a fourth aspect, the present application provides a computer readable storage medium for storing a computer program for performing any of the methods described above.
Drawings
Fig. 1 is a flowchart of a processing method for job scheduling according to an embodiment of the present application;
fig. 2 is a schematic structural diagram of a processing system for job scheduling according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present application.
Detailed Description
While exemplary embodiments of the present application are shown in the drawings, it should be understood that the present application may be embodied in various forms and should not be limited to the embodiments set forth herein. Other embodiments, which can be derived by those skilled in the art from the embodiments given herein without any inventive contribution, are also within the scope of the present application.
In the claims and specification of the present application and in the drawings accompanying the description, the terms "comprise" and "have" and any variations thereof, are intended to cover non-exclusive inclusions.
Job scheduling is generally used to examine whether a system can meet the resource requirements of a user job based on information in a job control block, and to select some jobs from a backing queue of an external memory to call into the memory according to a certain algorithm, and to create processes and allocate necessary resources for them. And then the newly created process is inserted into the ready queue to be executed.
When the application service system or the scheduling system fails, for example, a node of scheduling or application fails, the scheduling service stops to cause that the job cannot be executed normally, and the batch processing stops. Often, manual intervention is required to process in order to resume batch processing. However, the operation and maintenance of the batch scheduling system are inefficient due to the manual intervention processing.
For example, when a batch job is executed at night without being attended to by a person, it is difficult to recover the batch process by manual intervention, or the long time required to recover the batch process is long, and the operation and maintenance costs are high.
Based on this, in the embodiment of the present application provided by the applicant, by recording the information of executing the job by each scheduling service node and the running state, the failed scheduling service node can be automatically identified, and the job on the failed scheduling service node is transferred to the healthy scheduling service node for execution. By adopting the technical scheme of the embodiment of the application, the dispatching service node fault of the batch dispatching can be automatically recovered, the manual intervention is reduced, and the operation and maintenance cost of the batch dispatching system is reduced.
In order to facilitate understanding of the technical solutions provided in the embodiments of the present application, a method, a system, and an electronic device for processing job scheduling provided in the embodiments of the present application are described below with reference to the accompanying drawings.
The application provides a processing method for job scheduling.
Referring to fig. 1, fig. 1 is a flowchart of a processing method for job scheduling according to an embodiment of the present disclosure.
As shown in fig. 1, the processing method of job scheduling in the embodiment of the present application includes S101 to S106.
And S101, distributing the jobs to one or more scheduling service nodes.
The distribution of jobs may be made to one or more dispatch service nodes, and the jobs distributed to each dispatch service node may be one or more.
S102, when one or more scheduling service nodes initiate job execution based on respective jobs, recording respective jobs of the one or more scheduling service nodes to obtain job records.
And determining information of which scheduling service node the job is executed at, namely determining the corresponding relation between the job and the scheduling service node.
S103, when a registration request sent by a scheduling service node is received, updating the running time of the scheduling service node; wherein the registration request is sent every preset time interval when one or more scheduling service nodes execute respective jobs.
Each dispatch service node sends a registration request when executing a job.
For example, each scheduling service node transmits a registration request every 5 minutes while executing a job.
The preset time periods corresponding to the one or more scheduling service nodes may be the same or different.
And the running time of the scheduling service node is used for representing the state that the scheduling service node is in normal running and normally executes the job at the time.
And S104, performing polling detection according to the running time of all the scheduling service nodes, and determining whether the scheduling service node with the fault exists.
S105, when the first scheduling service node is detected to be out of order, determining a second scheduling service node which is not out of order, and determining a first job set according to the job record.
The first set of jobs is a set of jobs executing on a first scheduling service node.
An executing job on a first scheduled service node refers to a job that is scheduled by the first scheduled service node and that is executed when the first scheduled service node fails.
A first set of jobs and a scheduling service node (second scheduling service node) that is operating healthily are determined.
The job record contains the corresponding relation between the scheduling service node and the job.
And S106, sending the first job set to the second scheduling service node so that the second scheduling service node executes the jobs in the first job set.
And transferring the job on the failed scheduling service node to the healthy scheduling service node for execution.
In the technical scheme of the embodiment of the application, by recording the information of the job executed by each scheduling service node and the running state, the failed scheduling service node can be automatically identified, and the job on the failed scheduling service node is transferred to the healthy scheduling service node for execution. By adopting the technical scheme of the embodiment of the application, the dispatching service node fault of the batch dispatching can be automatically recovered, the manual intervention is reduced, and the operation and maintenance cost of the batch dispatching system is reduced.
The application also provides another processing method for job scheduling.
The processing method of job scheduling in the embodiment of the present application includes S201 to S211. The following describes in detail a processing method by which modules can implement job scheduling in the embodiment of the present application.
S201, the scheduling management module responds to the trigger condition of the job execution and distributes the job to one or more scheduling service nodes in the scheduling service module.
The scheduling service module is used for managing the operation flow, providing an execution inlet of the operation flow and providing an interface for the outside to execute the operation flow manually or at regular time.
A workflow may be composed of a plurality of jobs.
The trigger conditions for the execution of the job may include: manual triggering or timed automatic triggering.
In some possible cases, the interface may be a restful API interface.
The scheduling service node is used for providing scheduling service and executing one or more jobs distributed by the scheduling management module.
The scheduling management module can distribute the jobs to one or more scheduling service nodes, and the jobs distributed to each scheduling service node can be one or more.
In a possible implementation manner, the scheduling management module sends job execution requests to one or more scheduling service nodes in the scheduling service module, where the job execution request received by each scheduling service node includes one or more jobs distributed to the corresponding scheduling service node.
S202, one or more scheduling service nodes initiate job execution based on respective jobs, and write records corresponding to the respective jobs into a scheduling event table, so that the scheduling event table comprises corresponding relations between the jobs and the scheduling service nodes.
And determining information of which scheduling service node the job executes according to the scheduling event table, namely, the corresponding relation between the job and the scheduling service node.
In a possible implementation manner, after one or more scheduling service nodes receive the job execution request, the one or more scheduling service nodes analyze the job in the job execution request, and initiate job execution based on the respective job.
In one possible implementation, the record corresponding to the job is deleted in the scheduling event table before the job execution exits.
S203, one or more scheduling service nodes execute respective jobs.
Each scheduling service node executes a job corresponding to the own node.
And S204, when one or more scheduling service nodes execute the job, sending a registration request to the heartbeat registry at preset time intervals.
For example, each dispatch service node sends a registration request to the hop registry every 5 minutes while executing a job.
The dispatch service node can send a registration request to the heartbeat registry indicating that the dispatch service node is functioning properly and executing the job properly.
In a possible implementation manner, when each scheduling service node starts the scheduling service, a scheduling service starting notice is sent to the heartbeat processing module; when the heartbeat processing module receives the notification sent by the dispatch service node, a record corresponding to the dispatch service node is written into the heartbeat registry so as to record the starting time of the dispatch service.
Further, in a possible implementation manner, IP (Internet Protocol) information of the scheduling service node may also be recorded.
S205, after the heartbeat processing module receives the registration request of the scheduling service node, the running time of the scheduling service node is updated in the heartbeat registry.
And after receiving a registration request of a certain scheduling service node, updating the running time of the scheduling service node in the heartbeat registry.
And the running time of the scheduling service node is used for representing the state that the scheduling service node runs normally and executes the job normally at the time.
Further, in a possible implementation manner, the operation time of the dispatch service node is updated according to the time when the registration request of the dispatch service node is received.
S206, the heartbeat processing module carries out polling detection on the running time of all the scheduling service nodes in the heartbeat registry to determine whether the scheduling service nodes with faults exist.
In a possible implementation manner, the heartbeat processing module performs polling detection on the running time of the scheduling service node in the registry, and determines whether the scheduling service node with the fault exists according to a preset time period corresponding to the scheduling service node.
The preset time interval is the interval time interval for sending the registration request to the heartbeat registry at intervals of the scheduling service node.
For example, the thread used to poll the detection heartbeat registry is a heartbeat health check polling thread.
The heartbeat health check polling thread performs polling detection on a plurality of dispatch service records (the running time of the dispatch service nodes) in the heartbeat registry, and determines whether a failed dispatch service node exists.
For example, for the dispatch service node a, if five communication failures occur within 1 minute, the dispatch service node a is determined to be the failed dispatch service node.
And S208, when the first scheduling service node is detected to have a fault, determining the job executed on the first scheduling service node.
An executing job on a first dispatch service node refers to a job that is scheduled by the first dispatch service node and that is executed upon failure of the first dispatch service node.
Specifically, a job executing on a first dispatch service node is determined from a dispatch event table.
And inquiring all jobs which run on the first scheduling service node and are in the executing state according to the scheduling event table.
For example, in the scheduling service module, it is assumed that a first scheduling service node is down in executing a job flow. And the heartbeat health check polling thread determines that the first scheduling service node is down by inquiring a heartbeat registry of the heartbeat service module.
In one possible implementation, jobs on multiple failed dispatch service nodes may also be queried simultaneously.
S209, determining a second scheduling service node according to the heartbeat registry.
The second dispatch service node is a healthy dispatch service node.
Specifically, the operation condition of at least one scheduling service node is determined according to the operation time of the scheduling service node in the heartbeat registry, and a healthy second scheduling service node is determined.
S210, the scheduling management module sends the job on the first scheduling service node to a second scheduling service node.
S211, the second scheduling service node executes the jobs on the first scheduling service node according to the sequence.
In one possible implementation, the order refers to the order in which the jobs are executed.
In some possible cases, the running host identification of the job is changed to the second dispatch service node.
In some possible implementations, the recovery of jobs may also be performed in batches by querying jobs on multiple failed dispatch service nodes.
For example, the second dispatch service node invokes a flow resume thread to resume the job. Flow recovery threads
And the flow recovery thread inquires which jobs in the failed machine are scheduled at the failed scheduling service node from the scheduling event table, inquires the healthy scheduling service nodes in the heartbeat registration, and initiates the jobs on the failed scheduling service node again according to the sequence.
And the second scheduling service node restores the execution context according to the scheduling event registered before the operation of the operation flow, and pulls up the operation flow again to restore the execution.
By adopting the technical scheme of the embodiment of the application, each scheduling service node sends the registration request at a preset time interval when executing the job, and the running time of the scheduling service node is updated after receiving the registration request. According to the running time of the scheduling service node, which scheduling service node or scheduling service nodes are failed can be determined. Through two polling threads, one is a heartbeat health check polling thread, and the other is a process recovery thread, the dispatching service node with the fault is detected in a polling mode, and operation is recovered from the dispatching service node with the fault in time. According to the technical scheme, the job on the scheduling service node with the fault can be identified and transferred to the healthy scheduling service node, the fault of the scheduling service node scheduled in batches can be rapidly and automatically recovered, manual intervention is reduced, and the operation and maintenance cost is reduced. In a specific application scene, the method can automatically and quickly process the node faults and can be better used in an unattended scene during batch operation at night.
The application also provides a processing system for job scheduling.
Referring to fig. 2, fig. 2 is a schematic structural diagram of a processing system for job scheduling according to an embodiment of the present application.
As shown in fig. 2, a processing system 200 for job scheduling in the embodiment of the present application includes a scheduling management module 201, a scheduling service module 202, and a heartbeat processing module 203.
The schedule management module 201 is used to distribute jobs to one or more schedule service nodes in the schedule service module 202.
The heartbeat processing module 203 is configured to: when one or more scheduling service nodes initiate operation execution based on respective operation, recording the respective operation of one or more scheduling service nodes to obtain operation records; when a registration request sent by a scheduling service node is received, updating the running time of the scheduling service node; the registration request is sent at preset time intervals when one or more scheduling service nodes execute respective jobs; performing polling detection according to the running time of one or more scheduling service nodes to determine whether a scheduling service node with a fault exists; when the first scheduling service node is detected to be out of order, determining a second scheduling service node which is not out of order, and determining the job executed on the first scheduling service node according to the job record to obtain a first job set.
The scheduling management module 201 is further configured to send the first job set to the second scheduling service node, so that the second scheduling service node executes the jobs in the first job set.
In a possible implementation manner, the heartbeat processing module 203 is specifically configured to: and when the first scheduling service node is detected to be failed, determining a second scheduling service node which is not failed according to the running time of one or more scheduling service nodes.
In a possible implementation manner, the heartbeat processing module 203 is further configured to: before the third scheduling service node executes the first job and quits, deleting a record corresponding to the first job in the job record; the third scheduling service node is any one of the one or more scheduling service nodes, and the first job is any one of jobs executed on the third scheduling service node.
In a possible implementation manner, the scheduling management module 201 is specifically configured to: and distributing the jobs to one or more scheduling service nodes in response to the triggering conditions of the job execution.
The modules included in the processing system 200 for job scheduling can achieve the same technical effects as the processing method for job scheduling in the above embodiments, and are not described herein again to avoid repetition.
The embodiment of the application also provides the electronic equipment.
Referring to fig. 3, fig. 3 is a schematic structural diagram of an electronic device according to an embodiment of the present disclosure.
As shown in fig. 3, an electronic device 300 according to an embodiment of the present application includes a processor 301 and a memory 302, where the memory 302 stores codes, and the processor 301 is configured to call the codes stored in the memory 302 to execute any one of the above-mentioned job scheduling processing methods.
The units included in the electronic device 300 can achieve the same technical effects as the job scheduling processing method in the above embodiments, and are not described herein again to avoid repetition.
In an embodiment of the present application, a computer-readable storage medium is further provided, where the computer-readable storage medium is used for storing a computer program, and the computer program is used for executing the processing method for job scheduling, and can achieve the same technical effect, and in order to avoid repetition, details are not repeated here. The computer-readable storage medium may be a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk.
The previous description of the disclosed embodiments is provided to enable any person skilled in the art to make or use the present application. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be applied to other embodiments without departing from the spirit or scope of the application. Thus, the present application is not intended to be limited to the embodiments shown herein but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.
Claims (10)
1. A method for processing job scheduling, the method comprising:
distributing the jobs to one or more scheduling service nodes;
when the one or more scheduling service nodes initiate operation execution based on respective operation, recording the respective operation of the one or more scheduling service nodes to obtain operation records;
when a registration request sent by a scheduling service node is received, updating the running time of the scheduling service node; the registration requests are sent every preset time interval when the one or more scheduling service nodes execute respective jobs;
performing polling detection according to the running time of the one or more scheduling service nodes to determine whether a scheduling service node with a fault exists;
when the first scheduling service node is detected to be out of order, determining a second scheduling service node which is not out of order, and determining the operation executed on the first scheduling service node according to the operation record to obtain a first operation set;
and sending the first job set to the second scheduling service node so that the second scheduling service node executes the jobs in the first job set.
2. The method according to claim 1, wherein when it is detected that the first dispatch service node fails, determining a second dispatch service node that does not fail specifically includes:
and when the first scheduling service node is detected to be failed, determining a second scheduling service node which is not failed according to the running time of the one or more scheduling service nodes.
3. The method of claim 1, further comprising:
before a third scheduling service node executes a first job and quits, deleting a record corresponding to the first job in the job record; the third scheduling service node is any one of the one or more scheduling service nodes, and the first job is any one of jobs executed on the third scheduling service node.
4. The method according to claim 1, wherein the distributing the job to the one or more scheduling service nodes specifically comprises:
and distributing the jobs to the one or more scheduling service nodes in response to the triggering conditions of the job execution.
5. A processing system for job scheduling, the system comprising a scheduling management module, a scheduling service module, and a heartbeat processing module, wherein:
the scheduling management module is used for distributing jobs to one or more scheduling service nodes in the scheduling service module;
the heartbeat processing module is configured to: when the one or more scheduling service nodes initiate operation execution based on respective operation, recording the respective operation of the one or more scheduling service nodes to obtain operation records; when a registration request sent by a scheduling service node is received, updating the running time of the scheduling service node; the registration requests are sent at preset time intervals when the one or more scheduling service nodes execute respective jobs; performing polling detection according to the running time of the one or more scheduling service nodes to determine whether a scheduling service node with a fault exists; when the first scheduling service node is detected to be out of order, determining a second scheduling service node which is not out of order, and determining the operation executed on the first scheduling service node according to the operation record to obtain a first operation set;
the scheduling management module is further configured to send the first job set to the second scheduling service node, so that the second scheduling service node executes jobs in the first job set.
6. The system according to claim 1, wherein the heartbeat processing module is specifically configured to: and when the first scheduling service node is detected to be out of order, determining a second scheduling service node which is not out of order according to the running time of the one or more scheduling service nodes.
7. The system of claim 1, wherein the heartbeat processing module is further configured to: before a third scheduling service node executes a first job and quits, deleting a record corresponding to the first job in the job record; the third scheduling service node is any one of the one or more scheduling service nodes, and the first job is any one of jobs executed on the third scheduling service node.
8. The system of claim 1, wherein the schedule management module is specifically configured to: and distributing the jobs to the one or more scheduling service nodes in response to the triggering conditions of the job execution.
9. An electronic device comprising a processor and a memory, wherein the memory stores code and the processor is configured to invoke the code stored in the memory to perform the method of any of claims 1 to 4.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium is used to store a computer program for performing the method of any of claims 1 to 4.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210460838.3A CN114780306A (en) | 2022-04-28 | 2022-04-28 | Job scheduling processing method and system and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210460838.3A CN114780306A (en) | 2022-04-28 | 2022-04-28 | Job scheduling processing method and system and electronic equipment |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114780306A true CN114780306A (en) | 2022-07-22 |
Family
ID=82434864
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210460838.3A Pending CN114780306A (en) | 2022-04-28 | 2022-04-28 | Job scheduling processing method and system and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114780306A (en) |
-
2022
- 2022-04-28 CN CN202210460838.3A patent/CN114780306A/en active Pending
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103201724B (en) | Providing application high availability in highly-available virtual machine environments | |
| US9369521B2 (en) | Naming of distributed business transactions | |
| US8412899B2 (en) | Real time backup storage node assignment | |
| CN111818159B (en) | Management method, device, equipment and storage medium of data processing node | |
| WO2020248507A1 (en) | Container cloud-based system resource monitoring method and related device | |
| EP3489825A1 (en) | Method, apparatus and computer readable storage medium for processing service | |
| CN109558260B (en) | Kubernetes fault elimination system, method, equipment and medium | |
| CN111274052A (en) | Data distribution method, server, and computer-readable storage medium | |
| CN109710416B (en) | Resource scheduling method and device | |
| CN110109741B (en) | Method and device for managing circular tasks, electronic equipment and storage medium | |
| CN101137984A (en) | Systems, methods, and software for distributed loading of databases | |
| CN106572137B (en) | Distributed service resource management method and device | |
| JP2004038516A (en) | Work processing system, operation management method and program for performing operation management | |
| CN110727508A (en) | Task scheduling system and scheduling method | |
| CN110912972A (en) | Service processing method, system, electronic equipment and readable storage medium | |
| CN111045811A (en) | Task allocation method and device, electronic equipment and storage medium | |
| CN106547566B (en) | Communications service process pool management method and system | |
| CN112052095A (en) | Distributed high-availability big data mining task scheduling system | |
| CN111611057A (en) | Distributed retry method, device, electronic equipment and storage medium | |
| CN111541762A (en) | Data processing method, management server, device and storage medium | |
| CN110532105B (en) | Method, system and device for controlling message queue consumer process | |
| JP2005301436A (en) | Cluster system and failure recovery method for it | |
| JP2000250833A (en) | Operation information acquiring method for operation management of plural servers, and recording medium recorded with program therefor | |
| CN110620798A (en) | Control method, system, equipment and storage medium for FTP connection | |
| CN111756800A (en) | Method and system for processing burst flow |
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 |