CN107239324A - Work flow processing method, apparatus and system - Google Patents
Work flow processing method, apparatus and system Download PDFInfo
- Publication number
- CN107239324A CN107239324A CN201710364481.8A CN201710364481A CN107239324A CN 107239324 A CN107239324 A CN 107239324A CN 201710364481 A CN201710364481 A CN 201710364481A CN 107239324 A CN107239324 A CN 107239324A
- Authority
- CN
- China
- Prior art keywords
- service
- business object
- business
- processing
- state information
- 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
Links
- 238000000034 method Methods 0.000 title claims abstract description 94
- 238000005111 flow chemistry technique Methods 0.000 title claims abstract description 64
- 238000012545 processing Methods 0.000 claims abstract description 105
- 238000013507 mapping Methods 0.000 claims abstract description 41
- 230000015654 memory Effects 0.000 claims description 28
- 238000003860 storage Methods 0.000 claims description 27
- 230000008859 change Effects 0.000 claims description 6
- 230000009897 systematic effect Effects 0.000 abstract 1
- 230000008569 process Effects 0.000 description 23
- 230000006870 function Effects 0.000 description 15
- 238000010586 diagram Methods 0.000 description 14
- 230000006872 improvement Effects 0.000 description 10
- 238000013461 design Methods 0.000 description 9
- 238000004590 computer program Methods 0.000 description 8
- 238000005516 engineering process Methods 0.000 description 6
- 230000000903 blocking effect Effects 0.000 description 5
- 238000004891 communication Methods 0.000 description 5
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000000694 effects Effects 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- 239000007795 chemical reaction product Substances 0.000 description 2
- 230000003993 interaction Effects 0.000 description 2
- 239000000463 material Substances 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 238000003672 processing method Methods 0.000 description 2
- 230000007704 transition Effects 0.000 description 2
- 230000001960 triggered effect Effects 0.000 description 2
- OKTJSMMVPCPJKN-UHFFFAOYSA-N Carbon Chemical compound [C] OKTJSMMVPCPJKN-UHFFFAOYSA-N 0.000 description 1
- 108010001267 Protein Subunits Proteins 0.000 description 1
- 230000002159 abnormal effect Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 229910021389 graphene Inorganic materials 0.000 description 1
- 230000010365 information processing Effects 0.000 description 1
- 230000009545 invasion Effects 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 238000004519 manufacturing process Methods 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000005055 memory storage Effects 0.000 description 1
- 229920001296 polysiloxane Polymers 0.000 description 1
- 239000000047 product Substances 0.000 description 1
- 230000000750 progressive effect Effects 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements 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/46—Multiprogramming arrangements
- G06F9/465—Distributed object oriented systems
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0633—Workflow analysis
Landscapes
- Engineering & Computer Science (AREA)
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- Software Systems (AREA)
- Economics (AREA)
- Entrepreneurship & Innovation (AREA)
- Strategic Management (AREA)
- General Physics & Mathematics (AREA)
- Educational Administration (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Operations Research (AREA)
- General Business, Economics & Management (AREA)
- Marketing (AREA)
- Game Theory and Decision Science (AREA)
- Development Economics (AREA)
- General Engineering & Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The embodiment of the present application discloses a kind of work flow processing method, apparatus and system.Methods described includes：Business object is read from business object set, the business object set is included based on the pending business object generation received；From pending business object destination object corresponding with business object described in query processing in the mapping relations data of destination object, the business object is sent to the destination object；Receive the destination object and perform the status information that the business object is returned；The work flow for determining the business object according to the status information handles operation.Using each embodiment of the application, the workflow of business and actual business processing are separated, coding difficulty, reduction encoding amount is greatly simplified, improves systematic function.
Description
Technical Field
The present application relates to the field of computer data processing technologies, and in particular, to a method, an apparatus, and a system for processing a service flow.
Background
At present, with the continuous expansion of businesses, more and more businesses and business circulation operations need to be processed, and the scale of a business system gradually increases. And the implementation environment of distributed processing well caters for the development of the trend.
The distributed processing is a computer system in which a plurality of computers having different functions or having different data at different locations are connected via a communication network and cooperatively perform a large-scale information processing task under the unified management control of a control system. In a distributed system, in order to allocate tasks to respective processors for execution, a large number of flow processes of various job tasks need to be performed. The current common practice mainly includes encoding its own state machine for each different task (the state machine is usually composed of a state register and a combinational logic circuit, and can perform state transition according to a control signal and a preset state), and each task is responsible for circulation. In this way, if the task is successfully executed, the task side changes the flow state thereof; if the execution fails, the task waits for the opportunity to take charge of retry.
Firstly, the current business process processing mode like the above needs to customize a state machine for each task, and such a task flow processing mode causes too large coding amount, high repetition degree and low coding efficiency. Secondly, the reliability of the code execution of the tasks retried by the tasks after the tasks are executed mistakenly depends on the encoding language technology level of encoding personnel and the comprehension degree of task processing to a great extent, and the encoding difficulty and the state machine design difficulty are higher. Meanwhile, a large amount of redundant state machine codes can also reduce the system throughput in the system service flow processing, which causes the system performance to be reduced.
Disclosure of Invention
The application aims to provide a service flow processing method, a device and a system, a new flow processing scheme is designed, the flow of the service is separated from the actual service processing, the coding difficulty is greatly simplified, the coding amount is reduced, and the system performance is improved.
The method, the device and the system for processing the service flow are realized as follows:
a method for processing service flow, the method comprising:
reading a business object from a business object set, wherein the business object set comprises a business object to be processed and a business object to be processed;
inquiring and processing a target object corresponding to the business object from mapping relation data of the business object to be processed and the target object, and sending the business object to the target object;
receiving state information returned by the target object executing the business object;
and determining the service flow processing operation of the service object according to the state information.
A traffic flow processing apparatus, the apparatus comprising:
the storage module is used for receiving and storing the to-be-processed business object and acquiring mapping relation data of the to-be-processed business object and the corresponding target object;
the service polling processing module is used for reading the service object from the storage module, inquiring and processing a target object corresponding to the service object from the mapping relation data of the service object to be processed and the target object, and sending the service object to the target object; and the system is also used for receiving the state information returned by the target object executing the business object and determining the business flow processing operation of the business object according to the state information.
A traffic flow processing apparatus comprising a processor and a memory for storing processor-executable instructions, the instructions when executed by the processor implementing:
reading a business object from a business object set, wherein the business object set comprises a business object to be processed and a business object to be processed;
inquiring and processing a target object corresponding to the business object from mapping relation data of the business object to be processed and the target object, and sending the business object to the target object;
receiving state information returned by the target object executing the business object;
and determining the service flow processing operation of the service object according to the state information.
A computer readable storage medium having stored thereon computer instructions that, when executed, perform the steps of:
reading a business object from a business object set, wherein the business object set comprises a business object to be processed and a business object to be processed;
inquiring and processing a target object corresponding to the business object from mapping relation data of the business object to be processed and the target object, and sending the business object to the target object;
receiving state information returned by the target object executing the business object;
and determining the service flow processing operation of the service object according to the state information.
A distributed system comprising a processor to perform a job, a processor, and a memory to store processor-executable instructions that when executed by the processor implement:
reading processing services from a service queue set, wherein the service queue set comprises services to be processed and generated based on the received services;
inquiring a processor corresponding to the processing service in mapping relation data of the service to be processed and the processor, and sending the processing service to the processor;
receiving state information returned by the processor for executing the processing service;
and determining the service flow processing operation of the processing service according to the state information.
According to the service flow processing method, the service flow processing device and the service flow processing system, the flow of the service is separated from the actual service processing, the global service uses a unified and general flow processing mode, different tasks can be realized only by defining the state processing mode of the service, the flow of the service state and the error retry can be executed by the same engine, and the coding amount is greatly reduced. Under the condition that developers guarantee idempotent (the same data is executed for a plurality of times, the results are the same, and other influences cannot be caused), the universal stream processing engine for different tasks can be realized, the dependence of code robustness on the developers is reduced, the engine code difficulty is lower, and the coding difficulty and the state machine design difficulty are effectively reduced. Meanwhile, the service asynchronous non-blocking processing also improves the system performance.
Drawings
In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below, it is obvious that the drawings in the following description are only some embodiments described in the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without any creative effort.
Fig. 1 is a schematic flowchart of an embodiment of a service flow processing method according to the present application;
fig. 2 is a schematic view of an application scenario of an embodiment of a business process processing method provided in the present application;
FIG. 3 is a pseudo code diagram of a process interface according to the method of the present application;
FIG. 4 is a schematic flow chart diagram of another embodiment of the method provided herein;
FIG. 5 is a schematic flow chart diagram of another embodiment of the method provided herein;
fig. 6 is a schematic block structure diagram of an embodiment of a service flow processing apparatus provided in the present application.
Detailed Description
In order to make those skilled in the art better understand the technical solutions in the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
Fig. 1 is a flowchart illustrating an embodiment of a service flow processing method according to the present application. Although the present application provides the method operation steps or apparatus structures as shown in the following embodiments or figures, more or less operation steps or module units after partial combination may be included in the method or apparatus based on conventional or non-inventive labor. In the case of steps or structures which do not logically have the necessary cause and effect relationship, the execution sequence of the steps or the module structure of the apparatus is not limited to the execution sequence or the module structure shown in the embodiment or the drawings of the present application. When the described method or module structure is applied to a device, a server or an end product in practice, the method or module structure according to the embodiment or the figures may be executed sequentially or in parallel (for example, in a parallel processor or multi-thread processing environment, or even in an implementation environment including distributed processing and server clustering).
A specific embodiment is shown in fig. 1, and in an embodiment of a service flow processing method provided in the present application, the method may include:
s1: and reading the business object from a business object set, wherein the business object set comprises the generation of the business object to be processed based on the received.
The service object described in this embodiment may represent specific service data that needs to be executed by the processing machine, such as a service for querying in the processing machine, a setting instruction for reading and writing data from and to the processing machine, and sending the setting instruction to the processing machine. Generally, one business object may correspond to a job task that needs to be executed by one processor, or may be a set of a plurality of job tasks. The job task may be a task that needs to be executed by the processing machine and is created by the submitter, and the self attribute information of the job task generally includes information such as the type of the task and the flow state of the task. In this embodiment, job tasks submitted by a worker may be received, and each job task may be stored before being allocated to a corresponding processing machine for processing, and may be stored as a business object set. The business object set may be specifically implemented in the form of a message queue, and when the business flow is switched to processing, job tasks (collectively referred to as business objects herein) that need to be allocated to the processing machine for processing may be sequentially read from the message queue. Fig. 2 is a schematic view of an application scenario of an embodiment of a business process processing method provided by the present application, and fig. 2 may be configured with a task queue for storing business objects to be processed submitted by submitters (e.g., workers or a job server). The business objects in the task queue may be arranged in the order of time of receipt.
The reading time of the business object may be a time for taking out the job task to be circulated from the business object set, or may be another embodiment such as reading the business object when it is confirmed that there is sufficient processing resource.
In other embodiments, the set of business objects may be implemented as a database, a table, a file, or the like.
S2: and inquiring and processing a target object corresponding to the business object from the mapping relation data of the business object to be processed and the target object, and sending the business object to the target object.
In this embodiment, after the business object to be allocated is read, the corresponding target object to which the business object should be allocated may be queried through the mapping relationship data. The target object may include a unit for processing or executing the service object, such as the processing machine shown in fig. 2, and in other embodiments, the target object may also be other functional components or a server or a terminal device. The processor can be a process class, can realize a process interface, and inherits the Task to realize the Task of the processor. The mapping relation data can be pre-established or acquired, and is used for storing the mapping relation between each job task and a processor (Process) thereof, and delivering the job task to a real processor for execution in a processing stage. For example, one implementation of the mapping relationship data may be a mapping table of the object to be serviced and a processor executing the object to be serviced. For the added job type, the added job type can be realized by registering the added job type in the mapping table of the watchdog, as shown in fig. 3, fig. 3 is a pseudo code schematic diagram of a process interface of the method according to the present application.
In an embodiment of the mapping relationship data, the mapping relationship data may be locally set and stored, for example, a mapping relationship between the to-be-serviced object and the processor is established and configured on a local service system, and operations and maintenance are performed to increase a job type, modify the mapping relationship, and the like. In another embodiment, the mapping relation data may be stored in a network, such as a remote server. The mapping information of the object to be operated and the target object can be configured on the remote server in advance, the configuration information can be downloaded from the remote server for use before the streaming process, or the mapping relation data on the remote server is directly read on line, and the result is returned after the target object is found. In another embodiment of the method of the present application, the mapping relationship data is locally stored data, or configuration information of a remote server.
After the business object is read, the target object corresponding to the mapping relation data is inquired in the mapping relation data and is sent to the target object for processing. In a specific example, as shown in fig. 2, for example, the watchdog reads the task a, then determines the corresponding handler a according to the task type of the task a in the mapping table of the job task and the handler (in this embodiment, the mapping relationship data is processed by the same handler with the same task type), and then delivers the task a to the handler a for execution. The watchdog in this embodiment is equivalent to a poller, and takes out the job task from the task queue to the corresponding handler for execution according to a predetermined manner.
S3: and receiving the state information returned by the target object executing the business object.
The target object receives and processes the received service object, for example, the processor determines the specific execution content according to the current service flow state, and can return the corresponding processing state information. The state information may include information of a current state returned after the execution of the business object is completed, or may include state information returned after the execution is interrupted or not interrupted in the execution process, such as an execution error or an exception alarm. If the execution is completed, the state information of the completion of the execution of the business object can be returned. The other dimension of the returned state information may further include information indicating whether the service flow state of the service object is changed, for example, if the execution is completed and the service flow state of the job task is changed, the state information indicating that the service flow state of the service object is changed may be directly returned.
For example, in the implementation scenario shown in fig. 2, the processor receives the task and then performs processing, and returns to the current state after the execution is completed. If there is an error, the watchdog will capture the exception, and the watchdog may also receive the status information of the execution exception.
S4: and determining the service flow processing operation of the service object according to the state information.
According to the embodiment of the application, the active state change of the conventional job task is changed, and only one data flow corresponding to the service flow state can be executed each time by using a passive job task triggering mechanism. And returning the execution result, and determining the next business flow processing operation of the job task according to the execution result, such as discarding the executed job task or waiting for triggering of the next job task.
In this embodiment, the processor may simply execute the job task and return the status information after the execution is completed. And then, the next business flow processing operation of the job tasks is decided according to the state information, so that the active change of the business flow state of each job task is converted into the trigger of the passive job task, and the flow of the job task is separated from the actual processing of the job task. The implementation mode can process the unified circulation strategy aiming at different types and a large number of job tasks, greatly reduces the coding difficulty, the state machine design difficulty, the coding amount and the like, and has obvious system performance improvement effect in practical application.
The operation of determining the service flow processing of the service object according to the state information can be specifically set according to the flow processing requirements in different implementation environments. If the business object successfully executed can be handed to another server for processing the next flow state in a unified way, or the business object can be handed to the task queue again for processing until the business flow state is not in the processing range of the current system. Or, the executed business object is directly discarded, or still stored in the task queue, but the processing standard is modified to not need processing, or the business object which is failed to be executed is separately stored. Fig. 4 is a schematic flowchart of another embodiment of the method provided in the present application, specifically, the determining, according to the state information, a service flow processing operation of the service object may include:
s401: and if the state information comprises information indicating that the execution of the business object is completed, deleting the business object from the business object set.
If the normal execution of the business object in the corresponding target object can be confirmed from the state information, the business object can be deleted from the business object set, for example, from a task queue, so that the occupied space of a message queue can be saved.
Fig. 5 is a schematic flow chart of another embodiment of the method provided in the present application, where when a service object is completed normally, it may be determined (or directly obtained) that a service flow state of the service object does not change, and then the service object may be triggered again to execute retry after waiting for the next time. Specifically, in another embodiment of the method, the determining, according to the state information, a service flow processing operation of the service object may include:
s402: if the state information comprises information indicating that the business object is not executed, maintaining the business flow state of the business object in the business object set; and the number of the first and second groups,
and when the triggering condition is reached, re-reading the business object, and sending the business object to the target object for processing.
For example, in the application scenario shown in fig. 2, the watchdog determines whether the current state is completed according to the return result of the handler, and if the current state is completed, the flow is switched to the next state according to the return state information; if there is an error, the watchdog will capture the exception, and may consider that the traffic state is unchanged (the traffic state is the state of the task itself), and may replace the job task that has not been completed back to the task queue or do no operation.
The status information described in the foregoing may include various types of information. In an embodiment of the method of the present application, the information may include two types of state information, one is information including whether a transfer state of the job task is changed, and the other is information including whether the job task is completed or abnormal. If the execution is completed, the normal processing is performed. If the execution is not completed and retry is required, in an embodiment of the present application, the business object may be confirmed to be not completed based on at least one of the following status information:
information of the business object execution error;
and the service flow state of the service object does not change.
Further, if a task queue implementation is employed, the watchdog may place the unexecuted job task back into the task queue upon confirming that the job task is not completed. Therefore, in another embodiment of the method, the set of business objects includes a task queue, and the business objects in the task queue are arranged according to the received time sequence;
correspondingly, the reading the business object from the business object set comprises sequentially fetching the business objects sent to the target object for execution from the task queue, and,
the method further comprises the following steps: and putting the business objects which are not completed by execution back to the task queue.
For example, business objects which are not completed by execution can be placed at the tail of the task queue, so that the job task can be triggered again for retrying after being polled for a period.
Of course, in other embodiments, the business object set may also be an embodiment of a database, a file, or the like, and it is not limited that the business objects are necessarily arranged in sequence or read in sequence. In some embodiments, if the execution is not complete at the business object, it may be marked as a retry business, waiting for the next opportunity to retry. The retry timing can be implemented in various ways, and in an embodiment provided by the present application, the incomplete processing service can be read periodically or the retry timing can be determined according to the priority of the job task. Therefore, in another embodiment of the method of the present application, when the status information includes that the execution of the business object is not completed, the business object is marked as a retry business, and accordingly, the triggering condition may include:
reading retry service from the service object set at regular time;
or,
retry traffic is read based on the priority of the traffic object handling.
With the embodiments provided above, a general flow engine can be implemented. The existing non-universal engine needs to write the engine again when adding a task due to a strongly coupled state machine design mode, the influence range is large, and the implementation of code design, linking and the like is difficult. When the operation types are added in the mode provided by the application, the operation types can be registered in the mapping table of the watchdog, so that the operation types can be increased, and the invasion to the original system is greatly reduced.
According to the business flow processing method, the flow of the business is separated from the actual business processing, the global business uses a unified and general flow processing mode, different tasks can be realized only by defining the state processing mode of the business, the flow of the business state and error retry can be executed by the same engine, and the coding amount is greatly reduced. Under the condition that developers guarantee idempotent (the same data is executed for a plurality of times, the results are the same, and other influences cannot be caused), the universal stream processing engine for different tasks can be realized, the dependence of code robustness on the developers is reduced, the engine code difficulty is lower, and the coding difficulty and the state machine design difficulty are effectively reduced. Meanwhile, the service asynchronous non-blocking processing also improves the system performance.
Based on the service flow processing method, the application also provides a service flow processing device. The apparatus can include systems (including distributed systems), software (applications), modules, components, servers, clients, etc. that employ the methods described herein, in conjunction with hardware where necessary to implement the apparatus. Based on the same innovative concept, the device in one embodiment provided by the present application is described in the following embodiment. Because the implementation scheme of the device for solving the problems is similar to that of the method, the implementation of the specific device in the present application can refer to the implementation of the method, and repeated details are not repeated. As used hereinafter, the term "unit" or "module" may be a combination of software and/or hardware that implements a predetermined function. Although the means described in the embodiments below are preferably implemented in software, an implementation in hardware, or a combination of software and hardware is also possible and contemplated. Specifically, fig. 6 is a schematic block structure diagram of an embodiment of a service flow processing apparatus provided in the present application, and as shown in fig. 6, the apparatus may include:
the storage module 101 may be configured to receive and store a to-be-processed service object, and acquire mapping relationship data between the to-be-processed service object and a corresponding target object;
the service polling processing module 102 may be configured to read a service object from the storage module, query and process a target object corresponding to the service object from mapping relationship data between a service object to be processed and the target object, and send the service object to the target object; and the system is also used for receiving the state information returned by the target object executing the business object and determining the business flow processing operation of the business object according to the state information.
As described in the foregoing method, when the service polling processing module determines the service flow processing operation of the service object specifically according to the state information, the method may include:
and if the state information comprises information indicating that the execution of the business object is completed, deleting the business object from the business object set.
Or, in another embodiment, if the state information includes information indicating that the execution of the business object is not completed, maintaining a business flow state of the business object in the business object set; and when the triggering condition is reached, re-reading the business object and sending the business object to the target object for processing.
According to the service flow processing device, the flow of the service is separated from the actual service processing, the global service uses a unified and general flow processing mode, different tasks can be realized only by defining the state processing mode of the global service, the flow of the service state and error retry can be executed by the same engine, and the coding amount is greatly reduced. Under the condition that developers guarantee idempotent (the same data is executed for a plurality of times, the results are the same, and other influences cannot be caused), the universal stream processing engine for different tasks can be realized, the dependence of code robustness on the developers is reduced, the engine code difficulty is lower, and the coding difficulty and the state machine design difficulty are effectively reduced. Meanwhile, the service asynchronous non-blocking processing also improves the system performance.
The service flow processing method provided by the application can be realized by executing corresponding program instructions in a computer by a processor, for example, JAVA can well realize process registration by reflection. Specifically, in another embodiment of a service flow processing apparatus provided in the present application, the apparatus may include a processor and a memory for storing processor-executable instructions, where the processor executes the instructions to implement:
reading a business object from a business object set, wherein the business object set comprises a business object to be processed and a business object to be processed;
inquiring and processing a target object corresponding to the business object from mapping relation data of the business object to be processed and the target object, and sending the business object to the target object;
receiving state information returned by the target object executing the business object;
and determining the service flow processing operation of the service object according to the state information.
In other embodiments, as described in the foregoing method or apparatus, when the processor executes an instruction for determining a service flow processing operation of the service object according to the state information:
and if the state information comprises information indicating that the execution of the business object is completed, deleting the business object from the business object set.
Or in another embodiment, when the processor executes the instruction for determining the service flow processing operation of the service object according to the state information:
if the state information comprises information indicating that the business object is not executed, maintaining the business flow state of the business object in the business object set; and the number of the first and second groups,
and when the triggering condition is reached, re-reading the business object, and sending the business object to the target object for processing.
The method or apparatus described in the foregoing embodiments of the present application may implement service logic through a computer program and record the service logic on a storage medium, where the storage medium may be read and executed by a computer, so as to implement at least one effect described in the embodiments of the present application. Accordingly, the present application also provides a computer readable storage medium having stored thereon computer instructions that, when executed, may perform the steps of:
reading a business object from a business object set, wherein the business object set comprises a business object to be processed and a business object to be processed;
inquiring and processing a target object corresponding to the business object from mapping relation data of the business object to be processed and the target object, and sending the business object to the target object;
receiving state information returned by the target object executing the business object;
and determining the service flow processing operation of the service object according to the state information.
The computer readable storage medium may include physical means for storing information, typically by digitizing the information for storage on a medium using electrical, magnetic or optical means. The computer-readable storage medium according to this embodiment may include: devices that store information using electrical energy, such as various types of memory, e.g., RAM, ROM, etc.; devices that store information using magnetic energy, such as hard disks, floppy disks, tapes, core memories, bubble memories, and usb disks; devices that store information optically, such as CDs or DVDs. Of course, there are other ways of storing media that can be read, such as quantum memory, graphene memory, and so forth.
The device or the method or the computer readable storage medium can be used in a system of a distributed implementation environment, a unified and general flow engine is adopted, different tasks can be implemented only by defining a state processing mode of the device or the method, state transition and error retry are executed by the engine, the coding amount is greatly reduced, developers only need to ensure idempotent, and the dependency of code robustness on developers is reduced. While asynchronous non-blocking processing also increases system performance. Specifically, in one embodiment of a distributed system, the distributed system includes a processor for executing a job, a processor, and a memory for storing processor-executable instructions, where the processor executes the instructions to implement:
reading processing services from a service queue set, wherein the service queue set comprises services to be processed and generated based on the received services;
inquiring a processor corresponding to the processing service in mapping relation data of the service to be processed and the processor, and sending the processing service to the processor;
receiving state information returned by the processor for executing the processing service;
and determining the service flow processing operation of the processing service according to the state information.
It should be noted that, the above-mentioned device, computer storage medium, or system may also include other implementation manners according to the description of the method embodiment, for example, a service object that is not executed and completed is read from the retry service at regular time, and a specific implementation manner may refer to the description of the method embodiment, which is not described herein again.
According to the service flow processing method, the service flow processing device and the service flow processing system, the flow of the service is separated from the actual service processing, the global service uses a unified and general flow processing mode, different tasks can be realized only by defining the state processing mode of the service, the flow of the service state and the error retry can be executed by the same engine, and the coding amount is greatly reduced. Under the condition that developers guarantee idempotent (the same data is executed for a plurality of times, the results are the same, and other influences cannot be caused), the universal stream processing engine for different tasks can be realized, the dependence of code robustness on the developers is reduced, the engine code difficulty is lower, and the coding difficulty and the state machine design difficulty are effectively reduced. Meanwhile, the service asynchronous non-blocking processing also improves the system performance.
Although the description of data construction, acquisition, interaction, calculation, judgment, etc. using watchdog as a poller, a mapping table to store the mapping relationship of job tasks to handlers, a process interface implementation to add job types, etc. is referred to in this application, the application is not limited to the case where it is necessary to conform to industry communication standards, standard databases, computer processing and storage rules, or the description of the embodiments of the application. Certain industry standards, or implementations modified slightly from those described using custom modes or examples, may also achieve the same, equivalent, or similar, or other, contemplated implementations of the above-described examples. The embodiments using the modified or transformed data acquisition, storage, judgment, processing and the like may still fall within the scope of the alternative embodiments of the present application.
In the 90 s of the 20 th century, improvements in a technology could clearly distinguish between improvements in hardware (e.g., improvements in circuit structures such as diodes, transistors, switches, etc.) and improvements in software (improvements in process flow). However, as technology advances, many of today's process flow improvements have been seen as direct improvements in hardware circuit architecture. Designers almost always obtain the corresponding hardware circuit structure by programming an improved method flow into the hardware circuit. Thus, it cannot be said that an improvement in the process flow cannot be realized by hardware physical modules. For example, a Programmable Logic Device (PLD), such as a Field Programmable Gate Array (FPGA), is an integrated circuit whose Logic functions are determined by programming the Device by a user. A digital system is "integrated" on a PLD by the designer's own programming without requiring the chip manufacturer to design and fabricate application-specific integrated circuit chips. Furthermore, nowadays, instead of manually making an integrated Circuit chip, such Programming is often implemented by "logic compiler" software, which is similar to a software compiler used in program development and writing, but the original code before compiling is also written by a specific Programming Language, which is called Hardware Description Language (HDL), and HDL is not only one but many, such as abel (advanced Boolean Expression Language), ahdl (alternate Language Description Language), traffic, pl (core unified Programming Language), HDCal, JHDL (Java Hardware Description Language), langue, Lola, HDL, laspam, hardsradware (Hardware Description Language), vhjhd (Hardware Description Language), and vhigh-Language, which are currently used in most common. It will also be apparent to those skilled in the art that hardware circuitry that implements the logical method flows can be readily obtained by merely slightly programming the method flows into an integrated circuit using the hardware description languages described above.
The controller may be implemented in any suitable manner, for example, the controller may take the form of, for example, a microprocessor or processor and a computer-readable medium storing computer-readable program code (e.g., software or firmware) executable by the (micro) processor, logic gates, switches, an Application Specific Integrated Circuit (ASIC), a programmable logic controller, and an embedded microcontroller, examples of which include, but are not limited to, the following microcontrollers: ARC 625D, Atmel AT91SAM, Microchip PIC18F26K20, and Silicone Labs C8051F320, the memory controller may also be implemented as part of the control logic for the memory. Those skilled in the art will also appreciate that, in addition to implementing the controller as pure computer readable program code, the same functionality can be implemented by logically programming method steps such that the controller is in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers, embedded microcontrollers and the like. Such a controller may thus be considered a hardware component, and the means included therein for performing the various functions may also be considered as a structure within the hardware component. Or even means for performing the functions may be regarded as being both a software module for performing the method and a structure within a hardware component.
The systems, devices, modules or units illustrated in the above embodiments may be implemented by a computer chip or an entity, or by a product with certain functions. One typical implementation device is a computer. In particular, the computer may be, for example, a personal computer, a laptop computer, a vehicle-mounted human-computer interaction device, a cellular telephone, a camera phone, a smart phone, a personal digital assistant, a media player, a navigation device, an email device, a game console, a tablet computer, a wearable device, or a combination of any of these devices.
Although the present application provides method steps as described in an embodiment or flowchart, more or fewer steps may be included based on conventional or non-inventive means. The order of steps recited in the embodiments is merely one manner of performing the steps in a multitude of orders and does not represent the only order of execution. When an actual apparatus or end product executes, it may execute sequentially or in parallel (e.g., parallel processors or multi-threaded environments, or even distributed data processing environments) according to the method shown in the embodiment or the figures. The terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, the presence of additional identical or equivalent elements in a process, method, article, or apparatus that comprises the recited elements is not excluded.
For convenience of description, the above devices are described as being divided into various modules by functions, and are described separately. Of course, in implementing the present application, the functions of each module may be implemented in one or more software and/or hardware, or a module implementing the same function may be implemented by a combination of a plurality of sub-modules or sub-units, and the like. The above-described embodiments of the apparatus are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
Those skilled in the art will also appreciate that, in addition to implementing the controller as pure computer readable program code, the same functionality can be implemented by logically programming method steps such that the controller is in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers, embedded microcontrollers and the like. Such a controller may therefore be considered as a hardware component, and the means included therein for performing the various functions may also be considered as a structure within the hardware component. Or even means for performing the functions may be regarded as being both a software module for performing the method and a structure within a hardware component.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
In a typical configuration, a computing device includes one or more processors (CPUs), input/output interfaces, network interfaces, and memory.
The memory may include forms of volatile memory in a computer readable medium, Random Access Memory (RAM) and/or non-volatile memory, such as Read Only Memory (ROM) or flash memory (flash RAM). Memory is an example of a computer-readable medium.
Computer-readable media, including both non-transitory and non-transitory, removable and non-removable media, may implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of computer storage media include, but are not limited to, phase change memory (PRAM), Static Random Access Memory (SRAM), Dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), Digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium that can be used to store information that can be accessed by a computing device. As defined herein, a computer readable medium does not include a transitory computer readable medium such as a modulated data signal and a carrier wave.
As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The application 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 application 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 embodiments in the present specification are described in a progressive manner, and the same and similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. In particular, for the system embodiment, since it is substantially similar to the method embodiment, the description is simple, and for the relevant points, reference may be made to the partial description of the method embodiment. In the description herein, reference to the description of the term "one embodiment," "some embodiments," "an example," "a specific example," or "some examples," etc., means that a particular feature, structure, material, or characteristic described in connection with the embodiment or example is included in at least one embodiment or example of the application. In this specification, the schematic representations of the terms used above are not necessarily intended to refer to the same embodiment or example. Furthermore, the particular features, structures, materials, or characteristics described may be combined in any suitable manner in any one or more embodiments or examples. Furthermore, various embodiments or examples and features of different embodiments or examples described in this specification can be combined and combined by one skilled in the art without contradiction.
The above description is only an example of the present application and is not intended to limit the present application. Various modifications and changes may occur to those skilled in the art. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present application should be included in the scope of the claims of the present application.
Claims (16)
1. A method for processing service flow, the method comprising:
reading a business object from a business object set, wherein the business object set is generated based on a received business object to be processed;
inquiring and processing a target object corresponding to the business object from mapping relation data of the business object to be processed and the target object, and sending the business object to the target object;
receiving state information returned by the target object executing the business object;
and determining the service flow processing operation of the service object according to the state information.
2. The method of claim 1, wherein the determining the service flow processing operation of the service object according to the state information comprises:
and if the state information comprises information indicating that the execution of the business object is completed, deleting the business object from the business object set.
3. The method of claim 1, wherein the determining the service flow processing operation of the service object according to the state information comprises:
if the state information comprises information indicating that the business object is not executed, maintaining the business flow state of the business object in the business object set; and the number of the first and second groups,
and when the triggering condition is reached, re-reading the business object, and sending the business object to the target object for processing.
4. The service flow processing method according to claim 3, wherein the service object is confirmed to be not executed based on at least one of the following status information:
information of the business object execution error;
and the service flow state of the service object does not change.
5. A service flow processing method according to claim 3, wherein the service object set includes a task queue, and the service objects in the task queue are arranged according to the received time sequence;
correspondingly, the reading of the business objects from the business object set comprises sequentially fetching the business objects sent to the target object for execution from the task queue, and,
the method further comprises the following steps: and putting the business objects which are not completed by execution back to the task queue.
6. The service flow processing method according to claim 3, further comprising:
marking the service object which is not executed and completed as a retry service, wherein the triggering condition comprises:
reading retry service from the service object set at regular time;
or,
retry traffic is read based on the priority of the traffic object handling.
7. The method of claim 1, wherein at least one of the following configurations is adopted:
the mapping relation data is locally stored data or configuration information of a remote server;
the business object set comprises any one implementation mode of a database, a message queue, a table and a file.
8. A traffic flow processing apparatus, the apparatus comprising:
the storage module is used for receiving and storing the business object to be processed and acquiring the mapping relation data between the business object to be processed and the corresponding target object;
the service polling processing module is used for reading the service object from the storage module, inquiring and processing a target object corresponding to the service object from the mapping relation data of the service object to be processed and the target object, and sending the service object to the target object; and the system is also used for receiving the state information returned by the target object executing the business object and determining the business flow processing operation of the business object according to the state information.
9. The apparatus of claim 8, wherein the service rotation processing module determines a service rotation processing operation of the service object according to the status information comprises:
and if the state information comprises information indicating that the execution of the business object is completed, deleting the business object from the business object set.
10. The apparatus of claim 8, wherein the service rotation processing module determines a service rotation processing operation of the service object according to the status information comprises:
if the state information comprises information indicating that the business object is not executed, maintaining the business flow state of the business object in the business object set; and the number of the first and second groups,
and when the triggering condition is reached, re-reading the business object, and sending the business object to the target object for processing.
11. A traffic flow processing apparatus comprising a processor and a memory for storing processor-executable instructions, the instructions when executed by the processor implementing:
reading a business object from a business object set, wherein the business object set comprises a business object to be processed and a business object to be processed;
inquiring and processing a target object corresponding to the business object from mapping relation data of the business object to be processed and the target object, and sending the business object to the target object;
receiving state information returned by the target object executing the business object;
and determining the service flow processing operation of the service object according to the state information.
12. The apparatus of claim 11, wherein when the processor executes the instruction for determining the service flow processing operation of the service object according to the state information:
and if the state information comprises information indicating that the execution of the business object is completed, deleting the business object from the business object set.
13. The apparatus of claim 11, wherein when the processor executes the instruction for determining the service flow processing operation of the service object according to the state information:
if the state information comprises information indicating that the business object is not executed, maintaining the business flow state of the business object in the business object set; and the number of the first and second groups,
and when the triggering condition is reached, re-reading the business object, and sending the business object to the target object for processing.
14. A service flow processing device as claimed in claim 13, wherein the service object set includes a task queue, and the service objects in the task queue are arranged according to the received time sequence;
correspondingly, the processor reading the business object from the business object set comprises sequentially fetching the business objects sent to the target object for execution from the task queue, and,
the processor, when executing the instructions, further implements: and putting the business objects which are not completed by execution back to the task queue.
15. A computer readable storage medium having stored thereon computer instructions that, when executed, perform the steps of:
reading a business object from a business object set, wherein the business object set comprises a business object to be processed and a business object to be processed;
inquiring and processing a target object corresponding to the business object from mapping relation data of the business object to be processed and the target object, and sending the business object to the target object;
receiving state information returned by the target object executing the business object;
and determining the service flow processing operation of the service object according to the state information.
16. A distributed system comprising a processor to perform a job, a processor, and a memory to store processor-executable instructions that when executed by the processor implement:
reading processing services from a service queue set, wherein the service queue set comprises services to be processed and generated based on the received services;
inquiring a processor corresponding to the processing service in mapping relation data of the service to be processed and the processor, and sending the processing service to the processor;
receiving state information returned by the processor for executing the processing service;
and determining the service flow processing operation of the processing service according to the state information.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710364481.8A CN107239324B (en) | 2017-05-22 | 2017-05-22 | Service flow processing method, device and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710364481.8A CN107239324B (en) | 2017-05-22 | 2017-05-22 | Service flow processing method, device and system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107239324A true CN107239324A (en) | 2017-10-10 |
| CN107239324B CN107239324B (en) | 2020-12-11 |
Family
ID=59985196
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710364481.8A Active CN107239324B (en) | 2017-05-22 | 2017-05-22 | Service flow processing method, device and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107239324B (en) |
Cited By (18)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108093077A (en) * | 2017-12-29 | 2018-05-29 | 广东欧珀移动通信有限公司 | Abnormality eliminating method, device and server |
| CN108664292A (en) * | 2018-05-02 | 2018-10-16 | 山东浪潮通软信息科技有限公司 | A method of supporting dynamic expansion data processing business |
| CN109101223A (en) * | 2018-07-26 | 2018-12-28 | 北京大米未来科技有限公司 | A kind of Business Process Control method, Business Process Control engine and system |
| CN109408118A (en) * | 2018-09-29 | 2019-03-01 | 古进 | MHP heterogeneous multiple-pipeline processor |
| CN109597680A (en) * | 2018-10-22 | 2019-04-09 | 阿里巴巴集团控股有限公司 | Task queue's response parameter evaluation method and device |
| CN109995824A (en) * | 2017-12-29 | 2019-07-09 | 阿里巴巴集团控股有限公司 | Method for scheduling task and device in a kind of peer-to-peer network |
| CN110018891A (en) * | 2018-11-28 | 2019-07-16 | 阿里巴巴集团控股有限公司 | A kind of task management system, a kind of task management method and device |
| CN110069323A (en) * | 2018-01-24 | 2019-07-30 | 可赛尔内存股份有限公司 | High speed reaction game station and its method for allocating tasks |
| CN110503334A (en) * | 2019-08-23 | 2019-11-26 | 行吟信息科技（上海）有限公司 | A kind of state machine control method and system |
| CN111142975A (en) * | 2019-12-12 | 2020-05-12 | 贝壳技术有限公司 | State machine persistence method and state machine persistence system |
| CN111427542A (en) * | 2020-03-19 | 2020-07-17 | 武汉慧联无限科技有限公司 | Information processing method, device and computer readable storage medium |
| CN111598541A (en) * | 2020-05-14 | 2020-08-28 | 深圳易伙科技有限责任公司 | Enterprise business reporting method, device, equipment and storage medium |
| CN111754184A (en) * | 2019-03-29 | 2020-10-09 | 上海宽带技术及应用工程研究中心 | Cross-enterprise workflow control method, system, device and storage medium |
| CN112035232A (en) * | 2020-09-01 | 2020-12-04 | 中国银行股份有限公司 | Job operation priority determining method and related equipment |
| CN112532513A (en) * | 2019-09-19 | 2021-03-19 | 上海淘票儿信息科技有限公司 | Gateway and service data processing method |
| CN112860389A (en) * | 2019-11-27 | 2021-05-28 | 上海哔哩哔哩科技有限公司 | Task scheduling method based on state machine |
| CN112860454A (en) * | 2021-02-05 | 2021-05-28 | 百果园技术(新加坡)有限公司 | Service processing system and method |
| CN114691454A (en) * | 2022-03-30 | 2022-07-01 | 网银在线（北京）科技有限公司 | Process task processing method and device, computer equipment and storage medium |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102136967A (en) * | 2010-12-31 | 2011-07-27 | 华为软件技术有限公司 | Method, device and system for managing service state |
| CN102880937A (en) * | 2012-09-17 | 2013-01-16 | 北京中电普华信息技术有限公司 | Process implementation method based on business process modeling notation international standard |
| CN103345664A (en) * | 2013-05-31 | 2013-10-09 | 华为技术有限公司 | Method and system for adaptation between workflow and task scheduling |
| CN102681854B (en) * | 2012-05-18 | 2015-04-29 | 华为技术有限公司 | Service execution method, server and computer system |
| CN105913197A (en) * | 2016-05-06 | 2016-08-31 | 杭州中房信息科技有限公司 | Workflow method executed based on business data rule |
| CN106155769A (en) * | 2015-03-26 | 2016-11-23 | 北大方正集团有限公司 | A kind of workflow processing method, device and workflow engine |
| CN106296243A (en) * | 2015-05-22 | 2017-01-04 | 阿里巴巴集团控股有限公司 | Service implementation method and device |
| US20170083442A1 (en) * | 2015-09-23 | 2017-03-23 | International Business Machines Corporation | Transactional memory coherence control |
-
2017
- 2017-05-22 CN CN201710364481.8A patent/CN107239324B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102136967A (en) * | 2010-12-31 | 2011-07-27 | 华为软件技术有限公司 | Method, device and system for managing service state |
| CN102681854B (en) * | 2012-05-18 | 2015-04-29 | 华为技术有限公司 | Service execution method, server and computer system |
| CN102880937A (en) * | 2012-09-17 | 2013-01-16 | 北京中电普华信息技术有限公司 | Process implementation method based on business process modeling notation international standard |
| CN103345664A (en) * | 2013-05-31 | 2013-10-09 | 华为技术有限公司 | Method and system for adaptation between workflow and task scheduling |
| CN106155769A (en) * | 2015-03-26 | 2016-11-23 | 北大方正集团有限公司 | A kind of workflow processing method, device and workflow engine |
| CN106296243A (en) * | 2015-05-22 | 2017-01-04 | 阿里巴巴集团控股有限公司 | Service implementation method and device |
| US20170083442A1 (en) * | 2015-09-23 | 2017-03-23 | International Business Machines Corporation | Transactional memory coherence control |
| CN105913197A (en) * | 2016-05-06 | 2016-08-31 | 杭州中房信息科技有限公司 | Workflow method executed based on business data rule |
Cited By (25)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109995824B (en) * | 2017-12-29 | 2022-10-04 | 阿里巴巴集团控股有限公司 | Task scheduling method and device in peer-to-peer network |
| CN109995824A (en) * | 2017-12-29 | 2019-07-09 | 阿里巴巴集团控股有限公司 | Method for scheduling task and device in a kind of peer-to-peer network |
| CN108093077A (en) * | 2017-12-29 | 2018-05-29 | 广东欧珀移动通信有限公司 | Abnormality eliminating method, device and server |
| CN110069323A (en) * | 2018-01-24 | 2019-07-30 | 可赛尔内存股份有限公司 | High speed reaction game station and its method for allocating tasks |
| CN110069323B (en) * | 2018-01-24 | 2024-04-05 | 可赛尔内存股份有限公司 | High-speed reaction game device and task allocation method thereof |
| CN108664292A (en) * | 2018-05-02 | 2018-10-16 | 山东浪潮通软信息科技有限公司 | A method of supporting dynamic expansion data processing business |
| CN109101223A (en) * | 2018-07-26 | 2018-12-28 | 北京大米未来科技有限公司 | A kind of Business Process Control method, Business Process Control engine and system |
| CN109408118A (en) * | 2018-09-29 | 2019-03-01 | 古进 | MHP heterogeneous multiple-pipeline processor |
| CN109408118B (en) * | 2018-09-29 | 2024-01-02 | 古进 | MHP heterogeneous multi-pipeline processor |
| CN109597680A (en) * | 2018-10-22 | 2019-04-09 | 阿里巴巴集团控股有限公司 | Task queue's response parameter evaluation method and device |
| CN109597680B (en) * | 2018-10-22 | 2023-07-07 | 创新先进技术有限公司 | Task queuing response parameter estimation method and device |
| CN110018891A (en) * | 2018-11-28 | 2019-07-16 | 阿里巴巴集团控股有限公司 | A kind of task management system, a kind of task management method and device |
| CN110018891B (en) * | 2018-11-28 | 2023-11-21 | 创新先进技术有限公司 | Task management system, task management method and device |
| CN111754184A (en) * | 2019-03-29 | 2020-10-09 | 上海宽带技术及应用工程研究中心 | Cross-enterprise workflow control method, system, device and storage medium |
| CN110503334A (en) * | 2019-08-23 | 2019-11-26 | 行吟信息科技（上海）有限公司 | A kind of state machine control method and system |
| CN112532513A (en) * | 2019-09-19 | 2021-03-19 | 上海淘票儿信息科技有限公司 | Gateway and service data processing method |
| CN112860389A (en) * | 2019-11-27 | 2021-05-28 | 上海哔哩哔哩科技有限公司 | Task scheduling method based on state machine |
| CN111142975A (en) * | 2019-12-12 | 2020-05-12 | 贝壳技术有限公司 | State machine persistence method and state machine persistence system |
| CN111427542A (en) * | 2020-03-19 | 2020-07-17 | 武汉慧联无限科技有限公司 | Information processing method, device and computer readable storage medium |
| CN111598541A (en) * | 2020-05-14 | 2020-08-28 | 深圳易伙科技有限责任公司 | Enterprise business reporting method, device, equipment and storage medium |
| CN112035232B (en) * | 2020-09-01 | 2023-08-18 | 中国银行股份有限公司 | Job operation priority determining method and related equipment |
| CN112035232A (en) * | 2020-09-01 | 2020-12-04 | 中国银行股份有限公司 | Job operation priority determining method and related equipment |
| CN112860454A (en) * | 2021-02-05 | 2021-05-28 | 百果园技术(新加坡)有限公司 | Service processing system and method |
| CN112860454B (en) * | 2021-02-05 | 2024-04-19 | 百果园技术(新加坡)有限公司 | Service processing system and method |
| CN114691454A (en) * | 2022-03-30 | 2022-07-01 | 网银在线（北京）科技有限公司 | Process task processing method and device, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107239324B (en) | 2020-12-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107239324B (en) | Service flow processing method, device and system | |
| CN112035230B (en) | Task scheduling file generation method, device and storage medium | |
| CN108599973B (en) | Log association method, device and equipment | |
| CN107016029B (en) | Method, device and system for processing service data | |
| CN107066519B (en) | Task detection method and device | |
| CN108459913B (en) | Data parallel processing method and device and server | |
| CN110807013B (en) | Data migration method and device for distributed data storage cluster | |
| CN112115105B (en) | Service processing method, device and equipment | |
| CN110297955B (en) | Information query method, device, equipment and medium | |
| US20230281179A1 (en) | Load Balancing For A Storage System | |
| WO2023160083A1 (en) | Method for executing transactions, blockchain, master node, and slave node | |
| US20080005537A1 (en) | Quantifying core reliability in a multi-core system | |
| CN109597678A (en) | Task processing method and device | |
| CN112905668B (en) | Database derivative method, device and medium based on distributed data stream processing engine | |
| CN108446301B (en) | Business file splitting and summarizing method, device and equipment | |
| CN110046028B (en) | Data processing method, device and server | |
| CN115952227A (en) | Data acquisition system and method, electronic device and storage medium | |
| CN116822606A (en) | Training method, device, equipment and storage medium of anomaly detection model | |
| CN110992039A (en) | Transaction processing method, device and equipment | |
| US20120159247A1 (en) | Automatically changing parts in response to tests | |
| CN111339117B (en) | Data processing method, device and equipment | |
| CN110245136B (en) | Data retrieval method, device, equipment and storage equipment | |
| CN109241027B (en) | Data migration method, device, electronic equipment and computer readable storage medium | |
| CN111967764A (en) | Service access verification method and device and electronic equipment | |
| CN110968566A (en) | Migration tool-based domestic application system migration method |
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 | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20200925 Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Applicant after: Innovative advanced technology Co.,Ltd. Address before: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Applicant before: Advanced innovation technology Co.,Ltd. Effective date of registration: 20200925 Address after: Cayman Enterprise Centre, 27 Hospital Road, George Town, Grand Cayman Islands Applicant after: Advanced innovation technology Co.,Ltd. Address before: Greater Cayman, British Cayman Islands Applicant before: Alibaba Group Holding Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |