CN115147031B - Clearing workflow execution method, device, equipment and medium - Google Patents

Clearing workflow execution method, device, equipment and medium Download PDF

Info

Publication number
CN115147031B
CN115147031B CN202211091773.6A CN202211091773A CN115147031B CN 115147031 B CN115147031 B CN 115147031B CN 202211091773 A CN202211091773 A CN 202211091773A CN 115147031 B CN115147031 B CN 115147031B
Authority
CN
China
Prior art keywords
workflow
clearing
execution
task
upstream
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
CN202211091773.6A
Other languages
Chinese (zh)
Other versions
CN115147031A (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.)
Huarui Distributed Technology Changsha Co ltd
Shenzhen Huarui Distributed Technology Co ltd
Original Assignee
Huarui Distributed Technology Changsha Co ltd
Shenzhen Huarui Distributed Technology 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 Huarui Distributed Technology Changsha Co ltd, Shenzhen Huarui Distributed Technology Co ltd filed Critical Huarui Distributed Technology Changsha Co ltd
Priority to CN202211091773.6A priority Critical patent/CN115147031B/en
Publication of CN115147031A publication Critical patent/CN115147031A/en
Application granted granted Critical
Publication of CN115147031B publication Critical patent/CN115147031B/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/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0633Workflow analysis
    • 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/06Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
    • G06Q10/063Operations research, analysis or management
    • G06Q10/0631Resource planning, allocation, distributing or scheduling for enterprises or organisations
    • G06Q10/06316Sequencing of tasks or work
    • 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
    • G06Q40/00Finance; Insurance; Tax strategies; Processing of corporate or income taxes
    • G06Q40/12Accounting

Abstract

The invention relates to the field of task scheduling, and provides a clearing workflow execution method, a device, equipment and a medium, wherein the method comprises the following steps: acquiring the incidence relation of each subtask in a clearing task, constructing a directed graph according to the incidence relation, extracting at least one clearing workflow from the directed graph, configuring a workflow identifier for each clearing workflow, detecting the state of each clearing workflow according to the workflow identifier, determining the clearing workflow as a target workflow when detecting that the subtask in the clearing workflow is started, configuring an execution identifier for the target workflow, associating the execution identifier with the execution logs of all subtasks in the target workflow, and scheduling tasks of the target workflow according to the execution logs. By utilizing the method and the device, the clearing workflow can be orderly executed based on the incidence relation, the data processing efficiency in the clearing process is improved, the error rate is effectively reduced, and the resource waste is avoided.

Description

Clearing workflow execution method, device, equipment and medium
Technical Field
The invention relates to the technical field of task scheduling, in particular to a clearing workflow execution method, a clearing workflow execution device and a clearing workflow execution medium.
Background
With the development of financial market innovation business, the increase of transaction scale and the internationalization acceleration process, the business attribute and the transaction mode of the financial market are increasingly complicated, and the clearing business saturation is also continuously improved. Most security companies today are limited by the fact that traditional business system architectures are in tight coupling, resulting in clearing work that is subject to re-encumbrance. Specifically, on the business level, the lagging clearing manner cannot realize multi-business clearing, so that the current situation that clearing personnel must complete clearing work across a multi-business system within a limited clearing window period cannot be solved so far. In the technical aspect, the old technical architecture cannot realize all-service all-weather clearing and cannot respond to new requirements of services, even a clearing person is still required to record clearing items in a papery form in low-frequency remote services, so that the services cannot conform to the development of the era and are continuously innovated, and the old technical architecture cannot decouple systems such as transactions, funds, accounts and the like and cannot realize real-time clearing.
In addition, in the prior art, the triggering condition of the original task is not controlled, and the associated task does not have any response after the task is triggered, which can cause the situation of repeated execution of multiple tasks in the workflow, directly causes the abnormal clearing data, and simultaneously, the resource allocation without priority can cause the problems of resource waste and the like.
Disclosure of Invention
In view of the above, there is a need to provide a clearing workflow execution method, device, apparatus and medium, which aim to solve the problems of poor task timeliness and easy execution exception of the clearing workflow.
A clearing workflow execution method, the clearing workflow execution method comprising:
acquiring the incidence relation of each subtask in the clearing task, and constructing a directed graph according to the incidence relation;
extracting at least one clearing workflow from the directed graph and configuring a workflow identification for each clearing workflow;
detecting the status of each clearing workflow according to the workflow identification;
when detecting that a subtask in a clearing workflow is started, determining the clearing workflow as a target workflow, and configuring an execution identifier for the target workflow;
associating the execution identifier with the execution logs of all subtasks in the target workflow;
and performing task scheduling on the target workflow according to the execution log.
According to the preferred embodiment of the present invention, the constructing the directed graph according to the association relationship comprises:
determining each subtask as a node;
determining the upstream and downstream relation between every two subtasks according to the incidence relation;
determining the upstream-downstream relationship between every two nodes according to the upstream-downstream relationship between every two subtasks;
and connecting each node according to the upstream and downstream relation between every two nodes to obtain the directed graph.
According to a preferred embodiment of the present invention, the task scheduling the target workflow according to the execution log includes:
for each subtask in the target workflow, acquiring all upstream tasks of the subtask;
detecting the execution state of each upstream task in all the upstream tasks according to the execution log;
when the execution state of each upstream task is the execution success state, acquiring the entry parameter of the subtask from each upstream task, and executing the subtask according to the entry parameter; or alternatively
When the execution state of the upstream task in all the upstream tasks is the execution failure state, the subtask is not executed; or
And when the execution state of an upstream task in all the upstream tasks is an executing state, waiting for the upstream task to continue executing, and after the execution of the upstream task is finished, continuously detecting the execution state of each upstream task in all the upstream tasks according to the execution log.
According to a preferred embodiment of the present invention, when performing task scheduling on the target workflow according to the execution log, the method further includes:
when the sub-tasks in the target workflow report errors, acquiring an execution log of each sub-task in the target workflow according to the execution identifier;
positioning the sub-tasks with abnormal execution in the target workflow according to the execution log of each sub-task, and determining the sub-tasks with abnormal execution as fault points;
acquiring a pre-constructed fault-reason list;
inquiring in the fault-reason list according to the fault point to obtain a fault reason;
and sending the fault point, the fault reason and the execution log of the fault point to specified terminal equipment, and sending a fault prompt.
According to a preferred embodiment of the invention, the method further comprises:
and when the target workflow has an independent task which is independently executed, covering the last execution state of the independent task by using the current execution state of the independent task.
According to a preferred embodiment of the invention, the method further comprises:
at least one task executor is deployed in a distributed mode, wherein the at least one task executor is distributed on at least one heterogeneous node machine;
executing each subtask in the clearing task using the at least one task executor;
wherein each process is separated using a remote procedure call mechanism while each subtask in the clearing task is executed.
According to a preferred embodiment of the invention, the method further comprises:
configuring a trigger strategy for each subtask in the clearing task;
the trigger strategies comprise Cron trigger, fixed interval trigger, fixed delay trigger, event trigger, manual trigger and chain trigger.
A clearing workflow execution apparatus, said clearing workflow execution apparatus comprising:
the construction unit is used for acquiring the incidence relation of each subtask in the clearing task and constructing a directed graph according to the incidence relation;
the extracting unit is used for extracting at least one clearing workflow from the directed graph and configuring a workflow identifier for each clearing workflow;
a detection unit for detecting the status of each clearing workflow according to the workflow identification;
the system comprises a determining unit, a calculating unit and a processing unit, wherein the determining unit is used for determining a clearing workflow as a target workflow and configuring an execution identifier for the target workflow when detecting that a subtask in the clearing workflow is started;
the association unit is used for associating the execution identifier with the execution logs of all the subtasks in the target workflow;
and the scheduling unit is used for performing task scheduling on the target workflow according to the execution log.
A computer device, the computer device comprising:
a memory storing at least one instruction; and
a processor executing instructions stored in the memory to implement the clearing workflow execution method.
A computer-readable storage medium having stored therein at least one instruction for execution by a processor in a computer device to implement the clearing workflow execution method.
According to the technical scheme, the clearing workflow can be orderly executed based on the incidence relation, the data processing efficiency in the clearing process is improved, meanwhile, the error rate is effectively reduced, and the resource waste is avoided.
Drawings
FIG. 1 is a flow chart of a preferred embodiment of a clearing workflow execution method of the present invention.
FIG. 2 is an exemplary schematic of a directed graph of the present invention.
FIG. 3 (a) is a diagram illustrating task scheduling for a target workflow according to the present invention.
FIG. 3 (b) is another illustration of the present invention performing task scheduling on a target workflow.
FIG. 4 is a functional block diagram of a preferred embodiment of the clearing workflow execution apparatus of the present invention.
FIG. 5 is a schematic structural diagram of a computer device for implementing the clearing workflow execution method according to the preferred embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention will be described in detail with reference to the accompanying drawings and specific embodiments.
FIG. 1 is a flow chart of a preferred embodiment of the clearing workflow execution method of the present invention. The order of the steps in the flow chart may be changed and some steps may be omitted according to different needs.
The method for executing the clearing workflow is applied to one or more computer devices, and the computer devices are devices capable of automatically performing numerical calculation and/or information processing according to preset or stored instructions, and the hardware thereof includes but is not limited to a microprocessor, an Application Specific Integrated Circuit (ASIC), a Programmable Gate Array (FPGA), a Digital Signal Processor (DSP), an embedded device, and the like.
The computer device may be any electronic product capable of performing human-computer interaction with a user, for example, a Personal computer, a tablet computer, a smart phone, a Personal Digital Assistant (PDA), a game machine, an Internet Protocol Television (IPTV), an intelligent wearable device, and the like.
The computer device may also include a network device and/or a user device. The network device includes, but is not limited to, a single network server, a server group consisting of a plurality of network servers, or a Cloud Computing (Cloud Computing) based Cloud consisting of a large number of hosts or network servers.
The server may be an independent server, or may be a cloud server that provides basic cloud computing services such as a cloud service, a cloud database, cloud computing, a cloud function, cloud storage, a Network service, cloud communication, a middleware service, a domain name service, a security service, a Content Delivery Network (CDN), a big data and artificial intelligence platform, and the like.
Among them, artificial Intelligence (AI) is a theory, method, technique and application system that simulates, extends and expands human Intelligence using a digital computer or a machine controlled by a digital computer, senses the environment, acquires knowledge and uses the knowledge to obtain the best result.
The artificial intelligence infrastructure generally includes technologies such as sensors, dedicated artificial intelligence chips, cloud computing, distributed storage, big data processing technologies, operation/interaction systems, mechatronics, and the like. The artificial intelligence software technology mainly comprises a computer vision technology, a robot technology, a biological recognition technology, a voice processing technology, a natural language processing technology, machine learning/deep learning and the like.
The Network in which the computer device is located includes, but is not limited to, the internet, a wide area Network, a metropolitan area Network, a local area Network, a Virtual Private Network (VPN), and the like.
And S10, acquiring the incidence relation of each subtask in the clearing task, and constructing a directed graph according to the incidence relation.
For example: each subtask in the clearing task may include, but is not limited to: issuing tasks, downloading tasks, reconciliation tasks and the like.
In this embodiment, the constructing a directed graph according to the association relationship includes:
determining each subtask as a node;
determining the upstream and downstream relation between every two subtasks according to the incidence relation;
determining the upstream and downstream relation between every two nodes according to the upstream and downstream relation between every two subtasks;
and connecting each node according to the upstream and downstream relation between every two nodes to obtain the directed graph.
Please refer to fig. 2, which is an exemplary diagram of a directed graph according to the present invention. In the figure, each circle represents a node in the directed graph, each node represents a subtask, the start end of each arrow represents an upstream task, the end of each arrow represents a downstream task, each arrow represents an upstream-downstream relationship, and also represents an association relationship between nodes.
By constructing the directed graph, the execution sequence among the subtasks is clearer, repeated execution of the tasks caused by unclear incidence relation among the tasks is avoided, and further abnormal clearing data is avoided.
In this embodiment, the directed graph may be continuously updated according to the actual requirement of the clearing task, so as to implement the configurability of the directed graph.
And S11, extracting at least one clearing workflow from the directed graph, and configuring a workflow identifier for each clearing workflow.
In this embodiment, each clearing workflow may be abstracted based on actual clearing requirements.
For example: the clearing workflow can be extracted according to the requirement on the task dimension, so that when an error occurs in the clearing process, only the wrong task dimension needs to be corrected, and the problem that the clearing window is short in period and has no fault-tolerant time is solved.
In any extracted clearing workflow, different tasks have directional serial and parallel relations, so that the tasks are connected in series and parallel and coexist, the overall efficiency of the clearing tasks is improved, the pain point that the clearing window period is short and fault-tolerant time is not available is solved, the business data can be rapidly processed under the condition that hundreds of millions of quotations are broken out, the clearing work efficiency of a system is improved, and even the time consumption of the clearing work is reduced from hour level to minute level.
Specifically, at least one clearing workflow may be included in one clearing task, and one clearing workflow may include at least one subtask.
In this embodiment, the Workflow identification may be Workflow _ id.
Through the workflow identification, different clearing workflows can be effectively distinguished, and repeated execution of tasks is further avoided.
And S12, detecting the state of each clearing workflow according to the workflow identification.
Specifically, each clearing workflow is located according to the workflow identification, and the status of each located clearing workflow is detected.
S13, when detecting that the subtask in the clearing workflow is started, determining the clearing workflow as a target workflow, and configuring an execution identifier for the target workflow.
For example: and when the first task in the clearing workflow is detected to be started, determining that the start of the subtask in the clearing workflow is detected, and determining the clearing workflow as the target workflow.
In this embodiment, the execution identifier may be run _ id.
And S14, associating the execution identification with the execution logs of all the subtasks in the target workflow.
In this embodiment, a field of the execution identifier may be added to the execution log, and the obtained execution log may include:
task identifier taskid, execution identifier run _ id, and state trigger _ code.
Through the execution log, the strong association between the state and the execution identifier can be realized, so that the state of task execution is conveniently tracked in real time, the positioning of the execution abnormal node is assisted, and the abnormal reason is checked.
And S15, performing task scheduling on the target workflow according to the execution log.
In this embodiment, the task scheduling the target workflow according to the execution log includes:
for each subtask in the target workflow, acquiring all upstream tasks of the subtask;
detecting the execution state of each upstream task in all the upstream tasks according to the execution log;
when the execution state of each upstream task is the execution success state, acquiring the entry parameter of the subtask from each upstream task, and executing the subtask according to the entry parameter; or alternatively
When the execution state of the upstream task in all the upstream tasks is the execution failure state, the subtask is not executed; or alternatively
And when the execution state of an upstream task in all the upstream tasks is an executing state, waiting for the upstream task to continue executing, and after the execution of the upstream task is finished, continuously detecting the execution state of each upstream task in all the upstream tasks according to the execution log.
Please refer to fig. 3 (a) -3 (b), which are schematic diagrams illustrating task scheduling for a target workflow according to the present invention.
Fig. 3 (a) illustrates scheduling of a simple workflow, where each subtask is executed serially. Taking task B as an example, before triggering execution of task B, it is detected whether task a of the upstream task is successfully executed. If the execution of the A is successful, transmitting the required access participation of the B to the B, and executing the following steps of B: if the execution of A fails, the execution of B is not triggered.
FIG. 3 (b) is a diagram illustrating the scheduling of a complex workflow, wherein each subtask is executed in series and executed in parallel. Taking task B as an example, before triggering and executing task B, it is detected whether task a and task D of the upstream task are executed successfully. Only when A, D are successfully executed, the required input parameter of B is transmitted to B, and B is triggered to be executed; if A, D has any one of them failed to execute (including failed execution or executing), then execution B is not triggered, at this time, if D is detected to be still in the executing state, then the state of a is detected after D is successfully executed.
The task scheduling mode in this embodiment implements response between different tasks through the association relationship, so that the execution of the tasks has a definite priority, and resource waste during resource allocation is avoided.
In this embodiment, when performing task scheduling on the target workflow according to the execution log, the method further includes:
when the sub-tasks in the target workflow report errors, acquiring an execution log of each sub-task in the target workflow according to the execution identifier;
positioning and executing abnormal subtasks in the target workflow according to the execution log of each subtask, and determining the executed abnormal subtasks as fault points;
acquiring a pre-constructed fault-reason list;
inquiring in the fault-reason list according to the fault point to obtain a fault reason;
and sending the fault point, the fault reason and the execution log of the fault point to specified terminal equipment, and sending a fault prompt.
The fault-cause list may be constructed according to historical execution data, or may be constructed according to expert experience, which is not limited in the present invention.
The designated terminal device may be a terminal device of a related worker, such as a person responsible for a clearing task.
According to the embodiment, the fault point, the fault reason and the corresponding execution log are sent to the relevant equipment, and the fault prompt is sent in time, so that the fault location and the fault elimination can be assisted more quickly and accurately, the exception handling efficiency is improved, and the loss caused by the error of clearing data is avoided.
In this embodiment, the method further includes:
and when the target workflow has independent tasks which are independently executed, covering the last execution state of the independent task by using the current execution state of the independent task.
The independent task can be a task only paying attention to the current state, so that the independent task can be executed in a covering mode without using an execution identifier for state tracking and positioning.
In this embodiment, the method further includes:
at least one task executor is deployed in a distributed mode, wherein the at least one task executor is distributed on at least one heterogeneous node machine;
executing each subtask in the clearing task using the at least one task executor;
wherein each process is separated using a Remote Procedure Call (RPC) mechanism when each subtask in the clearing task is executed.
Distributed deployment supports the configurability of task scheduling, e.g., data can be assembled according to business dimensions to support the implementation of complex business.
In the embodiment, the task execution center is separated from the scheduling by the distributed deployment of the task executors, and meanwhile, the communication among the processes is executed by utilizing a remote process calling mechanism, so that the remote method is called as a local method.
In this embodiment, the method further includes:
configuring a trigger strategy for each subtask in the clearing task;
the trigger strategies comprise Cron trigger, fixed interval trigger, fixed delay trigger, event trigger, manual trigger and chain trigger.
Specifically, the Cron trigger is: the code layer realizes the triggering execution of the timing task by using a cron expression;
the fixed interval triggering and the fixed delay triggering are as follows: triggering task execution at each time node according to the configured interval time length;
the event trigger is as follows: tasks depend on the completion of an event, wherein the associated event and the current task do not necessarily belong to the same clearing workflow;
the manual triggering is as follows: the task cannot be actively executed and needs manual triggering;
the chain triggering is as follows: in the same task flow, the task depends on the completion condition of the upstream task, the upstream task is correctly executed, and the downstream task is automatically triggered.
The embodiment adopts a multi-trigger strategy, realizes the automatic execution of the whole process, realizes the maximization of the processing efficiency of each task node, and completes the task in the shortest time consumption.
According to the technical scheme, the association relationship of each subtask in the clearing tasks can be obtained, the directed graph is constructed according to the association relationship, at least one clearing workflow is extracted from the directed graph, the workflow identifier is configured for each clearing workflow, the state of each clearing workflow is detected according to the workflow identifier, when the fact that the subtask in the clearing workflow is started is detected, the clearing workflow is determined to be the target workflow, the execution identifier is configured for the target workflow, the execution identifier is associated with the execution logs of all subtasks in the target workflow, and task scheduling is carried out on the target workflow according to the execution logs. By utilizing the method and the device, the clearing workflow can be orderly executed based on the incidence relation, the data processing efficiency in the clearing process is improved, the error rate is effectively reduced, and the resource waste is avoided.
Fig. 4 is a functional block diagram of a preferred embodiment of the clearing workflow executing apparatus of the present invention. The clearing workflow executing apparatus 11 includes a constructing unit 110, an extracting unit 111, a detecting unit 112, a determining unit 113, an associating unit 114, and a scheduling unit 115. A module/unit as referred to herein is a series of computer program segments stored in a memory that can be executed by a processor and that can perform a fixed function. In the present embodiment, the functions of the modules/units will be described in detail in the following embodiments.
The construction unit 110 obtains an association relationship of each subtask in the clearing task, and constructs a directed graph according to the association relationship.
For example: each subtask in the clearing task may include, but is not limited to: issuing tasks, downloading tasks, reconciliation tasks and the like.
In this embodiment, the constructing unit 110 constructs the directed graph according to the association relationship, including:
determining each subtask as a node;
determining the upstream and downstream relation between every two subtasks according to the incidence relation;
determining the upstream-downstream relationship between every two nodes according to the upstream-downstream relationship between every two subtasks;
and connecting each node according to the upstream and downstream relation between every two nodes to obtain the directed graph.
Please refer to fig. 2, which is an exemplary diagram of a directed graph according to the present invention. In the figure, each circle represents a node in the directed graph, each node represents a subtask, the start end of each arrow represents an upstream task, the end of each arrow represents a downstream task, each arrow represents an upstream-downstream relationship, and also represents an association relationship between nodes.
By constructing the directed graph, the execution sequence among the subtasks is clearer, repeated execution of the tasks caused by unclear incidence relation among the tasks is avoided, and further abnormal clearing data is avoided.
In this embodiment, the directed graph may be continuously updated according to the actual requirement of the clearing task, so as to implement the configurability of the directed graph.
The extraction unit 111 extracts at least one clearing workflow from the directed graph and configures a workflow identification for each clearing workflow.
In this embodiment, each clearing workflow may be abstracted based on actual clearing requirements.
For example: the clearing workflow can be extracted according to the requirement on the task dimension, so that when an error occurs in the clearing process, only the wrong task dimension needs to be corrected, and the problem that the clearing window period is short and the fault-tolerant time is short is solved.
In any extracted clearing workflow, different tasks have directional serial and parallel relations, so that the tasks are connected in series and parallel and coexist, the overall efficiency of the clearing tasks is improved, the pain point that the clearing window period is short and fault-tolerant time is not available is solved, the business data can be rapidly processed under the condition that hundreds of millions of quotations are broken out, the clearing work efficiency of a system is improved, and even the time consumption of the clearing work is reduced from hour level to minute level.
Specifically, at least one clearing workflow may be included in one clearing task, and one clearing workflow may include at least one subtask.
In this embodiment, the Workflow identification may be Workflow _ id.
Through the workflow identification, different clearing workflows can be effectively distinguished, and repeated execution of tasks is further avoided.
The detection unit 112 detects the status of each clearing workflow based on the workflow identification.
Specifically, each clearing workflow is located according to the workflow identification, and the status of each located clearing workflow is detected.
When detecting that a subtask in the clearing workflow is started, the determining unit 113 determines the clearing workflow as a target workflow and configures an execution identifier for the target workflow.
For example: and when the first task in the clearing workflow is detected to be started, determining that the start of the subtask in the clearing workflow is detected, and determining the clearing workflow as the target workflow.
In this embodiment, the execution flag may be run _ id.
The associating unit 114 associates the execution identifier with the execution log of all subtasks in the target workflow.
In this embodiment, a field of the execution identifier may be added to the execution log, and the obtained execution log may include:
task identification task _ id, execution identification run _ id and state trigger _ code.
Through the execution log, the strong association between the state and the execution identifier can be realized, so that the state of task execution is conveniently tracked in real time, the positioning of the execution abnormal node is assisted, and the abnormal reason is checked.
The scheduling unit 115 performs task scheduling on the target workflow according to the execution log.
In this embodiment, the scheduling unit 115 performs task scheduling on the target workflow according to the execution log, including:
for each subtask in the target workflow, acquiring all upstream tasks of the subtask;
detecting the execution state of each upstream task in all the upstream tasks according to the execution log;
when the execution state of each upstream task is the execution success state, acquiring the entry parameters of the subtasks from each upstream task, and executing the subtasks according to the entry parameters; or
When the execution state of the upstream task in all the upstream tasks is the execution failure state, the subtask is not executed; or alternatively
And when the execution state of an upstream task in all the upstream tasks is an executing state, waiting for the upstream task to continue executing, and after the execution of the upstream task is finished, continuously detecting the execution state of each upstream task in all the upstream tasks according to the execution log.
Please refer to fig. 3 (a) -3 (b), which are schematic diagrams illustrating task scheduling for a target workflow according to the present invention.
Fig. 3 (a) illustrates scheduling of a simple workflow, and each subtask is executed serially. Taking task B as an example, before triggering execution of task B, it is detected whether task a of the upstream task is successfully executed. If the execution of the A is successful, the required access parameter of the B is transmitted to the B, and the B: if the execution of the A fails, the execution of the B is not triggered.
Fig. 3 (b) is a complex workflow scheduling, in which serial execution and parallel execution coexist between each subtask. Taking task B as an example, before triggering execution of task B, it is detected whether task a and task D of the upstream task are successfully executed. Only when A, D are successfully executed, the required input parameter of B is transmitted to B, and B is triggered to be executed; if A, D has any one of them failed to execute (including failed execution or executing), then execution B is not triggered, and if D is detected to be in the executing state, then the state of a is detected after D is successfully executed.
The task scheduling mode in this embodiment implements response between different tasks through the association relationship, so that the execution of the tasks has a definite priority, and resource waste during resource allocation is avoided.
In this embodiment, when task scheduling is performed on the target workflow according to the execution log, and when an error occurs in a subtask in the target workflow, the execution log of each subtask in the target workflow is obtained according to the execution identifier;
positioning and executing abnormal subtasks in the target workflow according to the execution log of each subtask, and determining the executed abnormal subtasks as fault points;
acquiring a pre-constructed fault-reason list;
inquiring in the fault-reason list according to the fault point to obtain a fault reason;
and sending the fault point, the fault reason and the execution log of the fault point to specified terminal equipment, and sending a fault prompt.
The fault-cause list may be constructed according to historical execution data or may be constructed according to expert experience, and the present invention is not limited thereto.
The designated terminal device may be a terminal device of a related worker, such as a person responsible for a clearing task.
According to the embodiment, the fault point, the fault reason and the corresponding execution log are sent to the relevant equipment, and the fault prompt is sent in time, so that the fault location and the fault elimination can be assisted more quickly and accurately, the exception handling efficiency is improved, and the loss caused by the error of clearing data is avoided.
In this embodiment, when there is an independent task independently executed in the target workflow, the last execution state of the independent task is covered with the current execution state of the independent task.
The independent task can be a task only paying attention to the current state, so that the independent task can be executed in an overlaying mode without using an execution identifier for state tracking and positioning.
In this embodiment, at least one task executor is deployed in a distributed manner, where the at least one task executor is distributed on at least one heterogeneous node machine;
executing each subtask in the clearing task using the at least one task executor;
wherein each process is separated using a Remote Procedure Call (RPC) mechanism when each subtask in the clearing task is executed.
Distributed deployment supports the configurability of task scheduling, e.g., data can be assembled according to business dimensions to support the implementation of complex business.
In the embodiment, the task execution center is separated from the scheduling by the distributed deployment of the task executor, and meanwhile, the communication between processes is executed by using a remote process calling mechanism, so that the remote method is called as a local method.
In this embodiment, a trigger policy is configured for each subtask in the clearing task;
the trigger strategies comprise Cron trigger, fixed interval trigger, fixed delay trigger, event trigger, manual trigger and chain trigger.
Specifically, the Cron trigger is: the code layer realizes the triggering execution of the timing task by using a cron expression;
the fixed interval triggering and the fixed time delay triggering are as follows: triggering task execution at each time node according to the configured interval time length;
the event trigger is as follows: tasks depend on the completion of an event, wherein the associated event and the current task do not necessarily belong to the same clearing workflow;
the manual triggering is as follows: the task cannot be actively executed and needs to be manually triggered;
the chain triggering is as follows: in the same task flow, the task depends on the completion condition of the upstream task, the upstream task is correctly executed, and the downstream task is automatically triggered.
The embodiment adopts a multi-trigger strategy, realizes the automatic execution of the whole process, realizes the maximization of the processing efficiency of each task node, and completes the task in the shortest time.
According to the technical scheme, the association relation of each subtask in the clearing tasks can be obtained, the directed graph is constructed according to the association relation, at least one clearing workflow is extracted from the directed graph, the workflow identifier is configured for each clearing workflow, the state of each clearing workflow is detected according to the workflow identifier, when the situation that the subtask in the clearing workflow is started is detected, the clearing workflow is determined to be the target workflow, the execution identifier is configured for the target workflow, the execution identifier is associated with the execution logs of all subtasks in the target workflow, and the target workflow is subjected to task scheduling according to the execution logs. By utilizing the method and the device, the clearing workflow can be orderly executed based on the incidence relation, the data processing efficiency in the clearing process is improved, the error rate is effectively reduced, and the resource waste is avoided.
Fig. 5 is a schematic structural diagram of a computer device according to a preferred embodiment of the present invention for implementing the clearing workflow execution method.
The computer device 1 may comprise a memory 12, a processor 13 and a bus, and may further comprise a computer program, such as a clearing workflow execution program, stored in the memory 12 and executable on the processor 13.
It will be understood by those skilled in the art that the schematic diagram is merely an example of the computer device 1, and does not constitute a limitation to the computer device 1, the computer device 1 may have a bus-type structure or a star-shaped structure, the computer device 1 may further include more or less other hardware or software than those shown, or different component arrangements, for example, the computer device 1 may further include an input and output device, a network access device, etc.
It should be noted that the computer device 1 is only an example, and other electronic products that are currently available or may come into existence in the future, such as electronic products that can be adapted to the present invention, should also be included in the scope of the present invention, and are included herein by reference.
The memory 12 includes at least one type of readable storage medium, which includes flash memory, removable hard disks, multimedia cards, card-type memory (e.g., SD or DX memory, etc.), magnetic memory, magnetic disks, optical disks, etc. The memory 12 may in some embodiments be an internal storage unit of the computer device 1, e.g. a removable hard disk of the computer device 1. The memory 12 may also be an external storage device of the computer device 1 in other embodiments, such as a plug-in removable hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), etc. provided on the computer device 1. Further, the memory 12 may also include both an internal storage unit and an external storage device of the computer device 1. The memory 12 can be used not only for storing application software installed in the computer device 1 and various types of data such as a code of a clearing workflow execution program, etc., but also for temporarily storing data that has been output or will be output.
The processor 13 may be composed of an integrated circuit in some embodiments, for example, a single packaged integrated circuit, or may be composed of a plurality of integrated circuits packaged with the same or different functions, including one or more Central Processing Units (CPUs), microprocessors, digital Processing chips, graphics processors, and combinations of various control chips. The processor 13 is a Control Unit (Control Unit) of the computer device 1, connects various components of the entire computer device 1 by using various interfaces and lines, and executes various functions and processes data of the computer device 1 by running or executing programs or modules (e.g., executing a clearing workflow execution program, etc.) stored in the memory 12 and calling data stored in the memory 12.
The processor 13 executes the operating system of the computer device 1 and various installed application programs. The processor 13 executes the application program to implement the steps in the various clearing workflow execution method embodiments described above, such as the steps shown in FIG. 1.
Illustratively, the computer program may be divided into one or more modules/units, which are stored in the memory 12 and executed by the processor 13 to accomplish the present invention. The one or more modules/units may be a series of computer readable instruction segments capable of performing certain functions, which are used to describe the execution of the computer program in the computer device 1. For example, the computer program may be divided into a construction unit 110, an extraction unit 111, a detection unit 112, a determination unit 113, an association unit 114, a scheduling unit 115.
The integrated unit implemented in the form of a software functional module may be stored in a computer-readable storage medium. The software functional module is stored in a storage medium and includes several instructions to enable a computer device (which may be a personal computer, a computer device, or a network device) or a processor (processor) to execute parts of the clearing workflow execution method according to the embodiments of the present invention.
The modules/units integrated by the computer device 1 may be stored in a computer-readable storage medium if they are implemented in the form of software functional units and sold or used as separate products. Based on such understanding, all or part of the flow of the method according to the embodiments of the present invention may be implemented by a computer program, which may be stored in a computer-readable storage medium, and when the computer program is executed by a processor, the steps of the method embodiments described above may be implemented.
Wherein the computer program comprises computer program code, which may be in the form of source code, object code, an executable file or some intermediate form, etc. The computer-readable medium may include: any entity or device capable of carrying the computer program code, recording medium, U-disk, removable hard disk, magnetic disk, optical disk, computer Memory, read-Only Memory (ROM), random-access Memory, or the like.
Further, the computer-readable storage medium may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required for at least one function, and the like; the storage data area may store data created according to the use of the blockchain node, and the like.
The block chain is a novel application mode of computer technologies such as distributed data storage, point-to-point transmission, a consensus mechanism, an encryption algorithm and the like. A block chain (Blockchain), which is essentially a decentralized database, is a series of data blocks associated by using a cryptographic method, and each data block contains information of a batch of network transactions, so as to verify the validity (anti-counterfeiting) of the information and generate a next block. The blockchain may include a blockchain underlying platform, a platform product service layer, an application service layer, and the like.
The bus may be a Peripheral Component Interconnect (PCI) bus, an Extended Industry Standard Architecture (EISA) bus, or the like. The bus may be divided into an address bus, a data bus, a control bus, etc. For ease of illustration, only one line is shown in FIG. 5, but it is not intended that there be only one bus or one type of bus. The bus is arranged to enable connection communication between the memory 12 and at least one processor 13 or the like.
Although not shown, the computer device 1 may further include a power supply (such as a battery) for supplying power to each component, and preferably, the power supply may be logically connected to the at least one processor 13 through a power management device, so that functions of charge management, discharge management, power consumption management and the like are realized through the power management device. The power supply may also include any component of one or more dc or ac power sources, recharging devices, power failure detection circuitry, power converters or inverters, power status indicators, and the like. The computer device 1 may further include various sensors, a bluetooth module, a Wi-Fi module, and the like, which are not described herein again.
Further, the computer device 1 may further include a network interface, and optionally, the network interface may include a wired interface and/or a wireless interface (such as a WI-FI interface, a bluetooth interface, etc.), which are generally used for establishing a communication connection between the computer device 1 and other computer devices.
Optionally, the computer device 1 may further comprise a user interface, which may be a Display (Display), an input unit, such as a Keyboard (Keyboard), and optionally a standard wired interface, a wireless interface. Alternatively, in some embodiments, the display may be an LED display, a liquid crystal display, a touch-sensitive liquid crystal display, an OLED (Organic Light-Emitting Diode) touch device, or the like. The display, which may also be referred to as a display screen or display unit, is suitable for displaying information processed in the computer device 1 and for displaying a visualized user interface.
It is to be understood that the described embodiments are for purposes of illustration only and that the scope of the appended claims is not limited to such structures.
Fig. 5 shows only a computer device 1 with components 12-13, and it will be understood by a person skilled in the art that the structure shown in fig. 5 does not constitute a limitation of the computer device 1, and may comprise fewer or more components than shown, or a combination of certain components, or a different arrangement of components.
In connection with fig. 1, the memory 12 in the computer device 1 stores a plurality of instructions to implement a clearing workflow execution method, and the processor 13 can execute the plurality of instructions to implement:
acquiring the incidence relation of each subtask in the clearing task, and constructing a directed graph according to the incidence relation;
extracting at least one clearing workflow from the directed graph and configuring a workflow identification for each clearing workflow;
detecting the status of each clearing workflow according to the workflow identification;
when detecting that a subtask in a clearing workflow is started, determining the clearing workflow as a target workflow, and configuring an execution identifier for the target workflow;
associating the execution identifier with the execution logs of all subtasks in the target workflow;
and performing task scheduling on the target workflow according to the execution log.
Specifically, the processor 13 may refer to the description of the relevant steps in the embodiment corresponding to fig. 1 for a specific implementation method of the instruction, which is not described herein again.
It should be noted that all the data involved in the present application are legally acquired.
In the embodiments provided in the present invention, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the modules is only one logical functional division, and other divisions may be realized in practice.
The invention is operational with numerous general purpose or special purpose computing system environments or configurations. For example: personal computers, server computers, hand-held or portable devices, tablet-type devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like. The invention may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The invention may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.
The modules described as separate parts may or may not be physically separate, and parts displayed as modules may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment.
In addition, functional modules in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, or in a form of hardware plus a software functional module.
It will be evident to those skilled in the art that the invention is not limited to the details of the foregoing illustrative embodiments, and that the present invention may be embodied in other specific forms without departing from the spirit or essential attributes thereof.
The present embodiments are therefore to be considered in all respects as illustrative and not restrictive, the scope of the invention being indicated by the appended claims rather than by the foregoing description, and all changes which come within the meaning and range of equivalency of the claims are therefore intended to be embraced therein. Any reference signs in the claims shall not be construed as limiting the claim concerned.
Furthermore, it is obvious that the word "comprising" does not exclude other elements or steps, and the singular does not exclude the plural. A plurality of units or means recited in the present invention may also be implemented by one unit or means through software or hardware. The terms first, second, etc. are used to denote names, but not any particular order.
Finally, it should be noted that the above embodiments are only for illustrating the technical solutions of the present invention and not for limiting, and although the present invention is described in detail with reference to the preferred embodiments, it should be understood by those skilled in the art that modifications or equivalent substitutions may be made on the technical solutions of the present invention without departing from the spirit and scope of the technical solutions of the present invention.

Claims (9)

1. A clearing workflow execution method, wherein the clearing workflow execution method comprises:
acquiring the incidence relation of each subtask in the clearing task, and constructing a directed graph according to the incidence relation; wherein, the constructing the directed graph according to the association relationship comprises: determining each subtask as a node; determining the upstream and downstream relation between every two subtasks according to the incidence relation; determining the upstream and downstream relation between every two nodes according to the upstream and downstream relation between every two subtasks; connecting each node according to the upstream and downstream relation between every two nodes to obtain the directed graph;
extracting at least one clearing workflow from the directed graph and configuring a workflow identification for each clearing workflow; wherein, in any extracted clearing workflow, different tasks have directional serial and parallel relations;
detecting the status of each clearing workflow according to the workflow identification;
when detecting that a subtask in a clearing workflow is started, determining the clearing workflow as a target workflow, and configuring an execution identifier for the target workflow;
associating the execution identifier with the execution logs of all subtasks in the target workflow;
and performing task scheduling on the target workflow according to the execution log.
2. The clearing workflow execution method of claim 1 wherein said task scheduling said target workflow according to said execution log comprises:
for each subtask in the target workflow, acquiring all upstream tasks of the subtask;
detecting the execution state of each upstream task in all the upstream tasks according to the execution log;
when the execution state of each upstream task is the execution success state, acquiring the entry parameters of the subtasks from each upstream task, and executing the subtasks according to the entry parameters; or
When the execution state of the upstream task in all the upstream tasks is the execution failure state, the subtask is not executed; or
And when the execution state of an upstream task in all the upstream tasks is an executing state, waiting for the upstream task to be continuously executed, and after the execution of the upstream task is finished, continuously detecting the execution state of each upstream task in all the upstream tasks according to the execution log.
3. The clearing workflow execution method of claim 1, wherein in task scheduling the target workflow according to the execution log, the method further comprises:
when the sub-tasks in the target workflow report errors, acquiring an execution log of each sub-task in the target workflow according to the execution identifier;
positioning and executing abnormal subtasks in the target workflow according to the execution log of each subtask, and determining the executed abnormal subtasks as fault points;
acquiring a pre-constructed fault-reason list;
inquiring in the fault-reason list according to the fault point to obtain a fault reason;
and sending the fault point, the fault reason and the execution log of the fault point to specified terminal equipment, and sending a fault prompt.
4. The clearing workflow execution method of claim 1, said method further comprising:
and when the target workflow has an independent task which is independently executed, covering the last execution state of the independent task by using the current execution state of the independent task.
5. The clearing workflow execution method of claim 1 wherein said method further comprises:
at least one task executor is deployed in a distributed mode, wherein the at least one task executor is distributed on at least one heterogeneous node machine;
executing each subtask in the clearing task using the at least one task executor;
wherein each process is separated using a remote procedure call mechanism while each subtask in the clearing task is executed.
6. The clearing workflow execution method of claim 1, said method further comprising:
configuring a trigger strategy for each subtask in the clearing task;
the trigger strategies comprise Cron trigger, fixed interval trigger, fixed delay trigger, event trigger, manual trigger and chain trigger.
7. A clearing workflow execution apparatus, wherein the clearing workflow execution apparatus comprises:
the construction unit is used for acquiring the incidence relation of each subtask in the clearing task and constructing a directed graph according to the incidence relation; wherein the constructing the directed graph according to the association relationship comprises: determining each subtask as a node; determining the upstream and downstream relation between every two subtasks according to the incidence relation; determining the upstream-downstream relationship between every two nodes according to the upstream-downstream relationship between every two subtasks; connecting each node according to the upstream-downstream relation between every two nodes to obtain the directed graph;
the extraction unit is used for extracting at least one clearing workflow from the directed graph and configuring a workflow identifier for each clearing workflow; wherein, in any extracted clearing workflow, different tasks have directional serial and parallel relations;
a detection unit for detecting the status of each clearing workflow according to the workflow identification;
the system comprises a determining unit, a calculating unit and a processing unit, wherein the determining unit is used for determining a clearing workflow as a target workflow and configuring an execution identifier for the target workflow when detecting that a subtask in the clearing workflow is started;
the association unit is used for associating the execution identifier with the execution logs of all the subtasks in the target workflow;
and the scheduling unit is used for performing task scheduling on the target workflow according to the execution log.
8. A computer device, characterized in that the computer device comprises:
a memory storing at least one instruction; and
a processor executing instructions stored in the memory to implement the clearing workflow execution method of any of claims 1 to 6.
9. A computer-readable storage medium characterized by: the computer-readable storage medium has stored therein at least one instruction that is executable by a processor in a computer device to implement the clearing workflow execution method of any one of claims 1 to 6.
CN202211091773.6A 2022-09-07 2022-09-07 Clearing workflow execution method, device, equipment and medium Active CN115147031B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202211091773.6A CN115147031B (en) 2022-09-07 2022-09-07 Clearing workflow execution method, device, equipment and medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202211091773.6A CN115147031B (en) 2022-09-07 2022-09-07 Clearing workflow execution method, device, equipment and medium

Publications (2)

Publication Number Publication Date
CN115147031A CN115147031A (en) 2022-10-04
CN115147031B true CN115147031B (en) 2022-12-06

Family

ID=83415468

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202211091773.6A Active CN115147031B (en) 2022-09-07 2022-09-07 Clearing workflow execution method, device, equipment and medium

Country Status (1)

Country Link
CN (1) CN115147031B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115617403A (en) * 2022-12-19 2023-01-17 深圳华锐分布式技术股份有限公司 Clearing task execution method, device, equipment and medium based on task segmentation

Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101216911A (en) * 2008-01-04 2008-07-09 清华大学 Dynamic workflow model subdivision method supporting distributed execution
CN107577586A (en) * 2016-07-04 2018-01-12 阿里巴巴集团控股有限公司 A kind of method and apparatus for being used to determine that business performs link in distributed system
CN109086986A (en) * 2018-07-20 2018-12-25 中国邮政储蓄银行股份有限公司 job scheduling method and device
EP3493124A1 (en) * 2017-11-30 2019-06-05 Siemens Aktiengesellschaft Method for automatic consistency checking after manual intervention in bpmn based workflow execution
CN111897622A (en) * 2020-06-10 2020-11-06 中国科学院计算机网络信息中心 High-throughput computing method and system based on container technology
CN112817720A (en) * 2021-01-30 2021-05-18 北京奇保信安科技有限公司 Visual workflow scheduling method and device and electronic equipment
CN114997706A (en) * 2022-06-24 2022-09-02 平安普惠企业管理有限公司 Workflow-based business processing method, device, equipment and storage medium

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN113886443A (en) * 2021-09-30 2022-01-04 中国平安人寿保险股份有限公司 Log processing method and device, computer equipment and storage medium
CN114881616A (en) * 2022-06-17 2022-08-09 平安消费金融有限公司 Business process execution method and device, electronic equipment and storage medium

Patent Citations (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101216911A (en) * 2008-01-04 2008-07-09 清华大学 Dynamic workflow model subdivision method supporting distributed execution
CN107577586A (en) * 2016-07-04 2018-01-12 阿里巴巴集团控股有限公司 A kind of method and apparatus for being used to determine that business performs link in distributed system
EP3493124A1 (en) * 2017-11-30 2019-06-05 Siemens Aktiengesellschaft Method for automatic consistency checking after manual intervention in bpmn based workflow execution
CN109086986A (en) * 2018-07-20 2018-12-25 中国邮政储蓄银行股份有限公司 job scheduling method and device
CN111897622A (en) * 2020-06-10 2020-11-06 中国科学院计算机网络信息中心 High-throughput computing method and system based on container technology
CN112817720A (en) * 2021-01-30 2021-05-18 北京奇保信安科技有限公司 Visual workflow scheduling method and device and electronic equipment
CN114997706A (en) * 2022-06-24 2022-09-02 平安普惠企业管理有限公司 Workflow-based business processing method, device, equipment and storage medium

Also Published As

Publication number Publication date
CN115147031A (en) 2022-10-04

Similar Documents

Publication Publication Date Title
CN112698971A (en) Rule engine based parameter conversion method, device, equipment and medium
CN112559535B (en) Multithreading-based asynchronous task processing method, device, equipment and medium
CN111400011B (en) Real-time task scheduling method, system, equipment and readable storage medium
US8914798B2 (en) Production control for service level agreements
CN115936886B (en) Failure detection method, device, equipment and medium for heterogeneous securities trading system
CN115147031B (en) Clearing workflow execution method, device, equipment and medium
CN112256783A (en) Data export method and device, electronic equipment and storage medium
CN115081538A (en) Customer relationship identification method, device, equipment and medium based on machine learning
CN114519084A (en) Block chain-based medical data inspection method, device, equipment and medium
CN114116400A (en) Application exception handling method, device, equipment and medium based on log printing
CN114356530A (en) Task scheduling method and device, electronic equipment and storage medium
CN114841710B (en) Method, device, equipment and medium for removing order when transaction system fails
CN114399397A (en) Renewal tracking method, device, equipment and medium
CN114881313A (en) Behavior prediction method and device based on artificial intelligence and related equipment
CN114185502A (en) Log printing method, device, equipment and medium based on production line environment
CN114372892A (en) Payment data monitoring method, device, equipment and medium
CN114385453A (en) Database cluster exception handling method, device, equipment and medium
CN114510400A (en) Task execution method and device, electronic equipment and storage medium
US20110099436A1 (en) Expedited transaction failure handling by leveraging a reliable message transport protocol to assist detection of discarded processing
CN113687834B (en) Distributed system node deployment method, device, equipment and medium
CN115964307B (en) Automatic test method, device, equipment and medium for transaction data
CN114637564B (en) Data visualization method and device, electronic equipment and storage medium
CN112527842B (en) System flow pushing method and device, electronic equipment and computer readable storage medium
CN116414699B (en) Operation and maintenance testing method, device, equipment and medium
CN112905470A (en) Interface calling method and device, computer equipment and 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