CN113238764A - Software delivery method and system based on DAG graph, electronic device and readable storage medium - Google Patents
Software delivery method and system based on DAG graph, electronic device and readable storage medium Download PDFInfo
- Publication number
- CN113238764A CN113238764A CN202110536802.4A CN202110536802A CN113238764A CN 113238764 A CN113238764 A CN 113238764A CN 202110536802 A CN202110536802 A CN 202110536802A CN 113238764 A CN113238764 A CN 113238764A
- Authority
- CN
- China
- Prior art keywords
- node
- flow
- software
- dag
- definition
- 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
- 238000000034 method Methods 0.000 claims abstract description 82
- 230000008569 process Effects 0.000 claims abstract description 70
- 238000012163 sequencing technique Methods 0.000 claims abstract description 8
- 238000004590 computer program Methods 0.000 claims description 13
- 230000000007 visual effect Effects 0.000 claims description 7
- 238000004806 packaging method and process Methods 0.000 claims description 5
- 238000012856 packing Methods 0.000 claims description 4
- 230000006835 compression Effects 0.000 claims description 2
- 238000007906 compression Methods 0.000 claims description 2
- 238000000605 extraction Methods 0.000 claims description 2
- 238000002360 preparation method Methods 0.000 claims 1
- 238000010586 diagram Methods 0.000 abstract description 18
- 238000007726 management method Methods 0.000 description 10
- 238000013461 design Methods 0.000 description 9
- 230000006870 function Effects 0.000 description 7
- 238000004519 manufacturing process Methods 0.000 description 7
- 238000010276 construction Methods 0.000 description 6
- 230000010354 integration Effects 0.000 description 6
- 238000011161 development Methods 0.000 description 5
- 238000012423 maintenance Methods 0.000 description 5
- 238000012545 processing Methods 0.000 description 4
- 230000006872 improvement Effects 0.000 description 3
- 238000004422 calculation algorithm Methods 0.000 description 2
- 230000008859 change Effects 0.000 description 2
- 238000012360 testing method Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000002955 isolation Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000002085 persistent effect Effects 0.000 description 1
- 238000012795 verification Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/60—Software deployment
-
- 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
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
- G06F9/45533—Hypervisors; Virtual machine monitors
- G06F9/45558—Hypervisor-specific management and integration aspects
-
- 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/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/44—Arrangements for executing specific programs
- G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
- G06F9/45533—Hypervisors; Virtual machine monitors
- G06F9/45558—Hypervisor-specific management and integration aspects
- G06F2009/45562—Creating, deleting, cloning virtual machine instances
Abstract
The invention discloses a software delivery method, a system, electronic equipment and a readable storage medium based on a DAG (demand oriented architecture) diagram, wherein the software delivery method based on the DAG diagram comprises the following steps: receiving preset software parameter definition and preset process definition; starting a scheduling engine to execute the pre-bound subtasks of each node in the flow according to the preset software parameter definition and the preset flow definition; the scheduling engine is a process scheduling engine realized based on DAG topological sequencing; and storing the execution process and the result of the task bound by each node in a library to finish software delivery when all subtasks are executed or the process jumps to the last node. In the software delivery method, each flow node completes a relatively independent subtask, and the software delivery can be automated by combining the subtasks; the requirement of delivery tasks with larger magnitude can be met, and the software delivery efficiency can be improved.
Description
Technical Field
The invention belongs to the technical field of software delivery, and particularly relates to a software delivery method and system based on a DAG (demand oriented architecture) graph, electronic equipment and a readable storage medium.
Background
With the rapid development of the IT and internet industries, software becomes an important carrier to serve various industries, and the ever-changing demand makes the delivery cycle of the software shorter.
At present, the traditional software delivery process needs to go through a plurality of links such as development, compilation, test verification, production deployment and the like, and a series of operations are manually completed. In a mode of distributed development and micro-service architecture, a complete system is composed of a plurality of small services (namely micro-services), the number of the small services is dozens, and more than ten, the number of the small services is thousands, the micro-services cooperate with each other through API (application program interface) and RPC (remote procedure call) to provide services to the outside, and at the quantum level, the traditional manual delivery process cannot complete the delivery task at the same magnitude in a short time.
In summary, a fast and flexible software delivery method is needed to support the development, delivery and operation of software.
Disclosure of Invention
The present invention is directed to a DAG graph-based software delivery method, system, electronic device, and readable storage medium, so as to solve one or more of the above technical problems. In the software delivery method, each flow node completes a relatively independent subtask, and the software delivery can be automated by combining the subtasks; the requirement of delivery tasks with larger magnitude can be met, and the software delivery efficiency can be improved.
In order to achieve the purpose, the invention adopts the following technical scheme:
the invention discloses a software delivery method based on a DAG graph, which comprises the following steps:
receiving preset software parameter definition and preset process definition;
starting a scheduling engine to execute the pre-bound subtasks of each node in the flow according to the preset software parameter definition and the preset flow definition; the scheduling engine is a process scheduling engine realized based on DAG topological sequencing;
and storing the execution process and the result of the task bound by each node in a library to finish software delivery when all subtasks are executed or the process jumps to the last node.
A further refinement of the invention provides that the predefined software item parameters include: one or more of item type, release version number, node flow definition, and status parameters.
In a further refinement of the present invention, the node flow definition comprises: the method comprises the following steps of DAG graph definition, input and output parameters of each node, dependency relationship and execution sequence of the nodes.
A further improvement of the present invention is that the step of starting the scheduling engine to execute the task bound to each node in the process based on the received predefined software project parameters and predefined process rules specifically includes:
executing the subtasks bound by each node according to the software project parameters and the process rule parameters, and writing the running state and the execution result of each subtask into Redis after serialization; whether the subtask is continuously executed downwards is determined by the post condition of the current subtask and the pre condition of the next node.
The invention has the further improvement that when the subtasks bound by each node are executed, if the node is forked, the subtasks are executed in a parallel mode.
The invention has the further improvement that Jenkins are adopted when the subtasks bound in advance by each node in the flow are executed;
the subtasks include:
constructing a compiling task, wherein the execution logic comprises code pulling, dependency installing, compiling script executing and binary file generating;
packing the task, wherein the execution logic comprises binary code extraction, compression packing and archiving storage; or packaging the docker container mirror image according to the programming language and the running environment thereof and distributing the docker container mirror image to a mirror image warehouse.
The invention is further improved in that the preset flow definition is generated by a visual flow designer and a project form, and the format is JSON or XML format.
The invention discloses a software delivery system based on a DAG graph, which comprises:
the receiving module is used for receiving preset software parameter definition and preset process definition;
the scheduling module is used for starting a scheduling engine to execute the pre-bound subtasks of each node in the flow according to the preset software parameter definition and the preset flow definition; the scheduling engine is a process scheduling engine realized based on DAG topological sequencing;
and storing the execution process and the result of the task bound by each node in a library to finish software delivery when all subtasks are executed or the process jumps to the last node.
An electronic device of the present invention includes: a processor; a memory for storing computer program instructions; the computer program instructions, when loaded and executed by the processor, cause the processor to perform any of the DAG graph-based software delivery methods of the invention described above.
A readable storage medium of the present invention stores computer program instructions that, when loaded and executed by a processor, perform any of the DAG graph-based software delivery methods of the present invention described above.
Compared with the prior art, the invention has the following beneficial effects:
in the software delivery method, each flow node completes a relatively independent subtask, and the software delivery can be automated by combining the subtasks; the requirement of delivery tasks with larger magnitude can be met, and the software delivery efficiency can be improved. In the invention, a flow engine is designed based on a DAG algorithm, is used for realizing automatic execution of a flow, is applied to the processes of continuous integration, continuous delivery and continuous deployment, and can realize the quick delivery of a software system; after software development is completed, the whole delivery process is fully automatic without manual intervention, and the conditions of frequent change of product requirements, rapid iteration, numerous micro-services and great operation and maintenance burden can be easily met.
Specifically, the invention takes continuous integration, continuous delivery and continuous deployment in the software development process as an application scene, and aims at the problems of untimely delivery, complex flow, easy error, incapability of supporting operation and maintenance of large-batch services and the like in the scenes. It has the following advantages:
firstly, the method comprises the following steps: the delivery process is fully automatic, manual intervention is not needed, and production accidents caused by human errors are avoided;
secondly, the method comprises the following steps: the visual flow self-defining function is realized, and flow nodes can be customized according to different delivery flows;
thirdly, the method comprises the following steps: large-scale simultaneous deployment of projects can be realized;
fourthly: the delivery process is visual, and the task execution condition can be monitored in real time.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art are briefly introduced below; it is obvious that the drawings in the following description are some embodiments of the invention, and that for a person skilled in the art, other drawings can be derived from them without inventive effort.
FIG. 1 is a schematic diagram of a DAG in an embodiment of the invention;
FIG. 2 is a schematic diagram of a topological ordering in an embodiment of the present invention;
FIG. 3 is a design architecture diagram in an embodiment of the present invention;
FIG. 4 is a schematic diagram of a publication flow in an embodiment of the invention;
fig. 5 is a schematic diagram of a call relationship of a flow scheduling module in the embodiment of the present invention.
Detailed Description
In order to make the purpose, technical effect and technical solution of the embodiments of the present invention clearer, the following clearly and completely describes the technical solution of the embodiments of the present invention with reference to the drawings in the embodiments of the present invention; it is to be understood that the described embodiments are only some of the embodiments of the present invention. Other embodiments, which can be derived by one of ordinary skill in the art from the disclosed embodiments without inventive faculty, are intended to be within the scope of the invention.
Referring to fig. 1 and fig. 2, a software delivery method based on a DAG map according to an embodiment of the present invention includes the following steps:
receiving preset software parameter definition and preset process definition;
starting a scheduling engine to execute the pre-bound subtasks of each node in the flow according to the preset software parameter definition and the preset flow definition; the scheduling engine is a process scheduling engine realized based on DAG topological sequencing;
and storing the execution process and the result of the task bound by each node in a library to finish software delivery when all subtasks are executed or the process jumps to the last node.
In the embodiment of the invention, based on the relatively determined flow of the software delivery process, the method of the invention carries out the task flow in the delivery process, each flow node finishes a relatively independent subtask, the subtask execution automation is realized at each node, and finally the automation of the whole delivery process can be finished through the preset flow.
The embodiment of the invention provides a software delivery method based on a DAG (demand oriented architecture) diagram, which is a continuous integration, continuous delivery and continuous deployment method based on the DAG diagram, and specifically comprises the following steps:
step 3, after receiving the construction and release instruction, the flow scheduler executes each subtask according to the parameters and the flow parameters defined by the project, writes the running state and the execution result of each subtask into Redis after serialization, determines whether the subtask is continuously executed downwards according to the post condition of the current subtask and the pre-condition of the next node, and simultaneously starts the parallel execution of the subtask according to whether the flow has a bifurcation node;
and 4, after all subtasks are finished or when the flow jumps to the last node, collecting and summarizing an execution result by the flow scheduler and changing the execution state.
In the embodiment of the invention, the project flow definition in the step 1 is generated by a visual flow designer and a project form in a JSON or XML format, so that a design project management submodule can be extended to distinguish different production environments for data isolation; and a special process design submodule can be designed so as to simplify the process definition process and visually define the process.
The flow scheduler is realized based on DAG (directed acyclic graph) topological ordering, and the characteristics of front and back dependence of DAG are in accordance with the structural requirements of flow design.
The sub-modules described in the invention are dependent in the implementation process, and the construction of each sub-module can be based on the existing system or self-developed corresponding module. In the implementation process of the step 3 and the step 4, the flow scheduling submodule refreshes the task data in real time according to the execution state of the subtasks, and the monitoring, informing and warning functions of the flow are realized.
The embodiment of the invention designs a flow engine based on a DAG algorithm, which is used for realizing automatic execution of the flow and is applied to the processes of continuous integration, continuous delivery and continuous deployment, thereby realizing the rapid delivery of a software system. After software development is completed, the whole delivery process is fully automatic without manual intervention, and the conditions of frequent change of product requirements, rapid iteration, numerous micro-services and great operation and maintenance burden can be easily met.
The invention takes continuous integration, continuous delivery and continuous deployment in the software development process as an application scene, and aims to solve the problems of untimely delivery, complex flow, easy error, incapability of supporting operation and maintenance of large-batch services and the like in the scenes. It has the following advantages: the delivery process is fully automatic, manual intervention is not needed, and production accidents caused by human errors are avoided; the visual flow self-defining function is realized, and flow nodes can be customized according to different delivery flows; large-scale simultaneous deployment of projects can be realized; the delivery process is visual, and the task execution condition can be monitored in real time.
Referring to fig. 3 to fig. 5, a software delivery system based on a DAG diagram according to an embodiment of the present invention includes:
the receiving module is used for receiving preset software parameter definition and preset process definition;
the scheduling module is used for starting a scheduling engine to execute the pre-bound subtasks of each node in the flow according to the preset software parameter definition and the preset flow definition; the scheduling engine is a process scheduling engine realized based on DAG topological sequencing;
and storing the execution process and the result of the task bound by each node in a library to finish software delivery when all subtasks are executed or the process jumps to the last node.
Specifically, the system implemented based on the method of the present invention preferably includes a process scheduling sub-module, a project management sub-module, a process design sub-module, a task execution sub-module, and a cluster management sub-module, and the design architecture is shown in fig. 3.
The project management submodule is used for managing a plurality of projects and a plurality of release environments of the projects, such as a test environment, a development environment and a production environment. Each environment has a plurality of components in its entirety, with one component representing an independent functional unit (e.g., a microservice), at least one environment for an item, and at least one component for an environment. Each environment and component has independent parameter configuration, including the parameter definition required by the component in the delivery link.
The flow design submodule is embedded in the project management submodule. And each node binds one task in the task construction sub-module. During the process of executing the flow, tasks pre-bound to each node are executed according to the definition of the flow, and a typical flow is as shown in fig. 4.
The flow scheduling submodule, a flow scheduling engine realized based on DAG graph, is characterized in that a flow rule is predefined by a flow design submodule, a construction flow is initiated by a project management submodule to trigger the flow scheduling submodule, the flow scheduling submodule starts the scheduling engine to execute tasks bound by each node in the flow after receiving the flow definition, the tasks are finally executed by a task construction submodule, and in the construction process, the task execution submodule returns the execution process and the result to the flow scheduling submodule. After the execution is completed, the data is stored in the database, the delivery process is completed, and the calling relation is as shown in fig. 5.
And the task execution submodule is used for a management operation platform of the automation script. Can be Jenkins or a self-built platform. The task execution logic of the node is executed by this submodule. Such as building a compilation task. The execution logic comprises pulling codes, installing dependencies, executing a compiling script and generating a binary file; for example, the packaging task comprises extracting binary codes, compressing and packaging, archiving and storing, or continuously packaging the docker container mirror image according to the programming language and the operating environment thereof, and distributing to the mirror image warehouse.
The cluster management submodule is used for realizing the centralized management of the server cluster and aiming at the problem that a plurality of clusters are difficult to maintain. And the cluster management submodule calls an interface of the cluster through an API (application programming interface) to realize the deployment of the software to the cluster environment. The system is called by the task execution submodule in the deployment link.
The five sub-modules of the system are realized in a micro-service mode, and the principle of high availability and high concurrency is taken. For the process scheduling engine, resources can be saved through a thread pool, and current limitation is performed through queue sequencing and control of the concurrency quantity so as to avoid exceeding the load limit. For example, it is set that 1000 processes can be concurrently executed at the same time, and a maximum 1000 sorting queue is created, then the execution requests of 2000 processes can be loaded at the highest, wherein 1000 processes are directly executed, the requests exceeding 1000 enter the queue to wait, and the requests exceeding the maximum limit of the queue are directly discarded. The number of concurrencies and the size of the queue can be set reasonably according to the configuration of the server.
In summary, the software-based delivery process is a relatively definite flow, the invention processes the tasks in the delivery process, each flow node completes a relatively independent task, and then the tasks of each node are automated, and finally the automation of the whole delivery process can be completed through the flow. The continuous integration, continuous delivery and continuous deployment method based on the DAG graph has high flexibility, can freely customize personalized processes according to different production environments, realizes highly flexible project delivery, can solve delivery of complex software architecture projects (such as micro service architecture), and reduces operation and maintenance cost due to automation of the delivery process.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Although the present invention has been described in detail with reference to the above embodiments, those skilled in the art can make modifications and equivalents to the embodiments of the present invention without departing from the spirit and scope of the present invention, which is set forth in the claims of the present application.
Claims (10)
1. A software delivery method based on DAG graph is characterized by comprising the following steps:
receiving preset software parameter definition and preset process definition;
starting a scheduling engine to execute the pre-bound subtasks of each node in the flow according to the preset software parameter definition and the preset flow definition; the scheduling engine is a process scheduling engine realized based on DAG topological sequencing;
and storing the execution process and the result of the task bound by each node in a library to finish software delivery when all subtasks are executed or the process jumps to the last node.
2. The DAG graph-based software delivery method of claim 1, wherein the predefined software project parameters comprise: one or more of item type, release version number, node flow definition, and status parameters.
3. The DAG graph-based software delivery method as recited in claim 2, wherein the node flow definition comprises: the method comprises the following steps of DAG graph definition, input and output parameters of each node, dependency relationship and execution sequence of the nodes.
4. The DAG-graph-based software delivery method as claimed in claim 1, wherein the step of starting the scheduling engine to execute the tasks bound to each node in the flow based on the received predefined software project parameters and predefined flow rules specifically comprises:
executing the subtasks bound by each node according to the software project parameters and the process rule parameters, and writing the running state and the execution result of each subtask into Redis after serialization; whether the subtask is continuously executed downwards is determined by the post condition of the current subtask and the pre condition of the next node.
5. The DAG-graph-based software delivery method as claimed in claim 4, wherein when the subtasks bound to each node are executed, if the node is a forked node, the subtasks are executed in a parallel manner.
6. The DAG graph-based software delivery method according to claim 1, wherein Jenkins is adopted when the pre-bound subtasks of each node in the flow are executed;
the subtasks include:
constructing a compiling task, wherein the execution logic comprises code pulling, dependency installing, compiling script executing and binary file generating;
packing the task, wherein the execution logic comprises binary code extraction, compression packing and archiving storage; or packaging the docker container mirror image according to the programming language and the running environment thereof and distributing the docker container mirror image to a mirror image warehouse.
7. The DAG graph-based software delivery method as claimed in claim 1, wherein the preset flow definition is generated by a visual flow designer and a project form, and the format is JSON or XML format.
8. A DAG graph-based software delivery system, comprising:
the receiving module is used for receiving preset software parameter definition and preset process definition;
the scheduling module is used for starting a scheduling engine to execute the pre-bound subtasks of each node in the flow according to the preset software parameter definition and the preset flow definition; the scheduling engine is a process scheduling engine realized based on DAG topological sequencing;
and storing the execution process and the result of the task bound by each node in a library to finish software delivery when all subtasks are executed or the process jumps to the last node.
9. An electronic device, comprising: a processor; a memory for storing computer program instructions; it is characterized in that the preparation method is characterized in that,
the computer program instructions, when loaded and executed by the processor, cause the processor to perform the DAG graph-based software delivery method of any of claims 1 to 7.
10. A readable storage medium storing computer program instructions, which when loaded and executed by a processor, perform the DAG graph-based software delivery method of any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110536802.4A CN113238764A (en) | 2021-05-17 | 2021-05-17 | Software delivery method and system based on DAG graph, electronic device and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110536802.4A CN113238764A (en) | 2021-05-17 | 2021-05-17 | Software delivery method and system based on DAG graph, electronic device and readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113238764A true CN113238764A (en) | 2021-08-10 |
Family
ID=77134973
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110536802.4A Pending CN113238764A (en) | 2021-05-17 | 2021-05-17 | Software delivery method and system based on DAG graph, electronic device and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113238764A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106873975A (en) * | 2016-12-30 | 2017-06-20 | 武汉默联股份有限公司 | Devops based on Docker persistently pays and automated system and method |
| CN110321152A (en) * | 2019-07-04 | 2019-10-11 | 青岛华正信息技术股份有限公司 | A kind of Software Development Platform |
| CN111309441A (en) * | 2020-02-19 | 2020-06-19 | 北京中数智汇科技股份有限公司 | Micro-service deployment method for realizing DevOps based on Jenkins |
| CN111399814A (en) * | 2020-03-09 | 2020-07-10 | 中国邮政储蓄银行股份有限公司 | Visual arrangement method and device for construction tasks |
| CN111580832A (en) * | 2020-04-29 | 2020-08-25 | 电科云(北京)科技有限公司 | Application release system and method applied to heterogeneous multi-cloud environment |
| CN111767218A (en) * | 2020-06-24 | 2020-10-13 | 北京思特奇信息技术股份有限公司 | Automatic testing method, equipment and storage medium for continuous integration |
-
2021
- 2021-05-17 CN CN202110536802.4A patent/CN113238764A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106873975A (en) * | 2016-12-30 | 2017-06-20 | 武汉默联股份有限公司 | Devops based on Docker persistently pays and automated system and method |
| CN110321152A (en) * | 2019-07-04 | 2019-10-11 | 青岛华正信息技术股份有限公司 | A kind of Software Development Platform |
| CN111309441A (en) * | 2020-02-19 | 2020-06-19 | 北京中数智汇科技股份有限公司 | Micro-service deployment method for realizing DevOps based on Jenkins |
| CN111399814A (en) * | 2020-03-09 | 2020-07-10 | 中国邮政储蓄银行股份有限公司 | Visual arrangement method and device for construction tasks |
| CN111580832A (en) * | 2020-04-29 | 2020-08-25 | 电科云(北京)科技有限公司 | Application release system and method applied to heterogeneous multi-cloud environment |
| CN111767218A (en) * | 2020-06-24 | 2020-10-13 | 北京思特奇信息技术股份有限公司 | Automatic testing method, equipment and storage medium for continuous integration |
Non-Patent Citations (2)
| Title |
|---|
| APACHECN: "Directed Acyclic Graph", Retrieved from the Internet <URL:https://www.bookstack.cn/read/gitlab-doc-zh/docs-258.md> * |
| 虫虫搜奇: "GitLab12.2版本发布，新增设计管理和管道有向无环图流程管理", pages 1 - 6, Retrieved from the Internet <URL:https://baijiahao.baidu.com/s?id=1642639699868593505&wfr=spider&for=pc> * |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN105843684B (en) | Managing task execution | |
| KR20200122985A (en) | Data processing method and related products | |
| EP3113017A1 (en) | Controlling tasks performed by a computing system | |
| US20170255886A1 (en) | Workflow execution | |
| US10466981B1 (en) | System and method for generative programming in an integrated development environment (IDE) | |
| CN106557470B (en) | Data extraction method and device | |
| US9983979B1 (en) | Optimized dynamic matrixing of software environments for application test and analysis | |
| CN110362315B (en) | DAG-based software system scheduling method and device | |
| CN113569987A (en) | Model training method and device | |
| CN111861235A (en) | Task flow arrangement method and device and electronic equipment | |
| CN110611707A (en) | Task scheduling method and device | |
| CN112733511A (en) | Form processing method, system, electronic equipment and computer readable storage medium | |
| CN112131315A (en) | Database synchronization method and device under multi-task parallel development | |
| CN112817710A (en) | Timed task processing method, timed task processing system, computer equipment and computer storage medium | |
| CN112199180A (en) | Multitask scheduling method and device, electronic equipment and readable storage medium | |
| CN114968272A (en) | Algorithm operation method, device, equipment and storage medium | |
| CN109165088B (en) | Elastic expansion task segmentation method based on elastic-jobframe and capable of achieving single machine | |
| CN112463334B (en) | Training task queuing reason analysis method, system, equipment and medium | |
| CN112328225A (en) | Page operation method and operation system thereof | |
| CN113238764A (en) | Software delivery method and system based on DAG graph, electronic device and readable storage medium | |
| CN113568842B (en) | Automatic testing method and system for batch tasks | |
| CN115056234A (en) | RPA controller scheduling method and system based on event driving and infinite state machine | |
| CN114416305A (en) | Robot engine implementation method and system and electronic equipment | |
| CN110046809B (en) | Job scheduling method and device | |
| CN113296902A (en) | Task arranging method, equipment, device and system and computer readable storage medium |
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 |