Work early warning method and device based on topological dependence, medium and program product
By generating job topology diagrams and calculating key paths, identifying time-consuming abnormal jobs, the problems of unintuitive operation management and untimely warning information in the existing technology are solved, real-time monitoring and efficient early warning of job status are achieved.
Patent Information
- Application Number
- CN202410966798.9
- Authority / Receiving Office
- CN · China
- Patent Type
- Applications(China)
- Current Assignee / Owner
- Filing Date
- 2024-07-18
- Publication Date
- 2024-11-15
AI Technical Summary
The existing technology cannot intuitively display the specific progress and status of job execution, and lacks a reliable event notification mechanism, resulting in job management not being intuitive enough, inefficient and timely feedback on early warning information.
By recording job information in the job dependency table, generating job topology diagrams, using the suspended polling algorithm to calculate the average job time, and generating key job paths based on the critical path algorithm, comparing the actual job timing and critical path timing, and identifying time-consuming Exceptional jobs, generate path warning information.
It realizes intuitive display and timely warning of the operation status, improves the operation and maintenance personnel's grasp of the operation status, and ensures that the operation is executed on time.
Smart Images

Figure CN118964003A_ABST
Abstract
Description
Technical Field
[0001] The present invention relates to the field of computer operation and maintenance technology, and in particular to a topology-dependent based operation early warning method, device, medium and program product. Background Art
[0002] With the continuous expansion of corporate business and the increasing complexity of IT systems, the correlation and dependency between jobs are becoming more and more complex. Traditional text descriptions or simple lists can no longer meet the needs of clear display and management of job correlation. In order to ensure the smooth execution of jobs, it is necessary to manage the execution order, execution path, and execution status of jobs in a refined manner. At the same time, real-time monitoring and early warning of job completion are becoming more and more important.
[0003] The job topology map can display the execution status and progress of the job in real time. When an abnormality or failure occurs in the job, it can be immediately reflected in the topology map and remind the user through color, shape or animation effects, which helps users to promptly discover and deal with potential problems and ensure the on-time execution of the job.
[0004] The existing technical methods for judging whether a job in the system is completed usually rely on the status information or monitoring mechanism provided by the job execution system. The status of the job is mainly checked through API calls, database queries, polling mechanisms, etc. There are also methods such as WebSocket, HTTP callbacks, message queues, etc. to notify the change of the job status. However, these existing methods cannot intuitively display the specific progress of the job execution, and there may be delays in status query; too frequent polling will increase the system burden, while too sparse polling may cause missed status changes. At the same time, the system does not provide a reliable event notification mechanism, and users cannot promptly handle the alarm information generated during the job execution process.
[0005] Therefore, it is urgent to invent a new business system operation management and early warning method to solve the problems of the existing business system operation management being not intuitive enough, inefficient and not providing timely early warning information feedback. Summary of the invention
[0006] In view of this, embodiments of the present invention provide a method, device, medium and program product for job warning based on topology dependency, which at least partially solve the problems existing in the prior art.
[0007] Other features and advantages of the present invention will become apparent from the following detailed description, or may be learned in part by practice of the present invention.
[0008] In order to achieve the above purpose, the embodiment of the present invention provides the following technical solutions:
[0009] According to a first aspect of an embodiment of the present invention, a method for job early warning based on topology dependency is provided, the method comprising:
[0010] Record job information in the job dependency table and configure dependencies between jobs;
[0011] Using the job dependency table, generating a job topology graph;
[0012] Based on the suspended polling algorithm, the average operation time of each operation in the operation topology diagram is calculated;
[0013] Generate a critical operation path using the operation topology graph according to a critical path algorithm;
[0014] Generate an actual job sequence according to the average job duration of the jobs on the critical job path;
[0015] The actual operation timing is compared with the critical path timing corresponding to the critical operation path, and the operation with abnormal time consumption is used as the operation to be warned. According to the upstream and downstream buffer time of the operation to be warned, path warning information is generated.
[0016] Furthermore, the job dependency table is used to generate a job topology graph, including:
[0017] Performing job parsing on the job dependency table to obtain job information and dependency relationships between jobs;
[0018] Using the job information, dependencies between jobs, and imported basic topology data, a job topology relationship is obtained;
[0019] A job topology graph is generated according to the job topology relationship.
[0020] Furthermore, based on the suspended polling algorithm, the average time consumption of each job in the job topology graph is calculated, including:
[0021] According to the dependency relationship between each job to be calculated in the job topology graph, the number of predecessors of each job to be calculated is calculated, where the number of predecessors is the number of the job to be calculated;
[0022] The jobs to be calculated and the corresponding predecessor numbers are stored in the job pending polling table;
[0023] For each job to be calculated in the job suspension polling table, determining whether the number of predecessors of the job to be calculated is equal to the number of completed predecessor jobs corresponding to the job to be calculated in the job completion mark table;
[0024] If the number of predecessors of the job to be calculated is equal to the number of completed predecessor jobs corresponding to the job to be calculated in the job completion mark table, the job to be calculated is placed in a queue to be driven;
[0025] If the number of predecessors of the job to be calculated is not equal to the number of completed predecessor jobs corresponding to the job to be calculated in the job completion mark table, the job to be calculated is not put into the queue to be driven;
[0026] According to the preset scheduling strategy, the job to be calculated is selected from the queue to be driven for job execution processing, and the average job time corresponding to the job to be calculated is obtained;
[0027] Mark the completed pending jobs as completed jobs and store them in the job completion mark table.
[0028] Further, according to the critical path algorithm, the critical operation path is generated using the operation topology graph, including:
[0029] According to the dependency relationship between the jobs to be analyzed in the job topology graph, forward calculation and backward calculation are performed for all the jobs to be analyzed to obtain forward calculation results and backward calculation results;
[0030] A key operation path is constructed according to the forward calculation results and the backward calculation results corresponding to the operation to be analyzed.
[0031] Furthermore, forward calculation and backward calculation are performed for all jobs to be analyzed, and forward calculation results and backward calculation results are obtained, including:
[0032] Perform forward calculation on the jobs to be analyzed in the job topology graph to obtain the earliest start time and earliest completion time corresponding to each job to be analyzed, wherein the initial value of the earliest start time is zero, the earliest start time corresponding to the job to be analyzed is the earliest completion time of the predecessor job corresponding to the job to be analyzed, and the earliest completion time corresponding to the job to be analyzed is the sum of the earliest start time corresponding to the job to be analyzed and the job duration corresponding to the job to be analyzed;
[0033] Backward calculation is performed on the jobs to be analyzed in the job topology diagram to obtain the latest start time and the latest completion time corresponding to each job to be analyzed, wherein the initial value of the latest completion time is the final value of the earliest completion time, the latest start time corresponding to the job to be analyzed is the difference between the latest completion time corresponding to the job to be analyzed and the job duration corresponding to the job to be analyzed, and the latest completion time corresponding to the job to be analyzed is the latest start time of the post-job corresponding to the job to be analyzed.
[0034] Furthermore, according to the forward calculation results and the backward calculation results corresponding to the job to be analyzed, a key job path is constructed, including:
[0035] For each job to be analyzed in the job topology graph, determining whether the earliest start time corresponding to the job to be analyzed is equal to the latest start time corresponding to the job to be analyzed;
[0036] If the earliest start time corresponding to the job to be analyzed is not equal to the latest start time corresponding to the job to be analyzed, then the job to be analyzed is not considered as a key job;
[0037] If the earliest start time corresponding to the job to be analyzed is equal to the latest start time corresponding to the job to be analyzed, the job to be analyzed is regarded as a key job;
[0038] Using all the key tasks, a key task path is obtained.
[0039] Furthermore, the actual operation timing is compared with the critical path timing corresponding to the critical operation path, and the operation with abnormal time consumption is used as the operation to be warned. According to the upstream and downstream buffer time of the operation to be warned, path warning information is generated, including:
[0040] Comparing the actual operation timing with the critical path timing to obtain a comparison result, wherein the critical path timing is the start time and completion time of each operation on the critical operation path;
[0041] According to the comparison result, determining whether there is an abnormally time-consuming operation;
[0042] If there are no operations that are abnormally time-consuming, no warning is required;
[0043] If there is an abnormally time-consuming job, the abnormally time-consuming job is regarded as a job to be warned;
[0044] Based on the topological dependency of the job to be warned, determining whether a buffer time is set between the job to be warned and a subsequent job of the job to be warned;
[0045] If no buffer time is set between the job to be warned and the post-job of the job to be warned, the job time deviation corresponding to the job to be warned is used as the final time deviation;
[0046] If a buffer time is set between the job to be warned and the post-job of the job to be warned, determining whether the buffer time can absorb the job time deviation of the job to be warned;
[0047] If the buffer time can absorb the time deviation of the job to be warned, the time deviation of the job to be warned will not affect the subsequent job, and no warning is needed;
[0048] If the buffer time is insufficient to absorb the operation time deviation of the operation to be warned, the difference between the operation time deviation and the buffer time is used as the final time deviation of the operation to be warned;
[0049] According to the final time-consuming deviation, the warning activity point corresponding to the job to be warned is obtained, path warning information is generated for the warning activity point, and the path warning information is displayed in the job topology map.
[0050] According to a second aspect of an embodiment of the present invention, there is provided a topology dependency-based job warning device, the device comprising: a processor and a memory;
[0051] The memory is used to store one or more program instructions;
[0052] The processor is used to run one or more program instructions to execute the steps of a topology-dependent job warning method as described in any one of the above items.
[0053] According to a third aspect of an embodiment of the present invention, a computer-readable storage medium is provided, wherein a computer program is stored on the computer-readable storage medium, and when the computer program is executed by a processor, the steps of a method for job warning based on topological dependency as described above are implemented.
[0054] According to a fourth aspect of an embodiment of the present invention, a computer program product is provided, the computer program product comprising a computer program stored on a non-transitory computer-readable storage medium, the computer program comprising program instructions, which, when executed by a computer, enable the computer to implement the steps of a job warning method based on topology dependency as described in any of the above items.
[0055] The embodiments of the present invention have the following advantages:
[0056] 1. Intuitiveness: The present invention uses a topology diagram to clearly and intuitively display the hierarchy, logic and operating status of each link of the operation, helping operation and maintenance personnel to clarify the internal topological relationship.
[0057] 2. Simplicity: The present invention utilizes a suspended polling algorithm based on a single thread or a group of threads to periodically suspend the queue and check the status and dependencies of the job to determine the average time consumption of the job. The algorithm is simple and has high computational efficiency.
[0058] 3. Real-time performance: The present invention compares the actual operation time with the operation time calculated by the critical path method. When there is a time deviation, the early warning mechanism is triggered, and early warning information is generated and sent to relevant personnel, so that the operation and maintenance personnel can grasp the operation status in time. BRIEF DESCRIPTION OF THE DRAWINGS
[0059] In order to more clearly illustrate the implementation methods of the present invention or the technical solutions in the prior art, the following briefly introduces the drawings required for the implementation methods or the description of the prior art. Obviously, the drawings in the following description are only exemplary, and for ordinary technicians in this field, other implementation drawings can be derived from the provided drawings without creative work.
[0060] Figure 1 A schematic diagram of a process flow of a job early warning method based on topology dependency provided by an embodiment of the present invention;
[0061] Figure 2 A schematic diagram of a process for calculating the average time consumption of a job using a suspended polling algorithm provided by an embodiment of the present invention;
[0062] Figure 3 A schematic diagram of a process for generating a key operation path provided by an embodiment of the present invention;
[0063] Figure 4 A schematic diagram of a process for generating path warning information provided by an embodiment of the present invention;
[0064] Figure 5 A schematic diagram of the logical architecture of job scheduling provided by an embodiment of the present invention. DETAILED DESCRIPTION
[0065] In order to enable those skilled in the art to better understand the scheme of the present invention, the technical scheme in the embodiments of the present invention will be clearly and completely described below in conjunction with the drawings in the embodiments of the present invention. Obviously, the described embodiments are only part of the embodiments of the present invention, not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by ordinary technicians in this field without creative work should fall within the scope of protection of the present invention.
[0066] In addition, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover non-exclusive inclusions. For example, a process, method, system, product, or apparatus that includes a series of steps or elements is not necessarily limited to those steps or elements explicitly listed, but may include other steps or elements not explicitly listed or inherent to such process, method, product, or apparatus.
[0067] The embodiment of the present invention discloses a job early warning method based on topology dependency. Figure 1 The figure shows a flow chart of a job early warning method based on topology dependency according to an embodiment of the present invention.
[0068] like Figure 1 As shown, the job warning method based on topology dependency according to an embodiment of the present invention may include step S100, step S200, step S300, step S400, step S500 and step S600.
[0069] In step S100, the job information is recorded in a job dependency table, and the dependency relationship between jobs is configured.
[0070] The above steps specifically include: creating an Excel template, recording the job information in the template according to preset fields, forming a job dependency table, and arranging and configuring the dependency relationships between jobs in the table; the above preset fields include job ID, job name, job description, dependent job list and trigger conditions, and the above dependency relationships include the relationship between a job and its predecessor and successor jobs.
[0071] In step S200, a job topology graph is generated using the job dependency table.
[0072] The above steps specifically include: uploading the job dependency table, using the background service to perform job parsing on the job dependency table, extracting the job information and the dependency relationship between jobs, and importing the basic topology data, using the job information, the dependency relationship between jobs and the imported basic topology data to obtain the upper and lower job topology relationship; based on the job topology relationship, generating the initialization topology, performing internal topology customization on the initialization topology, generating the topology version, and finally obtaining the job topology diagram.
[0073] In step S300, based on the suspended polling algorithm, the average job duration of each job in the job topology graph is calculated.
[0074] In one example, the Figure 2 The process shown obtains the average time consumed by each job.
[0075] Figure 2 The figure shows a flow chart of calculating the average time consumption of a job according to an embodiment of the present invention.
[0076] like Figure 2 As shown, in step S301, the number of predecessors of each job to be calculated is calculated according to the dependency relationship between each job to be calculated in the job topology graph, and the number of predecessors is the number of predecessor jobs of the job to be calculated.
[0077] In step S302, the job to be calculated and the corresponding predecessor number are stored in a job suspension polling table.
[0078] Next, in step S303, for each job to be calculated in the job suspension polling table, determine whether the number of predecessors of the job to be calculated is equal to the number of completed predecessor jobs corresponding to the job to be calculated in the job completion mark table; if the number of predecessors of the job to be calculated is equal to the number of completed predecessor jobs corresponding to the job to be calculated in the job completion mark table, execute step S304 to put the job to be calculated into the queue to be driven; if the number of predecessors of the job to be calculated is not equal to the number of completed predecessor jobs corresponding to the job to be calculated in the job completion mark table, execute step S305 and do not put the job to be calculated into the queue to be driven.
[0079] In step S306, according to a preset scheduling strategy, a job to be calculated is selected from the queue to be driven for multiple rounds of job execution processing to obtain an average job duration corresponding to the job to be calculated. The preset scheduling strategy includes a load balancing strategy and a priority strategy.
[0080] Finally, in step S307, the completed job to be calculated is marked as a completed job and stored in the job completion mark table.
[0081] The embodiment of the present invention calculates the average time consumption of a job through a suspended polling algorithm. The suspended polling algorithm determines whether the job is completed by querying the job list and database records. According to the dependency relationship between jobs, it checks whether the dependency conditions of each job are met. The dependency condition is that all the predecessor jobs of the job have been completed. If the dependency condition of the job to be calculated is not met (that is, there is a predecessor job that has not been completed), the job will be marked as suspended and put into the suspended polling table to wait. The suspended polling table is used to store jobs that do not currently meet the execution conditions. The algorithm will poll the suspended queue according to a preset cycle. In each polling, the algorithm will re-evaluate whether the dependency conditions of each job in the queue are met. Once the dependency conditions of a job are all met (that is, all predecessor jobs have been completed), the job will be removed from the suspended queue and placed in the queue to be driven. The jobs in the queue to be driven are waiting to be executed in a certain order (such as priority, submission time, etc.). The system will select jobs from the queue to be driven according to the preset scheduling strategy for multiple rounds of execution to obtain the average time consumption of the job. After the execution is completed, the job will be marked as completed and can trigger the dependent condition check of its post-jobs. The above-mentioned suspended polling algorithm will perform polling checks in a loop until all jobs are executed or other termination conditions are met, including timeout and system shutdown.
[0082] Return to reference Figure 1 In step S400, a critical operation path is generated using the operation topology graph according to a critical path algorithm.
[0083] In one example, the Figure 3The process shown generates critical path activities.
[0084] Figure 3 A flowchart of generating a critical path job according to an embodiment of the present invention is illustrated.
[0085] like Figure 3 As shown, in step S401, according to the dependency relationship between each job to be analyzed in the job topology graph, forward calculation and backward calculation are performed for all jobs to be analyzed respectively to obtain forward calculation results and backward calculation results.
[0086] Specifically, the above steps include: performing forward calculation on the jobs to be analyzed in the job topology diagram, and calculating the earliest start time ES and the earliest completion time EF corresponding to each job to be analyzed. Forward calculation refers to a forward calculation based on the dependency relationship, wherein the earliest start time ES of the first job executed is zero, the earliest start time ES corresponding to the job to be analyzed is the earliest completion time EF of the predecessor job corresponding to the job to be analyzed, and the earliest completion time EF corresponding to the job to be analyzed is the sum of the earliest start time ES corresponding to the job to be analyzed and the preset job duration corresponding to the job to be analyzed, that is, the earliest completion time EF = earliest start time ES + job duration.
[0087] Perform backward calculation on the jobs to be analyzed in the job topology diagram to obtain the latest start time LS and the latest completion time LF corresponding to each job to be analyzed. Backward calculation refers to the reverse calculation based on the dependency relationship, where the initial value of the latest completion time LF is the final value of the earliest completion time EF, that is, the earliest completion time EF of the last job in the forward calculation; the latest start time LS corresponding to the job to be analyzed is the difference between the latest completion time LF corresponding to the job to be analyzed and the job duration corresponding to the job to be analyzed, that is, the latest start time LS = latest completion time LF - job duration, and the latest completion time LF corresponding to the job to be analyzed is the latest start time LS of the subsequent job corresponding to the job to be analyzed.
[0088] In step S402, for each job to be analyzed in the job topology diagram, determine whether the earliest start time corresponding to the job to be analyzed is equal to the latest start time corresponding to the job to be analyzed; if the earliest start time corresponding to the job to be analyzed is not equal to the latest start time corresponding to the job to be analyzed, execute step S403, indicating that the job to be analyzed is not on the critical path, and the job to be analyzed is not regarded as a critical job; if the earliest start time corresponding to the job to be analyzed is equal to the latest start time corresponding to the job to be analyzed, execute step S404, indicating that the job to be analyzed is on the critical path, and the job to be analyzed is regarded as a critical job.
[0089] Next, in step S405, all key tasks are used to obtain key task paths.
[0090] The above critical path method is an important theoretical method for processing the topological dependency of scheduling jobs. A series of interdependent jobs in a job flow are executed in a specific order. The embodiment of the present invention determines whether the job is on the critical path by judging whether the earliest start time and the latest start time of the job to be analyzed are equal. The critical job path determines the shortest completion time of the entire job flow. After the critical job path is determined, the execution order and resource allocation of jobs on the critical path can be optimized, which helps to ensure that the job flow can be completed on time and maximize the use of limited resources.
[0091] The critical path algorithm used in the embodiment of the present invention can also be used to monitor the progress of the job flow. By regularly checking the progress of jobs on the critical path, potential delay risks can be discovered in a timely manner. If a job is delayed, the critical path is recalculated and the resource allocation and job priority are adjusted according to the new critical path.
[0092] Return to reference Figure 1 In step S500, the actual job sequence corresponding to the jobs on the critical path is generated according to the average time consumption of each job on the critical job path.
[0093] In step S600, the actual job timing is compared with the critical path timing corresponding to the critical job path, and the job with abnormal time consumption is regarded as the job to be warned. According to the upstream and downstream buffer time of the job to be warned, the path warning information is generated.
[0094] In one example, the Figure 4 The process shown generates path warning information.
[0095] Figure 4 The figure shows a flow chart of generating path warning information according to an embodiment of the present invention.
[0096] like Figure 4 As shown, in step S601, the actual job timing corresponding to the critical path is compared with the critical path timing to obtain a comparison result, wherein the critical path timing is the start time and completion time of each job on the critical job path, which is an ideal job timing predicted based on the critical path algorithm.
[0097] In step S602, based on the comparison results, determine whether there are any jobs with abnormal time consumption, that is, determine whether there are any jobs whose actual job timing information does not match the critical path timing information; if there are no jobs with abnormal time consumption, execute step S603 without issuing an early warning; if there are jobs with abnormal time consumption, execute step S604 and treat the jobs with abnormal time consumption as jobs to be warned.
[0098] Next, in step S605, based on the topological dependency of the jobs to be warned, it is determined whether a buffer time is set between the job to be warned and a subsequent job of the job to be warned.
[0099] If no buffer time is set between the job to be warned and the subsequent job of the job to be warned, step S606 is executed to take the job time deviation corresponding to the job to be warned as the final time deviation.
[0100] If a buffer time is set between the job to be warned and its subsequent job, step S607 is executed to determine whether the buffer time can absorb the job time deviation of the job to be warned, that is, whether the buffer time is greater than the job time deviation.
[0101] If the buffer time can absorb the time-consuming deviation of the job to be warned, step S608 is executed. The time-consuming deviation of the job to be warned will not affect the subsequent job, and no warning is required.
[0102] If the buffer time is insufficient to absorb the operation time deviation of the operation to be warned, step S609 is executed to take the difference between the operation time deviation and the buffer time as the final time deviation of the operation to be warned.
[0103] In addition, when considering resource constraints, when upstream job delays cause resource occupancy to be extended, it is also necessary to calculate the time difference from resource release to the time when downstream jobs can start; as well as the scheduling flexibility of downstream jobs. When the start time of downstream jobs can be flexibly adjusted according to resource availability, the actual impact time may need to be determined in combination with the resource scheduling plan. The final calculated time of the affected downstream jobs should take into account the combined effect of all relevant factors.
[0104] Finally, in step S610, based on the final time-consuming deviation obtained by comprehensively considering all relevant factors, the warning activity point corresponding to the warning is obtained, path warning information is generated for the warning activity point, and the path warning information is displayed in the job topology map, so that the user can promptly grasp the changes in the job status, obtain warning information in time and conduct analysis to avoid the occurrence of job execution delays.
[0105] The embodiment of the present invention determines the execution status of the job by comparing the actual job timing of the critical job path with the critical path timing calculated by the critical path algorithm. When an abnormality occurs in the job time consumption, the warning activity node is automatically obtained, the warning information is generated, and displayed on the topology map.
[0106] in addition, Figure 5A schematic diagram of the logical architecture of a job scheduling provided for an embodiment of the present disclosure is provided. The system consists of an execution layer, a control layer, an application layer, and a presentation layer, and is a typical four-layer architecture. The application layer provides a wealth of functions and tools, and orchestrates workflows through graphic orchestration / Excel orchestration, etc., and manages the execution order, time, and dependencies of jobs in a refined manner. In the job management and topology monitoring modules, the association relationship between batch jobs that have dependencies between various systems is topologically displayed, and early warning, predictive analysis, and a sound business operation topology relationship are established for batch overall job management.
[0107] The present invention discloses a method, device, medium and program product for job warning based on topological dependency, including: firstly, recording job information in a job dependency table, and configuring the dependency relationship between jobs; then using the job dependency table to generate a job topology map; then based on a suspended polling algorithm, calculating the average job time of each job in the job topology map; according to a critical path algorithm, using the job topology map to generate a critical job path; then generating the actual job sequence according to the average job time of the jobs on the critical job path; finally, using the actual job sequence and the critical path sequence corresponding to the critical job path to compare, taking the jobs with abnormal time consumption as jobs to be warned, and generating path warning information according to the upstream and downstream buffering time of the jobs to be warned. The present invention can realize visual management and warning of jobs based on topological dependency, and ensure the high efficiency and real-time performance of job warning.
[0108] In addition, an embodiment of the present invention also provides a job warning device based on topological dependency, which includes: a processor and a memory; the memory is used to store one or more program instructions; the processor is used to run one or more program instructions to execute the steps of a job warning method based on topological dependency as described in any of the above items.
[0109] In addition, an embodiment of the present invention further provides a computer-readable storage medium having a computer program stored thereon. When the computer program is executed by a processor, the steps of a job warning method based on topology dependency as described in any one of the above items are implemented.
[0110] In addition, an embodiment of the present invention further provides a computer program product, which includes computer program instructions. When the computer program instructions are executed by a processor, the steps of a job warning method based on topology dependency as described in any of the above items are implemented.
[0111] In the embodiment of the present invention, the processor may be an integrated circuit chip with signal processing capability. The processor may be a general-purpose processor, a digital signal processor (DSP), an application-specific integrated circuit (ASIC), a field programmable gate array (FPGA), or other programmable logic devices, discrete gates or transistor logic devices, or discrete hardware components. The methods, steps, and logic block diagrams disclosed in the embodiments of the present invention may be implemented or executed. The general-purpose processor may be a microprocessor or the processor may be any conventional processor, etc. The steps of the method disclosed in the embodiment of the present invention may be directly embodied as being executed by a hardware decoding processor, or may be executed by a combination of hardware and software modules in a decoding processor. The software module may be located in a mature storage medium in the art such as a random access memory, a flash memory, a read-only memory, a programmable read-only memory, or an electrically erasable programmable memory, a register, etc. The processor reads the information in the storage medium and completes the steps of the above method in combination with its hardware. The storage medium may be a memory, for example, a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories. Among them, the non-volatile memory can be a read-only memory (ROM), a programmable read-only memory (PROM), an erasable programmable read-only memory (EPROM), an electrically erasable programmable read-only memory (EEPROM), or a flash memory. The volatile memory can be a random access memory (RAM), which is used as an external cache. By way of example but not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDRSDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous link dynamic random access memory (SLDRAM) and direct memory bus random access memory (Direct Rambus RAM, DRRAM).The storage medium described in the embodiment of the present invention is intended to include but is not limited to these and any other suitable types of memory. Those skilled in the art should be aware that in one or more of the above examples, the functions described in the present invention can be implemented by a combination of hardware and software. When the software is applied, the corresponding function can be stored in a computer-readable medium or transmitted as one or more instructions or codes on a computer-readable medium. Computer-readable media include computer storage media and communication media, wherein the communication medium includes any medium that is convenient for transmitting a computer program from one place to another. The storage medium can be any available medium that a general or special-purpose computer can access. Although the present invention has been described in detail above with general descriptions and specific embodiments, it is obvious to those skilled in the art that some modifications or improvements can be made to it on the basis of the present invention. Therefore, these modifications or improvements made on the basis of not departing from the spirit of the present invention all belong to the scope of protection claimed in the present invention.
Claims
1. A job warning method based on topological dependency, It is characterized in that The method comprises: Record job information in the job dependency table and configure dependencies between jobs; Using the job dependency table, generating a job topology graph; Based on the suspended polling algorithm, the average operation time of each operation in the operation topology diagram is calculated; Generate a critical operation path using the operation topology graph according to a critical path algorithm; Generate an actual job sequence according to the average job duration of the jobs on the critical job path; The actual operation timing is compared with the critical path timing corresponding to the critical operation path, and the operation with abnormal time consumption is used as the operation to be warned. According to the upstream and downstream buffer time of the operation to be warned, path warning information is generated.
2. A method for early warning of a job based on topological dependency as claimed in claim 1, It is characterized in that Using the job dependency table, a job topology graph is generated, including: Performing job parsing on the job dependency table to obtain job information and dependency relationships between jobs; Using the job information, dependencies between jobs, and imported basic topology data, a job topology relationship is obtained; A job topology graph is generated according to the job topology relationship.
3. A method for early warning of a job based on topological dependence as claimed in claim 1, It is characterized in that Based on the suspended polling algorithm, the average time consumption of each job in the job topology diagram is calculated, including: According to the dependency relationship between each job to be calculated in the job topology graph, the number of predecessors of each job to be calculated is calculated, where the number of predecessors is the number of the job to be calculated; The jobs to be calculated and the corresponding predecessor numbers are stored in the job pending polling table; For each job to be calculated in the job suspension polling table, determining whether the number of predecessors of the job to be calculated is equal to the number of completed predecessor jobs corresponding to the job to be calculated in the job completion mark table; If the number of predecessors of the job to be calculated is equal to the number of completed predecessor jobs corresponding to the job to be calculated in the job completion mark table, the job to be calculated is placed in a queue to be driven; If the number of predecessors of the job to be calculated is not equal to the number of completed predecessor jobs corresponding to the job to be calculated in the job completion mark table, the job to be calculated is not put into the queue to be driven; According to the preset scheduling strategy, the job to be calculated is selected from the queue to be driven for job execution processing, and the average job time corresponding to the job to be calculated is obtained; Mark the completed pending jobs as completed jobs and store them in the job completion mark table.
4. A method for early warning of a job based on topological dependence as claimed in claim 1, It is characterized in that According to the critical path algorithm, the critical operation path is generated using the operation topology graph, including: According to the dependency relationship between the jobs to be analyzed in the job topology graph, forward calculation and backward calculation are performed for all the jobs to be analyzed to obtain forward calculation results and backward calculation results; A key operation path is constructed according to the forward calculation results and the backward calculation results corresponding to the operation to be analyzed.
5. A method for early warning of a job based on topological dependency as claimed in claim 4, It is characterized in that Perform forward calculation and backward calculation for all jobs to be analyzed, and obtain forward calculation results and backward calculation results, including: Perform forward calculation on the jobs to be analyzed in the job topology graph to obtain the earliest start time and earliest completion time corresponding to each job to be analyzed, wherein the initial value of the earliest start time is zero, the earliest start time corresponding to the job to be analyzed is the earliest completion time of the predecessor job corresponding to the job to be analyzed, and the earliest completion time corresponding to the job to be analyzed is the sum of the earliest start time corresponding to the job to be analyzed and the job duration corresponding to the job to be analyzed; Backward calculation is performed on the jobs to be analyzed in the job topology diagram to obtain the latest start time and the latest completion time corresponding to each job to be analyzed, wherein the initial value of the latest completion time is the final value of the earliest completion time, the latest start time corresponding to the job to be analyzed is the difference between the latest completion time corresponding to the job to be analyzed and the job duration corresponding to the job to be analyzed, and the latest completion time corresponding to the job to be analyzed is the latest start time of the post-job corresponding to the job to be analyzed.
6. A method for early warning of a job based on topological dependence as claimed in claim 5, It is characterized in that According to the forward calculation results and backward calculation results corresponding to the job to be analyzed, a key job path is constructed, including: For each job to be analyzed in the job topology graph, determining whether the earliest start time corresponding to the job to be analyzed is equal to the latest start time corresponding to the job to be analyzed; If the earliest start time corresponding to the job to be analyzed is not equal to the latest start time corresponding to the job to be analyzed, then the job to be analyzed is not considered as a key job; If the earliest start time corresponding to the job to be analyzed is equal to the latest start time corresponding to the job to be analyzed, the job to be analyzed is regarded as a key job; Using all the key tasks, a key task path is obtained.
7. A method for early warning of a job based on topological dependence as claimed in claim 1, It is characterized in that The actual operation timing is compared with the critical path timing corresponding to the critical operation path, and the operation with abnormal time consumption is used as the operation to be warned. According to the upstream and downstream buffer time of the operation to be warned, path warning information is generated, including: Comparing the actual operation timing with the critical path timing to obtain a comparison result, wherein the critical path timing is the start time and completion time of each operation on the critical operation path; According to the comparison result, determining whether there is an abnormally time-consuming operation; If there are no operations that are abnormally time-consuming, no warning is required; If there is an abnormally time-consuming job, the abnormally time-consuming job is regarded as a job to be warned; Based on the topological dependency of the job to be warned, determining whether a buffer time is set between the job to be warned and a subsequent job of the job to be warned; If no buffer time is set between the job to be warned and the post-job of the job to be warned, the job time deviation corresponding to the job to be warned is used as the final time deviation; If a buffer time is set between the job to be warned and the post-job of the job to be warned, determining whether the buffer time can absorb the job time deviation of the job to be warned; If the buffer time can absorb the time deviation of the job to be warned, the time deviation of the job to be warned will not affect the subsequent job, and no warning is needed; If the buffer time is insufficient to absorb the operation time deviation of the operation to be warned, the difference between the operation time deviation and the buffer time is used as the final time deviation of the operation to be warned; According to the final time-consuming deviation, the warning activity point corresponding to the job to be warned is obtained, path warning information is generated for the warning activity point, and the path warning information is displayed in the job topology map.
8. A job warning device based on topological dependency, It is characterized in that The device comprises: a processor and a memory; The memory is used to store one or more program instructions; The processor is used to run one or more program instructions to execute the steps of a topology dependency-based job warning method as described in any one of claims 1 to 7.
9. A computer-readable storage medium, It is characterized in that The computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the steps of a job warning method based on topology dependency as described in any one of claims 1 to 7 are implemented.
10. A computer program product, It is characterized in that The computer program product includes computer program instructions, which, when executed by a processor, implement the steps of a job warning method based on topology dependency as described in any one of claims 1 to 7.
