A job management method, device, storage medium and electronic device

Abstract

The present application provides a job management method, device, storage medium and electronic device. By constructing a pre-dependency matrix table based on the dependency data of each job, for each matrix column in the pre-dependency matrix table, it is determined whether there is a first marker or a cyclic marker in the matrix column. If there is a first marker or a cyclic marker in the matrix column, when the dependency data of the job corresponding to the matrix column does not include a post-output condition, a post-output condition is added to the dependency data of the job corresponding to the matrix column. If there is no first marker and no cyclic marker in the matrix column, when the dependency data of the job corresponding to the matrix column includes a post-output condition, the post-output condition in the dependency data of the job corresponding to the matrix column is deleted, realizing automatic correction of the dependency data of the job, thereby improving the job management efficiency and reducing the consumption of human and time costs.

Description

Technical Field

[0001] This application relates to the field of computer technology, and in particular, to a job management method, device, storage medium, and electronic device. Background Art

[0002] In a job batch control system, with the increase in application components, the job volume surges, and it often happens that job configurations go wrong, such as chaotic job dependency relationships, missing dependency conditions, etc., thus affecting the normal operation of job scheduling. To avoid the impact on job calls, job configurations need to be managed.

[0003] In the prior art, it relies on operation and maintenance personnel to manually check the dependency relationships of each job level by level. However, for batch jobs, the job levels are numerous, and the dependency relationships between jobs are complex. Downstream jobs often depend on the output conditions of the upper-level jobs, and the upper-level jobs depend on the output conditions of the higher-level jobs. Such dependency relationships may exceed dozens of levels. If purely checked manually level by level, it will consume a large amount of human and time costs, and the management efficiency is low. Summary of the Invention

[0004] This application provides a job management method, device, storage medium, and electronic device, aiming to solve the problems that the existing job management methods consume a large amount of human and time costs and have low management efficiency.

[0005] To achieve the above object, this application provides the following technical solutions:

[0006] A job management method includes:

[0007] Obtain the dependency relationship data and job serial numbers of each job included in the application component; the dependency relationship data of each job includes pre-dependency conditions and / or post-output conditions;

[0008] Based on the dependency relationship data of each job, construct a pre-dependency matrix table; wherein, the number of rows and columns of the pre-dependency matrix table is determined by the number of jobs included in the application component;

[0009] For each matrix column in the pre-dependency matrix table, determine whether there is a first marker or a cyclic marker in the matrix column. If there is a first marker or a cyclic marker in the matrix column, then when the dependency data of the job corresponding to the matrix column does not include a post-output condition, add a post-output condition to the dependency data of the job corresponding to the matrix column and generate a correction log. If there is no first marker and no cyclic marker in the matrix column, then when the dependency data of the job corresponding to the matrix column includes a post-output condition, delete the post-output condition in the dependency data of the job corresponding to the matrix column and generate a correction log; wherein, the first marker is used to represent that the job corresponding to the target matrix column is a pre-dependency condition of the job corresponding to the target matrix row, the target matrix column is the matrix column corresponding to the first marker, and the target matrix row is the matrix row corresponding to the first marker;

[0010] If there is a cyclic marker in the pre-dependency matrix table, generate a cyclic job chain, and generate a job governance list based on the cyclic job chain and each correction log;

[0011] If there is no cyclic marker in the pre-dependency matrix table, generate a job governance list based on each correction log.

[0012] For the above method, optionally, the constructing a pre-dependency matrix table based on the dependency data of each job includes:

[0013] Construct a pre-dependency matrix table based on the dependency data of each job through depth-first traversal search.

[0014] For the above method, optionally, the constructing a pre-dependency matrix table based on the dependency data of each job through depth-first traversal search includes:

[0015] Determine the number of rows and columns of the matrix table to be constructed based on the number of jobs included in the application component;

[0016] Construct a matrix table based on the number of rows and columns of the matrix table to be constructed;

[0017] If there is a job that has no post-output condition and has not been searched, determine one of the jobs as the starting job;

[0018] Perform a search operation on the starting job; the search operation is to search for jobs that have a pre-dependency relationship with the starting job based on the dependency data of the starting job;

[0019] If a job with a pre - dependency relationship with the starting job is searched and the searched job is a job for which the search operation has not been performed, set a first marker at the position corresponding to the i - th row and j - th column in the matrix table; where, the i is determined by the job number of the starting job, and the j is determined by the job number of any job with a pre - dependency relationship.

[0020] Use the non - starting job corresponding to the first marker as the starting job, and return to execute the step of performing the search operation on the starting job.

[0021] If no job with a pre - dependency relationship with the starting job is searched, determine whether there is a job for which the search operation has not been performed among the jobs for which the search operation has been performed. If there is, determine this job as the starting job and return to execute the step of performing the search operation on the starting job.

[0022] If a job with a pre - dependency relationship with the starting job is searched and the searched job is a job for which the search operation has been performed, change the first marker corresponding to the starting job and the searched job in the matrix table to a loop marker, and use the non - starting job corresponding to the loop marker as the starting job, and return to execute the step of performing the search operation on the starting job.

[0023] If there is no job without a post - output condition, determine whether there is a job with a pre - dependency relationship with a job for which the search operation has been performed and for which the search operation has not been performed. If so, determine one of the jobs as the starting job and return to execute the step of performing the search operation on the starting job. If there is no job for which the search operation has not been performed, determine the current matrix table as the pre - dependency matrix table.

[0024] In the above method, optionally, searching for a job with a pre - dependency relationship with the starting job based on the dependency relationship data of the starting job includes:

[0025] Determine whether there is a pre - dependency condition in the dependency relationship data of the starting job.

[0026] If there is a pre - dependency condition in the dependency relationship data of the starting job, determine the job searched to have a pre - dependency relationship with the starting job.

[0027] If there is no pre - dependency condition in the dependency relationship data of the starting job, determine that no job with a pre - dependency relationship with the starting job is searched.

[0028] In the above method, optionally, generating a cyclic job chain includes:

[0029] Determine each loop marker included in the pre - dependency matrix table.

[0030] Determine the matrix rows and matrix columns corresponding to each loop tag;

[0031] Generate a loop job chain based on the matrix rows and matrix columns corresponding to each loop tag.

[0032] For the above method, optionally, after generating the job management list, it further includes:

[0033] Generate a job flow view based on the current dependency data of each job and the pre-dependency matrix table.

[0034] A job management device, including:

[0035] An acquisition unit, configured to acquire the dependency data and job numbers of each job included in the application component; the dependency data of each job includes pre-dependency conditions and / or post-output conditions;

[0036] A construction unit, configured to construct a pre-dependency matrix table based on the dependency data of each job; wherein, the number of rows and columns of the pre-dependency matrix table is determined by the number of jobs included in the application component;

[0037] A judgment unit, configured to, for each matrix column in the pre-dependency matrix table, judge whether there is a first tag or a loop tag in the matrix column. If there is a first tag or a loop tag in the matrix column, then when the dependency data of the job corresponding to the matrix column does not include a post-output condition, add a post-output condition to the dependency data of the job corresponding to the matrix column and generate a correction log. If there is no first tag and loop tag in the matrix column, then when the dependency data of the job corresponding to the matrix column includes a post-output condition, delete the post-output condition from the dependency data of the job corresponding to the matrix column and generate a correction log; wherein, the first tag is used to represent that the job corresponding to the target matrix column is a pre-dependency condition of the job corresponding to the target matrix row, the target matrix column is the matrix column corresponding to the first tag, and the target matrix row is the matrix row corresponding to the first tag;

[0038] A first generation unit, configured to, if there is a loop tag in the pre-dependency matrix table, generate a loop job chain and generate a job management list based on the loop job chain and each correction log;

[0039] A second generation unit, configured to, if there is no loop tag in the pre-dependency matrix table, generate a job management list based on each correction log.

[0040] For the above device, optionally, the construction unit is specifically configured to:

[0041] Based on the dependency data of each job, a pre-dependency matrix table is constructed through depth-first traversal search.

[0042] A storage medium stores an instruction set, and when the instruction set is executed by a processor, the above-mentioned job management method is implemented.

[0043] An electronic device includes:

[0044] A memory for storing at least one set of instruction sets;

[0045] A processor for executing the instruction sets stored in the memory, and implementing the above-mentioned job management method by executing the instruction sets.

[0046] Compared with the prior art, the present application has the following advantages:

[0047] The present application provides a job management method, device, storage medium and electronic device. By obtaining the dependency data and job serial numbers of each job included in the application component, based on the dependency data of each job, a pre-dependency matrix table is constructed. For each matrix column in the pre-dependency matrix table, it is determined whether there is a first mark or a cyclic mark in the matrix column. If there is a first mark or a cyclic mark in the matrix column, when the dependency data of the job corresponding to the matrix column does not include a post-output condition, a post-output condition is added to the dependency data of the job corresponding to the matrix column. If there is no first mark and cyclic mark in the matrix column, when the dependency data of the job corresponding to the matrix column includes a post-output condition, the post-output condition in the dependency data of the job corresponding to the matrix column is deleted, realizing automatic correction of the dependency data of the job, thereby improving the job management efficiency and reducing the consumption of human and time costs. Description of the Drawings

[0048] In order to more clearly illustrate the technical solutions in the embodiments of the present application or the prior art, the following will briefly introduce the drawings required for the description of the embodiments or the prior art. Obviously, the drawings in the following description are only the embodiments of the present application. For those of ordinary skill in the art, other drawings can be obtained according to the provided drawings without creative efforts.

[0049] Figure 1 It is a method flowchart of a job management method provided by the present application;

[0050] Figure 2 It is another method flowchart of a job management method provided by the present application;

[0051] Figure 3 It is an example diagram of a job management method provided by the present application;

[0052] Figure 4 Another flowchart of a job management method provided for this application;

[0053] Figure 5 Another example diagram of a job management method provided for this application;

[0054] Figure 6 Another example diagram of a job management method provided for this application;

[0055] Figure 7 A schematic structural diagram of a job management device provided for this application;

[0056] Figure 8 A schematic structural diagram of an electronic device provided for this application. Detailed implementation manners

[0057] Next, the technical solutions in the embodiments of this application will be clearly and completely described in conjunction with the accompanying drawings in the embodiments of this application. Obviously, the described embodiments are only some of the embodiments of this application, rather than all embodiments. All other embodiments obtained by those of ordinary skill in the art based on the embodiments of this application without creative efforts shall fall within the protection scope of this application.

[0058] The term "including" and its variants used herein are open-ended, that is, "including but not limited to". The term "based on" is "at least partially based on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". The relevant definitions of other terms will be given in the following description.

[0059] It should be noted that the concepts such as "first" and "second" mentioned in the disclosure of this application are only used to distinguish different devices, modules or units, and are not used to limit the order or mutual dependence relationship of the functions executed by these devices, modules or units.

[0060] It should be noted that the modifications of "one" and "multiple" mentioned in the disclosure of this application are illustrative rather than restrictive. Those skilled in the art should understand that unless otherwise clearly specified in the context, it should be understood as "one or more".

[0061] This application can be used in many general or special computing device environments or configurations. For example: personal computers, server computers, handheld devices or portable devices, tablet devices, multi-processor devices, distributed computing environments including any of the above devices or equipment, and so on.

[0062] An embodiment of the present application provides a job management method. The flowchart of the job management method is as follows Figure 1 shown, and specifically includes:

[0063] S101. Obtain the dependency relationship data and job serial numbers of each job included in the application component.

[0064] In this embodiment, the dependency relationship data and job serial numbers of each job included in the application component are obtained. Among them, the dependency relationship data of each job includes pre-dependency conditions and / or post-output conditions. The job serial number is used to identify the job. It should be noted that different jobs correspond to different job serial numbers.

[0065] S102. Based on the dependency relationship data of each job, construct a pre-dependency matrix table.

[0066] In this embodiment, based on the dependency relationship data of each job, a pre-dependency matrix table is constructed. Among them, the number of rows of the matrix included in the pre-dependency matrix table is determined by the number of jobs included in the application component, and the number of columns of the matrix included in the pre-dependency matrix table is determined by the number of jobs included in the application component. For example, if the number of jobs included in the application component is 9, which are job 1 to job 9 respectively, then the constructed pre-dependency matrix table is a two-dimensional matrix table with 9 rows and 9 columns. Among them, the first matrix row in the pre-dependency matrix table corresponds to job 1, the first matrix column corresponds to job 1, the second matrix row corresponds to job 2, the second matrix column corresponds to job 2, the third matrix row corresponds to job 3, the third matrix column corresponds to job 3, and so on.

[0067] In this embodiment, the pre-dependency matrix table includes a first flag, or a first flag and a cycle flag. Among them, the first flag is used to represent that the job corresponding to the matrix column where the first flag is located is the pre-dependency object of the job corresponding to the matrix column where the first flag is located. For example, referring to Table 1, there is a first flag "1" in the 3rd row and 2nd column of the pre-dependency matrix table, which means that job 2 corresponding to the 2nd column is the pre-dependency condition of job 3 corresponding to the 3rd row.

[0068] 1 2 3 4 5 6 7 8 9 10 11 12 1 0 0 0 0 0 0 0 0 0 0 0 0 2 1 0 0 0 0 0 0 0 0 0 0 0 3 0 1 0 0 0 0 0 0 0 0 0 0 4 0 0 0 0 0 0 0 0 0 0 0 0 5 0 0 0 1 0 0 0 0 0 0 0 0 6 0 0 0 1 0 0 0 0 0 0 0 0 7 0 0 0 0 1 0 0 0 0 0 0 0 8 0 0 0 0 0 1 0 0 0 0 1 0 9 0 0 0 0 0 0 0 1 0 0 0 0 10 0 0 0 0 0 0 0 0 0 0 0 R 11 0 0 0 0 0 0 0 0 0 R 0 0 12 0 0 0 0 0 0 0 0 0 0 R 0

[0069] Table 1 Pre-dependency matrix table

[0070] Among them, the cycle flag is used to represent that the job corresponding to the matrix row where the cycle flag is located, the job corresponding to the matrix column where the cycle flag is located, and other jobs form a cyclic dependency. For example, also referring to Table 1, there is a cycle flag "R" in the 11th row and 10th column of the pre-dependency table, which means that job 11 corresponding to the 11th row, job 10 corresponding to the 10th column, and other jobs form a cyclic dependency. Referring to Table 1, that is, job 10, job 11, and job 12 form a cyclic dependency.

[0071] S103. For each matrix column in the pre - dependency matrix table, determine whether there is a first marker or a cyclic marker in the matrix column. If so, execute S104; if not, execute S105.

[0072] In this embodiment, for each matrix column in the pre - dependency matrix table, determining whether there is a first marker or a cyclic marker in the matrix column means determining whether there is a first marker or a cyclic marker in this matrix column of the pre - dependency matrix table.

[0073] S104. Determine whether the dependency relationship data of the job corresponding to the matrix column includes a post - output condition. If not, execute S106; if so, execute S107.

[0074] In this embodiment, for each matrix column in the pre - dependency matrix table, if there is a first marker or a cyclic marker in the matrix column, further determine whether the dependency relationship data of the job corresponding to the matrix column includes a post - output condition.

[0075] S105. Determine whether the dependency relationship data of the job corresponding to the matrix column includes a post - output condition. If so, execute S108; if not, execute S107.

[0076] In this embodiment, for each matrix column in the pre - dependency matrix table, if there is neither a first marker nor a cyclic marker in the matrix column, further determine whether the dependency relationship data corresponding to the matrix column includes a post - output condition.

[0077] S106. Add a post - output condition to the dependency relationship data of the job corresponding to the matrix column and generate a correction log.

[0078] In this embodiment, for each matrix column in the pre - dependency matrix table, if there is a first marker or a cyclic marker in the matrix column, when the dependency relationship data of the job corresponding to the matrix column does not include a post - output condition, it means that the dependency relationship data lacks a post - output condition, and a post - output condition is added to the dependency relationship data of the job corresponding to the matrix column to correct the dependency relationship data of the job corresponding to the matrix column.

[0079] In this embodiment, for each matrix column in the pre - dependency matrix table, after adding a post - output condition to the dependency relationship data of the job corresponding to the matrix column, a correction log is generated. The correction log is used to explain that a post - output condition is added to the dependency relationship data of the job corresponding to the matrix column.

[0080] S107. Determine whether the first judgment on each matrix column in the pre - dependency matrix table is completed, where the first judgment is the judgment of whether there is a first marker or a cyclic marker. If so, execute S109; if not, return to execute S103.

[0081] S108. Delete the post-output condition in the dependency data of the job corresponding to the matrix column, and generate a correction log.

[0082] In this embodiment, for each matrix column in the pre-dependency matrix table, if neither the first marker nor the loop marker exists in the matrix column, when the dependency data of the job corresponding to the matrix column includes a post-output condition, it indicates that the dependency data has an extra post-output condition, and the post-output condition in the dependency data of the job corresponding to the matrix column is deleted, so as to correct the dependency data of the job corresponding to the matrix column.

[0083] In this embodiment, for each matrix column in the pre-dependency matrix table, after deleting the post-output condition in the dependency data of the job corresponding to the matrix column, a correction log is generated, and the correction log is used to explain the deletion of the post-output condition in the dependency data of the job corresponding to the matrix column.

[0084] S109. Determine whether there is a loop marker in the pre-dependency matrix table. If so, execute S110; if not, execute S111.

[0085] In this embodiment, after completing the correction of the dependency data of all jobs, it is determined whether there is a loop marker in the pre-dependency matrix table.

[0086] S110. Generate a loop job chain, and generate a job governance list based on the loop job chain and each correction log.

[0087] In this embodiment, when there is a loop marker in the pre-dependency matrix table, a loop job chain is generated.

[0088] Refer to Figure 2 , the process of generating a loop job chain specifically includes the following steps:

[0089] S201. Determine each loop marker included in the pre-dependency matrix table.

[0090] In this embodiment, determine each loop marker included in the pre-dependency matrix table. For example, refer to Table 1, there are 3 loop markers 1 in the pre-dependency matrix table, which are the loop marker 2 in the 10th row and 12th column, the loop marker in the 11th row and 10th column, and the loop marker 3 in the 12th row and 11th column respectively.

[0091] S202. Determine the matrix row and matrix column corresponding to each loop marker.

[0092] Exemplarily, refer to Table 1, loop marker 1 corresponds to the 10th row and 12th column, loop marker 2 corresponds to the 11th row and 10th column, and loop marker 3 corresponds to the 12th row and 11th column.

[0093] S203. Generate a cyclic job chain based on the matrix rows and matrix columns corresponding to each loop tag.

[0094] In this embodiment, to generate a cyclic job chain based on the matrix rows and matrix columns corresponding to each loop tag, specifically, determine the jobs corresponding to the matrix rows corresponding to each loop tag based on the matrix rows corresponding to each loop tag, and determine the jobs corresponding to the matrix columns corresponding to each loop tag based on the matrix columns corresponding to each loop tag. Then, generate a cyclic job chain based on the jobs corresponding to the matrix rows corresponding to each loop tag and the jobs corresponding to the matrix columns corresponding to each loop tag.

[0095] Exemplarily, referring to Table 1, the job corresponding to the 10th row corresponding to loop tag 1 is job 10, and the job corresponding to the 12th column corresponding to loop tag 1 is job 12. Thus, it can be known that job 12 is the pre - dependency condition of job 10; the job corresponding to the 11th row corresponding to loop tag 2 is job 11, and the job corresponding to the 10th column corresponding to loop tag 2 is job 10. Thus, it can be known that job 10 is the pre - dependency condition of job 11; the job corresponding to the 12th row corresponding to loop tag 3 is job 12, and the job corresponding to the 11th column corresponding to loop tag 3 is job 11. Thus, it can be known that job 11 is the pre - dependency condition of job 12. Therefore, a cyclic job chain can be generated as Figure 3 shown, where JOB10 is job 10, JOB11 is job 11, and JOB12 is job 12.

[0096] In this embodiment, after generating the cyclic job chain, generate a job governance list based on the cyclic job chain and each correction log. The job governance list includes each correction log and the cyclic job chain.

[0097] S111. Generate a job governance list based on each correction log.

[0098] In this implementation, if there is no loop tag in the pre - dependency matrix table, directly generate a job governance list based on each correction log. The generated job governance list includes each correction log.

[0099] The job management method provided by the embodiment of the present application obtains the dependency data and job serial numbers of each job included in the application component, constructs a pre-dependency matrix table based on the dependency data of each job, and for each matrix column in the pre-dependency matrix table, determines whether there is a first mark or a cyclic mark in the matrix column. If there is a first mark or a cyclic mark in the matrix column, when the dependency data of the job corresponding to the matrix column does not include a post-output condition, a post-output condition is added to the dependency data of the job corresponding to the matrix column. If there is no first mark and no cyclic mark in the matrix column, when the dependency data of the job corresponding to the matrix column includes a post-output condition, the post-output condition in the dependency data of the job corresponding to the matrix column is deleted, realizing automatic correction of the dependency data of the job, thereby improving the job management efficiency and reducing the consumption of human and time costs. And by generating a job management list and retaining the correction traces, it is convenient for users to quickly obtain the corrected dependency data, thereby improving the user experience.

[0100] The job management method provided by the embodiment of the present application, step S102 specifically includes the following steps:

[0101] Based on the dependency data of each job, a pre-dependency matrix table is constructed through depth-first traversal search.

[0102] In this embodiment, based on the dependency data of each job, a pre-dependency matrix table is constructed through depth-first traversal search.

[0103] Refer to Figure 4 , the process of constructing a pre-dependency matrix table based on the dependency data of each job through depth-first traversal search specifically includes the following steps:

[0104] S401. Based on the number of jobs included in the application component, determine the number of rows and columns of the matrix table to be constructed, and construct a matrix table based on the number of rows and columns of the matrix table to be constructed.

[0105] In this embodiment, based on the number of jobs included in the application component, determine the number of rows of the matrix row and the number of columns of the matrix column of the matrix table to be constructed. For example, if the number of jobs included in the application component is 9, then the number of rows of the matrix table to be constructed is 9, and the number of columns is 9.

[0106] In this embodiment, based on the number of rows and columns of the matrix table to be constructed, a matrix table is constructed. For example, if the number of rows of the matrix table to be constructed is 9 and the number of columns is 9, then a 9-row and 9-column matrix table is constructed.

[0107] S402. Determine whether there is a job that has no post-output condition and has not been subjected to a search operation. If so, execute S403; if not, execute S404.

[0108] In this embodiment, based on the dependency data of each job, it is determined whether there is a job that only has a precondition dependency but no postcondition output.

[0109] In this embodiment, after determining that there is no postcondition output, it is further determined whether there is a job among the jobs without postcondition output that has not performed a search operation, so as to determine whether there is a job without postcondition output and that has not performed a search operation.

[0110] S403. Determine one of the jobs as the starting job.

[0111] In this embodiment, if there is a job without postcondition output and that has not performed a search operation, then determine one of the jobs without postcondition output and that has not performed a search operation as the starting job.

[0112] S404. Determine whether there is a job with a postcondition output that has not performed a search operation. If not, execute S405; if so, execute S406.

[0113] In this embodiment, if there is no job without postcondition output and that has not performed a search operation, then determine whether there is a job with a postcondition output that has not performed a search operation.

[0114] S405. Determine the current matrix table as the precondition dependency matrix table.

[0115] In this embodiment, in the case where there is no job without postcondition output and that has not performed a search operation, if there is no job with a postcondition output that has not performed a search operation, it means that the search operation for all jobs has been completed, and the current matrix table is determined as the precondition dependency matrix table.

[0116] S406. Determine one of the jobs as the starting job.

[0117] In this embodiment, in the case where there is no job without postcondition output and that has not performed a search operation, if there is a job with a postcondition output that has not performed a search operation, then determine one of the jobs with a postcondition output and that has not performed a search operation as the starting job.

[0118] S407. Perform a search operation on the starting job; the search operation is to search for jobs that have a precondition dependency with the starting job based on the dependency data of the starting job.

[0119] In this embodiment, perform a search operation on the starting job. The search operation is to search for jobs that have a precondition dependency with the starting job based on the dependency data of the starting job.

[0120] Specifically, the process of performing a search operation on the starting job includes the following steps:

[0121] Determine whether there is a pre-dependency condition in the dependency relationship data of the starting job;

[0122] If there is a pre-dependency condition in the dependency relationship data of the starting job, determine the job that has a pre-dependency relationship with the starting job and is searched;

[0123] If there is no pre-dependency condition in the dependency relationship data of the starting job, determine that no job with a pre-dependency relationship with the starting job is searched.

[0124] In this embodiment, based on the dependency relationship data of the starting job, determine whether there is a pre-dependency condition in the dependency relationship data of the starting job. If there is a pre-dependency condition in the dependency relationship data of the starting job, determine the job that has a pre-dependency relationship with the starting job and is searched. If there is no pre-dependency condition in the dependency relationship data of the starting job, determine that no job with a pre-dependency relationship with the starting job is searched. For example, if there is a pre-dependency condition Ci-job1 in the dependency relationship data of the starting job JOB2, determine the job JOB1 that has a pre-dependency relationship with JOB2 and is searched.

[0125] S408. Determine whether a job with a pre-dependency relationship with the starting job is searched. If so, execute S409; if not, execute S410.

[0126] S409. Determine whether the searched job is a job on which the search operation has not been performed. If so, execute S411; if not, execute S412.

[0127] In this embodiment, if a job with a pre-dependency relationship with the starting job is searched, further determine whether the searched job is a job on which the search operation has not been performed.

[0128] S410. Determine whether there is a job that has a pre-dependency relationship with a job on which the search operation has been performed and on which the search operation has not been performed. If so, execute S413; if not, return to execute S402.

[0129] In this embodiment, determine whether there is a job that has a pre-dependency relationship with a job on which the search operation has been performed and on which the search operation has not been performed, that is, backtrack the job on which the search operation has been performed to determine whether the job on which the search operation has been performed has a pre-dependency relationship. If so, execute step S413; if not, return to execute step S402.

[0130] S411. Set a first mark at the position corresponding to the i-th row and j-th column in the matrix table, use the non-starting job corresponding to the first mark as the starting job, and return to execute S407.

[0131] In this embodiment, if a job with a pre - dependency relationship with the starting job is found, and the found job has not been subjected to the search operation, a first mark is set at the position corresponding to the i - th row and j - th column in the matrix table; where i is determined by the job number of the starting job, and j is determined by the job number of any job with a pre - dependency relationship. For example, if the starting job is job 3 and the found job is job 2, then a first mark "1" is set in the 3rd row and 2nd column of the matrix table.

[0132] In this embodiment, the non - starting job corresponding to the first mark is used as the starting job, and step S407 is returned for execution.

[0133] S412. Change the first marks corresponding to the starting job and the found job in the matrix table to loop marks, and use the non - starting job corresponding to the loop mark as the starting job, then return to execute S407.

[0134] In this embodiment, if a job with a pre - dependency relationship with the starting job is found, and the found job has already been subjected to the search operation, change the first marks corresponding to the starting job and the found job in the matrix table to loop marks. For example, if there is a first mark "1" in the 11th row and 10th column of the matrix table, the current starting job is job 11, a job 10 with a pre - dependency relationship with job 11 is found, and the found job 10 has already been subjected to the search operation, then change the first mark in the 11th row and 10th column of the matrix table to a loop mark "R".

[0135] In this embodiment, after changing to the loop mark, use the non - starting job corresponding to the loop mark as the starting job. For example, use the above - mentioned job 10 as the starting job.

[0136] S413. Determine one of the jobs as the starting job, and return to execute S407.

[0137] In this embodiment, if there is a job with a pre - dependency relationship with a job that has already been subjected to the search operation and has not been subjected to the search operation, then determine one of the jobs with a pre - dependency relationship with the job that has already been subjected to the search operation and has not been subjected to the search operation as the starting job, and return to execute step S407.

[0138] In this embodiment, an example of the process of constructing the pre - dependency matrix table mentioned above is as follows:

[0139] Take the first job with only pre - dependencies as the starting point, and trigger a DFS search of the directed graph for traversal according to the pre - dependency conditions.

[0140] Based on the DFS (Depth First Search) of the directed graph, a pre-dependency matrix table is formed:

[0141] Search for the pre-dependency jobs of the search job. Assume there are n jobs in the application component, numbered 1, 2... n. Starting from job j, find all the preconditions of job j:

[0142]

[0143] If the job has no pre-dependency jobs, return to the upper-level job and search whether it has other pre-dependency jobs. If so, continue to search for the pre-dependency jobs; if not, continue to return to the upper-level job. Repeat the DFS search, traverse these n jobs, and form the pre-dependency matrix table A = (σ ji ). The matrix is n×n dimension. Terminate the DFS search until all jobs are traversed.

[0144] If the job is traversed again and it is found that it has been marked as 1, indicating the existence of a cyclic dependency. According to the pre-dependency relationship, traverse the cyclic jobs again and change the marked values corresponding to all job chains to R.

[0145] The method provided by the embodiments of the present application constructs a pre-dependency matrix table through depth-first traversal search based on the dependency relationship data of each job, realizing the rapid construction of the pre-dependency matrix table.

[0146] After step S111 of the job governance method provided by the embodiments of the present application, the following steps may further be included:

[0147] Generate a job flow view based on the current dependency relationship data of each job and the pre-dependency matrix table.

[0148] After generating the job governance list, the job governance method provided by the embodiments of the present application generates a job flow view based on the current dependency relationship data of each job and the pre-dependency matrix table. Exemplarily, refer to Figure 5 , after JOB1 is completed, a post-output condition Co-job1 will be thrown. The pre-dependency conditions for JOB2 and JOB3 to run are both Ci-job1, and the pre-dependency conditions for JOB4 to run are Ci-job3 and Ci-job6, and so on. Among them, Figure 5 the arrows in indicate the job execution order.

[0149] Refer to Figure 6 , and the process of the above-mentioned job governance is illustrated by way of example as follows:

[0150] Step 1, obtain the dependency relationship data of the job. From Figure 6It can be known that the application component includes 12 jobs, JOB1 (i.e., job 1), JOB2 (i.e., job 2), …… JOB12 (i.e., job 12). The prerequisite job of JOB3 is JOB2. That is to say, JOB2 is the prerequisite dependency condition of JOB3. Namely, the job with a prerequisite dependency relationship with JOB3 is JOB2. The prerequisite jobs of JOB8 are JOB6 and JOB11, and so on.

[0151] Among them, in the dependency relationship data of each job, JOB2 has a prerequisite dependency condition and no post-output condition. JOB7 has a prerequisite dependency condition and also has a post-output condition. JOB10, JOB11, and JOB12 have circular dependencies, and other dependency relationships are normal.

[0152] It should be noted that Figure 6 the arrows in

[0153] represent the dependency relationship, not the job flow direction.

[0154] Step 2: Search for jobs within the application component and find the first job JOB3 that only has a prerequisite dependency condition, and set JOB3 as the search starting point. Figure 6 The traversal process of

[0155] is as follows:

[0156] (1) First, search for JOB3 and find that the prerequisite dependency is JOB2;

[0157] (2) Search for JOB2 and find that the prerequisite dependency is JOB1;

[0158] (3) Find that JOB1 has no prerequisite dependency and stop traversing;

[0159] (4) Continue to find the next job JOB9 that has no post-dependency and find that the prerequisite dependency is JOB8;

[0160] (5) According to the prerequisite dependency, search for jobs JOB8, JOB6, and JOB4 in sequence. Since they have no prerequisite dependency, stop traversing;

[0161] (6) Return to JOB8 and find another prerequisite dependency JOB11;

[0162] (7) According to the prerequisite dependency, search for jobs JOB10, JOB12 in sequence, and then reach JOB11 again, triggering the marking change of the circular dependency. Search the circular job chain again and change the marking to R, and stop traversing;

[0163] (9) It is found that JOB4 has no pre-dependencies and the traversal stops.

[0164] (10) Finally, JOB7 is searched and its pre-dependency JOB5 is found.

[0165] According to the pre-dependency condition, DFS search is performed, and the pre-dependency matrix table generated by traversing the jobs is shown in Table 1.

[0166] Step 4, count the number of marks in each matrix column of the pre-dependency matrix table, N *2 represents the number of marks in the i-th column of the pre-dependency matrix table. As follows:

[0167] (1) Judgment shows that JOB1 has post-output conditions;

[0168] (2) Judgment shows that JOB2 has no post-output conditions, so the post-output condition Co-job2 of JOB2 is added, and the correction log is recorded;

[0169] (3) Judgment shows that JOB3 has no post-output conditions;

[0170] (4) Judgment shows that JOB4 has post-output conditions;

[0171] (5) Judgment shows that JOB5 has post-output conditions;

[0172] (6) Judgment shows that JOB6 has post-output conditions;

[0173] (7) Judgment shows that JOB7 has post-output conditions, so the post-output condition Co-job7 of JOB7 is deleted, and the correction log is recorded;

[0174] (8) Judgment shows that JOB8 has post-output conditions;

[0175] (9) Judgment shows that JOB9 has no post-output conditions;

[0176] (10) Judgment is made to record the cyclic job chain.

[0177] Step 5, generate a job governance list according to the dependency correction log and the cyclic job chain.

[0178] It should be noted that although the operations are depicted in a specific order, this should not be construed as requiring these operations to be performed in the specific order shown or in sequential order. In certain environments, multitasking and parallel processing may be beneficial.

[0179] It should be understood that the various steps described in the method embodiments disclosed in this application may be executed in different orders and / or executed in parallel. In addition, the method embodiments may include additional steps and / or omit the steps shown. The scope disclosed in this application is not limited in this regard.

[0180] corresponding to Figure 1 the method described above, an embodiment of this application further provides a job management device for Figure 1 the specific implementation of the method in Figure 7 as shown, specifically including:

[0181] An acquisition unit 701, configured to acquire the dependency data and job sequence numbers of each job included in the application component; the dependency data of each job includes pre-dependency conditions and / or post-output conditions;

[0182] A construction unit 702, configured to construct a pre-dependency matrix table based on the dependency data of each job; wherein, the number of rows and columns of the pre-dependency matrix table are both determined by the number of jobs included in the application component;

[0183] A judgment unit 703, configured to, for each matrix column in the pre-dependency matrix table, judge whether there is a first mark or a loop mark in the matrix column. If there is a first mark or a loop mark in the matrix column, then when the dependency data of the job corresponding to the matrix column does not include a post-output condition, add a post-output condition to the dependency data of the job corresponding to the matrix column and generate a correction log. If there is no first mark and loop mark in the matrix column, then when the dependency data of the job corresponding to the matrix column includes a post-output condition, delete the post-output condition in the dependency data of the job corresponding to the matrix column and generate a correction log; wherein, the first mark is used to represent that the job corresponding to the target matrix column is a pre-dependency condition of the job corresponding to the target matrix row, the target matrix column is the matrix column corresponding to the first mark, and the target matrix row is the matrix row corresponding to the first mark;

[0184] A first generation unit 704, configured to, if there is a loop mark in the pre-dependency matrix table, generate a loop job chain, and generate a job management list based on the loop job chain and each correction log;

[0185] A second generation unit 705, configured to, if there is no loop mark in the pre-dependency matrix table, generate a job management list based on each correction log.

[0186] In the job management device provided by the embodiment of the present application, by obtaining the dependency data and job serial numbers of each job included in the application component, and based on the dependency data of each job, a pre-dependency matrix table is constructed. For each matrix column in the pre-dependency matrix table, it is determined whether there is a first mark or a cycle mark in the matrix column. If there is a first mark or a cycle mark in the matrix column, when the dependency data of the job corresponding to the matrix column does not include a post-output condition, a post-output condition is added to the dependency data of the job corresponding to the matrix column. If there is no first mark and no cycle mark in the matrix column, when the dependency data of the job corresponding to the matrix column includes a post-output condition, the post-output condition in the dependency data of the job corresponding to the matrix column is deleted, realizing the automatic correction of the dependency data of the job, thereby improving the job management efficiency and reducing the consumption of human and time costs.

[0187] In an embodiment of the present application, based on the foregoing solution, the construction unit 702 is specifically configured to:

[0188] Based on the dependency data of each job, a pre-dependency matrix table is constructed through depth-first traversal search.

[0189] In an embodiment of the present application, based on the foregoing solution, when the construction unit 702 constructs a pre-dependency matrix table through depth-first traversal search based on the dependency data of each job, it is specifically configured to:

[0190] Based on the number of jobs included in the application component, determine the number of rows and columns of the matrix table to be constructed;

[0191] Based on the number of rows and columns of the matrix table to be constructed, construct the matrix table;

[0192] If there is a job that has no post-output condition and has not been subjected to a search operation, determine one of the jobs as the starting job;

[0193] Perform a search operation on the starting job; the search operation is to search for jobs that have a pre-dependency relationship with the starting job based on the dependency data of the starting job;

[0194] If a job that has a pre-dependency relationship with the starting job is searched and the searched job is a job that has not been subjected to a search operation, set a first mark at the position corresponding to the i-th row and j-th column in the matrix table; where, the i is determined by the job serial number of the starting job, and the j is determined by the job serial number of any job with a pre-dependency relationship;

[0195] Use the non-starting job corresponding to the first mark as the starting job, and return to execute the step of performing the search operation on the starting job;

[0196] If no job with a pre - dependency relationship with the starting job is found, determine whether there is a job for which the search operation has not been performed among the jobs performing the search operation. If so, determine this job as the starting job and return to execute the step of performing the search operation on the starting job;

[0197] If a job with a pre - dependency relationship with the starting job is found and the found job has been subjected to the search operation, change the first marker corresponding to the starting job and the found job in the matrix table to a loop marker, and use the non - starting job corresponding to the loop marker as the starting job, and return to execute the step of performing the search operation on the starting job;

[0198] If there is no job without a post - output condition, determine whether there is a job that has a pre - dependency relationship with a job that has been subjected to the search operation and has not been subjected to the search operation. If so, determine one of the jobs as the starting job and return to execute the step of performing the search operation on the starting job. If there is no job that has not been subjected to the search operation, determine the current matrix table as the pre - dependency matrix table.

[0199] In an embodiment of the present application, based on the foregoing solution, when the construction unit 702 searches for a job with a pre - dependency relationship with the starting job based on the dependency relationship data of the starting job, it specifically is used for:

[0200] Determine whether there is a pre - dependency condition in the dependency relationship data of the starting job;

[0201] If there is a pre - dependency condition in the dependency relationship data of the starting job, then determine the job found to have a pre - dependency relationship with the starting job;

[0202] If there is no pre - dependency condition in the dependency relationship data of the starting job, then determine that no job with a pre - dependency relationship with the starting job is found.

[0203] In an embodiment of the present application, based on the foregoing solution, when the first generation unit 704 generates a loop job chain, it specifically is used for:

[0204] Determine each loop marker included in the pre - dependency matrix table;

[0205] Determine the matrix row and matrix column corresponding to each loop marker;

[0206] Generate a loop job chain based on the matrix row and matrix column corresponding to each loop marker.

[0207] In an embodiment of the present application, based on the foregoing solution, it can also be configured as:

[0208] Generate a job flow view based on the current dependency data of each job and the foregoing dependency matrix table.

[0209] An embodiment of the present application also provides a storage medium storing an instruction set, wherein when the instruction set runs, it executes the job management method disclosed in any of the foregoing embodiments.

[0210] An embodiment of the present application also provides an electronic device, the structural schematic diagram of which is as Figure 8 shown, specifically including a memory 801 for storing at least one set of instruction sets; a processor 802 for executing the instruction sets stored in the memory, and implementing the job management method disclosed in any of the foregoing embodiments by executing the instruction sets.

[0211] Although the subject matter has been described in language specific to structural features and / or methodological logical acts, it should be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. On the contrary, the specific features and acts described above are merely example forms of implementing the claims.

[0212] Although several specific implementation details are included in the foregoing discussion, these should not be construed as limiting the scope of the disclosure of the present application. Certain features described in the context of separate embodiments may also be implemented in combination in a single embodiment. Conversely, the various features described in the context of a single embodiment may also be implemented separately or in any suitable sub-combination in multiple embodiments.

[0213] The above description is only a preferred embodiment of the disclosure of the present application and an explanation of the applied technical principles. Those skilled in the art should understand that the scope of disclosure involved in the present application is not limited to the technical solutions formed by the specific combination of the above technical features, and should also cover other technical solutions formed by any combination of the above technical features or their equivalent features without departing from the above disclosure concept. For example, the technical solutions formed by mutually replacing the above features with the technical features (but not limited to) having similar functions disclosed in the present application.

Claims

1. A job management method, characterized in that, comprising: obtaining the dependency data and job serial numbers of each job included in the application component; the dependency data of each job includes pre-dependency conditions and / or post-output conditions; determining the number of rows and columns of the matrix table to be constructed based on the number of jobs included in the application component; constructing a matrix table based on the number of rows and columns of the matrix table to be constructed; if there is a job without post-output conditions and no search operation has been performed on it, determining one of the jobs as the starting job; performing a search operation on the starting job; the search operation is to search for jobs that have a pre-dependency relationship with the starting job based on the dependency data of the starting job; if a job that has a pre-dependency relationship with the starting job is searched and the searched job is a job on which no search operation has been performed, setting a first mark at the position corresponding to the i-th row and j-th column in the matrix table; where, the i is determined by the job serial number of the starting job, and the j is determined by the job serial number of any job with a pre-dependency relationship; taking the non-starting job corresponding to the first mark as the starting job, and returning to execute the step of performing the search operation on the starting job; if no job that has a pre-dependency relationship with the starting job is searched, determining whether there is a job on which no search operation has been performed among the jobs on which the search operation has been performed, if so, determining that job as the starting job, and returning to execute the step of performing the search operation on the starting job; if a job that has a pre-dependency relationship with the starting job is searched and the searched job is a job on which the search operation has been performed, changing the first mark corresponding to the starting job and the searched job in the matrix table to a loop mark, and taking the non-starting job corresponding to the loop mark as the starting job, and returning to execute the step of performing the search operation on the starting job; if there is no job without post-output conditions, determining whether there is a job that has a pre-dependency relationship with a job on which the search operation has been performed and on which no search operation has been performed, if so, determining one of the jobs as the starting job, and returning to execute the step of performing the search operation on the starting job, if there is no job on which no search operation has been performed, then determining the current matrix table as the pre-dependency matrix table; where, the number of rows and columns of the pre-dependency matrix table are both determined by the number of jobs included in the application component; For each matrix column in the pre-dependency matrix table, determine whether there is a first marker or a cyclic marker in the matrix column. If there is a first marker or a cyclic marker in the matrix column, when the dependency data of the job corresponding to the matrix column does not include a post-output condition, add a post-output condition to the dependency data of the job corresponding to the matrix column and generate a correction log. If there is no first marker and no cyclic marker in the matrix column, when the dependency data of the job corresponding to the matrix column includes a post-output condition, delete the post-output condition in the dependency data of the job corresponding to the matrix column and generate a correction log; wherein, the first marker is used to represent that the job corresponding to the target matrix column is a pre-dependency condition of the job corresponding to the target matrix row, the target matrix column is the matrix column corresponding to the first marker, and the target matrix row is the matrix row corresponding to the first marker. If there is a cyclic marker in the pre-dependency matrix table, generate a cyclic job chain, and generate a job governance list based on the cyclic job chain and each correction log. If there is no cyclic marker in the pre-dependency matrix table, generate a job governance list based on each correction log.

2. The method according to claim 1, wherein, the searching for jobs that have a pre-dependency relationship with the starting job based on the dependency data of the starting job includes: judging whether there is a pre-dependency condition in the dependency data of the starting job; if there is a pre-dependency condition in the dependency data of the starting job, determine that a job having a pre-dependency relationship with the starting job is searched; if there is no pre-dependency condition in the dependency data of the starting job, determine that no job having a pre-dependency relationship with the starting job is searched.

3. The method according to claim 1, wherein, the generating of the cyclic job chain includes: determining each cyclic marker included in the pre-dependency matrix table; determining the matrix row and matrix column corresponding to each cyclic marker; generating a cyclic job chain based on the matrix row and matrix column corresponding to each cyclic marker.

4. The method according to claim 1, wherein, after the generating of the job governance list, further includes: generating a job flow view based on the current dependency data of each job and the pre-dependency matrix table.

5. A job governance device, wherein, includes: an obtaining unit, configured to obtain the dependency data and job serial number of each job included in the application component; the dependency data of each job includes a pre-dependency condition and / or a post-output condition; a constructing unit, configured to construct a pre-dependency matrix table based on the dependency data of each job; wherein, the number of rows and columns of the pre-dependency matrix table is determined by the number of jobs included in the application component. A judgment unit, configured to, for each matrix column in the pre-dependency matrix table, determine whether there is a first marker or a cyclic marker in the matrix column. If there is a first marker or a cyclic marker in the matrix column, when the dependency data of the job corresponding to the matrix column does not include a post-output condition, add a post-output condition to the dependency data of the job corresponding to the matrix column and generate a correction log. If there is no first marker and no cyclic marker in the matrix column, when the dependency data of the job corresponding to the matrix column includes a post-output condition, delete the post-output condition in the dependency data of the job corresponding to the matrix column and generate a correction log; wherein, the first marker is used to represent that the job corresponding to the target matrix column is a pre-dependency condition of the job corresponding to the target matrix row, the target matrix column is the matrix column corresponding to the first marker, and the target matrix row is the matrix row corresponding to the first marker; A first generation unit, configured to, if there is a cyclic marker in the pre-dependency matrix table, generate a cyclic job chain and generate a job governance list based on the cyclic job chain and each correction log; A second generation unit, configured to, if there is no cyclic marker in the pre-dependency matrix table, generate a job governance list based on each correction log; The construction unit is specifically configured to: Construct a pre-dependency matrix table by depth-first traversal search based on the dependency data of each job; When constructing a pre-dependency matrix table by depth-first traversal search based on the dependency data of each job, the construction unit is specifically configured to: Determine the number of rows and columns of the matrix table to be constructed based on the number of jobs included in the application component; Construct a matrix table based on the number of rows and columns of the matrix table to be constructed; If there is a job that has no post-output condition and has not been subjected to a search operation, determine one of the jobs as a starting job; Perform a search operation on the starting job; the search operation is to search for a job that has a pre-dependency relationship with the starting job based on the dependency data of the starting job; If a job that has a pre-dependency relationship with the starting job is searched and the searched job has not been subjected to a search operation, set a first marker at the position corresponding to the i-th row and j-th column in the matrix table; wherein, the i is determined by the job number of the starting job, and the j is determined by the job number of any job with a pre-dependency relationship; Use the non-starting job corresponding to the first marker as the starting job and return to execute the step of performing the search operation on the starting job; If a job that has a pre-dependency relationship with the starting job is not searched, determine whether the job that has been subjected to the search operation has a job that has not been subjected to the search operation. If so, determine the job as the starting job and return to execute the step of performing the search operation on the starting job; If a job with a pre - dependency relationship with the starting job is found and the found job has already had a search operation performed on it, change the first marker corresponding to the starting job and the found job in the matrix table to a loop marker, and use the non - starting job corresponding to the loop marker as the starting job, then return to execute the step of performing a search operation on the starting job; If there is no job without a post - output condition, determine whether there is a job that has a pre - dependency relationship with a job on which a search operation has already been performed and has not had a search operation performed on it. If so, determine one of the jobs as the starting job and return to execute the step of performing a search operation on the starting job. If there is no job on which a search operation has not been performed, then determine the current matrix table as the pre - dependency matrix table.

6. A storage medium, characterized in that, the storage medium stores an instruction set, wherein when the instruction set is executed by a processor, it implements the job management method according to any one of claims 1 to 4.

7. An electronic device, characterized in that, it includes: a memory for storing at least one set of instruction sets; a processor for executing the instruction sets stored in the memory, and implementing the job management method according to any one of claims 1 to 4 by executing the instruction sets.

Images