CN113778572A - Method for automatically connecting multiple CLI programs into task flow - Google Patents

Method for automatically connecting multiple CLI programs into task flow Download PDF

Info

Publication number
CN113778572A
CN113778572A CN202111142620.5A CN202111142620A CN113778572A CN 113778572 A CN113778572 A CN 113778572A CN 202111142620 A CN202111142620 A CN 202111142620A CN 113778572 A CN113778572 A CN 113778572A
Authority
CN
China
Prior art keywords
script
task
subprocess
main process
connection
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.)
Granted
Application number
CN202111142620.5A
Other languages
Chinese (zh)
Other versions
CN113778572B (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.)
Guangzhou 4399 Information Technology Co ltd
Original Assignee
Guangzhou 4399 Information 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 Guangzhou 4399 Information Technology Co ltd filed Critical Guangzhou 4399 Information Technology Co ltd
Priority to CN202111142620.5A priority Critical patent/CN113778572B/en
Publication of CN113778572A publication Critical patent/CN113778572A/en
Application granted granted Critical
Publication of CN113778572B publication Critical patent/CN113778572B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44Arrangements for executing specific programs
    • G06F9/448Execution paradigms, e.g. implementations of programming paradigms
    • G06F9/4482Procedural

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Stored Programmes (AREA)

Abstract

The invention provides a method for automatically connecting a plurality of CLI programs into a task flow, which comprises the following steps: constructing a general task database and constructing a connection script pool; customizing a business process node diagram according to the actual business process requirements of the project; each node binds a corresponding general task; and sequentially executing the general tasks of all the nodes in a connection script series connection mode. The invention provides a method for automatically linking a plurality of CLI programs into a task flow, which can completely multiplex universal tasks formed in a service flow and serially connect all the universal tasks into a complete service flow through a linking script, so that the service flow automation can be realized at lower cost, and the production efficiency is greatly improved.

Description

Method for automatically connecting multiple CLI programs into task flow
Technical Field
The invention belongs to the technical field of task automation, and particularly relates to a method for automatically linking a plurality of CLI programs into a task flow.
Background
Even if the technology stacks are the same, each item has some difference in the execution standard, and the general business flow is basically consistent. In the prior art, because the execution standards of all projects are different, each project needs to completely re-customize the business automation flow, and the problems of low reusability of the business flow and high implementation cost of the business automation flow of the project are solved.
Disclosure of Invention
Aiming at the defects in the prior art, the invention provides a method for automatically connecting a plurality of CLI programs into a task flow, which can effectively solve the problems.
The technical scheme adopted by the invention is as follows:
the invention provides a method for automatically connecting a plurality of CLI programs into a task flow, which comprises the following steps:
step 1, constructing a general task database; the general task database is used for storing a plurality of general tasks; each universal task is provided with a universal task ID, a task parameter receiving interface and a task parameter output interface;
step 2, constructing a connection script pool; the joining script pool is used for storing a plurality of joining scripts; each of the connection scripts corresponds to a general task ID and an execution sequence, wherein the execution sequence is as follows: before the corresponding general task is executed, executing the connection script, namely the preposed connection script; or after the corresponding general task is executed, executing the connection script, namely the post-connection script; each linking script is provided with a script parameter receiving interface and a script parameter output interface;
step 3, customizing a business process node diagram according to the actual business process requirements of the project; the business process node graph comprises a plurality of nodes; each node binds a corresponding general task; the general tasks are the general tasks inquired from the general task database;
step 4, making i equal to 1;
step 5, the main process locates the ith node in the service process node diagramiThereby obtaining the ith nodeiBound generic taski
Step 6, the main process searches the connection script pool and judges whether the general task exists or notiCorrespond toIf any, will be linked with the generic taskiThe corresponding preposition join script is expressed as a preposition join script BSiExecuting step 7-step 9; otherwise, executing step 10;
step 7, the main process determines whether a forward connection script BS existsiIf so, acquiring the first transfer parameter, transferring the first transfer parameter to a first subprocess, and then informing the first subprocess to execute a preposed connection script BSi(ii) a If not, directly informing the first subprocess to execute the prepositive connection script BSi
Step 8, the first subprocess receives and executes the preposed connection script BSiAfter the notification message, firstly, whether a first transmission parameter from the main process is received is judged, if not, the preposed connection script BS is directly executedi(ii) a If so, the first transfer parameter is transferred to the prepositive connection script BSiThen executing the prepositive connection script BSi
The first subprocess executes the preposed connection script BSiAfter finishing, sending an executed notification message to the main process;
step 9, after receiving the execution completion notification message of the first subprocess, the main process captures a standard output stream of the first subprocess and judges whether the first subprocess has a second transmission parameter which needs to be transmitted downwards; if yes, the main process captures the second transmission parameter and executes the step 10; otherwise, directly executing step 10;
step 10, the main process determines whether there is a second transmission parameter transmitted to the second subprocess, if yes, the second transmission parameter is transmitted to the second subprocess, and then the second subprocess is informed to execute the general taski(ii) a If not, directly informing the second sub-process to execute the general taski
Step 11, the second sub-process receives and executes the general taskiAfter the notification message is received, it is first determined whether the second delivery parameter is received from the host process, and if not,then the generic task is executed directlyi(ii) a If so, passing the second passing parameter to the general taskiThen execute the general taski
The second sub-process executes the general taskiAfter finishing, sending an executed notification message to the main process;
step 12, after receiving the execution completion notification message of the second subprocess, the main process captures a standard output stream of the second subprocess, and judges whether the second subprocess has a third transmission parameter which needs to be transmitted downwards; if yes, the main process captures the third transfer parameter and executes step 13; otherwise, directly executing step 13;
step 13, the main process searches the connection script pool and judges whether the general task exists or notiCorresponding post-join scripts, if any, will be associated with the generic taskiThe corresponding post-join script is expressed AS a post-join script ASiExecuting step 14-step 16; otherwise, go to step 17;
step 14, the main process determines whether a backward connection script AS existsiIf the third transmission parameter exists, the third transmission parameter is obtained, the third transmission parameter is transmitted to the third subprocess, and then the third subprocess is informed to execute a post-join script ASi(ii) a If not, directly informing the third subprocess to execute the post-join script ASi
Step 15, the third subprocess receives and executes the post-connection script ASiAfter the notification message, firstly, judging whether a third transmission parameter from the main process is received, if not, directly executing the post-join script ASi(ii) a If yes, the third transfer parameter is transferred to the back connection script ASiThen executing the post-connection script ASi
The third sub-process executes the post-join script ASiAfter finishing, sending an executed notification message to the main process;
step 16, after receiving the execution completion notification message of the third subprocess, the main process captures a standard output stream of the third subprocess, and judges whether the third subprocess has a fourth transmission parameter which needs to be transmitted downwards; if yes, the main process captures the fourth transmission parameter, assigns the fourth transmission parameter to the first transmission parameter, and executes the step 17; otherwise, directly executing step 17;
step 17, judging the ith nodeiWhether the node is the last node in the service process node diagram or not, if so, completing the process of automatically connecting a plurality of CLI programs into a task process, and ending the process; if not, let i become i +1, return to step 5.
Preferably, the generic task is a computer application or executable script that is allowed to execute in the command line interface CLI.
The method for automatically connecting a plurality of CLI programs into a task flow, provided by the invention, has the following advantages:
the invention provides a method for automatically linking a plurality of CLI programs into a task flow, which can completely multiplex universal tasks formed in a service flow and serially connect all the universal tasks into a complete service flow through a linking script, so that the service flow automation can be realized at lower cost, and the production efficiency is greatly improved.
Drawings
Fig. 1 is a schematic flow chart of a method for automatically linking multiple CLI programs into a task flow according to the present invention.
Detailed Description
In order to make the technical problems, technical solutions and advantageous effects solved by the present invention more clearly apparent, the present invention is further described in detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention.
The invention provides a method for automatically linking a plurality of CLI programs into a task flow, which can completely multiplex universal tasks formed in a service flow and serially connect all the universal tasks into a complete service flow through a linking script, so that the service flow automation can be realized at lower cost, and the production efficiency is greatly improved.
The invention provides a method for automatically connecting a plurality of CLI programs into a task flow, which adjusts the difference of each link on different service lines to be consistent through a connecting script so as to meet the requirement of an automatic execution standard. The join script functions as a hook, and can be executed one or more times before/after the running of each general task.
In the task execution flow, each general task is executed in a sub-process mode. And before and after each general task is run, the main process searches whether the join script needing to be executed exists in the join script pool. If yes, executing, otherwise, skipping to the next general task in the task flow, until the execution of the whole task flow is finished.
Referring to fig. 1, the present invention provides a method for automatically linking multiple CLI programs into a task flow, comprising the following steps:
step 1, constructing a general task database; the general task database is used for storing a plurality of general tasks; each universal task is provided with a universal task ID, a task parameter receiving interface and a task parameter output interface;
wherein, the common task refers to a common operation flow which is needed to be experienced in the business flow. Taking a mobile phone application as an example, the general process for developing the mobile phone application may include (without limitation): setting application information, compiling, packaging, program signing, publishing and the like. Each step may then be a single general task.
The generic task does not need to consider special cases between each project, such as: the application information is a text format or other document format, how package compilation parameters between different items are set, and the like.
In the present invention, the generic tasks are not limited to specific computer programming language limitations, either computer applications or executable scripts that are allowed to execute in a Command Line Interface (CLI).
The generic task may pass parameters to the next task (which may be a generic task or an engagement script). The parameters are passed in a manner that uses the form of stdout (standard output stream).
Specifically, the main process intercepts specific content (i.e., transfer parameters) that needs to be transferred by capturing the standard output stream content of the sub-process. The interception may be performed by a digit interception (for example, intercepting the last 100 digits of the content), or may be performed by a format rule (for example, "@ next path ═ dir \ \ child dir, @ next name ═ game"). After the current sub-process is finished, when the main process schedules and executes the next task, the main process transmits the next task to the next sub-process in the form of command parameters, for example: "run (nextTask — path ═ dir \\ child-name ═ game)".
Receiving the general task parameters: before the general task is executed, the value of the previous subprocess is obtained to obtain the parameters transmitted by the last task, so that the specific logic processing of the general task is carried out.
Step 2, constructing a connection script pool; the joining script pool is used for storing a plurality of joining scripts; each of the connection scripts corresponds to a general task ID and an execution sequence, wherein the execution sequence is as follows: before the corresponding general task is executed, executing the connection script, namely the preposed connection script; or after the corresponding general task is executed, executing the connection script, namely the post-connection script; each linking script is provided with a script parameter receiving interface and a script parameter output interface;
the join script is used for processing the automation process differences of each item, such as setting application information, setting item compiling parameters and the like listed in the previous step. Even additional operations such as backing up results after packaging is completed can be processed through the join script. The following implementation details of the join script technology are as follows:
the join scripts are stored in the unified join script pool, so that after each task is executed, whether the next join script needs to be executed or not needs to be searched from the join script pool. In order to realize automatic association with the universal task node, the connection script needs to follow a certain naming specification. Its naming rule is "task name __ before/after- -execution order. script extension". Taking the compiling task (build) as an example, the pre-join script can be named as: build __ before- -0.py, build __ before- -1.sh, etc., the postfix script can be named: build __ after-0. py, build __ after-1. bat, etc.
The parameter transmission and reception rules of the join script are the same as the general task processing rules.
Step 3, customizing a business process node diagram according to the actual business process requirements of the project; the business process node graph comprises a plurality of nodes; each node binds a corresponding general task; the general tasks are the general tasks inquired from the general task database;
step 4, making i equal to 1;
step 5, the main process locates the ith node in the service process node diagramiThereby obtaining the ith nodeiBound generic taski
Step 6, the main process searches the connection script pool and judges whether the general task exists or notiCorresponding prepositive connection script, if any, will be connected with the general taskiThe corresponding preposition join script is expressed as a preposition join script BSiExecuting step 7-step 9; otherwise, executing step 10;
step 7, the main process determines whether a forward connection script BS existsiIf so, acquiring the first transfer parameter, transferring the first transfer parameter to a first subprocess, and then informing the first subprocess to execute a preposed connection script BSi(ii) a If not, directly informing the first subprocess to execute the prepositive connection script BSi
Step 8, the first subprocess receives and executes the preposed connection script BSiAfter the notification message, firstly, whether a first transmission parameter from the main process is received is judged, if not, the preposed connection script BS is directly executedi(ii) a If so, the first transfer parameter is transferred to the prepositive connection script BSiThen executing the prepositive connection script BSi
The first subprocess executes the preposed connection script BSiAfter finishing, sending an executed notification message to the main process;
step 9, after receiving the execution completion notification message of the first subprocess, the main process captures a standard output stream of the first subprocess and judges whether the first subprocess has a second transmission parameter which needs to be transmitted downwards; if yes, the main process captures the second transmission parameter and executes the step 10; otherwise, directly executing step 10;
step 10, the main process determines whether there is a second transmission parameter transmitted to the second subprocess, if yes, the second transmission parameter is transmitted to the second subprocess, and then the second subprocess is informed to execute the general taski(ii) a If not, directly informing the second sub-process to execute the general taski
Step 11, the second sub-process receives and executes the general taskiAfter the notification message, firstly, judging whether a second transmission parameter from the main process is received or not, if not, directly executing the general taski(ii) a If so, passing the second passing parameter to the general taskiThen execute the general taski
The second sub-process executes the general taskiAfter finishing, sending an executed notification message to the main process;
step 12, after receiving the execution completion notification message of the second subprocess, the main process captures a standard output stream of the second subprocess, and judges whether the second subprocess has a third transmission parameter which needs to be transmitted downwards; if yes, the main process captures the third transfer parameter and executes step 13; otherwise, directly executing step 13;
step 13, the main process searches the connection script pool and judges whether the general task exists or notiCorresponding post-join scripts, if any, will be associated with the generic taskiThe corresponding post-join script is expressed AS a post-join script ASiExecuting step 14-step 16; otherwise, go to step 17;
step 14, the main process determines whether a backward connection script AS existsiA third transfer parameter of the transfer ifIf yes, the third transfer parameter is obtained and transferred to the third subprocess, and then the third subprocess is informed to execute a post-join script ASi(ii) a If not, directly informing the third subprocess to execute the post-join script ASi
Step 15, the third subprocess receives and executes the post-connection script ASiAfter the notification message, firstly, judging whether a third transmission parameter from the main process is received, if not, directly executing the post-join script ASi(ii) a If yes, the third transfer parameter is transferred to the back connection script ASiThen executing the post-connection script ASi
The third sub-process executes the post-join script ASiAfter finishing, sending an executed notification message to the main process;
step 16, after receiving the execution completion notification message of the third subprocess, the main process captures a standard output stream of the third subprocess, and judges whether the third subprocess has a fourth transmission parameter which needs to be transmitted downwards; if yes, the main process captures the fourth transmission parameter, assigns the fourth transmission parameter to the first transmission parameter, and executes the step 17; otherwise, directly executing step 17;
step 17, judging the ith nodeiWhether the node is the last node in the service process node diagram or not, if so, completing the process of automatically connecting a plurality of CLI programs into a task process, and ending the process; if not, let i become i +1, return to step 5.
The method for automatically connecting a plurality of CLI programs into a task flow, provided by the invention, has the following advantages:
the invention provides a method for automatically linking a plurality of CLI programs into a task flow, which can completely multiplex universal tasks formed in a service flow and serially connect all the universal tasks into a complete service flow through a linking script, so that the service flow automation can be realized at lower cost, and the production efficiency is greatly improved.
The foregoing is only a preferred embodiment of the present invention, and it should be noted that, for those skilled in the art, various modifications and improvements can be made without departing from the principle of the present invention, and such modifications and improvements should also be considered within the scope of the present invention.

Claims (2)

1. A method for automatically linking a plurality of CLI programs into a task flow is characterized by comprising the following steps:
step 1, constructing a general task database; the general task database is used for storing a plurality of general tasks; each universal task is provided with a universal task ID, a task parameter receiving interface and a task parameter output interface;
step 2, constructing a connection script pool; the joining script pool is used for storing a plurality of joining scripts; each of the connection scripts corresponds to a general task ID and an execution sequence, wherein the execution sequence is as follows: before the corresponding general task is executed, executing the connection script, namely the preposed connection script; or after the corresponding general task is executed, executing the connection script, namely the post-connection script; each linking script is provided with a script parameter receiving interface and a script parameter output interface;
step 3, customizing a business process node diagram according to the actual business process requirements of the project; the business process node graph comprises a plurality of nodes; each node binds a corresponding general task; the general tasks are the general tasks inquired from the general task database;
step 4, making i equal to 1;
step 5, the main process locates the ith node in the service process node diagramiThereby obtaining the ith nodeiBound generic taski
Step 6, the main process searches the connection script pool and judges whether the general task exists or notiCorresponding prepositive connection script, if any, will be connected with the general taskiThe corresponding preposition join script is expressed as a preposition join script BSiExecuting step 7-step 9; otherwise, executing step 10;
step 7, the main process determines whether a forward connection script BS existsiIf so, acquiring the first transfer parameter, transferring the first transfer parameter to a first subprocess, and then informing the first subprocess to execute a preposed connection script BSi(ii) a If not, directly informing the first subprocess to execute the prepositive connection script BSi
Step 8, the first subprocess receives and executes the preposed connection script BSiAfter the notification message, firstly, whether a first transmission parameter from the main process is received is judged, if not, the preposed connection script BS is directly executedi(ii) a If so, the first transfer parameter is transferred to the prepositive connection script BSiThen executing the prepositive connection script BSi
The first subprocess executes the preposed connection script BSiAfter finishing, sending an executed notification message to the main process;
step 9, after receiving the execution completion notification message of the first subprocess, the main process captures a standard output stream of the first subprocess and judges whether the first subprocess has a second transmission parameter which needs to be transmitted downwards; if yes, the main process captures the second transmission parameter and executes the step 10; otherwise, directly executing step 10;
step 10, the main process determines whether there is a second transmission parameter transmitted to the second subprocess, if yes, the second transmission parameter is transmitted to the second subprocess, and then the second subprocess is informed to execute the general taski(ii) a If not, directly informing the second sub-process to execute the general taski
Step 11, the second sub-process receives and executes the general taskiAfter the notification message, firstly, judging whether a second transmission parameter from the main process is received or not, if not, directly executing the general taski(ii) a If so, passing the second passing parameter to the general taskiThen execute the general taski
The second subThe process executes the general taskiAfter finishing, sending an executed notification message to the main process;
step 12, after receiving the execution completion notification message of the second subprocess, the main process captures a standard output stream of the second subprocess, and judges whether the second subprocess has a third transmission parameter which needs to be transmitted downwards; if yes, the main process captures the third transfer parameter and executes step 13; otherwise, directly executing step 13;
step 13, the main process searches the connection script pool and judges whether the general task exists or notiCorresponding post-join scripts, if any, will be associated with the generic taskiThe corresponding post-join script is expressed AS a post-join script ASiExecuting step 14-step 16; otherwise, go to step 17;
step 14, the main process determines whether a backward connection script AS existsiIf the third transmission parameter exists, the third transmission parameter is obtained, the third transmission parameter is transmitted to the third subprocess, and then the third subprocess is informed to execute a post-join script ASi(ii) a If not, directly informing the third subprocess to execute the post-join script ASi
Step 15, the third subprocess receives and executes the post-connection script ASiAfter the notification message, firstly, judging whether a third transmission parameter from the main process is received, if not, directly executing the post-join script ASi(ii) a If yes, the third transfer parameter is transferred to the back connection script ASiThen executing the post-connection script ASi
The third sub-process executes the post-join script ASiAfter finishing, sending an executed notification message to the main process;
step 16, after receiving the execution completion notification message of the third subprocess, the main process captures a standard output stream of the third subprocess, and judges whether the third subprocess has a fourth transmission parameter which needs to be transmitted downwards; if yes, the main process captures the fourth transmission parameter, assigns the fourth transmission parameter to the first transmission parameter, and executes the step 17; otherwise, directly executing step 17;
step 17, judging the ith nodeiWhether the node is the last node in the service process node diagram or not, if so, completing the process of automatically connecting a plurality of CLI programs into a task process, and ending the process; if not, let i become i +1, return to step 5.
2. The method according to claim 1, wherein the generic task is a computer application or executable script that is allowed to be executed in a command line interface CLI.
CN202111142620.5A 2021-09-28 2021-09-28 Method for automatically linking multiple CLI programs into task flow Active CN113778572B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202111142620.5A CN113778572B (en) 2021-09-28 2021-09-28 Method for automatically linking multiple CLI programs into task flow

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202111142620.5A CN113778572B (en) 2021-09-28 2021-09-28 Method for automatically linking multiple CLI programs into task flow

Publications (2)

Publication Number Publication Date
CN113778572A true CN113778572A (en) 2021-12-10
CN113778572B CN113778572B (en) 2023-09-15

Family

ID=78854093

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202111142620.5A Active CN113778572B (en) 2021-09-28 2021-09-28 Method for automatically linking multiple CLI programs into task flow

Country Status (1)

Country Link
CN (1) CN113778572B (en)

Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1392019A1 (en) * 2002-08-19 2004-02-25 Alcatel Canada Inc. Command line interface processor with dynamic update of attribute dependencies.
US20040167795A1 (en) * 2003-02-25 2004-08-26 Akira Tanaka Method and system for processing business process, and processing program therefor
US20050132043A1 (en) * 2003-12-12 2005-06-16 Hon Hai Precision Industry Co., Ltd. System and method for command line interface command processing
US20060190579A1 (en) * 2005-02-23 2006-08-24 Alcatel Assisted command script template creation
CN101404696A (en) * 2008-11-03 2009-04-08 中兴通讯股份有限公司 Visible service flow tracing method and system, service flow processing system
CN102760074A (en) * 2011-04-26 2012-10-31 Sap股份公司 High-load business process scalability
CN109144618A (en) * 2018-09-10 2019-01-04 中铝视拓智能科技有限公司 A kind of service flow execution method and relevant apparatus
CN110399207A (en) * 2019-06-29 2019-11-01 苏州浪潮智能科技有限公司 Timed task processing method, system and storage medium in distributed memory system
CN112348326A (en) * 2020-10-23 2021-02-09 中国建设银行股份有限公司 Bank business processing method and system
CN112380255A (en) * 2020-11-16 2021-02-19 广东亿迅科技有限公司 Service processing method, device, equipment and storage medium

Patent Citations (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP1392019A1 (en) * 2002-08-19 2004-02-25 Alcatel Canada Inc. Command line interface processor with dynamic update of attribute dependencies.
US20040167795A1 (en) * 2003-02-25 2004-08-26 Akira Tanaka Method and system for processing business process, and processing program therefor
US20050132043A1 (en) * 2003-12-12 2005-06-16 Hon Hai Precision Industry Co., Ltd. System and method for command line interface command processing
US20060190579A1 (en) * 2005-02-23 2006-08-24 Alcatel Assisted command script template creation
CN101404696A (en) * 2008-11-03 2009-04-08 中兴通讯股份有限公司 Visible service flow tracing method and system, service flow processing system
CN102760074A (en) * 2011-04-26 2012-10-31 Sap股份公司 High-load business process scalability
CN109144618A (en) * 2018-09-10 2019-01-04 中铝视拓智能科技有限公司 A kind of service flow execution method and relevant apparatus
CN110399207A (en) * 2019-06-29 2019-11-01 苏州浪潮智能科技有限公司 Timed task processing method, system and storage medium in distributed memory system
CN112348326A (en) * 2020-10-23 2021-02-09 中国建设银行股份有限公司 Bank business processing method and system
CN112380255A (en) * 2020-11-16 2021-02-19 广东亿迅科技有限公司 Service processing method, device, equipment and storage medium

Also Published As

Publication number Publication date
CN113778572B (en) 2023-09-15

Similar Documents

Publication Publication Date Title
CN101963915A (en) Building method of compilation and system thereof
CN103870260A (en) Method and system for service interface development
CN104216912A (en) Method and device for achieving non-intrusive service form workflow
CN101957745A (en) Method for converting ladder diagram language into structure text language
Cengic et al. On formal analysis of IEC 61499 applications, Part A: Modeling
CN110764752A (en) System and method for realizing graphical service arrangement of Restful service based on micro-service architecture
CN112035090B (en) Intelligent contract intelligent management system and method based on containerization technology
CN112052235A (en) Method and device for migrating block chain transaction data
CN108647019A (en) A kind of control layer coding method of Services Composition
CN111641516A (en) Online reconfiguration of nodes in a process control system
CN114338738A (en) Actor model-based rule engine and scene linkage implementation method
CN113778572A (en) Method for automatically connecting multiple CLI programs into task flow
CN111913721B (en) Automatic deployment method, device, equipment and storage medium
CN109284935A (en) A kind of task processing system based on micro- assistance the superior and the subordinate office group
CN113792093A (en) Signal system interface service creating and executing method, device and electronic equipment
CN114385136A (en) Flow decomposition method and device for running ETL (extract transform load) by Flink framework
CN115589360A (en) Data transmission system, method, electronic device and storage medium
CN108932119B (en) Project layering method based on android system
Li et al. Mediator: A component-based modeling language for concurrent and distributed systems
CN110050291B (en) Aggregation platform, demand owner and methods thereof
Romanovsky Extending conventional languages by distributed/concurrent exception resolution
CN102469118B (en) A kind of method and device realizing information exploitation
CN112035169A (en) Skip processing method and device, computer equipment and computer readable storage medium
CN110580172A (en) Configuration rule verification method and device, storage medium and electronic device
Sobolewski Federated collaborations with exertions

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