DAG task relation graph processing method and device and electronic equipment

A technology of task relationship and processing method, applied in the direction of multi-program device, electrical digital data processing, program control design, etc., can solve the problems of complexity and difficult for users to rely on, achieve reasonable operation and maintenance, reduce interference information, information Streamlined effect

Active Publication Date: 2020-03-06
ALIBABA GRP HLDG LTD
View PDF5 Cites 1 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

As the number of unfolded layers increases, the entire DAG task relationship graph will become more and more complex, and there will be a lot of interference information. It is difficult for users to clearly understand the dependencies between each task node and the initial task node. Find the dependencies you want

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • DAG task relation graph processing method and device and electronic equipment
  • DAG task relation graph processing method and device and electronic equipment
  • DAG task relation graph processing method and device and electronic equipment

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0044] like figure 1 As shown, it is a schematic flowchart of a processing method of a DAG task relationship graph according to an embodiment of the present invention, and the method includes the following steps:

[0045] S101: For a multi-layered DAG task relationship graph having an initial task node, in response to a collapse instruction for a specified task node, acquire a dependency path between the specified task node and the initial task node. Wherein, on the user interface of the embodiment of the present invention, buttons for expanding / collapsing the task nodes can be set on each task node, and these buttons can be displayed or activated when the user selects a specific task node. The above-mentioned retraction instruction for the specified task node may come from the user's click operation on the retraction button.

[0046] Obtaining the dependency path between the specified task node and the initial task node in the above steps may specifically be: obtaining one o...

example 1

[0056] Example 1 (fold up):

[0057] like Figure 2 to Figure 6 As shown, it is one to five structural schematic diagrams of the processing method of the DAG task relationship graph in the embodiment of the present invention, wherein, as figure 2 As shown, the task node 15 is used as the designated task node, wherein the upward arrow on the left side of the task node 15 in the figure is the upward retracting operation button, and the upward retracting operation is performed on the task node 15 by clicking the upward retracting operation button. There is only one dependency path between the task node 15 and the initial task node 11 (the dependency path only includes the edge between the task node 15 and the initial task node 11), then several other paths connected to the task node 15 Edges (edges connecting task node 15 to task node 12, edges connecting task node 15 to task node 13, and edges connecting task node 15 to task node 14) need to be deleted. After deleting these e...

example 2

[0062] Example 2 (closed down):

[0063] like Figure 7 to Figure 8 As shown, it is the sixth to seventh structural schematic diagrams of the processing method of the DAG relationship task graph in the embodiment of the present invention, wherein the task node 25 is used as the designated task node, and the downward arrow on the left side of the task node 25 in the figure is the downward contraction Click the up operation button, and click the down down operation button to perform down down operation on the task node 25. Upstream of the task node 25, there is no dependency path with the starting task node 21, therefore, the edges between the task node 25 and the task nodes 27 and 28 should be deleted, so that the task node 27 becomes an isolated node , which in turn is also deleted, forming Figure 8 the view shown.

[0064] The above describes in detail the general rules followed by the collapsing operation of the DAG relational task graph through examples. In some cases, ...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The embodiment of the invention provides a DAG task relation graph processing method and device and electronic equipment. The method comprises the following steps: for a multi-layer DAG task relationship graph with an initial task node, in response to a collection instruction for a specified task node, obtaining a dependency relationship path between the specified task node and the initial task node; and carrying out pruning processing on the DAG task relationship graph according to the dependency relationship path. According to the embodiment of the invention, the interference information inthe DAG task relationship graph is reduced by removing the task nodes and the edges irrelevant to the dependency relationship between the specified task nodes and the initial task nodes, the information simplification of the DAG graph is realized, and a user can quickly see the core dependency relationship of the concerned task, so that reasonable operation and maintenance work is carried out.

Description

technical field [0001] The present application relates to a processing method, device and electronic equipment of a DAG task relationship graph, belonging to the field of computer technology. Background technique [0002] In the operation and maintenance process of data development tasks, it is often necessary to use the form of DAG (Directed Acyclic Graph) task relationship graph to visualize the relationship between data development tasks, so that users can understand the upstream and downstream tasks In specific situations, grasp the dependencies between various development tasks, so as to carry out reasonable operation and maintenance processing. [0003] In the DAG task relationship diagram, each node corresponds to a data development task, therefore, the nodes in the DAG task relationship diagram are called task nodes. Edges between task nodes represent dependencies between task nodes (that is, dependencies between data development tasks). Users generally start from ...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F9/48
CPCG06F9/4881Y02D10/00
Inventor 张谦胡杰
Owner ALIBABA GRP HLDG LTD
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap