CN114926045A - Operation management method and device - Google Patents
Operation management method and device Download PDFInfo
- Publication number
- CN114926045A CN114926045A CN202210589162.8A CN202210589162A CN114926045A CN 114926045 A CN114926045 A CN 114926045A CN 202210589162 A CN202210589162 A CN 202210589162A CN 114926045 A CN114926045 A CN 114926045A
- Authority
- CN
- China
- Prior art keywords
- node
- job
- nodes
- degree
- key
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0633—Workflow analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/90—Details of database functions independent of the retrieved data types
- G06F16/901—Indexing; Data structures therefor; Storage structures
- G06F16/9024—Graphs; Linked lists
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0631—Resource planning, allocation, distributing or scheduling for enterprises or organisations
- G06Q10/06312—Adjustment or analysis of established resource schedule, e.g. resource or task levelling, or dynamic rescheduling
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Theoretical Computer Science (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Strategic Management (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Educational Administration (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Marketing (AREA)
- General Business, Economics & Management (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- Databases & Information Systems (AREA)
- Software Systems (AREA)
- Data Mining & Analysis (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The present disclosure provides a job management method, including: the method comprises the steps of obtaining a directed acyclic graph corresponding to a plurality of jobs to be scheduled, wherein the directed acyclic graph comprises a plurality of nodes, and the plurality of nodes correspond to the plurality of jobs one by one; determining a key node from the plurality of nodes according to at least one of the in-degree and the out-degree of the plurality of nodes; and presenting the job execution condition of the key node. According to the method, the key nodes are determined by obtaining the directed acyclic graphs of the plurality of jobs and according to whether the in-degree or out-degree of the job nodes meets the preset conditions, the job execution conditions of the key nodes are presented to monitor the job flow of the key nodes, the job scheduling efficiency and the overall performance can be improved, and job management is achieved.
Description
Technical Field
The present disclosure relates to the field of computer technologies, and in particular, to a method, an apparatus, a server, a computer-readable storage medium, and a computer program product for job management.
Background
With the advent of the digital era, the data quantity of jobs needing to be processed in a job scheduling system is increasing, and the dependency relationship among the jobs is also increasing in complexity. In existing job scheduling, dependencies between jobs can be represented by directed acyclic graphs. Each node in the directed acyclic graph represents a job, and the arrows in the directed acyclic graph represent the execution order of the jobs. The node has an in degree and an out degree, the in degree refers to the number of nodes of which the arrows point to the node, and the out degree refers to the number of nodes of which the arrows point to the node. If the in-degree of a node is 0, the job represented by the node is a start job, and if the out-degree of a node is 0, the job represented by the node is an end job.
When the operation flow has problems, the operation execution condition of the key nodes in the directed acyclic graph is monitored, so that the operation can be quickly positioned, the operation scheduling efficiency and robustness are improved, and good operation management is realized. Therefore, it is very important how to determine the key nodes in job scheduling and monitor the job execution conditions of the key nodes to implement the management of job scheduling. There is a need in the art to provide a job management method capable of determining a key node in a directed acyclic graph and monitoring job execution conditions of the key node to improve job scheduling efficiency and performance.
Disclosure of Invention
The utility model provides a job management method, which can determine key nodes in a job scheduling network, and monitor the job execution condition of the key nodes to improve the overall performance of job scheduling and realize job management. The disclosure also provides a device, a server, a computer readable storage medium and a computer program product corresponding to the method.
In a first aspect, the present disclosure provides a job management method. The method comprises the following steps:
the method comprises the steps of obtaining a directed acyclic graph corresponding to a plurality of jobs to be scheduled, wherein the directed acyclic graph comprises a plurality of nodes, and the plurality of nodes correspond to the plurality of jobs one by one;
determining a key node from the plurality of nodes according to at least one of the in-degree and the out-degree of the plurality of nodes;
and presenting the job execution condition of the key node.
In some possible implementations, the method further includes:
acquiring a plurality of operation links corresponding to a starting node in the directed acyclic graph, wherein the starting node is a node with an entry degree of 0;
determining a key path from the plurality of operation links, wherein the key path is the operation link with the longest operation time in the plurality of operation links;
and presenting the operation time of each node in the key path.
In some possible implementations, the determining a critical path from the plurality of job links, where the critical path is a job link with a longest job time in the plurality of job links, includes:
fixing the operation starting time of the starting node;
acquiring the operation ending time of ending nodes corresponding to the plurality of operation links, wherein the ending nodes are nodes with out degrees of 0;
and determining the operation link corresponding to the end node with the latest operation end time as a key path.
In some possible implementations, the presenting the working time of each node in the critical path includes:
and determining the operation with the longest operation time in the critical path according to the operation time of each node in the critical path so as to optimize the operation time of the operation with the longest operation time.
In some possible implementations, the presenting the job execution condition of the key node includes:
when the in-degree of the key node meets a preset condition, presenting the job execution condition of the key node so as to monitor whether the job result of the key node is correct or not;
and when the out-degree of the key node meets a preset condition, presenting the job execution condition of the key node so as to monitor whether the job execution time of the key node is correct or not.
In some possible implementations, the method further includes:
and setting early warning conditions corresponding to the key nodes, and sending out early warning when the operation execution conditions of the key nodes meet the early warning conditions.
In a second aspect, the present disclosure provides a job management apparatus. The device comprises:
the system comprises an acquisition module, a scheduling module and a scheduling module, wherein the acquisition module is used for acquiring a directed acyclic graph corresponding to a plurality of jobs to be scheduled, the directed acyclic graph comprises a plurality of nodes, and the plurality of nodes are in one-to-one correspondence with the plurality of jobs;
a determining module, configured to determine a key node from the plurality of nodes according to at least one of an in-degree and an out-degree of the plurality of nodes;
and the presenting module is used for presenting the job execution condition of the key node.
In a third aspect, the present disclosure provides a server. The server comprises a processor and a memory, the memory having instructions stored therein, the processor executing the instructions to cause the server to perform the method according to the first aspect of the present disclosure or any implementation manner of the first aspect.
In a fourth aspect, the present disclosure provides a computer-readable storage medium. The computer readable storage medium has stored therein instructions that, when executed on a server, cause the server to perform the method of the first aspect or any implementation manner of the first aspect.
In a fifth aspect, the present disclosure provides a computer program product. The computer program product comprises computer readable instructions which, when run on a server, cause the server to perform the method of the first aspect or any implementation of the first aspect.
The present disclosure may be further combined to provide further implementations on the basis of the implementations provided by the above aspects.
Based on the above description, it can be seen that the technical solution of the present disclosure has the following beneficial effects:
specifically, the method includes the steps that a directed acyclic graph corresponding to a plurality of jobs to be scheduled is obtained, the directed acyclic graph comprises a plurality of nodes, and the plurality of nodes correspond to the plurality of jobs one to one; determining key nodes from the multiple nodes according to the in-degree and out-degree of the multiple nodes; and presenting the job execution condition of the key node. According to the method, the key nodes are determined by acquiring the directed acyclic graphs of the plurality of jobs according to whether the in-degree or out-degree of the job nodes meets the preset conditions, the job execution conditions of the key nodes are presented to monitor the job flow of the key nodes, the job scheduling efficiency and the overall performance can be improved, and job management is achieved.
Drawings
The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent by referring to the following detailed description when taken in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numbers refer to the same or similar elements. It should be understood that the drawings are schematic and that elements and components are not necessarily drawn to scale.
Fig. 1 is a directed acyclic graph of a job scheduling network according to an embodiment of the present disclosure;
fig. 2 is a schematic flowchart of a job management method according to an embodiment of the present disclosure;
fig. 3 is a schematic structural diagram of a job management apparatus according to an embodiment of the present disclosure.
Detailed Description
Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it is to be understood that the present disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein, but rather are provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the disclosure are for illustration purposes only and are not intended to limit the scope of the disclosure.
The term "include" and variations thereof as used herein are open-ended, i.e., "including but not limited to". The term "based on" is "based, at least in part, 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". Relevant definitions for other terms will be given in the following description.
It should be noted that the terms "first", "second", and the like in the present disclosure are only used for distinguishing different devices, modules or units, and are not used for limiting the order or interdependence relationship of the functions performed by the devices, modules or units.
It is noted that references to "a" or "an" in this disclosure are intended to be illustrative rather than limiting, and that those skilled in the art will appreciate that references to "one or more" are intended to be exemplary and not limiting unless the context clearly indicates otherwise.
In order to facilitate understanding of the technical solutions of the present disclosure, a directed acyclic graph related to the present disclosure is described below, and reference is made to a directed acyclic graph of a job scheduling network shown in fig. 1.
The dependencies between jobs in a job scheduling network may be represented by directed acyclic graphs. Each node in the directed acyclic graph represents a job, e.g., nodes a to H in fig. 1 may represent 8 different jobs a to H, the arrows represent the order of execution of the jobs, e.g., the arrow for node a pointing to node B may represent job a executing before job B. The node has an in-degree and an out-degree, the in-degree refers to the number of nodes pointed by the arrow to the node, for example, the in-degree of the node D is 2, and the in-degree of the node E is 3, and the out-degree refers to the number of nodes pointed by the arrow to the node, for example, the out-degree of the node B is 3, and the out-degree of the node C is 1.
If the degree of entry of a node is 0, the node is a start node, and the job represented by the node is a start job, for example, job a and job G are start jobs; if the out-degree of a node is 0, the node is an end node, and the jobs indicated by the node are end jobs, for example, job F and job H are end jobs. The operation is executed by a starting node according to the arrow sequence until the operation flow is finished by the execution to an ending node, and all executed nodes form a operation link, for example, a node A, a node B, a node C, a node E, a node F, a node G, a node D and a node H form an operation link.
In job scheduling, if a problem occurs in job execution, the key nodes in the directed acyclic graph can be quickly positioned by monitoring, serious problems in job execution can be prevented to a certain extent, job scheduling efficiency and robustness can be improved, and good job management is realized.
Based on this, the embodiment of the disclosure provides a job management method. Specifically, the method includes the steps that a directed acyclic graph corresponding to a plurality of jobs to be scheduled is obtained, the directed acyclic graph comprises a plurality of nodes, and the plurality of nodes correspond to the plurality of jobs one by one; determining a key node from the plurality of nodes according to at least one of the in-degree and the out-degree of the plurality of nodes; and presenting the job execution condition of the key node. According to the method, the key nodes are determined by obtaining the directed acyclic graphs of the plurality of jobs and according to whether the in-degree or out-degree of the job nodes meets the preset conditions, the job execution conditions of the key nodes are presented to monitor the job flow of the key nodes, the job scheduling efficiency and the overall performance can be improved, and job management is achieved.
Next, a job management method provided by an embodiment of the present disclosure will be described in detail with reference to the drawings.
Referring to the flowchart of a job management method shown in fig. 2, the method may be executed by a server, and specifically includes the following steps:
s201: the server obtains a directed acyclic graph corresponding to a plurality of jobs to be scheduled, the directed acyclic graph comprises a plurality of nodes, and the plurality of nodes correspond to the plurality of jobs one to one.
In the embodiment of the present disclosure, a server obtains a directed acyclic graph corresponding to a job to be scheduled, where different nodes in the directed acyclic graph represent different jobs. Through the acquired directed acyclic graph, the server can acquire the job to be scheduled and the dependency relationship and the execution sequence between the jobs to be scheduled.
S202: the server determines a key node from the plurality of nodes according to at least one of the in-degree and the out-degree of the plurality of nodes.
In the embodiment of the disclosure, the server compares the size relationship between at least one of the in-degree and the out-degree of the node and the preset condition, and determines the node as a key node when the node meets the preset condition. It should be noted that the preset conditions corresponding to different nodes may be different, that is, the preset condition for determining whether a node is a key node may be formulated according to the job corresponding to the node, for example, in the financing service, the preset condition corresponding to a contract job may be set to have an in-degree greater than 3, and the preset condition of a trade financing job may be set to have an out-degree greater than 5.
S203: the server presents the job execution of the key node.
In the disclosed embodiments, the server presents job execution of the key nodes, which may include whether the job started executing at an expected time, whether the job was successfully executed, whether the results of job execution are available, and the like.
In some possible implementation manners, when the in-degree of the key node meets a preset condition, the job execution condition of the key node is presented so as to monitor whether the job result of the key node is correct or not. That is, when the degree of entry of the key node is large, that is, there are many pre-jobs, the accuracy of the execution of the job by the key node can be concerned, and if the job result of the key node is incorrect, it can be determined that the execution of the pre-job is in a problem, and the job result can be corrected in time.
In some possible implementation manners, when the out-degree of the key node meets a preset condition, the job execution condition of the key node is presented so as to monitor whether the job execution time of the key node is correct or not. That is, when the out-degree of a key node is large, that is, there are many post-production jobs, since the key node affects the subsequent job flow, the job execution time of the key node can be concerned, and if the job execution time of the key node is delayed, the execution priority of the job corresponding to the node can be increased, so that the job flow can be smoothly performed.
In some possible implementation manners, the server may further set an early warning condition corresponding to the key node, and send out an early warning when the job execution condition of the key node meets the early warning condition.
In some possible implementation manners, the server may further obtain a plurality of job links corresponding to a starting node in the directed acyclic graph, determine a critical path from the plurality of job links, where the critical path is a job link with the longest job time in the plurality of job links, and present the job time of each node in the critical path.
Specifically, the server may determine the critical path by fixing the job start time of the start node, acquiring the job end times of the end nodes corresponding to the plurality of job links, and determining that the job link corresponding to the end node with the latest job end time is the critical path.
It should be noted that the server may determine, according to the job time of each node in the critical path, the job with the longest job time in the critical path, so as to optimize the job time of the job with the longest job time, and improve the overall efficiency of job scheduling.
The method comprises the steps of obtaining a directed acyclic graph corresponding to a plurality of jobs to be scheduled, wherein the directed acyclic graph comprises a plurality of nodes, and the plurality of nodes correspond to the plurality of jobs one by one; determining key nodes from the plurality of nodes according to the in-degree and out-degree of the plurality of nodes; and presenting the job execution condition of the key node. According to the method, the key nodes are determined by acquiring the directed acyclic graphs of the plurality of jobs according to whether the in-degree or out-degree of the job nodes meets the preset conditions, the job execution conditions of the key nodes are presented to monitor the job flow of the key nodes, the job scheduling efficiency and the overall performance can be improved, and job management is achieved.
Based on the method provided by the embodiment of the disclosure, the embodiment of the disclosure also provides a job management device corresponding to the method. The units/modules described in the embodiments of the present disclosure may be implemented by software or hardware. Wherein the name of a unit/module does not in some cases constitute a limitation of the unit/module itself.
Referring to the schematic structural diagram of the job management apparatus shown in fig. 3, the apparatus 300 includes:
an obtaining module 301, configured to obtain a directed acyclic graph corresponding to a plurality of jobs to be scheduled, where the directed acyclic graph includes a plurality of nodes, and the plurality of nodes correspond to the plurality of jobs one to one;
a determining module 302, configured to determine a key node from the plurality of nodes according to at least one of an in-degree and an out-degree of the plurality of nodes;
and a presenting module 303, configured to present a job execution condition of the key node.
In some possible implementations, the determining module 302 is specifically configured to:
and comparing the size relation between at least one of the in-degree and the out-degree of the plurality of nodes and the corresponding preset condition, and determining the nodes as key nodes when the nodes meet the preset condition.
In some possible implementations, the presenting module 303 is specifically configured to:
when the degree of entry of the key node meets a preset condition, presenting the job execution condition of the key node so as to monitor whether the job result of the key node is correct or not;
and when the out-degree of the key node meets a preset condition, presenting the job execution condition of the key node so as to monitor whether the job execution time of the key node is correct or not.
In some possible implementations, the obtaining module 301 is further configured to:
and acquiring a plurality of operation links corresponding to a starting node in the directed acyclic graph, wherein the starting node is a node with an in-degree of 0.
In some possible implementations, the determining module 302 is further configured to:
and determining a critical path from the plurality of job links, wherein the critical path is the job link with the longest job time in the plurality of job links.
In some possible implementations, the presenting module 302 is further configured to:
and presenting the operation time of each node in the key path.
In some possible implementations, the apparatus 300 further includes:
and the early warning module is used for setting an early warning condition corresponding to the key node, and sending out an early warning when the operation execution condition of the key node meets the early warning condition.
The job management apparatus 300 according to the embodiment of the present disclosure may correspond to performing the method described in the embodiment of the present disclosure, and the above and other operations and/or functions of each module/unit of the job management apparatus 300 are respectively for implementing corresponding flows of each method in the embodiment shown in fig. 2, and are not described herein again for brevity.
The functions described herein above may be performed, at least in part, by one or more hardware logic components. For example, one or more of the hardware logic may be a server, which may include a processing device (e.g., central processing unit, graphics processor, etc.) that may perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM) or a program loaded from a storage device into a Random Access Memory (RAM). In the RAM, various programs and data necessary for the operation of the server are also stored. The processing device, the ROM, and the RAM are connected to each other by a bus. An input/output (I/O) interface is also connected to the bus.
Generally, the following devices may be connected to the I/O interface: input devices including, for example, touch screens, touch pads, keyboards, mice, cameras, microphones, accelerometers, gyroscopes, and the like; output devices including, for example, Liquid Crystal Displays (LCDs), speakers, vibrators, and the like; storage devices including, for example, magnetic tape, hard disk, etc.; and a communication device. The communication means may allow the server to communicate wirelessly or by wire with other devices to exchange data.
The present disclosure also provides a computer-readable storage medium, also referred to as a machine-readable medium. In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
It should be noted that the computer readable medium in the present disclosure can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In contrast, in the present disclosure, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
The computer readable medium carries one or more programs which, when executed by the server, cause the server to: the method comprises the steps of obtaining a directed acyclic graph corresponding to a plurality of jobs to be scheduled, wherein the directed acyclic graph comprises a plurality of nodes, and the plurality of nodes correspond to the plurality of jobs one by one; determining a key node from the plurality of nodes according to at least one of the in-degree and the out-degree of the plurality of nodes; and presenting the job execution condition of the key node.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program carried on a non-transitory computer readable medium, the computer program containing program code for performing the method illustrated by the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication means, or may be installed from a storage means. The computer program, when executed by a processing device, performs the above-described functions defined in the methods of the embodiments of the present disclosure.
Although the subject matter has been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described above. Rather, the specific features and acts described above are disclosed as example forms of implementing the claims.
While several specific implementation details are included in the above discussion, these should not be construed as limitations on the scope of the disclosure. Certain features that are described in the context of separate embodiments can also be implemented in combination in a single embodiment. Conversely, various features that are described in the context of a single embodiment can also be implemented in multiple embodiments separately or in any suitable subcombination.
The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the disclosure herein is not limited to the particular combination of features described above, but also encompasses other combinations of features described above or equivalents thereof without departing from the spirit of the disclosure. For example, the above features and (but not limited to) the features disclosed in this disclosure having similar functions are replaced with each other to form the technical solution.
Claims (10)
1. A method for job management, the method comprising:
the method comprises the steps of obtaining a directed acyclic graph corresponding to a plurality of jobs to be scheduled, wherein the directed acyclic graph comprises a plurality of nodes, and the plurality of nodes correspond to the jobs one by one;
determining a key node from the plurality of nodes according to at least one of the in-degree and the out-degree of the plurality of nodes;
and presenting the job execution condition of the key node.
2. The method of claim 1, further comprising:
acquiring a plurality of operation links corresponding to a starting node in the directed acyclic graph, wherein the starting node is a node with an entry degree of 0;
determining a key path from the plurality of operation links, wherein the key path is the operation link with the longest operation time in the plurality of operation links;
and presenting the operation time of each node in the key path.
3. The method of claim 2, wherein determining a critical path from the plurality of job links, the critical path being a job link of the plurality of job links having a longest job time, comprises:
fixing the operation starting time of the starting node;
acquiring the operation end time of an end node corresponding to the plurality of operation links, wherein the end node is a node with an out-degree of 0;
and determining the operation link corresponding to the end node with the latest operation end time as a key path.
4. The method of claim 2, wherein said presenting the working time of each node in the critical path comprises:
and determining the operation with the longest operation time in the critical path according to the operation time of each node in the critical path so as to optimize the operation time of the operation with the longest operation time.
5. The method of claim 1, wherein determining a key node from the plurality of nodes based on at least one of in-degree and out-degree of the plurality of nodes comprises;
and comparing the size relation between at least one of the in-degree and the out-degree of the plurality of nodes and the corresponding preset condition, and determining the node as a key node when the node meets the preset condition.
6. The method according to claim 1, wherein said presenting job execution of said key node comprises:
when the in-degree of the key node meets a preset condition, presenting the job execution condition of the key node so as to monitor whether the job result of the key node is correct or not;
and when the out-degree of the key node meets a preset condition, presenting the job execution condition of the key node so as to monitor whether the job execution time of the key node is correct or not.
7. The method of claim 1, further comprising:
and setting an early warning condition corresponding to the key node, and sending out an early warning when the operation execution condition of the key node meets the early warning condition.
8. A job management apparatus, characterized in that the apparatus comprises:
the system comprises an acquisition module, a scheduling module and a scheduling module, wherein the acquisition module is used for acquiring a directed acyclic graph corresponding to a plurality of jobs to be scheduled, the directed acyclic graph comprises a plurality of nodes, and the plurality of nodes correspond to the plurality of jobs one to one;
a determining module, configured to determine a key node from the plurality of nodes according to at least one of an in-degree and an out-degree of the plurality of nodes;
and the presenting module is used for presenting the job execution condition of the key node.
9. A server, comprising a processor and a memory, the memory having stored therein instructions, the processor executing the instructions to cause the server to perform the method of any of claims 1 to 7.
10. A computer readable storage medium comprising computer readable instructions which, when run on a server, cause the server to perform the method of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210589162.8A CN114926045A (en) | 2022-05-27 | 2022-05-27 | Operation management method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210589162.8A CN114926045A (en) | 2022-05-27 | 2022-05-27 | Operation management method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114926045A true CN114926045A (en) | 2022-08-19 |
Family
ID=82810073
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210589162.8A Pending CN114926045A (en) | 2022-05-27 | 2022-05-27 | Operation management method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114926045A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116737511A (en) * | 2023-08-10 | 2023-09-12 | 山景智能(北京)科技有限公司 | Graph-based scheduling job monitoring method and device |
-
2022
- 2022-05-27 CN CN202210589162.8A patent/CN114926045A/en active Pending
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116737511A (en) * | 2023-08-10 | 2023-09-12 | 山景智能(北京)科技有限公司 | Graph-based scheduling job monitoring method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109523187B (en) | Task scheduling method, device and equipment | |
| CN111950988B (en) | Distributed workflow scheduling method and device, storage medium and electronic equipment | |
| CN108427616B (en) | Background program monitoring method and monitoring device | |
| CN108416449B (en) | Operation and maintenance method and device | |
| US9098350B2 (en) | Adaptive auto-pipelining for stream processing applications | |
| JP2023527195A (en) | Baseline monitoring methods, devices, readable media, and electronics | |
| CN110609755A (en) | Message processing method, device, equipment and medium for cross-block chain node | |
| CN114926045A (en) | Operation management method and device | |
| CN113760697A (en) | Interface testing method and device, electronic equipment and storage medium | |
| CN106549795B (en) | System for monitoring a plurality of distributed devices | |
| CN116302271A (en) | Page display method and device and electronic equipment | |
| CN110764911A (en) | Resource scheduling method, device and control system based on order | |
| CN111367720A (en) | Data protection method and device, electronic equipment and computer readable storage medium | |
| CN113360348B (en) | Abnormal request processing method and device, electronic equipment and storage medium | |
| CN111488268A (en) | Dispatching method and dispatching device for automatic test | |
| CN113760494B (en) | Task scheduling method and device | |
| CN111984496B (en) | Method, device, medium and electronic equipment for monitoring stack memory leakage | |
| CN114327673A (en) | Task starting method and device, electronic equipment and storage medium | |
| CN109960659B (en) | Method and device for detecting application program | |
| CN108288135B (en) | System compatibility method and device, computer readable storage medium and electronic equipment | |
| CN113778844A (en) | Automatic performance testing method and device | |
| CN112579447A (en) | Browser testing method and device | |
| CN110908886A (en) | Data sending method and device, electronic equipment and storage medium | |
| CN117312761B (en) | Method and device for calculating data fragment processing time | |
| CN112269672B (en) | File downloading exception handling method and device and electronic equipment |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |