CN111382983B - Workflow control method, workflow node and system - Google Patents

Workflow control method, workflow node and system Download PDF

Info

Publication number
CN111382983B
CN111382983B CN201811607674.2A CN201811607674A CN111382983B CN 111382983 B CN111382983 B CN 111382983B CN 201811607674 A CN201811607674 A CN 201811607674A CN 111382983 B CN111382983 B CN 111382983B
Authority
CN
China
Prior art keywords
node
current node
execution
task
preamble
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.)
Active
Application number
CN201811607674.2A
Other languages
Chinese (zh)
Other versions
CN111382983A (en
Inventor
罗光峰
孙琼
贾曼
钱超
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Telecom Corp Ltd
Original Assignee
China Telecom Corp Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by China Telecom Corp Ltd filed Critical China Telecom Corp Ltd
Priority to CN201811607674.2A priority Critical patent/CN111382983B/en
Publication of CN111382983A publication Critical patent/CN111382983A/en
Application granted granted Critical
Publication of CN111382983B publication Critical patent/CN111382983B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

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/10—Office automation; Time management
    • G06Q10/103—Workflow collaboration or project management
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D30/00—Reducing energy consumption in communication networks
    • Y02D30/70—Reducing energy consumption in communication networks in wireless communication networks

Landscapes

  • Business, Economics & Management (AREA)
  • Human Resources & Organizations (AREA)
  • Strategic Management (AREA)
  • Engineering & Computer Science (AREA)
  • Entrepreneurship & Innovation (AREA)
  • Operations Research (AREA)
  • Economics (AREA)
  • Marketing (AREA)
  • Data Mining & Analysis (AREA)
  • Quality & Reliability (AREA)
  • Tourism & Hospitality (AREA)
  • Physics & Mathematics (AREA)
  • General Business, Economics & Management (AREA)
  • General Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The disclosure provides a workflow control method, workflow nodes and a workflow control system, and relates to the technical field of networks. A workflow control method of the present disclosure includes: under the condition that the current node has the preamble node, acquiring the execution state of the preamble node adjacent to the current node and the judgment result after execution; determining whether to execute the task of the current node according to the execution state and the judgment result; under the condition that the task of the current node needs to be executed, executing the task of the current node, and determining the execution state of the current node as execution; otherwise, skipping the task of the current node, and determining the execution state of the current node as skipping. By the method, the workflow node can determine whether to execute the task of the current node or not only according to the execution state of the adjacent preamble node and the executed judgment result, so that the distributed node task execution judgment operation is realized, centralized control is not needed, and the flattening management of the workflow is realized.

Description

Workflow control method, workflow node and system
Technical Field
The disclosure relates to the technical field of networks, in particular to a workflow control method, workflow nodes and a system.
Background
The workflow engine is mainly oriented to an unmanned link flow, tasks in the flow can be automatically executed through software, and a task scheduler can be used for analyzing and starting tasks to be executed subsequently. The task scheduler needs to know the definition of the workflow, maintain the running state of the workflow instance, and then schedule the various task nodes centrally.
Disclosure of Invention
The inventor finds that the task scheduler in the related technology needs to acquire the execution state of each node, the centralized management mode has higher requirements on the performance of the task scheduler, the task scheduler needs to be pre-configured, and the parallel processing capability of the workflow engine is not beneficial to improvement.
An object of the present disclosure is to propose a distributed workflow node scheduling scheme, which implements flattened control management.
According to one aspect of the present disclosure, a workflow control method is presented, comprising: under the condition that the current node has the preamble node, acquiring the execution state of the preamble node adjacent to the current node and the judgment result after execution; determining whether to execute the task of the current node according to the execution state and the judgment result; under the condition that the task of the current node needs to be executed, executing the task of the current node, and determining the execution state of the current node as execution; otherwise, skipping the task of the current node, and determining the execution state of the current node as skipping.
In some embodiments, the determination includes an execution and a non-execution; determining whether to execute the task of the current node according to the execution state and the judging result comprises the following steps: and if the judgment result after any node is executed is not executed in the preamble nodes adjacent to the current node, determining that the task of the current node is not executed.
In some embodiments, determining whether to execute the task of the current node based on the execution state and the determination result further comprises: if the execution states of all the preamble nodes adjacent to the current node are skipped, determining that the task of the current node is not executed.
In some embodiments, determining whether to execute the task of the current node based on the execution state and the determination result further comprises: and if the judgment results of the nodes with the execution states not being skipped in the preamble nodes adjacent to the current node are all execution, determining to execute the task of the current node.
In some embodiments, the workflow control method further comprises: and determining to execute the task of the current node in the condition that the current node does not exist in the preamble node.
By the method, the workflow node can acquire the execution state of the adjacent preamble node and the judgment result after the execution, and determine whether to execute the task of the current node or not only according to the execution state of the adjacent preamble node and the judgment result after the execution, so that the distributed node task execution judgment operation is realized, centralized control is not needed, and the flattening management of the workflow is realized.
According to another aspect of the present disclosure, there is provided a workflow node comprising: a preamble information acquisition unit configured to acquire an execution state of a preamble node adjacent to a current node and a determination result after execution, in a case where the current node has the preamble node; an execution judging unit configured to determine whether to execute the task of the current node according to the execution state and the judging result; the state determining unit is configured to execute the task of the current node under the condition that the task of the current node needs to be executed, and determine the execution state of the current node as execution; otherwise, skipping the task of the current node, and determining the execution state of the current node as skipping.
In some embodiments, the determination includes an execution and a non-execution; the execution judgment unit is configured to: and if the judgment result after any node is executed is not executed in the preamble nodes adjacent to the current node, determining that the task of the current node is not executed.
In some embodiments, the execution determination unit is further configured to: if the execution states of all the preamble nodes adjacent to the current node are skipped, determining that the task of the current node is not executed.
In some embodiments, the execution determination unit is further configured to: and if the judgment results of the nodes with the execution states not being skipped in the preamble nodes adjacent to the current node are all execution, determining to execute the task of the current node.
In some embodiments, the execution determination unit is further configured to: and in the case that the current node is the non-existing preamble node, determining to execute the task of the current node.
According to yet another aspect of the present disclosure, a workflow node is presented, comprising: a memory; and a processor coupled to the memory, the processor configured to perform any of the workflow control methods above based on instructions stored in the memory.
The workflow node can acquire the execution state of the adjacent preamble node and the judgment result after the execution, and determine whether to execute the task of the current node or not only according to the execution state of the adjacent preamble node and the judgment result after the execution, thereby realizing the distributed node task execution judgment operation without centralized control and realizing the flattening management of the workflow.
According to yet another aspect of the present disclosure, a computer-readable storage medium having stored thereon computer program instructions which, when executed by a processor, implement the steps of any one of the workflow control methods above is presented.
By executing the instructions on the computer-readable storage medium, the workflow node can acquire the execution state of the adjacent preamble node and the judgment result after the execution, and determine whether to execute the task of the current node or not only according to the execution state of the adjacent preamble node and the judgment result after the execution, thereby realizing the distributed node task execution judgment operation without centralized control and realizing the flattening management of the workflow.
Additionally, according to one aspect of the present disclosure, a workflow system is presented, comprising: any of the plurality of workflow nodes above.
In the workflow system, the workflow nodes can acquire the execution states of the adjacent preamble nodes and the judgment results after the execution, and determine whether to execute the tasks of the current node or not only according to the execution states of the adjacent preamble nodes and the judgment results after the execution, so that distributed node task execution judgment operation is realized, centralized control is not needed, and flattened management of the workflow is realized.
Drawings
The accompanying drawings, which are included to provide a further understanding of the disclosure, illustrate and explain the present disclosure, and together with the description serve to explain the present disclosure. In the drawings:
FIG. 1 is a flow chart of one embodiment of a workflow control method of the present disclosure.
FIG. 2 is a flow chart of another embodiment of a workflow control method of the present disclosure.
FIG. 3A is a schematic diagram of one embodiment of a workflow control method of the present disclosure.
FIG. 3B is a schematic diagram of another embodiment of a workflow control method of the present disclosure.
FIG. 3C is a schematic diagram of yet another embodiment of a workflow control method of the present disclosure.
Fig. 4 is a schematic diagram of one embodiment of a workflow node of the present disclosure.
Fig. 5 is a schematic diagram of another embodiment of a workflow node of the present disclosure.
Fig. 6 is a schematic diagram of yet another embodiment of a workflow node of the present disclosure.
FIG. 7 is a schematic diagram of one embodiment of a workflow system of the present disclosure.
Fig. 8 is a schematic diagram of another embodiment of a workflow system of the present disclosure.
Detailed Description
The technical scheme of the present disclosure is described in further detail below through the accompanying drawings and examples.
A flow chart of one embodiment of a workflow control method of the present disclosure is shown in fig. 1.
In step 101, in the case where the current node has a preamble node, the execution state of the preamble node adjacent to the current node and the determination result after execution are acquired. In one embodiment, the execution state may include both execution and skip possibilities; the decision result after execution includes two possibilities of execution and non-execution.
In step 102, it is determined whether to execute the task of the current node according to the execution state and the determination result. If the task of the current node needs to be executed, executing step 104; if the task of the current node does not need to be performed, step 103 is performed.
In step 103, the task of the current node is skipped and the execution state of the current node is determined to be skipped. In one embodiment, if the current node is not the last node, the execution state of the current node is sent to the next node.
In step 104, the task of the current node is performed, and the execution state of the current node is determined to be execution. In one embodiment, if it is determined by the decision after the current node executes that it is necessary to execute the next node, then a decision operation is performed.
By the method, the workflow node can acquire the execution state of the adjacent preamble node and the judgment result after the execution, and determine whether to execute the task of the current node or not only according to the execution state of the adjacent preamble node and the judgment result after the execution, so that the distributed node task execution judgment operation is realized, centralized control is not needed, and the flattening management of the workflow is realized.
A flow chart of another embodiment of the workflow control method of the present disclosure is shown in fig. 2.
In step 201, it is determined whether a preamble node exists in the current node. If the preamble node exists, executing step 202; if there is no preamble node, the current node is a hint node of the workflow, and cannot be skipped, step 206 is performed.
In step 202, the execution state of the preamble node adjacent to the current node and the determination result after execution are acquired.
In one embodiment, as shown in FIG. 3A, if all the predecessor nodes of the current node can execute in parallel, when node task t 1 ～t m All perform, and condition f 1 ～f m The node task t is executed only if the judgment results of the (a) are all yes n 。
In another embodiment, as shown in FIG. 3B, node task t i And t j Having a common preamble task t x Will choose t i 、t j One of them executes, task t i 、t j The other one of (2) will skip; node task t n Not all of the preamble nodes need to perform. In the above description, t is a node identifier, and i, j, x, m, n are all positive integers.
In step 203, it is determined whether or not there is a preamble node adjacent to the current node, which is not executed, as a result of the determination after the execution. In one embodiment, if any executed preamble node is not executed as a result of the judgment after the execution (i.e., the judgment result of the corresponding condition f is that the next node is not executed), step 205 is executed; otherwise, step 204 is performed.
In step 204, it is determined whether the execution states of all the preamble nodes adjacent to the current node are skipped. If both are skipped, the preamble node is not executed, and the current node does not need to execute, and step 205 is executed. Otherwise, step 206 is performed.
In step 205, the task of the current node is skipped and the execution state of the current node is determined to be skipped.
In step 206, the current section is executedAnd the task of the point and determining the execution state of the current node as execution. In one embodiment, there are several possibilities for the conditions for performing the task of the current node, one of which is the first node in the workflow as shown in step 201; the other is that all the preamble nodes are executed, and the judgment result after the execution is that the task of the next node is executed; and a further step of determining that the previous node adjacent to the current node is executed although there is a skipped previous node adjacent to the current node, as shown in fig. 3C, node t n The execution state of (a) is execution.
By the method, the mutual exclusion of adjacent preamble nodes of the nodes can be considered, the preamble node and the current node skip mark are added in judgment, and the accuracy of the current node executing judgment is improved.
A schematic diagram of one embodiment of a workflow node of the present disclosure is shown in fig. 4. The preamble information acquisition unit 401 is capable of acquiring, in the case where a preamble node exists in the current node, the execution state of the preamble node adjacent to the current node and the determination result after execution. In one embodiment, the execution state may include both execution and skip possibilities; the decision result after execution includes two possibilities of execution and non-execution.
The execution judging unit 402 can determine whether to execute the task of the current node based on the execution state and the judgment result.
The state determination unit 403 is capable of performing the determination unit 402 to determine that the task of the current node is performed when the task of the current node needs to be performed, and to determine the execution state of the current node as being performed. In one embodiment, if it is determined by the decision after the current node executes that it is necessary to execute the next node, then a decision operation is performed. The state determination unit 403 is also capable of skipping the task of the current node when the execution judgment unit 402 does not need to execute the task of the current node, and determining the execution state of the current node as skipped. In one embodiment, if the current node is not the last node, the execution state of the current node is sent to the next node.
The workflow node can acquire the execution state of the adjacent preamble node and the judgment result after the execution, and determine whether to execute the task of the current node or not only according to the execution state of the adjacent preamble node and the judgment result after the execution, thereby realizing the distributed node task execution judgment operation without centralized control and realizing the flattening management of the workflow.
In one embodiment, the execution determining unit 402 may determine whether to execute the task of the current node in the manner shown in the embodiment of fig. 2, so as to increase the labels skipped by the previous node and the current node in the determination in consideration of mutual exclusion of adjacent previous nodes of the node, thereby improving accuracy of the current node executing determination.
A schematic structural diagram of one embodiment of a workflow node of the present disclosure is shown in fig. 5. The workflow node comprises a memory 501 and a processor 502. Wherein: memory 501 may be a magnetic disk, flash memory, or any other non-volatile storage medium. The memory is used to store instructions in the corresponding embodiments of the workflow control method above. Processor 502 is coupled to memory 501 and may be implemented as one or more integrated circuits, such as a microprocessor or microcontroller. The processor 502 is configured to execute instructions stored in a memory, and is capable of implementing distributed node task execution determination operations, without centralized control, and implementing flattened management of a workflow.
In one embodiment, the workflow node 600 may also include a memory 601 and a processor 602 as shown in FIG. 6. The processor 602 is coupled to the memory 601 through a BUS 603. The workflow node 600 may also be connected to external storage 605 via a storage interface 604 for invoking external data, and to a network or another computer system (not shown) via a network interface 606. And will not be described in detail herein.
In the embodiment, the data instruction is stored by the memory, and then the instruction is processed by the processor, so that the distributed node task execution judgment operation can be realized, the centralized control is not needed, and the flattened management of the workflow is realized.
In another embodiment, a computer readable storage medium has stored thereon computer program instructions which, when executed by a processor, implement the steps of the method in the corresponding embodiments of the workflow control method. It will be apparent to those skilled in the art that embodiments of the present disclosure may be provided as a method, apparatus, or computer program product. Accordingly, the present disclosure may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present disclosure may take the form of a computer program product embodied on one or more computer-usable non-transitory storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.
A schematic diagram of one embodiment of a workflow system of the present disclosure is shown in fig. 7. The workflow system includes workflow nodes 71-7 n, n being a positive integer. The non-revealing node determines whether the current node is executed according to the execution state of the preceding node and the result of the condition judgment after the execution if the state of the preceding node is the execution.
In the workflow system, the workflow nodes can acquire the execution states of the adjacent preamble nodes and the judgment results after the execution, and determine whether to execute the tasks of the current node or not only according to the execution states of the adjacent preamble nodes and the judgment results after the execution, so that distributed node task execution judgment operation is realized, centralized control is not needed, and flattened management of the workflow is realized.
In one embodiment, the order and judgment conditions between the workflow nodes can be set according to the needs, for example, as shown in fig. 8, and conditional branching, merging and the like can be included, wherein T1-T8 are workflow node identifiers. FIG. 8 is intended to be exemplary of a workflow node's context and is not intended to be limiting.
Such workflow systems can implement various, complex or simple workflow system configurations by configuring the fore-and-aft relationship of each workflow node, thereby implementing various functions; the execution of the workflow node is utilized to judge whether the function control node executes or not, and a centralized task scheduler does not need to be arranged, so that on one hand, the configuration operation of the task scheduler is omitted, the realization efficiency is improved, on the other hand, the flattening management of the task is realized, and the universality of the system is improved.
The present disclosure is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the disclosure. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations 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.
Thus far, the present disclosure has been described in detail. In order to avoid obscuring the concepts of the present disclosure, some details known in the art are not described. How to implement the solutions disclosed herein will be fully apparent to those skilled in the art from the above description.
The methods and apparatus of the present disclosure may be implemented in a number of ways. For example, the methods and apparatus of the present disclosure may be implemented by software, hardware, firmware, or any combination of software, hardware, firmware. The above-described sequence of steps for the method is for illustration only, and the steps of the method of the present disclosure are not limited to the sequence specifically described above unless specifically stated otherwise. Furthermore, in some embodiments, the present disclosure may also be implemented as programs recorded in a recording medium, the programs including machine-readable instructions for implementing the methods according to the present disclosure. Thus, the present disclosure also covers a recording medium storing a program for executing the method according to the present disclosure.
Finally, it should be noted that: the above embodiments are merely for illustrating the technical solution of the present disclosure and are not limiting thereof; although the present disclosure has been described in detail with reference to preferred embodiments, those of ordinary skill in the art will appreciate that: modifications may be made to the specific embodiments of the disclosure or equivalents may be substituted for part of the technical features; without departing from the spirit of the technical solutions of the present disclosure, it should be covered in the scope of the technical solutions claimed in the present disclosure.

Claims (7)

1. A workflow control method comprising:
under the condition that the current node has a preamble node, acquiring an execution state of the preamble node adjacent to the current node and an executed judging result, wherein the judging result comprises execution and non-execution;
determining whether to execute the task of the current node according to the execution state and the judging result, wherein the determining comprises the following steps: if the judgment result after any node is executed is not executed in the preamble nodes adjacent to the current node, determining that the task of the current node is not executed; if the execution states of all the preamble nodes adjacent to the current node are skipped, determining that the task of the current node is not executed; if the judgment results of the nodes with the execution states not being skipped in the preamble nodes adjacent to the current node are all execution, determining to execute the task of the current node;
under the condition that the task of the current node needs to be executed, executing the task of the current node, and determining the execution state of the current node as execution; otherwise, skipping the task of the current node, and determining the execution state of the current node as skipping.
2. The method of claim 1, further comprising:
and determining to execute the task of the current node in the condition that the current node does not exist in the preamble node.
3. A workflow node, comprising:
a preamble information acquisition unit configured to acquire, in a case where a preamble node exists in a current node, an execution state of a preamble node adjacent to the current node and a determination result after execution, wherein the determination result includes execution and non-execution;
an execution judging unit configured to determine whether to execute a task of a current node according to the execution state and the judging result, including: if the judgment result after any node is executed is not executed in the preamble nodes adjacent to the current node, determining that the task of the current node is not executed; if the execution states of all the preamble nodes adjacent to the current node are skipped, determining that the task of the current node is not executed; if the judgment results of the nodes with the execution states not being skipped in the preamble nodes adjacent to the current node are all execution, determining to execute the task of the current node;
the state determining unit is configured to execute the task of the current node under the condition that the task of the current node needs to be executed, and determine the execution state of the current node as execution; otherwise, skipping the task of the current node, and determining the execution state of the current node as skipping.
4. The workflow node of claim 3, wherein the execution determination unit is further configured to: and determining to execute the task of the current node in the condition that the current node does not exist in the preamble node.
5. A workflow node, comprising:
a memory; and
a processor coupled to the memory, the processor configured to perform the method of claim 1 or 2 based on instructions stored in the memory.
6. A computer readable storage medium having stored thereon computer program instructions which, when executed by a processor, implement the steps of the method of claim 1 or 2.
7. A workflow system, comprising: a plurality of workflow nodes according to any one of claims 3 to 5.
CN201811607674.2A 2018-12-27 2018-12-27 Workflow control method, workflow node and system Active CN111382983B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811607674.2A CN111382983B (en) 2018-12-27 2018-12-27 Workflow control method, workflow node and system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811607674.2A CN111382983B (en) 2018-12-27 2018-12-27 Workflow control method, workflow node and system

Publications (2)

Publication Number Publication Date
CN111382983A CN111382983A (en) 2020-07-07
CN111382983B true CN111382983B (en) 2023-07-28

Family

ID=71222330

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811607674.2A Active CN111382983B (en) 2018-12-27 2018-12-27 Workflow control method, workflow node and system

Country Status (1)

Country Link
CN (1) CN111382983B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115658270B (en) * 2022-11-02 2023-08-25 广州市易鸿智能装备有限公司 Workflow execution method, device and equipment of vision system and storage medium

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017125015A1 (en) * 2016-01-18 2017-07-27 中兴通讯股份有限公司 Method for processing workflow of distributed system and workflow engine system

Family Cites Families (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US8381181B2 (en) * 2007-08-31 2013-02-19 International Business Machines Corporation Updating a workflow when a user reaches an impasse in the workflow
CA2732643C (en) * 2011-02-24 2019-03-05 Brian G. Farn Configurable hierarchical tree view
CN102156917A (en) * 2011-04-06 2011-08-17 中国科学院科技政策与管理科学研究所 Emergency incident contingency plan reconstructing method
CN102279888B (en) * 2011-08-24 2014-04-30 北京新媒传信科技有限公司 Method and system for scheduling tasks
CN103455862B (en) * 2012-05-30 2017-02-08 方正宽带网络服务有限公司 Workflow process method and workflow process system
CN103279333B (en) * 2012-09-29 2016-03-02 南京国电南自轨道交通工程有限公司 A kind of method of the multinode sequential control based on SCADA system
IN2014MU01265A (en) * 2013-04-04 2015-09-04 Avaya Inc
CN103530740B (en) * 2013-10-25 2019-01-01 金蝶软件（中国）有限公司 A kind of pair of flow of task carries out the method and device of node control
CN103617066B (en) * 2013-12-16 2016-08-24 中国农业银行股份有限公司 A kind of workflow engine and its implementation
US9904899B2 (en) * 2014-08-27 2018-02-27 Software Ag Systems and/or methods for reactive, distributable, and extensible process execution
CN107316121A (en) * 2016-08-31 2017-11-03 天河大成建筑云科技（天津）有限公司 One kind is based on the workflow examination and approval method of BIM (BIM)
CN108694564B (en) * 2018-06-07 2022-05-06 创新先进技术有限公司 Task state control method and device
CN108572635A (en) * 2018-07-30 2018-09-25 天津中德应用技术大学 Industrial network node based on shared drive pond and modified round-robin method

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2017125015A1 (en) * 2016-01-18 2017-07-27 中兴通讯股份有限公司 Method for processing workflow of distributed system and workflow engine system

Also Published As

Publication number Publication date
CN111382983A (en) 2020-07-07

Similar Documents

Publication Publication Date Title
CN110018893B (en) Task scheduling method based on data processing and related equipment
CN105446799A (en) Method and system for performing rule management in computer system
CN110611707B (en) Task scheduling method and device
CN105808342B (en) method, judgment device and system for distributing client request
CN109445923A (en) A kind of method and device of micro services task schedule
CN109218058B (en) Method and system for acquiring OAM information and computer readable storage medium
CN105573827A (en) Multi-machine parallel processing method and device
CN108958789A (en) A kind of parallel streaming calculation method, electronic equipment, storage medium and system
CN111382983B (en) Workflow control method, workflow node and system
CN111597018B (en) Robot job scheduling method and device
CN107122952B (en) Flow scheduling method and system based on rules
US9880923B2 (en) Model checking device for distributed environment model, model checking method for distributed environment model, and medium
CN111580948A (en) Task scheduling method and device and computer equipment
CN116185869A (en) Software testing method, system, computer equipment and storage medium
CN110968445A (en) Node skipping method and device based on process engine and electronic equipment
CN105335244B (en) Method for application recovery
US20160162295A1 (en) Method and apparatus for executing multi-thread
CN105224305B (en) Function call path decoding method, apparatus and system
CN107678889B (en) Method and device for recovering workflow task state, storage medium and computing equipment
CN112035169B (en) Jump processing method and device, computer equipment and computer readable storage medium
CN109408204A (en) A kind of method for scheduling task and device of distributed task scheduling system
CN111176821A (en) Multitask scheduling method and device for operating system
CN109144486A (en) A kind of workflow implementation method statelessly changed
CN116126937A (en) Job scheduling method, job scheduling device, electronic equipment and storage medium
CN111343110B (en) Message processing method, SDN switch 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
GR01 Patent grant
GR01 Patent grant