CN114971594B - Workflow engine based on preemptive office mode - Google Patents
Workflow engine based on preemptive office mode Download PDFInfo
- Publication number
- CN114971594B CN114971594B CN202210895811.7A CN202210895811A CN114971594B CN 114971594 B CN114971594 B CN 114971594B CN 202210895811 A CN202210895811 A CN 202210895811A CN 114971594 B CN114971594 B CN 114971594B
- Authority
- CN
- China
- Prior art keywords
- preemptive
- node
- workflow engine
- task
- workflow
- 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
Links
- 238000000034 method Methods 0.000 claims abstract description 46
- 230000008569 process Effects 0.000 claims abstract description 32
- 238000012545 processing Methods 0.000 claims description 5
- 238000012217 deletion Methods 0.000 claims description 4
- 230000037430 deletion Effects 0.000 claims description 4
- 238000012544 monitoring process Methods 0.000 claims description 3
- 238000013461 design Methods 0.000 claims description 2
- 230000000977 initiatory effect Effects 0.000 claims description 2
- 230000006872 improvement Effects 0.000 abstract description 2
- 230000006870 function Effects 0.000 description 9
- 230000007246 mechanism Effects 0.000 description 6
- 230000008901 benefit Effects 0.000 description 4
- 238000004590 computer program Methods 0.000 description 4
- 230000004048 modification Effects 0.000 description 4
- 238000012986 modification Methods 0.000 description 4
- 230000009471 action Effects 0.000 description 3
- 238000007792 addition Methods 0.000 description 3
- 230000005540 biological transmission Effects 0.000 description 3
- 241001233037 catfish Species 0.000 description 3
- 238000004891 communication Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 230000004044 response Effects 0.000 description 3
- 238000010586 diagram Methods 0.000 description 2
- 238000002955 isolation Methods 0.000 description 2
- 230000015654 memory Effects 0.000 description 2
- 244000025254 Cannabis sativa Species 0.000 description 1
- RWSOTUBLDIXVET-UHFFFAOYSA-N Dihydrogen sulfide Chemical compound S RWSOTUBLDIXVET-UHFFFAOYSA-N 0.000 description 1
- 230000004075 alteration Effects 0.000 description 1
- 230000006399 behavior Effects 0.000 description 1
- 230000000903 blocking effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 230000005291 magnetic effect Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
- 230000003936 working memory Effects 0.000 description 1
Images
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
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
- G06F16/22—Indexing; Data structures therefor; Storage structures
-
- 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
- Y02P—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN THE PRODUCTION OR PROCESSING OF GOODS
- Y02P80/00—Climate change mitigation technologies for sector-wide applications
- Y02P80/10—Efficient use of energy, e.g. using compressed air or pressurized fluid as energy carrier
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Theoretical Computer Science (AREA)
- Strategic Management (AREA)
- Human Resources & Organizations (AREA)
- Physics & Mathematics (AREA)
- Data Mining & Analysis (AREA)
- General Physics & Mathematics (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Software Systems (AREA)
- Databases & Information Systems (AREA)
- General Engineering & Computer Science (AREA)
- Marketing (AREA)
- Operations Research (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- General Business, Economics & Management (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention provides a workflow engine based on a preemptive office mode, wherein a process node of the workflow engine consists of a preemptive node and a non-preemptive node, the preemptive node is provided with a preemptive task, and when the preemptive node is entered, the workflow engine opens a task preemption permission of the preemptive task to a corresponding department and issues a task handling permission to a first successful preemption department completing task preemption; the workflow engine also comprises a delay queue, the workflow engine preferentially puts the successfully seized department into the delay queue, and simultaneously closes the task seizing authority of other departments to the current node task; according to the invention, the preemptive office mode can be realized only by carrying out lightweight improvement on the traditional workflow engine, and the performance pressure of the system is not increased; the storage redundancy can be reduced, and the storage space is saved.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a workflow engine based on a preemptive office mode.
Background
The workflow is a description of a prescribed circulation process of a form, and comprises the following steps: several steps are to flow through; by whom each step is handled; which columns on the form are to be filled in at each step; which conditions must be met from one step to the next, and so on. The workflow is actually a concrete embodiment of a management system, and defines responsibility and division and defines a working program, so that each work can be efficiently and orderly carried out.
In the office environment of a company, the situation of low office delay efficiency often occurs, namely, a file can be processed only when the file has to be processed, and the problems are difficult to effectively solve due to enterprise system or talent cost. Based on this situation, each enterprise wants to supervise the efficient work of employees by using the annual performance assessment. Meanwhile, in order to promote the construction of enterprise culture, many enterprises utilize a catfish effect mechanism to enhance the competitiveness of offices, but currently, no corresponding mature working mode exists.
Based on the requirements of the office scene and the limitations of the traditional workflow, the traditional workflow engine needs to be modified, so that the workflow engine can meet the requirement of improving efficiency by using a catfish effect mechanism.
Disclosure of Invention
Aiming at the existing restriction limitation, the invention provides a workflow engine based on a preemptive office mode, and a preemptive work mode and a corresponding workflow engine system are introduced to solve the problem that the traditional workflow engine cannot meet the requirement of improving the efficiency by using a catfish effect mechanism.
In order to achieve the purpose, the invention adopts the following technical scheme:
the invention provides a workflow engine based on a preemptive office mode, wherein a process node of the workflow engine consists of a preemptive node and a non-preemptive node;
the process nodes of the workflow engine are composed of preemptive nodes and non-preemptive nodes, the preemptive nodes are provided with preemptive tasks, when the preemptive nodes are entered, the workflow engine opens task preemption authorities of the preemptive tasks to corresponding departments and issues task handling authorities to a first preemptive successful department which completes task preemption.
The workflow engine also comprises a delay queue, the workflow engine preferentially puts the successfully preempted department into the delay queue, and simultaneously closes the task preemption authority of other departments to the current node task.
When the pre-set handling duration is exceeded and the preemptive task is not handled, the workflow engine takes out all elements in the delay queue and restarts the task preemption authority of the preemptive task to the corresponding department;
and when the preemptive successful department completes the preemptive task within the preset transaction duration, the workflow engine continues to move backwards according to the predefined workflow.
And if the preemptive successful department completes the preemptive task within the preset transaction duration, if a new preemptive node appears in the nodes of the subsequent workflow or the node returns to the current preemptive node, the workflow engine directly takes the department out of the delay queue and opens the task transaction authority of the node to the department.
Compared with the prior art, the invention has the following advantages:
the preemptive node function is realized through the program design of the delay queue, and the preemptive office mode encountered in the actual application scene of the workflow is met; the scheme of storing the preemptive node and the non-preemptive node in the same table is provided, the preemptive node function can be realized only by carrying out lightweight improvement on the traditional workflow engine, and meanwhile, the performance pressure of the system is not increased; the scheme of storing the preemptive node and the non-preemptive node in the form of tables is provided, the storage redundancy is reduced, the storage space is saved, and the robustness and the expansibility of the preemptive node are enhanced.
The foregoing description is only an overview of the technical solutions of the present invention, and in order to make the technical means of the present invention more clearly understood, the present invention may be implemented in accordance with the content of the description, and in order to make the above and other objects, features, and advantages of the present invention more clearly understood, the following preferred embodiments are described in detail with reference to the accompanying drawings.
Drawings
Fig. 1 is a flowchart illustrating a method for implementing a preemptive node of a workflow engine based on a delay queue according to an embodiment of the present invention.
Fig. 2 is a schematic diagram of an operation manner of an implementation method of a workflow engine preemptive node based on a delay queue according to an embodiment of the present invention.
Fig. 3 is a diagram of a workflow engine structure according to an embodiment of the present invention.
Detailed Description
The present invention is described in terms of specific embodiments, and other advantages and benefits of the present invention will become apparent to those skilled in the art from the following disclosure. 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. For a further understanding of the present invention, reference will now be made in detail to the preferred embodiments of the present invention.
The following is an explanation of the embodiments of the present invention relating to noun terms:
the most prior response operation: i.e. the fastest response in time to a certain work task.
Preemptive: that is, the node is first obtained, and for the task node which is preempted, the processing authority of other level processing mechanisms of the node except the preempted mechanism is closed.
Preemptive office: multiple parallel organizations are allowed to handle a task by means of an initial response at one workflow node, and once the task is preempted by department a, all feedback and leadership approval for subsequent tasks are tracked and implemented by department a.
A priority queue: i.e., priority queue, a priority-based blocking queue (BlockingQueue) in which elements are given priority; when accessing elements, the element with the highest priority is deleted first. The priority queue has the behavior characteristic of highest-level first-out; typically implemented using a heap data structure.
Delay queue: the DelayQueue is a queue with a delay time attribute and realized based on a priority queue, and objects in the delay queue can be taken out of the queue only when the objects expire; the delay queue is ordered, i.e. the delay expiry time of the head-of-line object is longest.
The following specifically describes implementations of the present invention in conjunction with the foregoing noun terms:
the invention provides a workflow engine based on a preemptive office mode, wherein a process node of the workflow engine consists of a preemptive node and a non-preemptive node (a common node); the preemptive node is a process node for realizing the preemptive task, namely the preemptive node is provided with the preemptive task; the non-preemptive nodes, i.e., process nodes in the conventional workflow engine, do not have the functional attributes of the preemptive tasks, i.e., the non-preemptive nodes are provided with non-preemptive tasks (ordinary tasks).
The preemptive task has the preemptive property, namely the handling authority of the task is obtained by the preemption of a plurality of level handling mechanisms, and the first-come task is obtained first.
The workflow engine further comprises a delay queue; the delay queues are used to implement the function of preemptive nodes.
Referring to fig. 1, the workflow engine implements the working mode of the preemptive task by:
(1) Defining a working process in advance through a process designer, and designating a preemptive task handling department corresponding to the preemptive node; when entering the preemptive node, the workflow engine opens the task preemption authority of the preemptive task to the corresponding department through the authority controller, and the corresponding department preempts the task handling authority of the preemptive task according to the highest priority principle;
(2) At a preset preemption time T 0 The first internal task preemption department is a successful preemption department, and the workflow engine issues the task handling authority of the preemptive task to the successful preemption department; the workflow engine preferentially puts the successfully seized department into a delay queue, and then randomly puts other departments into the delay queue; meanwhile, the workflow engine stores the current task state data into the database, and closes the task viewing authority, the task handling authority and the task preemption authority of the current node task by other departments through the authority controller;
(3) Starting to transact the preemptive task by the preemptive successful department, and monitoring the transaction state of the preemptive successful department by a transaction manager;
if the successful preemption department exceeds the preset transaction duration T S When the nodes are not handled, the workflow engine takes out all elements in the delay queue, reopens the task preemption authority of the current preemption node to the corresponding department through the authority controller, and preempts the task handling authority by the corresponding department;
if the successful preemption department presets a transaction duration T S And if the preemptive task of the node is completed, the workflow engine continues to move backwards according to the predefined workflow.
Further, if the successful preemption department presets a handling duration T S And internally completing the preemptive task of the node, if a new preemptive node appears in the nodes of the subsequent workflow or the node returns to the current preemptive node, directly taking out the preemptive successful department from the delay queue by the workflow engine, and opening the task handling authority of the node to the preemptive successful department through the authority controller.
As an embodiment, the preemptive node and the non-preemptive node data are stored in the same process node table; the process node table is used for storing node data in the workflow, wherein the node data comprises preemptive node data and non-preemptive node data.
The process node table includes the following fields: number (string field), type (enumerated field), drafter (string field), file title (string field), creation department (string field), creator (string field), creation date (time field), creation time (time field), contact (string field), file summary (string field), transmission object (string field), urgency (enumerated field), issuer (string field), issue date (time field), remark (string field), comment indication (string field), attachment (file type field), body (file type field or string field), associated file (file type field), communication exchange (string field), whether it is a preemptive node (boolean field), a participating station (array field), a successful station (string field), a failed station (array field), a preemption mode configuration item (string field), a start time (time field), a preemption duration (time field), and an end time (time field).
It can be understood that the embodiment may be implemented based on the modification of the process node table of the conventional workflow engine, and the specific implementation manner is to add the following fields in the process node table of the conventional workflow engine: whether the node is a preemptive node (Boolean value field), a position (array field) participating in preemption, a position (character string field) successfully preempting, a position (array field) failing to preempt, a preemption mode configuration item (character string field), a preemption start time (time field), a preemption duration (time field), and a preemption end time (time field).
The operation of the workflow engine on the process node table comprises query, deletion, addition and modification, and the operation mode of the workflow engine on the process node table in the embodiment is the same as that of the conventional workflow engine on the process node table.
When the preemptive node and the non-preemptive node are stored in the same process node table, the workflow engine judges the node type by inquiring data of a field of' whether the preemptive node is in the process node table; when entering the preemptive node, the function of the preemptive node is realized according to the modes (1) to (3), and when entering the non-preemptive node, the processing is carried out according to the flow node processing mode of the conventional workflow engine.
When the embodiment that the non-preemptive nodes and the preemptive nodes are stored in the same node table is adopted, the reconstruction difficulty of the traditional workflow engine can be reduced, and the function of the preemptive nodes can be realized only by carrying out small-amplitude reconstruction on the traditional workflow engine.
As an embodiment, the non-preemptive node and the preemptive node data are stored in a normal node table and a preemptive node table, respectively.
The general node table includes the following fields: number (string field), type (enumerated field), drafter (string field), file title (string field), creation department (string field), creator (string field), creation date (time field), creation time (time field), contact (string field), file summary (string field), transmission object (string field), urgency (enumerated field), issuer (string field), issue date (time field), remark (string field), comment indication (string field), attachment (file type field), body (file type field or string field), associated file (file type field), communication (string field).
Besides the fields of the common node table, the preemptive node table also comprises the following fields: the method comprises the following steps of occupying positions (array field), positions (character string field) successfully occupied, positions (array field) unsuccessfully occupied, a occupying mode configuration item (character string field), occupying starting time (time field), occupying duration (time field) and occupying ending time (time field).
The common node table and the preemptive node table are integrated through an intermediate table, and the intermediate table is composed of common node numbers and preemptive node numbers.
Preferably, in order to optimize the query operation and improve the average query efficiency, the intermediate table also stores some node part attributes, where the node part attributes include at least one of a node number and whether a node is a preemptive node.
The operation of the workflow engine comprises query, deletion, addition and modification;
when the non-preemptive node and the preemptive node are respectively stored in a common node table and a preemptive node table, and the workflow engine performs adding, deleting, modifying and inquiring operations, determining to operate the common node table or the preemptive node table through a logic judgment link in an operation program; the judgment basis of the logic judgment link is a table name.
Referring to fig. 2, when the workflow engine performs querying, deleting, adding, and modifying, the operation mode is as follows:
and (3) inquiring: if the intermediate table contains the target query field, only operating the intermediate table; if the intermediate table does not contain the target query field, initiating correlation query to the common node table and the preemptive node table through the intermediate table, and finally merging results and returning;
and (3) deleting: deleting only the intermediate table, and then transferring a cascade deleting program to delete the common node table and the preemptive node table, so as to prevent the three tables from being asynchronous;
addition and modification: the contents of the three tables, namely the normal node table, the intermediate table and the preemptive node table, need to be added or modified simultaneously.
In fig. 2, the "node basic attribute" includes at least one of attributes such as number, type, drafter, file title, creation department, creator, creation date, creation time, contact means, file summary, transmission object, urgency, issuer, issue date, remark, comment indication, attachment, text, associated file, communication exchange, and the like; the 'node part attribute' comprises a node number and whether a node is a preemption node; the 'preemptive node specific attribute' includes whether the node is a preemptive node, a position participating in preemption, a position successfully preempted, a position failing to preempt, a preemption mode configuration item, a preemption start time, a preemption duration and a preemption end time.
When the embodiment that the non-preemptive nodes and the preemptive nodes are respectively stored is adopted, the redundancy can be reduced, and the hard disk space can be saved; meanwhile, when the program logic points to different tables for operation, physical isolation and logical isolation are achieved, and the robustness and the expansibility of the workflow engine are enhanced; and the query efficiency can be greatly improved for the workflow without preempting nodes.
As an embodiment, the present invention further provides a configuration policy for a case where there are a plurality of preemptive nodes in a flow, including a priority policy and an equal policy:
the priority strategy comprises the following steps: the weight of a successful department in the first preemptive node is increased, and if the department exists in a preemptive queue in the subsequent preemptive node, the department is directly adopted without preemption; if the department does not exist in the preemption queue in the subsequent preemption node, then fairly preempting;
and (3) an equal strategy: compared with the priority strategy, the weight of the successfully preempted department in the first preemptive node is not increased, and the subsequent preemptive nodes equally treat each department and compete fairly.
The configuration strategy is realized through a configuration strategy switch in a workflow engine configuration file; the configuration file is a key-value pair-based file; and reading the key value pair in the configuration file by the workflow engine during initial loading and executing the key value pair as an environment variable of the workflow engine.
Generally, a priority policy is adopted to improve the working efficiency of the workflow engine, and when the configuration policy adopts the priority policy, if a certain node in a process including a plurality of preemptive nodes is a preemptive node and the node appears for a plurality of times, the node does not need to be preempted again when appearing for the second time or later.
For example, refer to the following scheme: the method comprises the following steps of drawing grass, node 1, node 2, node 3, node 4, node 5, node 3, node 6 and handling, wherein the node 3 is a preemptive node, and if the flow firstly passes through the node 3, the flow is preempted by the department A, and the flow is directly handed to the department A to be handled without being preempted again when passing through the node 3 for the second time.
As an embodiment, the preemptive node may implement the preemptive office function in a workflow engine, and referring to fig. 3, the workflow engine is composed of a database, a form designer, a form presenter, a transaction manager, a flow designer, a flow deployer, an authority controller, and a data interface.
The database is used for storing data tables which are depended on in the operation process of the workflow engine, and comprises the process node table, the common node table and the preemptive node table in the embodiment, and further comprises a flow table, a to-do table and a staff table.
The authority controller is used for authority management and control of the workflow engine.
The form designer is used for designing a working form; the form display is used for visually displaying the working forms.
The item manager is used for monitoring task handling state and managing work task items.
The flow designer is used to visually design workflow flows.
The workflow deployer is used for actually deploying workflow processes and generating process data which can be identified by the workflow engine.
As an example, the workflow engine of the present invention may be implemented in software and/or a combination of software and hardware, for example, using Application Specific Integrated Circuits (ASICs), general purpose computers or any other similar hardware devices.
The workflow engine of the present invention may be implemented in the form of a software program that can be executed by a processor to implement the steps or functions described above. Also, the software programs (including associated data structures) may be stored in a computer readable recording medium, such as RAM memory, magnetic or optical drive or diskette and the like.
Additionally, some of the steps or functions of the methods of the present invention may be implemented in hardware, for example, as circuitry that cooperates with the processor to perform various steps or functions.
In addition, a portion of the workflow engine described herein may be implemented as a computer program product, such as computer program instructions, which when executed by a computer, may invoke or provide methods and/or aspects in accordance with the present application through the operation of the computer. The program instructions which invoke the methods of the present invention may be stored on a fixed or removable recording medium and/or transmitted via a data stream over a broadcast or other signal-bearing medium and/or stored within a working memory of a computer device operating in accordance with the program instructions.
The present invention also provides, as an embodiment, an apparatus comprising a memory for storing computer program instructions and a processor for executing the program instructions, wherein the computer program instructions, when executed by the processor, trigger the apparatus to perform a method and/or a technical solution according to the foregoing embodiments.
It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently depending on the application. Further, those skilled in the art should also appreciate that the embodiments described in the specification are exemplary embodiments and that the acts and modules referred to are not necessarily required in this application.
Finally, it should be noted that, in this document, relational terms such as first and second, and the like are used solely to distinguish one entity or action from another entity or action without necessarily requiring or implying any actual such relationship or order between such entities or actions. Also, the terms "include", "including" or any other variations thereof are intended to cover non-exclusive inclusion, so that a process, method, article, or terminal device including a series of elements includes not only those elements but also other elements not explicitly listed or inherent to such process, method, article, or terminal device. Without further limitation, an element defined by the phrases "comprising one of \ 8230; \8230;" does not exclude the presence of additional like elements in a process, method, article, or terminal device that comprises the element.
Although the present invention has been described with reference to a preferred embodiment, it should be understood that various changes, substitutions and alterations can be made herein without departing from the spirit and scope of the invention as defined by the appended claims.
Claims (9)
1. A workflow engine based on a preemptive office mode, characterized in that,
the process nodes of the workflow engine are composed of preemptive nodes and non-preemptive nodes, the preemptive nodes are provided with preemptive tasks, and when entering the preemptive nodes, the workflow engine opens task preemption permission of the preemptive tasks to corresponding departments and issues task handling permission to a first preemptive successful department completing task preemption;
the workflow engine also comprises a delay queue, the workflow engine preferentially puts the successfully seized department into the delay queue, and simultaneously closes the task seizing authority of other departments to the current node task;
when the pre-set transaction duration is exceeded and no preemptive task is transacted, the workflow engine takes out all elements in the delay queue and opens the task preemption authority of the preemptive task to the corresponding department again;
and when the preemptive successful department completes the preemptive task within the preset transaction duration, the workflow engine continues to move backwards according to the predefined workflow.
2. The workflow engine of claim 1,
if the preemptive successful department completes the preemptive task within the preset transaction duration, if a new preemptive node appears in the nodes of the subsequent workflow or returns to the current preemptive node, the workflow engine directly takes the department out of the delay queue and opens the task transaction authority of the node to the department.
3. The workflow engine of claim 1,
the preemptive node is composed of the following fields of data: the method comprises the following steps of occupying a position, a position which is successfully occupied, a position which is failed to be occupied, a configuration item of a occupying mode, beginning time of occupation, duration time of occupation and ending time of occupation.
4. The workflow engine of claim 1,
when a preemptive node is stored in a process node table, the process node table comprises a preemptive node field and a node type identifier;
and the workflow engine identifies the preemptive node through the node type identification.
5. The workflow engine of claim 1,
when the preemptive node and the non-preemptive node in the workflow engine are respectively stored in a preemptive node table and a common node table, the preemptive node table and the common node table are associated through an intermediate table, and the function of a process node table is realized;
the workflow engine identifies preemptive nodes by table names.
6. The workflow engine of claim 5,
when the workflow engine carries out query operation, if the intermediate table contains a target query field, directly querying the intermediate table; otherwise, initiating association query to the common node table and the preemptive node table through the intermediate table, and then combining and returning the results;
when the workflow engine carries out deletion operation, the intermediate table is firstly deleted, and then the data in the common node table and the preemptive node table are deleted by a cascade deletion method.
7. The workflow engine of claim 1,
and the workflow engine randomly puts the preemption failure department which does not complete the task into the delay queue after the preemption success department is put into the delay queue, and simultaneously closes the task viewing permission and the task handling permission of the current node task for the preemption failure department.
8. The workflow engine of claim 1,
the workflow engine contains a configuration file; the configuration file is used for identifying a processing mode of a workflow comprising a plurality of preemptive nodes;
and the workflow engine reads the configuration file during initial loading and stores the configuration file as an environment variable.
9. The workflow engine of claim 1,
the workflow engine consists of a database, a form designer, a form display, a matter manager, a flow designer, a flow deployer, an authority controller and a data interface;
the database is used for storing a data table depended on in the operation process of the workflow engine; the authority controller is used for the authority management and control of the workflow engine; the form designer is used for working form design; the form display is used for visually displaying a working form; the item manager is used for monitoring task handling state and managing work task items; the flow designer is used for visually designing the workflow flow; the workflow deployer is used for actually deploying the workflow and generating the workflow data which can be recognized by the workflow engine.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210895811.7A CN114971594B (en) | 2022-07-28 | 2022-07-28 | Workflow engine based on preemptive office mode |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210895811.7A CN114971594B (en) | 2022-07-28 | 2022-07-28 | Workflow engine based on preemptive office mode |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114971594A CN114971594A (en) | 2022-08-30 |
| CN114971594B true CN114971594B (en) | 2022-10-25 |
Family
ID=82970213
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210895811.7A Active CN114971594B (en) | 2022-07-28 | 2022-07-28 | Workflow engine based on preemptive office mode |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114971594B (en) |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109829598A (en) * | 2018-11-20 | 2019-05-31 | 用友网络科技股份有限公司 | A kind of candidate's preemptive type method for allocating tasks and system |
| CN113298503A (en) * | 2021-06-15 | 2021-08-24 | 中国建设银行股份有限公司 | Government affair-oriented workflow management system and database and table dividing method thereof |
Family Cites Families (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20120197625A1 (en) * | 2011-01-28 | 2012-08-02 | National Tsing Hua University | Data-dependency-Oriented Modeling Approach for Efficient Simulation of OS Preemptive Scheduling |
| CN110275770B (en) * | 2018-03-15 | 2023-09-22 | 阿里巴巴集团控股有限公司 | Task balanced scheduling method, system, node and electronic equipment |
| CN108762903A (en) * | 2018-05-23 | 2018-11-06 | 四川斐讯信息技术有限公司 | A kind of preemptive type method for scheduling task and system towards magnanimity working node |
| US11245751B1 (en) * | 2019-09-24 | 2022-02-08 | Cisco Technology, Inc. | Service or network function workload preemption |
| CN111399989B (en) * | 2020-04-10 | 2022-11-18 | 中国人民解放军国防科技大学 | Container cloud-oriented task preemption and scheduling method and system |
| CN111950988B (en) * | 2020-08-18 | 2022-03-29 | 北京字节跳动网络技术有限公司 | Distributed workflow scheduling method and device, storage medium and electronic equipment |
| CN112712335B (en) * | 2020-12-30 | 2021-12-10 | 北京宇信科技集团股份有限公司 | Working method, medium and equipment of workflow engine |
-
2022
- 2022-07-28 CN CN202210895811.7A patent/CN114971594B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109829598A (en) * | 2018-11-20 | 2019-05-31 | 用友网络科技股份有限公司 | A kind of candidate's preemptive type method for allocating tasks and system |
| CN113298503A (en) * | 2021-06-15 | 2021-08-24 | 中国建设银行股份有限公司 | Government affair-oriented workflow management system and database and table dividing method thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114971594A (en) | 2022-08-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20200133750A1 (en) | Methods, apparatus and computer programs for managing persistence | |
| US7702741B2 (en) | Configuring or reconfiguring a multi-master information sharing environment | |
| US7917499B2 (en) | Updating adaptive, deferred, incremental indexes | |
| US7240054B2 (en) | Techniques to preserve data constraints and referential integrity in asynchronous transactional replication of relational tables | |
| US7017156B1 (en) | System for computing an estimate execution time by totaling the time value base on an architecture or a software operating environment | |
| US7734618B2 (en) | Creating adaptive, deferred, incremental indexes | |
| JPH01237758A (en) | Electronic document management for interactive type information handling system | |
| GB2343020A (en) | Handling transaction failures in a transaction processing system | |
| US7937364B1 (en) | Method and system for reliable access of messages by multiple consumers | |
| CN108089926A (en) | A kind of method, apparatus, equipment and readable storage medium storing program for executing for obtaining distributed lock | |
| US20070073655A1 (en) | Enhancing tables and SQL interaction with queue semantics | |
| CN101477386A (en) | Timer implementing method and apparatus | |
| CN107111534A (en) | A kind of method and apparatus of data processing | |
| US20060143150A1 (en) | Messaging system and method of operation thereof | |
| CN114971594B (en) | Workflow engine based on preemptive office mode | |
| CN117083591A (en) | Asynchronous persistence of duplicate data changes in a database accelerator | |
| CN115169891B (en) | Method for realizing workflow engine comprising multi-start-point multi-branch flow | |
| US10871945B2 (en) | Resumable merge sort | |
| JPH07225704A (en) | File managing device | |
| CN103995743B (en) | Two-stage mixed task scheduling method based on resource reservation | |
| US7689534B2 (en) | Affecting database file performance by allowing delayed query language trigger firing | |
| CN115237577A (en) | Job scheduling method and device based on priority queue | |
| US7068604B2 (en) | Managing memory resident queues to control resources of the systems using the queues | |
| CA2220612C (en) | Method and apparatus for inter-node deadlock avoidance on a parallel processing system | |
| Konana et al. | Transaction management mechanisms for active and real-time databases: A comprehensive protocol and a performance study |
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 |