CN114140075A - Service processing method, device, medium and electronic equipment - Google Patents
Service processing method, device, medium and electronic equipment Download PDFInfo
- Publication number
- CN114140075A CN114140075A CN202111438937.3A CN202111438937A CN114140075A CN 114140075 A CN114140075 A CN 114140075A CN 202111438937 A CN202111438937 A CN 202111438937A CN 114140075 A CN114140075 A CN 114140075A
- Authority
- CN
- China
- Prior art keywords
- task
- flow
- block chain
- service
- node
- 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
- 238000003672 processing method Methods 0.000 title claims abstract description 25
- 238000012545 processing Methods 0.000 claims abstract description 65
- 238000000034 method Methods 0.000 claims abstract description 49
- 238000004891 communication Methods 0.000 claims abstract description 12
- 230000008569 process Effects 0.000 claims description 29
- 230000002159 abnormal effect Effects 0.000 claims description 20
- 238000003860 storage Methods 0.000 claims description 18
- 230000004044 response Effects 0.000 claims description 16
- 238000012856 packing Methods 0.000 claims description 14
- 238000004590 computer program Methods 0.000 claims description 11
- 238000012544 monitoring process Methods 0.000 claims description 9
- 238000004458 analytical method Methods 0.000 claims description 7
- 239000003086 colorant Substances 0.000 claims description 5
- 238000013507 mapping Methods 0.000 claims description 5
- 238000010586 diagram Methods 0.000 description 12
- 230000006870 function Effects 0.000 description 6
- 230000003287 optical effect Effects 0.000 description 4
- 230000007246 mechanism Effects 0.000 description 3
- 238000004806 packaging method and process Methods 0.000 description 3
- 230000009471 action Effects 0.000 description 2
- 239000000470 constituent Substances 0.000 description 2
- 238000009826 distribution Methods 0.000 description 2
- 238000004321 preservation Methods 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 230000001960 triggered effect Effects 0.000 description 2
- RWSOTUBLDIXVET-UHFFFAOYSA-N Dihydrogen sulfide Chemical compound S RWSOTUBLDIXVET-UHFFFAOYSA-N 0.000 description 1
- 230000005856 abnormality Effects 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000004140 cleaning Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000011156 evaluation Methods 0.000 description 1
- 230000001815 facial effect Effects 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000013178 mathematical model Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000001360 synchronised effect Effects 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- 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
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Strategic Management (AREA)
- Human Resources & Organizations (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Economics (AREA)
- Marketing (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Tourism & Hospitality (AREA)
- Quality & Reliability (AREA)
- Operations Research (AREA)
- Data Mining & Analysis (AREA)
- Accounting & Taxation (AREA)
- Development Economics (AREA)
- Finance (AREA)
- Technology Law (AREA)
- Debugging And Monitoring (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present application belongs to the technical field of block chaining, and in particular, to a service processing method, a service processing apparatus, a computer readable medium, and an electronic device. The service processing method comprises the following steps: analyzing the service triggering request to obtain a request identifier and a type identifier carried in the service triggering request; acquiring a flow task sequence corresponding to the type identifier through a task scheduling node in the block chain network, and performing parameter configuration on the flow task sequence to generate a task scheduling graph with a directed acyclic graph structure; according to the connection relation of each vertex and the communication direction of each edge in the task scheduling graph, associating the flow task to be executed with the request identifier and then issuing the flow task to the block chain network so as to execute the flow task through the block chain nodes in the block chain network; and after all the flow tasks in the task scheduling graph are executed, returning a service processing result to a sender of the service triggering request. The method can improve the service processing efficiency.
Description
Technical Field
The present application belongs to the technical field of block chaining, and in particular, to a service processing method, a service processing apparatus, a computer readable medium, and an electronic device.
Background
In the field of financial business, a plurality of online business transaction channels can be provided for users through computer and internet technologies, for example, users can transact business through a plurality of ways such as mobile phone APP, small programs, public numbers and the like.
In the process of handling financial services, coordination among a plurality of service departments and circulation scheduling of a plurality of service flows are usually involved, and a subsequent flow can be initiated only after the current flow is executed. In the process of service handling, a service flow is often blocked at a certain node and cannot be continuously executed, so that technical problems of slow service flow scheduling, low service handling efficiency and the like generally exist.
Disclosure of Invention
The present application aims to provide a service processing method, a service processing apparatus, a computer readable medium, and an electronic device, which at least to some extent overcome the technical problems of low service processing efficiency and the like in the related art.
Other features and advantages of the present application will be apparent from the following detailed description, or may be learned by practice of the application.
According to an aspect of an embodiment of the present application, there is provided a service processing method, including:
analyzing a service triggering request to obtain a request identifier and a type identifier carried in the service triggering request, wherein the request identifier is a unique identifier used for determining the service triggering request, and the type identifier is a unique identifier used for determining the service type;
acquiring a flow task sequence corresponding to the type identifier through a task scheduling node in a block chain network, and performing parameter configuration on the flow task sequence to generate a task scheduling graph with a directed acyclic graph structure; the flow task sequence comprises a plurality of flow tasks arranged according to a service flow sequence, and the task scheduling graph comprises vertexes corresponding to the flow tasks and edges used for representing scheduling relations among the flow tasks;
according to the connection relation of each vertex and the communication direction of each edge in the task scheduling graph, associating the flow task to be executed with the request identifier and then issuing the flow task to the block chain network so as to execute the flow task through the block chain nodes in the block chain network;
and when all the flow tasks in the task scheduling graph are executed, returning a service processing result to a sender of the service triggering request.
In an embodiment of the present application, based on the above technical solution, the executing the process task through a block link point in the block link network includes:
each block chain node in the block chain network stores the flow task to a local task buffer pool;
judging whether the flow task in the task buffer pool meets the corresponding task triggering condition or not through a task triggering node in the block chain network;
when the flow task meets the task triggering condition, broadcasting a triggering message of the flow task to a block chain network;
and the block chain link points in the block chain network execute the flow tasks according to the trigger messages.
In an embodiment of the application, based on the above technical solution, executing the flow task according to the trigger message includes:
acquiring an intelligent contract address of a flow task corresponding to the trigger message through a task execution node in the block chain network;
calling an intelligent contract according to the intelligent contract address to execute the flow task;
and performing uplink processing on the execution result of the flow task to store the execution result of the flow task on a block chain.
In an embodiment of the present application, based on the above technical solution, performing uplink processing on the execution result of the process task includes:
when each block chain node in the block chain network receives an execution result broadcasted on the block chain network, determining a corresponding flow task according to a request identifier carried in the execution result, and writing the execution result and the flow task into a block to be packaged after performing association processing;
when the uplink condition is met, the task packing node broadcasts the packing information of the block to be packed to the block chain network so as to enable other block chain nodes in the block chain network to perform consensus authentication, and the block to be packed is linked to the block chain after the authentication is passed.
In an embodiment of the application, based on the above technical solution, after each blockchain link point in the blockchain network stores the flow task to a local task buffer pool, the method further includes:
monitoring the storage time of the flow task in the task buffer pool in real time;
when the storage time exceeds a time threshold, broadcasting a task synchronization request to a block chain network to update the execution state of the flow task;
if the execution state is execution completion, removing the flow task from the task buffer pool;
and if the execution state is not the completion of execution, marking the flow task as an abnormal task.
In an embodiment of the present application, based on the above technical solution, returning a service transaction result to a sender of the service trigger request includes:
monitoring the execution state of each flow task in the task scheduling graph through a task scheduling node in the block chain network;
and after all the flow tasks in the task scheduling graph are executed, performing association processing on a service transaction result and the request identifier and returning the service transaction result and the request identifier to a sender of the service triggering request.
In an embodiment of the application, based on the above technical solution, after performing parameter configuration on the flow task sequence to generate a task scheduling graph having a directed acyclic graph structure, the method further includes:
monitoring the execution state of each flow task in the task scheduling graph through a task scheduling node in the block chain network;
acquiring a plurality of task processing nodes corresponding to the flow tasks, and recording task response time of the task processing nodes, wherein the task processing nodes comprise task trigger nodes, task execution nodes and task packaging nodes;
mapping the task response duration of each task processing node to a color space to obtain a color characteristic value of the process task;
adding colors to the vertexes in the task scheduling graph according to the color characteristic values;
and performing color analysis on the task scheduling graph added with the color to determine an abnormal vertex in the task scheduling graph and an abnormal task processing node corresponding to the abnormal vertex.
According to an aspect of an embodiment of the present application, there is provided a service processing apparatus, including:
the service triggering module is configured to send a service triggering request to a service server, wherein the service triggering request carries a request identifier and a type identifier;
the acquisition module is configured to acquire a flow task sequence corresponding to the type identifier through a task scheduling node in a block chain network, and perform parameter configuration on the flow task sequence to generate a task scheduling graph with a directed acyclic graph structure; the flow task sequence comprises a plurality of flow tasks arranged according to a service flow sequence, and the task scheduling graph comprises vertexes corresponding to the flow tasks and edges used for representing scheduling relations among the flow tasks;
the execution module is configured to associate the flow task to be executed with the request identifier and then issue the flow task to the block chain network according to the connection relation of each vertex and the communication direction of each edge in the task scheduling graph, so that the flow task is executed through a block chain link point in the block chain network;
and the return module is configured to return a service processing result to a sender of the service triggering request after all the flow tasks in the task scheduling graph are executed.
According to an aspect of the embodiments of the present application, there is provided a computer-readable medium, on which a computer program is stored, which when executed by a processor implements a service processing method as in the above technical solutions.
According to an aspect of an embodiment of the present application, there is provided an electronic apparatus including: a processor; and a memory for storing executable instructions of the processor; wherein the processor is configured to execute the service processing method as in the above technical solution via executing the executable instructions.
According to an aspect of embodiments herein, there is provided a computer program product or computer program comprising computer instructions stored in a computer readable storage medium. The processor of the computer device reads the computer instructions from the computer readable storage medium, and the processor executes the computer instructions, so that the computer device executes the business processing method as in the above technical solution.
In the technical scheme provided by the embodiment of the application, by configuring the task scheduling graph with the directed acyclic graph structure, each flow task in the flow task sequence can be distributed to a plurality of block chain nodes in the block chain network, so that each flow task can be executed in a parallelized manner by different block chain nodes, and all block chain nodes in the block chain network can compete for the task execution right, thereby avoiding the problem of task flow blockage and remarkably improving the execution efficiency of the service flow.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and together with the description, serve to explain the principles of the application. It is obvious that the drawings in the following description are only some embodiments of the application, and that for a person skilled in the art, other drawings can be derived from them without inventive effort.
Fig. 1 shows a schematic composition diagram of a blockchain system in an embodiment of the present application.
Fig. 2 shows the constituent structure of a blockchain maintained on a blockchain network.
Fig. 3 is a flow chart illustrating steps of a service processing method in an embodiment of the present application.
FIG. 4 illustrates a task scheduling graph generated based on a flow task sequence in one embodiment of the present application.
FIG. 5 is a flow diagram illustrating steps for performing flow tasks in one embodiment of the present application.
FIG. 6 is a flowchart illustrating steps for visually presenting and evaluating task scheduling results according to an embodiment of the present application.
Fig. 7 schematically shows a block diagram of a service processing apparatus provided in an embodiment of the present application.
FIG. 8 schematically illustrates a block diagram of a computer system suitable for use in implementing an electronic device of an embodiment of the present application.
Detailed Description
Example embodiments will now be described more fully with reference to the accompanying drawings. Example embodiments may, however, be embodied in many different forms and should not be construed as limited to the examples set forth herein; rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the concept of example embodiments to those skilled in the art.
Furthermore, the described features, structures, or characteristics may be combined in any suitable manner in one or more embodiments. In the following description, numerous specific details are provided to give a thorough understanding of embodiments of the application. One skilled in the relevant art will recognize, however, that the subject matter of the present application can be practiced without one or more of the specific details, or with other methods, components, devices, steps, and so forth. In other instances, well-known methods, devices, implementations, or operations have not been shown or described in detail to avoid obscuring aspects of the application.
The block diagrams shown in the figures are functional entities only and do not necessarily correspond to physically separate entities. I.e. these functional entities may be implemented in the form of software, or in one or more hardware modules or integrated circuits, or in different networks and/or processor means and/or microcontroller means.
The flow charts shown in the drawings are merely illustrative and do not necessarily include all of the contents and operations/steps, nor do they necessarily have to be performed in the order described. For example, some operations/steps may be decomposed, and some operations/steps may be combined or partially combined, so that the actual execution sequence may be changed according to the actual situation.
The blockchain is an anti-counterfeiting, anti-tampering and traceable shared digital account book with a blockchain data structure, which is constructed by transparent and credible rules under a peer-to-peer network environment. The block chain type data structure is a data structure which stores transactions occurring in a period of time in units of blocks and connects the blocks into a chain in time sequence by a cryptographic algorithm. Accounts are distributed to all member nodes in the network, and a history of asset transactions occurring between peer nodes in the network is permanently recorded in a sequential chain of blocks linked by a hash cipher algorithm. All validated and certified transactions are linked from the beginning of the chain all the way to the latest tile, hence the named tile chain. Blockchains can act as a single source of facts, and members in a blockchain network can only view the transactions that are related to them.
Fig. 1 shows a schematic block chain system in an embodiment of the present application, where the block chain system 100 may include at least one client 110 and a block chain network 120, and the block chain network 120 includes at least one block chain node 121. The client 110 may be a smart phone, a tablet computer, a notebook computer, a desktop computer, an intelligent wearable device, an intelligent vehicle-mounted device, an intelligent payment terminal, a facial recognition terminal, or other various electronic devices, and may provide a block chain data service to a user by installing a corresponding client application program. The blockchain node 121 may be a terminal device or a server, for example, the blockchain node 121 may be an independent physical server, may also be a server cluster formed by a plurality of physical servers, and may also be a cloud server providing cloud computing services.
In the blockchain network 120, each blockchain node 121 may receive input information while performing normal operations and maintain shared data within the blockchain network based on the received input information. In order to ensure information intercommunication, there may be information connection between each blockchain node 121, and each blockchain node 121 may perform information transmission through the information connection. For example, when any blockchain node 121 in the blockchain network 120 receives input information and broadcasts the input information in the blockchain network 120, other node devices in the blockchain network 120 may acquire the input information according to a consensus algorithm and store the input information as shared data.
Each blockchain node 121 in the blockchain network 120 has a node identifier corresponding thereto, and each blockchain node 121 in the blockchain network 120 can store the node identifiers of other blockchain nodes in the same blockchain network, so that the generated block is broadcast to other nodes in the blockchain network 120 according to the node identifiers of other blockchain nodes in the subsequent process. A node identifier list as shown in table 1 may be maintained in the blockchain node 121, and the node name and the node identifier are correspondingly stored in the node identifier list. The node identifier may be an IP (Internet Protocol) address and any other information that can be used to identify the node, and table 1 is a node identifier list taking an IP address as an example.
TABLE 1
| Node name | Node identification |
| Node 1 | 117.114.151.174 |
| Node 2 | 117.116.189.145 |
| … | … |
| Node N | 119.123.789.258 |
Fig. 2 shows the constituent structure of a blockchain maintained on a blockchain network. As shown in fig. 2, the blockchain is composed of a plurality of blocks connected in sequence, and whenever new data needs to be written into the blockchain, the data is collected into a newly generated block, and the newly generated block is linked to the end of the blockchain, and the newly added block on each node device 121 can be guaranteed to be identical through the consensus algorithm. The data of the current block is recorded in the block body of each block, and the Hash value (Hash) of the previous block connected with the current block is stored in the block head of each block, and if the transaction data in the previous block changes, the Hash value of the current block changes accordingly. Therefore, the data uploaded to the blockchain network is difficult to tamper, and the reliability of the shared data can be improved.
The following describes in detail a service processing method, a service processing apparatus, a computer-readable medium, and an electronic device provided by the present application with reference to specific embodiments.
Fig. 3 is a flow chart illustrating steps of a traffic processing method in an embodiment of the present application, which may be performed by the client or the block chain node shown in fig. 1. As shown in fig. 3, the service processing method may mainly include the following steps S310 to S340.
Step S310: and analyzing the service triggering request to obtain a request identifier and a type identifier carried in the service triggering request, wherein the request identifier is a unique identifier for determining the service triggering request, and the type identifier is a unique identifier for determining the service type.
Step S320: acquiring a flow task sequence corresponding to the type identifier through a task scheduling node in the block chain network, and performing parameter configuration on the flow task sequence to generate a task scheduling graph with a directed acyclic graph structure; the flow task sequence comprises a plurality of flow tasks arranged according to the business flow sequence, and the task scheduling graph comprises vertexes corresponding to the flow tasks and edges used for representing scheduling relations among the flow tasks.
Step S330: and associating the flow task to be executed with the request identifier and then issuing the flow task to be executed to the block chain network according to the connection relation of each vertex and the communication direction of each edge in the task scheduling graph, so that the flow task is executed through the block chain nodes in the block chain network.
Step S340: and after all the flow tasks in the task scheduling graph are executed, returning a service processing result to a sender of the service triggering request.
In the service processing method provided in the embodiment of the present application, by configuring the task scheduling graph having the directed acyclic graph structure, each process task in the process task sequence may be allocated to a plurality of block chain nodes in the block chain network, so that each process task may be executed in parallel by different block chain nodes, and all block chain nodes in the block chain network may compete for the task execution right, thereby avoiding the problem of task flow blockage and significantly improving the execution efficiency of the service flow.
The following describes each method step of the service processing method in detail.
In step S310, the service triggering request is analyzed to obtain a request identifier and a type identifier carried in the service triggering request, where the request identifier is a unique identifier for determining the service triggering request, and the type identifier is a unique identifier for determining the service type.
The service triggering request is a request initiated by a user through the terminal equipment inputting relevant data for service transaction. Taking the card opening service of applying for transacting the credit card by the user as an example, the user can submit a credit card transacting request (service triggering request) through any way such as APP, applet, public number or counter, the request at least carries a request identifier and a type identifier, the service applied by the user can be determined to be the credit card transacting service based on the type identifier carried in the service triggering request, and the service triggering request can be uniquely determined in any link in the credit card transacting process based on the request identifier carried in the service triggering request.
In step S320, a flow task sequence corresponding to the type identifier is obtained through a task scheduling node in the block chain network, and parameter configuration is performed on the flow task sequence to generate a task scheduling graph with a directed acyclic graph structure; the flow task sequence comprises a plurality of flow tasks arranged according to the business flow sequence, and the task scheduling graph comprises vertexes corresponding to the flow tasks and edges used for representing scheduling relations among the flow tasks.
In an embodiment of the present application, the task scheduling node may be a block chain node that is pre-designated in the block chain network for task scheduling, for example, the node performance of each block chain node may be periodically monitored, and each block chain node may be sorted according to the node performance, so as to select the block chain node with the highest performance as the task scheduling node. The node performance may include device performance, such as CPU utilization, memory usage, disk space, and network performance, such as network bandwidth, network latency, throughput, and the like.
In one embodiment of the present application, the task scheduling node may be generated based on a consensus mechanism by real-time election. Each blockchain node in the blockchain network can participate in the competition for the scheduling right of one service trigger request, and a task scheduling node is generated in an election voting mode.
In one embodiment of the present application, each of the blockchain link points in the blockchain network may be alternately designated as the task scheduling node in a pre-designated order.
FIG. 4 illustrates a task scheduling graph generated based on a flow task sequence in one embodiment of the present application. As shown in FIG. 4, the task schedule graph is composed of a plurality of vertices and edges connecting the vertices, wherein each vertex corresponds to a flow task in the sequence of flow tasks. Taking the application for the credit card as an example, the card opening process of the credit card may include a plurality of links arranged according to a process sequence, such as synchronous updating of card opening parameters, batch piece feeding compensation, batch piece feeding return, card account and guest information synchronization, redis cache content cleaning, and the like, where each link corresponds to a process task. And drawing a directed acyclic graph for representing the card opening business handling process according to the scheduling relation of each process task.
In step S330, the process task to be executed is associated with the request identifier and then issued to the blockchain network according to the connection relationship between the vertices and the communication directions of the edges in the task scheduling graph, so that the process task is executed through the blockchain link points in the blockchain network.
As shown in fig. 4, a task scheduling graph may include 7 flow tasks, for example, and after associating each flow task with a request identifier of a current service trigger request, the tasks are issued to the blockchain network in sequence according to a service flow sequence. For example, task 1 may be issued first, tasks 2, 3, and 4 may be issued after task 1 is executed, task 5 may be issued after tasks 2 and 3 are executed, and so on until the issuance and execution of task 7 are completed. In addition, the task scheduling node may also issue all the flow tasks in the task scheduling graph to the blockchain network at the same time, for example, the tasks 1 to 7 shown in fig. 4 may be issued to the blockchain network at the same time, so that the blockchain link points in the blockchain network may execute each flow task in a parallelized manner.
Fig. 5 is a flowchart illustrating steps for executing a flow task in an embodiment of the present application, and as shown in fig. 5, on the basis of the above embodiment, the step S330 for executing the flow task through a block link point in a block chain network may include the following steps S510 to S540.
Step S510: each block chain node in the block chain network saves the flow task to a local task buffer pool.
Each block chain link point in the block chain network maintains a task buffer pool, and when a task scheduling node issues a task in the block chain network, each block chain node stores the received flow task to a local task buffer pool and waits for the task to be triggered and executed.
Step S520: and judging whether the flow tasks in the task buffer pool meet corresponding task triggering conditions or not through the task triggering nodes in the block chain network.
In an embodiment of the present application, the task trigger node may be a block chain link point that is pre-designated in the block chain network and used for task triggering, for example, the node performance of each block chain node may be periodically monitored, and each block chain node may be sorted according to the node performance, so as to select the block chain node with the highest performance as the task trigger node. The node performance may include device performance, such as CPU utilization, memory usage, disk space, and network performance, such as network bandwidth, network latency, throughput, and the like.
In one embodiment of the application, the task trigger node can be generated based on a consensus mechanism through real-time election. Each blockchain node in the blockchain network can participate in the competition of the task trigger right of a flow task, and the task trigger node is generated in an election voting mode.
In one embodiment of the present application, each of the tile link points in the tile chain network may be alternately designated as task trigger nodes in a pre-designated order.
The task triggering condition comprises that the execution of the preorder task flow of the flow task is completed and the current task flow reaches the task triggering time.
Step S530: and broadcasting a triggering message of the flow task to the block chain network when the flow task meets the task triggering condition.
When one process task meets a task triggering condition, a triggering message aiming at the process task is broadcasted to the block chain network, and the triggering message carries a request identifier corresponding to the process task, so that each block chain node in the block chain network can uniquely determine the process task to be triggered.
Step S540: and the block chain link points in the block chain network execute the flow tasks according to the trigger messages.
In one embodiment of the present application, a method for executing a flow task according to a trigger message includes: acquiring an intelligent contract address of a flow task corresponding to the trigger message through a task execution node in the block chain network; calling an intelligent contract according to the intelligent contract address to execute the flow task; and performing uplink processing on the execution result of the flow task so as to store the execution result of the flow task on the block chain.
In an embodiment of the present application, the task execution node may be a block chain node that is pre-designated in the block chain network for performing task execution, for example, the node performance of each block chain node may be periodically monitored, and each block chain node may be sorted according to the node performance, so as to select the block chain node with the highest performance as the task trigger node. The node performance may include device performance, such as CPU utilization, memory usage, disk space, and network performance, such as network bandwidth, network latency, throughput, and the like.
In one embodiment of the application, the task execution nodes may be generated based on a consensus mechanism by real-time election. Each blockchain node in the blockchain network can participate in competition for the task execution right of a flow task, and the task execution node is generated in an election voting mode.
In one embodiment of the present application, each of the tile link points in the tile chain network may be alternately designated as task execution nodes in a pre-designated order.
In an embodiment of the present application, a method for performing uplink processing on a result of execution of a flow task includes: when each block chain node in the block chain network receives an execution result broadcasted on the block chain network, determining a corresponding flow task according to a request identifier carried in the execution result, and writing the execution result and the flow task into a block to be packaged after performing association processing; when the uplink condition is met, the task packing node broadcasts the packing information of the blocks to be packed to the block chain network, so that other block chain nodes in the block chain network perform consensus authentication, and the blocks to be packed are linked to the block chain after the authentication is passed. The uplink condition may include that the number of tasks in the block to be packed reaches a set number threshold or the time interval between the number of tasks and the uplink time of the last block exceeds a time threshold. The packed message of the block to be packed may include, for example, a broadcast message carrying block header data of the block to be packed.
In one embodiment of the present application, each block link point may monitor the preservation time of the process task in the task buffer pool in real time; when the storage time exceeds a time threshold, broadcasting a task synchronization request to the block chain network to update the execution state of the flow task; if the execution state is execution completion, removing the flow task from the task buffer pool; and if the execution state is not the completion of execution, marking the flow task as an abnormal task. And aiming at the abnormal task, a reminding message can be sent to the service personnel so that the service personnel can check the task and find the reason of the abnormality.
In step S340, after all the flow tasks in the task scheduling graph are completed, a service transaction result is returned to the sender of the service triggering request.
In one embodiment of the present application, a method for returning a service transaction result to a sender of a service trigger request may include: monitoring the execution state of each flow task in a task scheduling graph through a task scheduling node in a block chain network; and after all the flow tasks in the task scheduling graph are executed, performing association processing on the service processing result and the request identifier and returning the service processing result and the request identifier to a sender of the service triggering request.
In an embodiment of the application, by monitoring the execution process of each flow task in the task scheduling graph, the business handling process can be visually displayed and evaluated, so that process optimization can be performed according to the evaluation result.
FIG. 6 is a flowchart illustrating steps for visually presenting and evaluating task scheduling results according to an embodiment of the present application. As shown in fig. 6, on the basis of the above embodiments, the method for presenting and evaluating the business transaction process based on the task schedule diagram may include the following steps S610 to S640.
Step S610: the method comprises the steps of respectively obtaining a plurality of task processing nodes corresponding to each flow task in a task scheduling graph, and recording task response time of the task processing nodes, wherein the task processing nodes comprise task trigger nodes, task execution nodes and task packaging nodes.
In an embodiment of the present application, each flow task in the task scheduling graph needs to be processed by task triggering, task executing, and task packing, and each processing link is executed by a task processing node such as a task triggering node, a task executing node, and a task packing node in the blockchain network. In the process of executing the flow task, the task response time of each processing link can be monitored and recorded in real time, for example, the task response time which can be recorded for one flow task may include task trigger time, task execution time and task packing time.
Step S620: and mapping the task response duration of each task processing node to a color space to obtain a color characteristic value of the flow task.
A color space is an abstract mathematical model that describes the way a color is represented using a set of values (usually three, four values, or color components). A color is expressed by one-dimensional, two-dimensional, three-dimensional or even four-dimensional space coordinates, and the color range which can be defined by the coordinate system is the color space.
In one embodiment of the present application, the color space of the corresponding dimension may be selected according to the number of task response durations. Each type of task response duration is mapped to a color characteristic value of one dimension. For example, when the task response time length includes three types of task trigger time length, task execution time length and task packing time length, the task response time length can be selected to be mapped to an RGB color space having three-dimensional coordinates. For another example, when the number of types of the task response time periods is four, it is possible to select the mapping of the task response time periods to the CMYK color space having four-dimensional coordinates.
Step S630: and adding colors to the vertexes in the task scheduling graph according to the color characteristic values.
The color corresponding to a flow task can be determined according to the color characteristic value of each dimension in the color space, and the color is added to the vertex corresponding to the flow task in the task scheduling graph, so that the task scheduling graph with different color distributions can be obtained.
Step S640: and performing color analysis on the task scheduling graph added with the color to determine an abnormal vertex in the task scheduling graph and an abnormal task processing node corresponding to the abnormal vertex.
Each vertex in the task scheduling graph has different colors, abnormal vertices can be selected according to the color distribution condition of each vertex in the task scheduling graph through color analysis, and abnormal task processing nodes corresponding to the abnormal vertices are further determined.
It should be noted that although the various steps of the methods in this application are depicted in the drawings in a particular order, this does not require or imply that these steps must be performed in this particular order, or that all of the shown steps must be performed, to achieve desirable results. Additionally or alternatively, certain steps may be omitted, multiple steps combined into one step execution, and/or one step broken down into multiple step executions, etc.
The following describes an embodiment of an apparatus of the present application, which may be used to execute a service processing method in the foregoing embodiment of the present application. Fig. 7 schematically shows a block diagram of a service processing apparatus provided in an embodiment of the present application. As shown in fig. 7, the service processing apparatus 700 may mainly include:
the analysis module 710 is configured to analyze a service trigger request to obtain a request identifier and a type identifier carried in the service trigger request, where the request identifier is a unique identifier used for determining the service trigger request, and the type identifier is a unique identifier used for determining a service type;
an obtaining module 720, configured to obtain, through a task scheduling node in a blockchain network, a flow task sequence corresponding to the type identifier, and perform parameter configuration on the flow task sequence to generate a task scheduling graph with a directed acyclic graph structure; the flow task sequence comprises a plurality of flow tasks arranged according to a service flow sequence, and the task scheduling graph comprises vertexes corresponding to the flow tasks and edges used for representing scheduling relations among the flow tasks;
the execution module 730 is configured to associate the flow task to be executed with the request identifier and then issue the flow task to the blockchain network according to the connection relationship between the vertices and the communication directions of the edges in the task scheduling graph, so that the flow task is executed through the blockchain link points in the blockchain network;
and a returning module 740 configured to return a service processing result to the sender of the service triggering request after all the flow tasks in the task scheduling graph are executed.
In an embodiment of the present application, based on the above embodiments, the executing module 730 includes:
the saving module is configured to save the flow task to a local task buffer pool by each blockchain node in the blockchain network;
the judging module is configured to judge whether the flow task in the task buffer pool meets the corresponding task triggering condition through a task triggering node in the block chain network;
the trigger message broadcasting module is configured to broadcast a trigger message of the flow task to a block chain network when the flow task is judged to meet the task trigger condition;
a task execution module configured to execute the flow task according to the trigger message by the block chain link point in the block chain network.
In an embodiment of the present application, based on the above embodiments, the task execution module includes:
the address acquisition module is configured to acquire an intelligent contract address of the flow task corresponding to the trigger message through a task execution node in the block chain network;
a contract calling module configured to call an intelligent contract according to the intelligent contract address to execute the flow task;
and the result uplink module is configured to perform uplink processing on the execution result of the flow task so as to store the execution result of the flow task on the block chain.
In an embodiment of the present application, based on the above embodiments, the result uplink module includes:
the task writing module is configured to determine a corresponding flow task according to a request identifier carried in an execution result when each block chain node in the block chain network receives the execution result broadcasted on the block chain network, and write the execution result and the flow task into a block to be packaged after association processing;
and the task packing module is configured to broadcast the packing information of the block to be packed to the block chain network through the task packing node when the uplink condition is met, so that other block chain nodes in the block chain network perform consensus authentication, and link the block to be packed to the block chain after the authentication is passed.
In an embodiment of the present application, based on the above embodiments, the service processing apparatus further includes:
the time monitoring module is configured to monitor the saving time of the flow task in the task buffer pool in real time;
the task synchronization module is configured to broadcast a task synchronization request to a block chain network to update the execution state of the flow task when the preservation time exceeds a time threshold;
a task removing module configured to remove the flow task from the task buffer pool if the execution state is execution completion;
and the task marking module is configured to mark the flow task as an abnormal task if the execution state is not completed.
In an embodiment of the present application, based on the above embodiments, the returning module 740 includes:
the state monitoring module is configured to monitor the execution state of each flow task in the task scheduling graph through a task scheduling node in the block chain network;
and the result returning module is configured to perform association processing on the service transaction result and the request identifier and return the service transaction result to the sender of the service triggering request after all the flow tasks in the task scheduling graph are executed.
In an embodiment of the present application, based on the above embodiments, the service processing apparatus further includes:
the time length obtaining module is configured to respectively obtain a plurality of task processing nodes corresponding to each flow task in the task scheduling graph and record task response time lengths of the task processing nodes, wherein the task processing nodes comprise task trigger nodes, task execution nodes and task packaging nodes;
the color mapping module is configured to map the task response duration of each task processing node to a color space to obtain a color characteristic value of the flow task;
a color adding module configured to add colors to the vertices in the task scheduling graph according to the color feature values;
and the color analysis module is configured to perform color analysis on the task scheduling graph after the color is added so as to determine an abnormal vertex in the task scheduling graph and an abnormal task processing node corresponding to the abnormal vertex.
The specific details of the service processing apparatus provided in each embodiment of the present application have been described in detail in the corresponding method embodiment, and are not described herein again.
Fig. 8 schematically shows a block diagram of a computer system of an electronic device for implementing an embodiment of the present application.
It should be noted that the computer system 800 of the electronic device shown in fig. 8 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present application.
As shown in fig. 8, the computer system 800 includes a Central Processing Unit (CPU) 801 that can perform various appropriate actions and processes according to a program stored in a Read-Only Memory (ROM) 802 or a program loaded from a storage section 808 into a Random Access Memory (RAM) 803. In the random access memory 803, various programs and data necessary for system operation are also stored. The cpu 801, the rom 802 and the ram 803 are connected to each other via a bus 804. An Input/Output interface 805(Input/Output interface, i.e., I/O interface) is also connected to the bus 804.
The following components are connected to the input/output interface 805: an input portion 806 including a keyboard, a mouse, and the like; an output section 807 including a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and a speaker; a storage portion 808 including a hard disk and the like; and a communication section 809 including a network interface card such as a local area network card, modem, and the like. The communication section 809 performs communication processing via a network such as the internet. A drive 810 is also connected to the input/output interface 805 as necessary. A removable medium 811 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 810 as necessary, so that a computer program read out therefrom is mounted on the storage section 808 as necessary.
In particular, according to embodiments of the present application, the processes described in the various method flowcharts may be implemented as computer software programs. For example, embodiments of the present application include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated by the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 809 and/or installed from the removable medium 811. When executed by the central processor 801, the computer program performs various functions defined in the system of the present application.
It should be noted that the computer readable medium shown in the embodiments of the present application may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a Read-Only Memory (ROM), an Erasable Programmable Read-Only Memory (EPROM), a flash Memory, an optical fiber, a portable Compact Disc Read-Only Memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present application, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In this application, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wired, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present application. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
It should be noted that although in the above detailed description several modules or units of the device for action execution are mentioned, such a division is not mandatory. Indeed, the features and functionality of two or more modules or units described above may be embodied in one module or unit, according to embodiments of the application. Conversely, the features and functions of one module or unit described above may be further divided into embodiments by a plurality of modules or units.
Through the above description of the embodiments, those skilled in the art will readily understand that the exemplary embodiments described herein may be implemented by software, or by software in combination with necessary hardware. Therefore, the technical solution according to the embodiments of the present application can be embodied in the form of a software product, which can be stored in a non-volatile storage medium (which can be a CD-ROM, a usb disk, a removable hard disk, etc.) or on a network, and includes several instructions to enable a computing device (which can be a personal computer, a server, a touch terminal, or a network device, etc.) to execute the method according to the embodiments of the present application.
Other embodiments of the present application will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains.
It will be understood that the present application is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the application is limited only by the appended claims.
Claims (10)
1. A method for processing a service, comprising:
analyzing a service triggering request to obtain a request identifier and a type identifier carried in the service triggering request, wherein the request identifier is a unique identifier used for determining the service triggering request, and the type identifier is a unique identifier used for determining the service type;
acquiring a flow task sequence corresponding to the type identifier through a task scheduling node in a block chain network, and performing parameter configuration on the flow task sequence to generate a task scheduling graph with a directed acyclic graph structure; the flow task sequence comprises a plurality of flow tasks arranged according to a service flow sequence, and the task scheduling graph comprises vertexes corresponding to the flow tasks and edges used for representing scheduling relations among the flow tasks;
according to the connection relation of each vertex and the communication direction of each edge in the task scheduling graph, associating the flow task to be executed with the request identifier and then issuing the flow task to the block chain network so as to execute the flow task through the block chain nodes in the block chain network;
and when all the flow tasks in the task scheduling graph are executed, returning a service processing result to a sender of the service triggering request.
2. The traffic processing method according to claim 1, wherein performing the flow task through a blockchain link point in the blockchain network comprises:
each block chain node in the block chain network stores the flow task to a local task buffer pool;
judging whether the flow task in the task buffer pool meets the corresponding task triggering condition or not through a task triggering node in the block chain network;
when the flow task meets the task triggering condition, broadcasting a triggering message of the flow task to a block chain network;
and the block chain link points in the block chain network execute the flow tasks according to the trigger messages.
3. The traffic processing method according to claim 2, wherein executing the flow task according to the trigger message includes:
acquiring an intelligent contract address of a flow task corresponding to the trigger message through a task execution node in the block chain network;
calling an intelligent contract according to the intelligent contract address to execute the flow task;
and performing uplink processing on the execution result of the flow task to store the execution result of the flow task on a block chain.
4. The traffic processing method according to claim 3, wherein performing uplink processing on the execution result of the flow task includes:
when each block chain node in the block chain network receives an execution result broadcasted on the block chain network, determining a corresponding flow task according to a request identifier carried in the execution result, and writing the execution result and the flow task into a block to be packaged after performing association processing;
when the uplink condition is met, the task packing node broadcasts the packing information of the block to be packed to the block chain network so as to enable other block chain nodes in the block chain network to perform consensus authentication, and the block to be packed is linked to the block chain after the authentication is passed.
5. The traffic processing method according to claim 2, wherein after each blockchain node in the blockchain network saves the flow task to a local task buffer pool, the method further comprises:
monitoring the storage time of the flow task in the task buffer pool in real time;
when the storage time exceeds a time threshold, broadcasting a task synchronization request to a block chain network to update the execution state of the flow task;
if the execution state is execution completion, removing the flow task from the task buffer pool;
and if the execution state is not the completion of execution, marking the flow task as an abnormal task.
6. The service processing method according to claim 1, wherein returning a service transaction result to a sender of the service trigger request comprises:
monitoring the execution state of each flow task in the task scheduling graph through a task scheduling node in the block chain network;
and after all the flow tasks in the task scheduling graph are executed, performing association processing on a service transaction result and the request identifier and returning the service transaction result and the request identifier to a sender of the service triggering request.
7. The traffic processing method according to any one of claims 1 to 6, wherein after performing parameter configuration on the flow task sequence to generate a task scheduling graph having a directed acyclic graph structure, the method further comprises:
respectively acquiring a plurality of task processing nodes corresponding to each flow task in the task scheduling graph, and recording task response time of the task processing nodes, wherein the task processing nodes comprise a task trigger node, a task execution node and a task packing node;
mapping the task response duration of each task processing node to a color space to obtain a color characteristic value of the process task;
adding colors to the vertexes in the task scheduling graph according to the color characteristic values;
and performing color analysis on the task scheduling graph added with the color to determine an abnormal vertex in the task scheduling graph and an abnormal task processing node corresponding to the abnormal vertex.
8. A traffic processing apparatus, comprising:
the service triggering module is configured to send a service triggering request to a service server, wherein the service triggering request carries a request identifier and a type identifier;
the acquisition module is configured to acquire a flow task sequence corresponding to the type identifier through a task scheduling node in a block chain network, and perform parameter configuration on the flow task sequence to generate a task scheduling graph with a directed acyclic graph structure; the flow task sequence comprises a plurality of flow tasks arranged according to a service flow sequence, and the task scheduling graph comprises vertexes corresponding to the flow tasks and edges used for representing scheduling relations among the flow tasks;
the execution module is configured to associate the flow task to be executed with the request identifier and then issue the flow task to the block chain network according to the connection relation of each vertex and the communication direction of each edge in the task scheduling graph, so that the flow task is executed through a block chain link point in the block chain network;
and the return module is configured to return a service processing result to a sender of the service triggering request after all the flow tasks in the task scheduling graph are executed.
9. A computer-readable medium, characterized in that the computer-readable medium has stored thereon a computer program which, when being executed by a processor, carries out the service processing method of any one of claims 1 to 7.
10. An electronic device, comprising:
a processor; and
a memory for storing executable instructions of the processor;
wherein the processor is configured to cause the electronic device to perform the business processing method of any one of claims 1 to 7 via execution of the executable instructions.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111438937.3A CN114140075B (en) | 2021-11-30 | 2021-11-30 | Service processing method, device, medium and electronic equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111438937.3A CN114140075B (en) | 2021-11-30 | 2021-11-30 | Service processing method, device, medium and electronic equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114140075A true CN114140075A (en) | 2022-03-04 |
| CN114140075B CN114140075B (en) | 2024-05-14 |
Family
ID=80389640
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111438937.3A Active CN114140075B (en) | 2021-11-30 | 2021-11-30 | Service processing method, device, medium and electronic equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114140075B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116578380A (en) * | 2023-04-13 | 2023-08-11 | 浪潮智慧科技有限公司 | Cluster task scheduling method, device and medium of data acquisition tool |
| CN116820709A (en) * | 2023-05-26 | 2023-09-29 | 京信数据科技有限公司 | Task chain operation method, device, terminal and computer storage medium |
| CN117314659A (en) * | 2023-11-29 | 2023-12-29 | 中国人寿保险股份有限公司上海数据中心 | Management method of non-insurance documents |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180260909A1 (en) * | 2017-03-08 | 2018-09-13 | Alibaba Group Holding Limited | Handing requests in a consensus network |
| US20190236559A1 (en) * | 2018-01-31 | 2019-08-01 | Salesforce.Com, Inc. | Systems, methods, and apparatuses for implementing smart flow contracts using distributed ledger technologies in a cloud based computing environment |
| WO2020140649A1 (en) * | 2019-01-03 | 2020-07-09 | 深圳壹账通智能科技有限公司 | Blockchain smart contract management method and apparatus, electronic device and storage medium |
| CN113283987A (en) * | 2021-05-17 | 2021-08-20 | 网易（杭州）网络有限公司 | Service processing method, device, block chain gateway, block chain node and storage medium |
-
2021
- 2021-11-30 CN CN202111438937.3A patent/CN114140075B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180260909A1 (en) * | 2017-03-08 | 2018-09-13 | Alibaba Group Holding Limited | Handing requests in a consensus network |
| US20190236559A1 (en) * | 2018-01-31 | 2019-08-01 | Salesforce.Com, Inc. | Systems, methods, and apparatuses for implementing smart flow contracts using distributed ledger technologies in a cloud based computing environment |
| WO2020140649A1 (en) * | 2019-01-03 | 2020-07-09 | 深圳壹账通智能科技有限公司 | Blockchain smart contract management method and apparatus, electronic device and storage medium |
| CN113283987A (en) * | 2021-05-17 | 2021-08-20 | 网易（杭州）网络有限公司 | Service processing method, device, block chain gateway, block chain node and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 曹怀虎;张艳梅;王坚;李海峰;崔丽欣;: "DAG区块链中基于确定性退火技术的融合分割遗传任务调度算法", 中国科学:信息科学, no. 02, 29 February 2020 (2020-02-29), pages 103 - 116 * |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116578380A (en) * | 2023-04-13 | 2023-08-11 | 浪潮智慧科技有限公司 | Cluster task scheduling method, device and medium of data acquisition tool |
| CN116578380B (en) * | 2023-04-13 | 2024-01-23 | 浪潮智慧科技有限公司 | Cluster task scheduling method, device and medium of data acquisition tool |
| CN116820709A (en) * | 2023-05-26 | 2023-09-29 | 京信数据科技有限公司 | Task chain operation method, device, terminal and computer storage medium |
| CN116820709B (en) * | 2023-05-26 | 2024-06-11 | 京信数据科技有限公司 | Task chain operation method, device, terminal and computer storage medium |
| CN117314659A (en) * | 2023-11-29 | 2023-12-29 | 中国人寿保险股份有限公司上海数据中心 | Management method of non-insurance documents |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114140075B (en) | 2024-05-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114140075B (en) | Service processing method, device, medium and electronic equipment | |
| CN111813516B (en) | Resource control method and device, computer equipment and storage medium | |
| CN111294217B (en) | Alarm analysis method, device, system and storage medium | |
| CN113570468A (en) | Enterprise payment wind control service platform | |
| CN109711849B (en) | Ether house address portrait generation method and device, electronic equipment and storage medium | |
| CN117591025B (en) | Multi-source heterogeneous data processing system | |
| CN114995791A (en) | API (application program interface) polymerization method and device, electronic equipment and storage medium | |
| CN110022323A (en) | A kind of method and system of the cross-terminal real-time, interactive based on WebSocket and Redux | |
| CN114693226A (en) | Approval process construction method, device, equipment and storage medium | |
| CN114862282B (en) | Business and financial cooperative management method and system based on data analysis | |
| CN116662387A (en) | Service data processing method, device, equipment and storage medium | |
| CN114338051B (en) | Method, device, equipment and medium for acquiring random number by block chain | |
| CN113626217B (en) | Asynchronous message processing method, device, electronic equipment and storage medium | |
| CN117216736A (en) | Abnormal account identification method, data scheduling platform and graph computing platform | |
| CN115022722A (en) | Video monitoring method and device, electronic equipment and storage medium | |
| CN111400608B (en) | Data processing method and device, storage medium and electronic equipment | |
| CN114723239A (en) | Multi-party collaborative modeling method, device, equipment, medium and program product | |
| CN109214874B (en) | IP product operation data processing method, device, equipment and readable storage medium | |
| CN114648410A (en) | Stock staring method, apparatus, system, device and medium | |
| CN112559221A (en) | Intelligent list processing method, system, equipment and storage medium | |
| CN111861432A (en) | Virtual resource information updating method and device, server and storage medium | |
| CN111737729A (en) | Evaluation data storage method and system based on service data block chain | |
| CN110489988A (en) | A kind of calculation method and device of exposure sources quantity | |
| CN114362968B (en) | Method, device, equipment and medium for acquiring random number by block chain | |
| CN111629038B (en) | Virtual resource sharing processing method and device, server and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |