CN109447568B - Asynchronous operation method, device, equipment and storage medium for process activities - Google Patents

Asynchronous operation method, device, equipment and storage medium for process activities Download PDF

Info

Publication number
CN109447568B
CN109447568B CN201811109557.3A CN201811109557A CN109447568B CN 109447568 B CN109447568 B CN 109447568B CN 201811109557 A CN201811109557 A CN 201811109557A CN 109447568 B CN109447568 B CN 109447568B
Authority
CN
China
Prior art keywords
active node
subsequent
current
node
activity
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
CN201811109557.3A
Other languages
Chinese (zh)
Other versions
CN109447568A (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.)
Shandong Civic Se Commercial Middleware Co ltd
Original Assignee
Shandong Civic Se Commercial Middleware Co 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 Shandong Civic Se Commercial Middleware Co ltd filed Critical Shandong Civic Se Commercial Middleware Co ltd
Priority to CN201811109557.3A priority Critical patent/CN109447568B/en
Publication of CN109447568A publication Critical patent/CN109447568A/en
Application granted granted Critical
Publication of CN109447568B publication Critical patent/CN109447568B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06QINFORMATION 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/00Administration; Management
    • G06Q10/10Office automation; Time management
    • G06Q10/103Workflow collaboration or project management

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 application discloses a flow activity asynchronous operation method, a flow activity asynchronous operation device, a flow activity asynchronous operation equipment and a flow activity asynchronous operation medium, relates to the technical field of workflow, and is used for solving the problem that time is wasted when a follow-up activity node can operate after waiting for the operation of a current activity node is finished, wherein the method comprises the following steps of: the method comprises the steps of obtaining a submission request of a current active node, keeping the operation of the current active node when the submission request is a partial submission request for submitting partial operation results of the current active node, sending the partial operation results of the current active node to a subsequent active node operated based on the partial operation results of the current active node, and operating the subsequent active node. That is, after acquiring a part of submitted requests of the current active node, the invention does not end the operation of the current active node, but operates the subsequent active node on the basis of keeping the operation of the current active node, thereby realizing the asynchronous operation of the flow activity without changing the original technical framework of the workflow, saving the working time and improving the service processing efficiency.

Description

Asynchronous operation method, device, equipment and storage medium for process activities
Technical Field
The present invention relates to the technical field of workflow, and in particular, to a method, an apparatus, a device, and a storage medium for asynchronous operation of a process activity.
Background
In the future, workflow middleware technology is applied to many industries, such as government, financial, telecommunication and other industries closely related to the process. The application of the workflow technology helps users to solve a lot of technical problems and business problems, well separates the flow circulation logic and the business processing logic, greatly accelerates the development speed of the flow business, and provides a lot of convenience for the users.
In the field of workflow engine architecture, a flow engine performs a series of processes after a current active node is submitted. Normally, the operation of the current active node is firstly finished, and then the subsequent active node is started, which shows that the task of the current post is completed and a new task appears in the next post on the business. In some service scenarios, the task of the next post may only need a part of the processing results of the current post to start, and if the task of the current post still needs to be completely completed, the working time is wasted, and the service processing efficiency is reduced.
Disclosure of Invention
In view of this, an object of the present invention is to provide a method, an apparatus, a device and a storage medium for asynchronous operation of process activities, which can implement asynchronous operation between process activity nodes, so that a subsequent activity node does not need to wait until the current activity node finishes operating and then start operating, thereby saving working time. The specific scheme is as follows:
in a first aspect, the present invention discloses a method for asynchronous operation of process activities, comprising:
acquiring a submission request of a current active node;
when the submission request is a partial submission request, keeping the operation of the current active node; wherein, the partial submission request is a request for submitting a partial operation result of the current active node;
sending a part of operation results of the current active node to a subsequent active node, and operating the subsequent active node; wherein the subsequent active node is an active node that operates based on a partial operation result of the current active node.
Optionally, after obtaining the submission request of the current active node, the method further includes:
when the submission request is a complete submission request, ending the operation of the current active node; wherein, the complete submission request is a request for submitting all operation results of the current active node;
and sending all operation results of the current active node to the subsequent active node, and operating the subsequent active node.
Optionally, before the running the subsequent active node, the method further includes:
judging whether the subsequent active node is started;
if not, starting the subsequent active node.
Optionally, the method further includes:
configuring a start label for the started subsequent active node; the launch tag is used to identify that the subsequent activity has been launched.
Optionally, the method further includes:
and configuring a corresponding retrieval identifier for each subsequent active node so as to obtain the corresponding subsequent active node by using the retrieval identifier.
Optionally, the method further includes:
setting a self-circulation attribute for each active node; and the self-circulation attribute is used for representing that the corresponding active node has an asynchronous operation function.
In a second aspect, the present invention discloses a flow activity asynchronous operation device, which includes:
a submission request acquisition module, configured to acquire a submission request of a current active node;
a current activity operation module, configured to keep the operation of the current activity node when the submission request is a partial submission request; wherein, the partial submission request is a request for submitting a partial operation result of the current active node;
a subsequent activity running module, configured to send a partial running result of the current activity node to a subsequent activity node, and run the subsequent activity node; wherein the subsequent active node is an active node that operates based on a partial operation result of the current active node.
Optionally, the method further includes:
a judging module, configured to judge whether the subsequent active node is started before the subsequent active node is operated; if not, the subsequent active node is started.
In a third aspect, the present invention discloses a process activity asynchronous operation device, which includes:
a memory for storing a computer program;
a processor for implementing the steps of the above-disclosed process activity asynchronous running method when executing the computer program.
In a fourth aspect, the present invention discloses a computer-readable storage medium for storing a computer program which, when executed by a processor, implements the steps of the above-disclosed process activity asynchronous running method.
It can be seen that the present invention first obtains a submission request of a current active node, when the submission request is a partial submission request for submitting a partial operation result of the current active node, keeps the operation of the current active node, sends the partial operation result of the current active node to a subsequent active node operating based on the partial operation result of the current active node, and operates the subsequent active node. Therefore, after acquiring the partial submission request of the current active node, the method and the device continue to keep the operation of the current active node, and send the operation result of the current active node to the subsequent active node, so that the subsequent active node can operate, and the asynchronous operation of the flow activity is realized. That is, the present invention can operate the subsequent active node on the basis of keeping the operation of the current active node without ending the operation of the current active node after acquiring the partial submission request of the current active node on the basis of not changing the original technical architecture of the workflow, thereby realizing the asynchronous operation of the current active node and the subsequent active node, saving the working time and further improving the service processing efficiency.
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 will be briefly described below, it is obvious that the drawings in the following description are only embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to the provided drawings without creative efforts.
FIG. 1 is a flow chart of a method for asynchronous operation of flow activities according to the present disclosure;
FIG. 2 is a flow chart of a specific asynchronous flow activity operation method disclosed in the present invention;
FIG. 3 is a schematic structural diagram of an asynchronous flow process running device according to the present invention;
fig. 4 is a schematic diagram of a specific hardware structure of a process-activity asynchronous running device disclosed in the present invention.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
In the technical architecture field of the existing workflow engine, the flow engine performs a series of processes after the current activity is submitted. Typically, the operation of the current active node is first ended, and then the subsequent active node is started, while in some service scenarios, the subsequent active node may only need a part of the processing result of the current active node to start the operation. If the task of the current active node still needs to be completely finished, the working time is wasted, and the service processing efficiency is reduced. Therefore, when the current active node is partially submitted, the invention runs the subsequent active nodes on the basis of still keeping the current active node running, thereby realizing the asynchronous running of the active nodes and improving the working efficiency.
The embodiment of the invention discloses a flow activity asynchronous operation method, which is shown in figure 1 and comprises the following steps:
step S11: acquiring a submission request of a current active node;
specifically, in the technical architecture field of workflow engines, a business user needs to log in an application system, process a task of a current active node, store processed data, and submit the current active node. In this embodiment, a submission request of a current active node is first obtained.
Step S12: when the submission request is a partial submission request, keeping the operation of the current active node; wherein, the partial submission request is a request for submitting a partial operation result of the current active node;
it should be noted that after the submission request of the current active node is acquired, the type of the submission request needs to be determined. In particular, the commit request may be a partial commit request, or a full commit request. Wherein, the partial submission request is a request for submitting a partial operation result of the current active node, which is represented by the periodic completion of the task of the current post in service, and the periodic completion result is submitted; the complete submitting request is a request for submitting all operation results of the current active node, and the complete result is submitted after all tasks of the current post are completed.
Specifically, when the submission request is a partial submission request, it indicates that the currently active node still has an incomplete task, and at this time, the operation of the currently active node is continuously maintained.
Step S13: sending part of the operation result of the current active node to a subsequent active node, and operating the subsequent active node; wherein the subsequent active node is an active node that operates based on a partial operation result of the current active node.
It can be understood that, when the submission request is a partial submission request, the partial operation result of the current active node is sent to the subsequent active node, so that the subsequent active node starts to operate after obtaining the operation result of the current active node. The subsequent active node is an active node which runs based on the partial operation result of the current active node, and the task which is shown as the next post in service can be executed only by the partial processing result of the current post. And further, operating the subsequent active node to realize asynchronous operation of the current active node and the subsequent active node.
In addition, in this embodiment, before the subsequent active node is operated, it is further determined whether the subsequent active node is started, that is, whether a task already exists in the subsequent active node is determined. If yes, directly running the existing task; if not, the subsequent active node needs to be started.
It can be seen that the present invention first obtains a submission request of a current active node, when the submission request is a partial submission request for submitting a partial operation result of the current active node, keeps the operation of the current active node, sends the partial operation result of the current active node to a subsequent active node operating based on the partial operation result of the current active node, and operates the subsequent active node. Therefore, after acquiring the partial submission request of the current active node, the method and the device continue to keep the operation of the current active node, and send the operation result of the current active node to the subsequent active node, so that the subsequent active node can operate, and the asynchronous operation of the flow activity is realized. That is, the present invention can operate the subsequent active node on the basis of keeping the operation of the current active node without ending the operation of the current active node after acquiring the partial submission request of the current active node on the basis of not changing the original technical architecture of the workflow, thereby realizing the asynchronous operation of the current active node and the subsequent active node, saving the working time and further improving the service processing efficiency.
The embodiment of the invention discloses a specific asynchronous operation method of flow activities, which comprises the following steps:
step S21: acquiring a submission request of a current active node;
step S22: when the submission request is a complete submission request, ending the operation of the current active node;
step S23: and sending all operation results of the current active node to the subsequent active node, and operating the subsequent active node.
Specifically, when the submission request is a complete submission request, it indicates that all tasks in the currently active node have been completed, and at this time, the running of the currently active node is ended.
It can be understood that, when the submission request is a complete submission request, all the operation results of the current active node are sent to the subsequent active node, so that the subsequent active node starts to operate after obtaining the operation results of the current active node.
In addition, this embodiment further includes, before the running the subsequent active node: and judging whether the subsequent activity node is started or not, namely judging whether the subsequent activity node has a task or not. If yes, directly running the existing task; if not, the subsequent active node needs to be started.
The embodiment of the invention discloses a specific asynchronous operation method of flow activities, and compared with the previous embodiment, the embodiment further explains and optimizes the technical scheme. Specifically, the method comprises the following steps:
in this embodiment, because it is necessary to determine whether the subsequent active node is started before the subsequent active node is operated, the asynchronous operation method for flow activity in this embodiment may further include:
configuring a starting label for the started subsequent active node; the launch tag is used to identify whether the subsequent activity has been launched. Specifically, each active node may be monitored in real time, and once it is monitored that the active node is started, a start tag is configured for the active node, so that before the subsequent active node is operated, whether the subsequent active node includes the start tag is directly judged, and whether the subsequent active node is started can be known.
Further, the asynchronous flow activity running method in this embodiment may further include:
and configuring a corresponding retrieval identifier for each subsequent active node so as to obtain the corresponding subsequent active node by using the retrieval identifier.
It will be appreciated that the retrieval identity should be configured in accordance with the subsequently active node's association with the currently active node. That is, the retrieval identifier can be used to characterize which portion of the running results of the currently active node the subsequently active node is running on. For example, assuming that the current active node has five tasks, if the subsequent active node can operate based on a result of the current active node after the third task is completed, the information of the third task of the current active node may be used as the retrieval identifier of the subsequent active node, specifically, the name or ID number of the third task may be used as the retrieval identifier of the subsequent active node, and after the third task of the current active node is completed, the matched subsequent active node may be obtained by using the information of the third task, and the corresponding subsequent active node is operated, thereby implementing asynchronous operation of the active node.
Referring to fig. 2, the asynchronous flow activity running method provided in the present invention is further described in detail below by a specific implementation manner, in this embodiment, a self-loop attribute is first set for each active node; and the self-circulation attribute is used for representing that the corresponding active node has an asynchronous operation function. .
Specifically, when an active node submits, it submits a flow transfer request to itself, and the specific process of the flow transfer request in the field of workflow engines is as follows: and submitting the current active node, submitting a circulation request to a subsequent active node, starting the subsequent active node, and creating a post task of the subsequent active node. Because each active node is set with a self-circulation attribute, that is, the current active node belongs to one of the subsequent active sets, if the acquired submission request is to partially submit the current active node, the current active node is restarted. At this time, in order to avoid resetting of the tasks in the active nodes, the workflow engine is used for judging whether the tasks exist in the current active nodes and the subsequent active nodes or not, namely judging that the current active nodes and the subsequent active nodes are started, if so, the tasks of the current active nodes are continuously operated without recreating, and other subsequent active nodes which are already operated also continue the original tasks, so that asynchronous operation is realized.
In addition, if the acquired submission request is that the current active node is completely submitted, the operation of the current active node is finished, all operation results of the current active node are sent to the subsequent active node, whether the subsequent active node is started or not is judged, and if yes, the subsequent active node is directly operated; if not, starting the subsequent active node. Further, the workflow engine deletes the current active node from the subsequent active set, and at this time, the started subsequent active node excludes the current active node, thereby realizing complete submission of the active node.
In the embodiment, the self-circulation attribute is set for each active node, the flow circulation rule and the active task creation rule are fully utilized, the original technical architecture of the workflow is not changed, unexpected consequences caused by large changes are avoided, partial submission and complete submission of the active nodes are realized, and the service processing efficiency is obviously improved.
In the following, the process activity asynchronous running device provided by the embodiment of the present invention is introduced, and the process activity asynchronous running device described below and the process activity asynchronous running method described above may be referred to correspondingly.
Fig. 3 is a block diagram of a structure of a flow activity asynchronous running device according to an embodiment of the present invention, and referring to fig. 3, the flow activity asynchronous running device may include:
a submission request obtaining module 100, configured to obtain a submission request of a current active node;
a current activity running module 200, configured to keep running the current activity node when the submission request is a partial submission request; the partial submitting request is a request for submitting a partial operation result of the current active node;
a subsequent activity running module 300, configured to send a partial running result of the current activity node to a subsequent activity node, and run the subsequent activity node; wherein the subsequent active node is an active node that operates based on a partial operation result of the current active node.
The method further comprises the following steps: a judging module, configured to judge whether the subsequent active node is started before the subsequent active node is operated; if not, the subsequent active node is started.
The process activity asynchronous running device of this embodiment is used to implement the process activity asynchronous running method, so the specific implementation manner in the process activity asynchronous running device can be seen in the foregoing embodiment section of the process activity asynchronous running method, and details are not described here.
Further, the embodiment of the present invention also discloses a flow activity asynchronous running device, which includes a processor 11 and a memory 12, wherein the processor 11 implements the following steps when executing the computer program stored in the memory 12:
acquiring a submission request of a current active node; when the submission request is a partial submission request, keeping the operation of the current active node; wherein, the partial submission request is a request for submitting a partial operation result of the current active node; sending part of the operation result of the current active node to a subsequent active node, and operating the subsequent active node; wherein the subsequent active node is an active node that operates based on a partial operation result of the current active node.
In this embodiment, when the processor 11 executes the computer subprogram stored in the memory 12, the following steps may be specifically implemented: when the submission request is a complete submission request, ending the operation of the current active node; wherein, the complete submission request is a request for submitting all operation results of the current active node; and sending all operation results of the current active node to the subsequent active node, and operating the subsequent active node.
In this embodiment, when the processor 11 executes the computer subprogram stored in the memory 12, the following steps may be specifically implemented: judging whether the subsequent active node is started; if not, the subsequent active node is started.
In this embodiment, when the processor 11 executes the computer subprogram stored in the memory 12, the following steps may be specifically implemented: configuring a starting label for the started subsequent active node; the launch tag is used to identify that the subsequent activity has been launched.
In this embodiment, when the processor 11 executes the computer subprogram stored in the memory 12, the following steps may be specifically implemented: and configuring a corresponding retrieval identifier for each subsequent active node so as to obtain the corresponding subsequent active node by using the retrieval identifier.
In this embodiment, when the processor 11 executes the computer subprogram stored in the memory 12, the following steps may be specifically implemented: setting a self-circulation attribute for each active node; and the self-circulation attribute is used for representing that the corresponding active node has an asynchronous operation function.
Further, referring to fig. 4, the flow activity asynchronous running device in this embodiment may further include:
the input interface 13 is configured to obtain a computer program imported from the outside, store the obtained computer program in the memory 12, and also be configured to obtain various instructions and parameters transmitted by an external terminal device, and transmit the instructions and parameters to the processor 11, so that the processor 11 performs corresponding processing by using the instructions and parameters. In this embodiment, the input interface 13 may specifically include, but is not limited to, a USB interface, a serial interface, a voice input interface, a fingerprint input interface, a hard disk reading interface, and the like.
And an output interface 14, configured to output various data generated by the processor 11 to a terminal device connected thereto, so that other terminal devices connected to the output interface 14 can acquire various data generated by the processor 11. In this embodiment, the output interface 14 may specifically include, but is not limited to, a USB interface, a serial interface, and the like.
In some embodiments, the flow activity asynchronous running device may further include a communication unit 15, configured to establish a remote communication connection with an external server, acquire data sent by an external terminal, and then send the data to the processor 11 for processing and analysis, and in addition, the processor 11 may further send various results obtained after processing to preset various data receiving ends through the communication unit 15. In this embodiment, the communication technology adopted by the communication unit 15 may be a wired communication technology or a wireless communication technology, such as a Universal Serial Bus (USB), a wireless fidelity technology (WiFi), a bluetooth communication technology, a low-power bluetooth communication technology (BLE), and the like. Additionally, the communication unit 15 may specifically be a cellular radio transceiver operating in accordance with wideband code division multiple access (W-CDMA), long Term Evolution (LTE) and similar standards.
In some embodiments, the process activity asynchronous execution device may further include a display unit 16 for displaying data sent from the processor 11.
Further, an embodiment of the present invention further discloses a computer-readable storage medium, which is used for storing a computer program, wherein the computer program is executed by a processor to implement the process activity asynchronous running method disclosed in the foregoing, and for specific steps of the method, reference may be made to corresponding contents disclosed in the foregoing embodiment, which is not described herein again.
After acquiring a part of submitted requests of the current active node, the method continues to keep the operation of the current active node, and sends the operation result of the current active node to the subsequent active node, so that the subsequent active node can operate, and asynchronous operation of the flow activity is realized. That is, the present invention can operate the subsequent active node on the basis of keeping the operation of the current active node without ending the operation of the current active node after acquiring the partial submission request of the current active node on the basis of not changing the original technical architecture of the workflow, thereby realizing the asynchronous operation of the current active node and the subsequent active node, saving the working time and further improving the service processing efficiency.
The embodiments are described in a progressive manner, each embodiment focuses on differences from other embodiments, and the same or similar parts among the embodiments are referred to each other. The device disclosed by the embodiment corresponds to the method disclosed by the embodiment, so that the description is simple, and the relevant points can be referred to the method part for description.
Those of skill would further appreciate that the various illustrative elements and algorithm steps described in connection with the embodiments disclosed herein may be implemented as electronic hardware, computer software, or combinations of both, and that the various illustrative components and steps have been described above generally in terms of their functionality in order to clearly illustrate this interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
The steps of a method or algorithm described in connection with the embodiments disclosed herein may be embodied directly in hardware, in a software module executed by a processor, or in a combination of the two. A software module may reside in Random Access Memory (RAM), memory, read-only memory (ROM), electrically programmable ROM, electrically erasable programmable ROM, registers, hard disk, a removable disk, a CD-ROM, or any other form of storage medium known in the art.
The method, the apparatus, the device and the computer-readable storage medium for asynchronous operation of process activities provided by the present invention are described in detail above, and a specific example is applied in the present document to explain the principle and the implementation of the present invention, and the description of the above embodiment is only used to help understanding the method and the core idea of the present invention; meanwhile, for a person skilled in the art, according to the idea of the present invention, the specific embodiments and the application range may be changed, and in summary, the content of the present specification should not be construed as a limitation to the present invention.

Claims (9)

1. A method for asynchronous operation of process activities, comprising:
acquiring a submission request of a current active node;
when the submission request is a partial submission request, keeping the operation of the current active node; wherein the partial submission request is a request for submitting a partial operation result of the current active node, and the partial submission request is a request for submitting a staged completion result when a task at a current post is staged to be completed in business;
sending part of the operation result of the current active node to a subsequent active node, and operating the subsequent active node; wherein the subsequent active node is an active node that operates based on a partial operation result of the current active node;
the asynchronous running method of the process activities further comprises the following steps:
setting a self-circulation attribute for each active node so that the current active node belongs to one of the subsequent active sets, and submitting a flow circulation request to the active node when the active node is submitted; the self-circulation attribute is used for representing that the corresponding active node has an asynchronous operation function;
and when the submission request is a partial submission request, judging whether the current active node is started, if so, continuing to run the task of the current active node without recreating.
2. The asynchronous process activity execution method as recited in claim 1, wherein after obtaining the commit request of the currently active node, the method further comprises:
when the submission request is a complete submission request, ending the operation of the current active node; wherein, the complete submission request is a request for submitting all operation results of the current active node;
and sending all operation results of the current active node to the subsequent active node, and operating the subsequent active node.
3. The asynchronous process activity execution method of claim 1 or 2, wherein prior to executing the subsequent active node, further comprising:
judging whether the subsequent active node is started;
if not, the subsequent active node is started.
4. The process activity asynchronous execution method of claim 3, further comprising:
configuring a starting label for the started subsequent active node; the launch tag is used to identify that the subsequent activity has been launched.
5. The process activity asynchronous execution method of claim 1, further comprising:
and configuring a corresponding retrieval identifier for each subsequent active node so as to obtain the corresponding subsequent active node by using the retrieval identifier.
6. A process activity asynchronous running device, comprising:
a submission request acquisition module, configured to acquire a submission request of a current active node;
a current activity operation module, configured to keep the operation of the current activity node when the submission request is a partial submission request; wherein the partial submission request is a request for submitting a partial operation result of the current active node, and the partial submission request is a request for submitting a staged completion result when a task at a current post is staged to be completed in business;
a subsequent activity running module, configured to send a partial running result of the current activity node to a subsequent activity node, and run the subsequent activity node; wherein the subsequent active node is an active node that operates based on a partial operation result of the current active node;
the flow activity asynchronous operation device is further configured to:
setting a self-circulation attribute for each active node so that the current active node belongs to one of the subsequent active sets, and submitting a flow circulation request to the active node when the active node is submitted; the self-circulation attribute is used for representing that the corresponding active node has an asynchronous operation function;
and when the submission request is a partial submission request, judging whether the current active node is started, if so, continuing to run the task of the current active node without recreating.
7. The process activity asynchronous execution device of claim 6, further comprising:
a judging module, configured to judge whether the subsequent active node is started before the subsequent active node is operated; if not, starting the subsequent active node.
8. A process activity asynchronous execution device, comprising:
a memory for storing a computer program;
processor for implementing the steps of the method for asynchronous execution of the process activities according to any of claims 1 to 5 when executing the computer program.
9. A computer-readable storage medium for storing a computer program which, when executed by a processor, carries out the steps of the method for asynchronous execution of process activities according to any of claims 1 to 5.
CN201811109557.3A 2018-09-21 2018-09-21 Asynchronous operation method, device, equipment and storage medium for process activities Active CN109447568B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811109557.3A CN109447568B (en) 2018-09-21 2018-09-21 Asynchronous operation method, device, equipment and storage medium for process activities

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811109557.3A CN109447568B (en) 2018-09-21 2018-09-21 Asynchronous operation method, device, equipment and storage medium for process activities

Publications (2)

Publication Number Publication Date
CN109447568A CN109447568A (en) 2019-03-08
CN109447568B true CN109447568B (en) 2022-12-02

Family

ID=65530728

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811109557.3A Active CN109447568B (en) 2018-09-21 2018-09-21 Asynchronous operation method, device, equipment and storage medium for process activities

Country Status (1)

Country Link
CN (1) CN109447568B (en)

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB0117539D0 (en) * 2001-07-18 2001-09-12 Hewlett Packard Co Apparatus and method for workflow
CN101159638A (en) * 2007-10-16 2008-04-09 中国移动通信集团福建有限公司 Workflow intelligent support system
WO2015070705A1 (en) * 2013-11-14 2015-05-21 华为技术有限公司 Computer device, method and apparatus for scheduling service process
CN106897857A (en) * 2015-12-17 2017-06-27 北京奇虎科技有限公司 A kind of workflow processing method and system

Family Cites Families (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103325001A (en) * 2013-01-06 2013-09-25 北京慧正通软科技有限公司 Process asynchronous submitting method
US9336020B1 (en) * 2013-11-18 2016-05-10 Amazon Technologies, Inc. Workflows with API idiosyncrasy translation layers
CN107943457B (en) * 2017-11-17 2021-01-15 中山大学 Workflow modeling method and system for business object
CN108090664A (en) * 2017-12-13 2018-05-29 北京网博视界科技股份有限公司 A kind of workflow adaptation dispatching method, device, equipment and storage medium

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
GB0117539D0 (en) * 2001-07-18 2001-09-12 Hewlett Packard Co Apparatus and method for workflow
CN101159638A (en) * 2007-10-16 2008-04-09 中国移动通信集团福建有限公司 Workflow intelligent support system
WO2015070705A1 (en) * 2013-11-14 2015-05-21 华为技术有限公司 Computer device, method and apparatus for scheduling service process
CN106897857A (en) * 2015-12-17 2017-06-27 北京奇虎科技有限公司 A kind of workflow processing method and system

Also Published As

Publication number Publication date
CN109447568A (en) 2019-03-08

Similar Documents

Publication Publication Date Title
CN109636317B (en) Service control method, device, system and storage medium
EP3731161A1 (en) Model application method and system, and model management method and server
CN104598513A (en) Data flow control method and system based on webpage frame
CN107168765A (en) A kind of method and system of remote compilation software
CN106034113A (en) Data processing method and data processing device
CN110990008B (en) Page updating method and device, storage medium and electronic equipment
CN103701867A (en) Method, system and central server for processing call requests
CN115329170A (en) Webpage crawling method, device, equipment and storage medium
CN111369237A (en) Data processing method and device and computer storage medium
CN113407560B (en) Update message processing method, data synchronization method and configuration information configuration method
US20200286012A1 (en) Model application method, management method, system and server
CN114238703A (en) Event flow arrangement method, device and application
CN108776665B (en) Data processing method and device
CN113918129A (en) Front-end and back-end separated interface request processing method and device
CN107844363B (en) Business transaction processing method, device, storage medium and equipment
CN109447568B (en) Asynchronous operation method, device, equipment and storage medium for process activities
CN111294377A (en) Network request sending method of dependency relationship, terminal device and storage medium
CN107508705B (en) Resource tree construction method of HTTP element and computing equipment
CN112367205B (en) Processing method and scheduling system for HTTP scheduling request
CN111639167B (en) Task dialogue method and device
CN111782157B (en) Express delivery face list printing management method, device and system
CN106790323B (en) Resource discovery method and device
CN111078425B (en) Message processing method and device, storage medium and electronic equipment
CN114691703A (en) Data updating method and device, electronic equipment and storage medium
CN114637531A (en) Method and device for dynamically generating application program interface

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