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
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
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, ...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com