CN110609755A - Message processing method, device, equipment and medium for cross-block chain node - Google Patents
Message processing method, device, equipment and medium for cross-block chain node Download PDFInfo
- Publication number
- CN110609755A CN110609755A CN201910713843.9A CN201910713843A CN110609755A CN 110609755 A CN110609755 A CN 110609755A CN 201910713843 A CN201910713843 A CN 201910713843A CN 110609755 A CN110609755 A CN 110609755A
- Authority
- CN
- China
- Prior art keywords
- node
- message
- message queue
- request
- monitoring process
- 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.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/13—File access structures, e.g. distributed indices
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/10—File systems; File servers
- G06F16/16—File or folder operations, e.g. details of user interfaces specifically adapted to file systems
-
- 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/54—Interprogram communication
- G06F9/546—Message passing systems or structures, e.g. queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/54—Indexing scheme relating to G06F9/54
- G06F2209/548—Queue
Abstract
The invention provides a method, a device, equipment and a medium for processing a message of a cross-block chain node, and relates to the technical field of computers. The method comprises the following steps: starting a message queue monitoring process according to a starting node in a block chain, and establishing a node index area through the message queue monitoring process; acquiring a current message in a message queue of a block chain node through a message queue monitoring process; acquiring a target parameter of the current message according to the node index area, and calling a system interface according to the target parameter to configure a starting node through the node attribute of a request node corresponding to the current message; and updating the node label field in the target file corresponding to the request node through the node attribute of the start node so as to process the current message in the request node through a message queue monitoring process in the start node. The technical scheme of the embodiment of the invention can correctly update the node label field of the file when the request node is changed, thereby improving the efficiency of processing the message by the long connection process.
Description
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a method and an apparatus for processing a message of a cross-block chain node, an electronic device, and a computer-readable storage medium.
Background
With the rapid development of technology, the blockchain technology is more and more emphasized. The block chain technology (distributed ledger technology) is a decentralized distributed database technology and has the characteristics of openness, transparency, no tampering, trustiness and the like.
Currently, when processing a message queue, a blockchain node usually opens a long connection process for processing, and when detecting that a message to be processed appears in the message queue, processes the message. When a large number of messages enter the message queue at the same time, the messages in the message queue can be processed one by one through the long connection process. However, when the long connection process is started, the starting blockchain node is set as the "current node" by default, and an input/output program (IO program for short) updates the node tag field of the file by using the "current node", that is, regardless of which blockchain node initiates the request message to the front-end server, the node tag of the blockchain node which starts the long connection process is always marked during the file update, so the MQ (message queue) long connection scheme is only applicable to the case where the requesting blockchain node which initiates the message is consistent with the blockchain node which starts the long connection process.
It is to be noted that the information disclosed in the above background section is only for enhancement of understanding of the background of the present disclosure, and thus may include information that does not constitute prior art known to those of ordinary skill in the art.
Disclosure of Invention
Embodiments of the present invention provide a method for processing a message of a cross-block chain node, a device for processing a message of a cross-block chain node, an electronic device, and a computer-readable storage medium, so as to overcome, at least to a certain extent, the problems in the prior art that a node is requested to change when a long connection process processes a message queue, and a node tag field of a file cannot be updated, and a node handle capacity is limited.
Additional features and advantages of the invention will be set forth in the detailed description which follows, or may be learned by practice of the invention.
According to a first aspect of the embodiments of the present invention, a method for processing a message of a cross-block chain node is provided, including: starting a message queue monitoring process according to a starting node in a block chain, and creating a corresponding node index area through the message queue monitoring process; acquiring a current message in a message queue of the block chain node through the message queue monitoring process; acquiring a target parameter of the current message according to the node index area, and configuring a node attribute of the message queue monitoring process according to the target parameter and a request node corresponding to the current message; and updating the node tag field of the target file corresponding to the request node through the node attribute of the message queue monitoring process so as to process the current message in the request node through the message queue monitoring process.
In some example embodiments of the present invention, based on the foregoing solution, the obtaining, by the message queue monitoring process, a current message in the message queue of the blockchain node further includes: sequencing the messages to be processed in the message queue according to a preset rule to generate a sequence list; and sequentially acquiring the current messages in the message queue according to the sequence list through the message queue monitoring process.
In some example embodiments of the present invention, based on the foregoing solution, the creating, by the message queue monitoring process, a corresponding node index region includes: acquiring a preset system interface based on the message queue monitoring process; creating a node index area according to the system interface; the node index area is used for storing the corresponding relation between the request node of the message in the message queue and the node handle corresponding to the request node.
In some example embodiments of the present invention, based on the foregoing solution, the target parameter includes the node handle, and before the corresponding system interface is called according to the target parameter to configure the initiator node through the node attribute of the requesting node corresponding to the current message, the method further includes: judging whether the request node of the current message and the request node of the previous message in the message queue are the same node or not; and if the request node of the current message and the request node of the previous message in the message queue are determined to be the same node, updating a node tag field in a target file corresponding to the request node through the node attribute of the starting node so as to process the current message in the request node through the message queue monitoring process in the starting node.
In some example embodiments of the present invention, based on the foregoing solution, the target parameter includes a requesting node of the current message, and before the corresponding system interface is invoked according to the target parameter to configure the initiating node through a node attribute of the requesting node corresponding to the current message, the method further includes: if the request node of the current message is determined not to be the same node as the request node of the previous message in the message queue, calling the corresponding system interface to access the node index area according to the request node of the current message so as to obtain a node handle corresponding to the request node; and calling the corresponding system interface according to the node handle to configure the starting node through the node attribute of the requesting node of the current message, and updating the node tag field in the target file corresponding to the requesting node through the node attribute of the starting node so as to process the current message in the requesting node through the message queue monitoring process in the starting node.
In some example embodiments of the present invention, based on the foregoing solution, after the requesting node according to the current message calls the system interface to access the node index area, the method further includes: judging whether a node handle corresponding to the request node of the current message exists in the node index area; if the node index area has the node handle corresponding to the request node of the current message, acquiring the node handle of the request node of the current message from the node index area so as to call the corresponding system interface according to the node handle and configure the starting node through the node attribute of the request node corresponding to the current message; and if the node index area does not have the node handle corresponding to the request node of the current message, calling the corresponding system interface through the request node of the current message to create the node handle corresponding to the request node of the current message and storing the node handle into the node index area.
In some example embodiments of the present invention, based on the foregoing solution, processing the current message by the message queue monitoring process further includes: judging whether the current message is to be processed in the message queue or not based on the message queue monitoring process; if the current message exists in the message queue, processing the current message; and if the current message does not exist in the message queue, ending the message queue monitoring process.
According to a second aspect of the embodiments of the present invention, there is provided a message processing apparatus of a cross-blockchain node, including: the starting unit is used for starting a message queue monitoring process according to a starting node in the block chain and creating a corresponding node index area through the message queue monitoring process; an obtaining unit, configured to obtain, through the message queue monitoring process, a current message in a message queue of the block chain node; a change unit, configured to obtain a target parameter of the current message according to the node index area, and configure a node attribute of the message queue monitoring process according to the target parameter and a request node corresponding to the current message; and the processing unit is used for updating the node tag field of the target file corresponding to the request node through the node attribute of the message queue monitoring process so as to process the current message in the request node through the message queue monitoring process.
According to a third aspect of embodiments of the present invention, there is provided an electronic apparatus, including: a processor; and a memory having stored thereon computer readable instructions which, when executed by the processor, implement a method of message processing across blockchain nodes as described in any one of the preceding claims.
According to a fourth aspect of embodiments of the present invention, there is provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, implements a method of message processing across blockchain nodes according to any one of the above.
The technical scheme provided by the embodiment of the invention has the following beneficial effects:
in the message processing method of the cross-block chain node in the exemplary embodiment of the invention, a starting node in a block chain starts a message queue monitoring process and creates a corresponding node index area, a current message in a message queue is read according to the message queue monitoring process, a target parameter of the current message is obtained in the node index area, a corresponding system interface is called according to the target parameter, the starting node is configured through the node attribute of a request node corresponding to the current message, and the current message is processed through the changed message queue monitoring process in the starting node. On one hand, the target parameters of the current message are obtained in the node index area, the corresponding system interface is called through the target parameters, and the starting node is configured through the node attributes of the request node corresponding to the current message, so that the problem that the link point of the request block and the link point of the block starting the long connection process are required to be consistent is avoided, and the efficiency of processing the message queue by the long connection process is improved; on the other hand, when the message queue is processed by using a long connection process, the node label field of the file can be correctly updated even if the request node is changed; on the other hand, the node handle of the same node can be reused by creating the node index area storage node and the node handle, and the problem that the capacity of the node handle is limited is solved.
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 invention, as claimed.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the invention and together with the description, serve to explain the principles of the invention. It is obvious that the drawings in the following description are only some embodiments of the invention, and that for a person skilled in the art, other drawings can be derived from them without inventive effort. In the drawings:
FIG. 1 schematically illustrates a schematic diagram of a cross blockchain interaction system in accordance with some embodiments of the present invention;
FIG. 2 schematically illustrates a schematic diagram of a message processing method across blockchain nodes, in accordance with some embodiments of the present invention;
FIG. 3 schematically illustrates a message processing flow across blockchain nodes, in accordance with some embodiments of the present invention;
FIG. 4 schematically illustrates a schematic diagram of a message processing apparatus across blockchain nodes, in accordance with some embodiments of the present invention;
FIG. 5 schematically illustrates a structural schematic of a computer system of an electronic device according to some embodiments of the invention;
FIG. 6 schematically illustrates a schematic diagram of a computer-readable storage medium according to some embodiments of the invention.
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 provide a thorough understanding of embodiments of the invention. One skilled in the relevant art will recognize, however, that the invention may 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 invention.
Furthermore, the drawings are merely schematic illustrations and are not necessarily drawn to scale. 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.
In one solution, a cross-blockchain interaction system and a communication solution are provided, for example, as shown in fig. 1, fig. 1 schematically illustrates a schematic diagram of a cross-blockchain interaction system according to some embodiments of the present invention. In the technical scheme, the subscription client corresponds to a block chain node in a first block chain and is used for maintaining a message queue corresponding to the block chain node, wherein the message queue contains messages subscribed by the block chain node. And the release client corresponds to the second block chain and is used for acquiring and releasing the message generated by the second block chain. The cross-chain interaction terminal is used for acquiring a subscription condition of a block chain node in the first block chain, and when the tail of the message queue contains a message meeting the subscription condition, requesting the message meeting the subscription condition from a publishing client and sending the message to the subscribing client so as to update the message into the message queue, so that the block chain node in the first block chain can pull the message from the message queue.
When processing a Message Queue (MQ), a block chain node of a subscribing client typically starts a long connection process to process, and when detecting that a message to be processed appears in the message queue, processes the message. When a large number of messages enter the message queue at the same time, the messages in the message queue can be processed one by one through the long connection process. However, when the long connection process is started, the starting block chain node is set as the "current node" by default, and an Input/Output program (IO program for short) updates the node tag field of the file using the "current node", that is, no matter which block chain link point initiates a request message to the front-end server, the node tag of the block chain node which starts the long connection process is always set when the file is updated, so this message queue long connection scheme is only applicable to a case where the block chain link point which initiates the request message is consistent with the block chain link point which starts the long connection process.
Based on this, in the present exemplary embodiment, a message processing method of a cross-blockchain node is first provided, and fig. 2 schematically illustrates a schematic diagram of a message processing method of a cross-blockchain node according to some embodiments of the present invention. Referring to fig. 2, the message processing method of the trans-blockchain node may include the following steps:
step S210, starting a message queue monitoring process according to a starting node in a block chain, and creating a corresponding node index area through the message queue monitoring process;
step S220, obtaining the current message in the message queue of the block chain node through the message queue monitoring process;
step S230, obtaining a target parameter of the current message according to the node index area, and calling a corresponding system interface according to the target parameter to configure the starting node through the node attribute of the request node corresponding to the current message;
step S240, updating a node tag field in a target file corresponding to the request node according to the node attribute of the start node, so as to process the current message in the request node through the message queue monitoring process in the start node.
According to the message processing method of the trans-block chain node in the embodiment, on one hand, the target parameter of the current message is obtained in the node index area, the corresponding system interface is called through the target parameter, and the starting node is configured through the node attribute of the request node corresponding to the current message, so that the problem that the link point of the request block is consistent with the link point of the block starting the long connection process is avoided, and the message queue processing efficiency of the long connection process is improved; on the other hand, when the message queue is processed by using a long connection process, the node label field of the file can be correctly updated even if the request node is changed; on the other hand, the node handle of the same node can be reused by creating the node index area storage node and the node handle, and the problem that the capacity of the node handle is limited is solved.
Next, a message processing method of a cross-blockchain node in the present exemplary embodiment will be further described.
In step S210, a message queue monitoring process is started according to the starting node in the block chain, and a corresponding node index area is created through the message queue monitoring process.
In some example embodiments of the present invention, the starting node may refer to a node in the blockchain corresponding to starting the message queue monitoring process, and the starting node may be a client in a blockchain, for example, as described with reference to fig. 1, and the blockchain node may be a subscribing client corresponding to the first blockchain, which is not particularly limited in this disclosure. The message queue monitoring process may refer to a process for monitoring and processing messages in a message queue, for example, the message queue monitoring process may be a long connection process, and specifically, starting a message queue monitoring process may be starting a long connection process corresponding to a message queue. In this exemplary embodiment, the long connection process is relative to the short connection process, that is, the long connection process may continuously monitor the message queue, and take out the unprocessed message for processing as soon as the unprocessed message is found, until the message in the message queue is processed. Of course, the message queue monitoring process may also be a short connection process, and specifically, starting a message queue monitoring process may be starting one or more short connection processes corresponding to the message queue. The short connection process is a process separately generated for a certain message, and is terminated after the message is processed. The node index area may be used to store a request node of a message in the message queue and a corresponding relationship between the request node and a node handle corresponding to the request node, and the node index area may be understood as a memory area, which is not particularly limited in this example embodiment.
Specifically, the message queue monitoring process acquires a preset system interface, and creates a node index area according to the system interface. The system interface may be pre-stored in a storage device of the client corresponding to the start node, or may be configured by a developer, which is not particularly limited in the present invention. After the system starts a node and starts a message queue monitoring process, a system interface is called through the message queue monitoring process and a node index area is created through the system interface. For example, suppose that there are currently 2 messages a and B to be processed in the message queue, which respectively correspond to a request node a initiating the message a and a request node B initiating the message B, the request node a may correspondingly create a node handle a and the request node B may correspondingly create a node handle B, and the node index area stores the corresponding relationship between the request node a and the node handle a, and between the request node B and the node handle B. Of course, this is merely an illustration and should not impose any particular limitation on the disclosure.
In step S220, the current message in the message queue of the blockchain node is obtained through the message queue monitoring process.
In some example embodiments of the present invention, the current message may refer to a message to be processed with the logical position at the top in the message queue, i.e., the current message is not a fixed message but is dynamically changed. For example, a message to be processed a, a message to be processed B, and a message to be processed C are prioritized in a message queue, and the logical position of the message to be processed a in the message queue is at the top, so the message to be processed a is considered to be the current message; arranging the message C to be processed, the message A to be processed and the message B to be processed according to the sequence of entering the message queue, wherein the logic position of the message C to be processed in the message queue is at the top, so that the message C to be processed is considered as the current message.
Specifically, messages to be processed in a message queue are sorted according to a preset rule to generate a sequence list, and current messages in the message queue are sequentially acquired according to the sequence list through the message queue monitoring process. The preset rule may refer to a rule for ordering messages to be processed, which is set by a user in advance, for example, the preset rule may be a priority of the messages to be processed in the message queue, or may be a sequence according to which the messages enter the message queue, which is not particularly limited in the present invention. The messages to be processed in the message queue are processed after being sorted according to a preset rule (the messages in the message queue can only be processed one by a long connection process), for example, the messages to be processed are processed according to the priority of the messages to be processed in the message queue. Of course, the messages to be processed may also be processed one by one directly according to the time sequence of the messages to be processed entering the message queue, and the invention does not specially limit this. And the message queue monitoring process acquires the current message in the generated sequence list or acquires the current message according to the time sequence of the messages to be processed entering the message queue.
In step S230, a target parameter of the current message is obtained according to the node index area, and a corresponding system interface is called according to the target parameter to configure the start node according to the node attribute of the request node corresponding to the current message.
In some example embodiments of the present invention, the target parameter may refer to an input parameter associated with the current message and used for invoking a system interface, for example, the target parameter may be a node handle corresponding to a request node of the current message, or may be the request node of the current message (the request node of the current message obtains the corresponding node handle in a node index, and then the node handle is used as the input parameter for invoking the system interface). The node attribute may include attribute information such as a name of the node, a value of the node, and a type of the node, and the system may allocate services such as an operation resource to the node according to the node attribute. And the message queue monitoring process calls a corresponding system interface according to the target parameter, and the system interface configures a starting node through the node attribute of the request node corresponding to the current message.
When processing the message queue, the system starts a long connection process through the starting node in the block chain to process the message, and when a large number of messages in the message queue enter the message queue, the messages in the message queue can be processed one by one through the long connection process. However, when the long connection process starts up the start node, the start node is set as the "current node" by default, and an input/output program (IO program for short) updates the node tag field of the file using the "current node", that is, the node tag of the start node that starts the long connection process is always marked when the file is updated, regardless of which request node that initiates the request message to the front-end server is. At this time, the long connection process may process the current message of the requesting node at the start node, and due to the inconsistency of the node attributes, the long connection process may fail to process the current message or may have low efficiency in processing the message. Therefore, the start node needs to be configured according to the node attribute of the request node corresponding to the current message through the node handle, so that the input/output program can correctly update the node tag field corresponding to the request node according to the node attribute of the start node, and the long connection process in the start node can accurately and quickly process the current message in the request node.
Specifically, whether a request node of a current message and a request node of a previous message in a message queue are the same node is judged; and if the request node of the current message and the request node of the previous message in the message queue are determined to be the same node, updating a node tag field in a target file corresponding to the request node through the node attribute of the starting node so as to process the current message in the request node through the message queue monitoring process in the starting node. The previous message may refer to a message that has been processed by the message queue monitoring process adjacent to the position of the current message in the message queue. For example, a message a to be processed, a message B to be processed, and a message C to be processed are arranged in a message queue according to priority, where the message a to be processed is a current message, and after the message queue monitoring process finishes processing the message a to be processed, the message B to be processed is the current message, and the processed message a is a previous message. The object file may refer to a compiled code corresponding to the requesting node, and the node tag field is stored in the object file. The node label field can comprise a node attribute value, a node label name and the like, and the node label field of the target file of the request node is changed according to the node attribute of the message queue monitoring process, so that the starting node of the long connection process started by the message queue monitoring process can be consistent with the request node of the current message, and the long connection process can better process the current message.
When the message queue monitoring process judges that the request node of the current message is the same as the request node of the previous message in the message queue, the node attribute of the current node is considered to be the same as the node attribute of the previous message, so that the node attribute of the starting node corresponding to the message queue monitoring process is not required to be updated, the node tag field in the target file corresponding to the request node is directly updated through the node attribute of the starting node, and the current message in the request node is processed through the message queue monitoring process in the starting node.
Optionally, if the message queue monitoring process determines that the requesting node of the current message is not the same node as the requesting node of the previous message in the message queue, it is considered that the node attributes of the requesting node of the current message are different from those of the requesting node of the previous message, so that the node attribute corresponding to the starting node corresponding to the message queue monitoring process needs to be updated first when the current message is processed. Therefore, the message queue monitoring process takes the request node of the current message as a target parameter (input parameter), calls a corresponding system interface to access the node index area to obtain the node handle of the request node of the current message, calls a corresponding system interface according to the node handle, obtains the node attribute of the request node of the current message by the system interface, configures a start node through the node attribute of the request node, and then updates the node tag field in the target file corresponding to the request node through the node attribute of the start node so as to process the current message in the request node through the message queue monitoring process in the start node.
Further, the message queue monitoring process judges whether a node handle corresponding to the request node of the current message exists in the node index area; if the node handle corresponding to the request node of the current message exists in the node index area, the node handle corresponding to the request node of the current message is directly obtained from the node index area, the request node (which can contain node attributes) of the current message is obtained according to the node handle corresponding to the request node of the current message, and a starting node corresponding to the message queue monitoring process is configured according to the node attributes of the request node of the current message, so that the message queue monitoring process can correctly process the current message in the message queue, and the message processing efficiency is improved.
Optionally, if it is determined that the node index area does not have the node handle corresponding to the request node of the current message, the message queue monitoring process calls the corresponding system interface to create the node handle corresponding to the request node of the current message by using the request node of the current message as a target parameter (input parameter), and stores the node handle in the node index area. And a node handle corresponding to a request node of the current message which does not exist in the original node index area is created in the node index area by calling a corresponding system interface, and the node index area is continuously perfected, so that the messages of the same request node are processed subsequently, and the message processing efficiency is further improved.
In step S240, the node tag field in the target file corresponding to the requesting node is updated according to the node attribute of the initiating node, so as to process the current message in the requesting node through the message queue monitoring process in the initiating node.
In some example embodiments of the present invention, the node tag field may include a node attribute value, a node tag name, and the like, and the node tag field of the target file of the requesting node is modified according to the node attribute of the message queue monitoring process, so that the initiating node of the long connection process initiated by the message queue monitoring process and the requesting node of the current message can be kept consistent, so that the long connection process can better process the current message. The object file may refer to a compiled code corresponding to the requesting node, and the node tag field is stored in the object file.
Optionally, the message queue monitoring process may determine whether there is a message to be processed in the message queue, and if there is a message to be processed in the message queue, determine whether to allow obtaining the message in the message queue: if the to-be-processed message is allowed to be acquired, processing the to-be-processed message in the message queue; if the acquisition is not allowed, ending the message queue monitoring process; if no messages are pending, the message queue monitoring process may enter an infinite wait mode until a pending message appears in the message queue.
Referring to fig. 3, fig. 3 schematically illustrates a message processing flow across blockchain nodes according to some embodiments of the present invention, and the steps in the diagram are described in detail below.
Step S301, a message queue monitoring process is started at a start node in the block chain.
Step S302, after the message queue monitoring process is started, the message queue monitoring process calls a corresponding system interface to create a node index area, and the node index area may be stored in a storage area of the client corresponding to the block link point.
Step S303, the message queue monitoring process may determine whether there is a message to be processed in the message queue, if there is a message to be processed in the message queue, determine whether to allow to acquire the message in the message queue, and if so, perform step S304; if acquisition is not allowed, the message queue monitoring process ends.
In step S304, the message queue monitoring process reads the current message from the message queue.
Step S305, the message queue monitoring process judges whether the request node of the current message and the request node of the previous message in the message queue are the same node, if the request node of the current message and the request node of the previous message in the message queue are the same node, step S312 is carried out; if it is determined that the requesting node of the current message is not the same node as the requesting node of the previous message in the message queue, step S306 is performed.
Step S306, the message queue monitoring process takes the request node of the current message as an input parameter, and invokes a corresponding system interface to access the node index area to obtain the node attribute of the request node of the current message.
Step S307, the message queue monitoring process judges whether a node handle corresponding to the request node of the current message exists in the node index area; if the node handle corresponding to the request node of the current message exists in the node index area, the step S308 is performed; if it is determined that the node handle corresponding to the request node of the current message does not exist in the node index area, step S309 is performed.
Step S308, the message queue monitoring process obtains the node handle corresponding to the current message request node from the node index area.
Step S309, the message queue monitoring process calls a corresponding system interface with the request node of the current message as an input parameter, and creates a node handle corresponding to the request node of the current message according to the system interface.
In step S310, the message queue monitoring process calls a corresponding system interface to store the message node and the created node handle in the node index area.
Step S311, the message queue monitoring process uses the node handle as an input parameter, calls a corresponding system interface to obtain a node attribute of a request node corresponding to the current message, and configures a start node according to the node attribute of the request node.
Step S312, the system calls the message queue monitoring process to process the message, and changes the node label field of the file according to the node attribute of the starting node corresponding to the message queue monitoring process.
It is noted that although the steps of the methods of the present invention are depicted in the drawings in a particular order, this does not require or imply that the steps must be performed in this particular order, or that all of the depicted 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.
In addition, in the present exemplary embodiment, a message processing apparatus of a cross-blockchain node is also provided. Referring to fig. 4, the message processing apparatus 400 of the cross-blockchain node includes: the starting unit 410 is configured to start a message queue monitoring process according to a starting node in a block chain, and create a corresponding node index region through the message queue monitoring process; the obtaining unit 420 is configured to obtain, through the message queue monitoring process, a current message in the message queue of the block chain node; the changing unit 430 is configured to obtain a target parameter of the current message according to the node index area, and configure a node attribute of the message queue monitoring process according to the target parameter and a request node corresponding to the current message; the processing unit 440 is configured to update a node tag field of a target file corresponding to the requesting node through a node attribute of the message queue monitoring process, so as to process the current message in the requesting node through the message queue monitoring process.
In an exemplary embodiment of the present invention, based on the foregoing scheme, the obtaining unit 420 is configured to: sequencing the messages to be processed in the message queue according to a preset rule to generate a sequence list; and sequentially acquiring the current messages in the message queue according to the sequence list through the message queue monitoring process.
In an exemplary embodiment of the present invention, based on the foregoing scheme, the starting unit 410 is configured to: acquiring a preset system interface based on the message queue monitoring process; creating a node index area according to the system interface; the node index area is used for storing the corresponding relation between the request node of the current message in the message queue and the node handle of the request node.
In an exemplary embodiment of the present invention, based on the foregoing scheme, the changing unit 430 includes: a judging unit, configured to judge whether the requesting node of the current message and the requesting node of the previous message in the message queue are the same node; and the node attribute modifying unit is used for directly updating a node tag field in a target file corresponding to the request node through the node attribute of the starting node if the request node of the current message and the request node of the previous message in the message queue are determined to be the same node, so that the current message in the request node is processed through the message queue monitoring process in the starting node.
In an exemplary embodiment of the present invention, based on the foregoing scheme, the node attribute modification unit includes: an access unit, configured to, if it is determined that the request node of the current message is not the same node as the request node of the previous message in the message queue, call, according to the request node of the current message, the corresponding system interface to access the node index area to obtain a node handle corresponding to the request node; and calling the corresponding system interface according to the node handle to configure the starting node through the node attribute of the requesting node of the current message, and updating the node tag field in the target file corresponding to the requesting node through the node attribute of the starting node so as to process the current message in the requesting node through the message queue monitoring process in the starting node.
In an exemplary embodiment of the present invention, based on the foregoing scheme, the message processing apparatus 400 of the inter-blockchain node is configured to: judging whether a node handle corresponding to the request node of the current message exists in the node index area; if the node index area has the node handle corresponding to the request node of the current message, acquiring the node handle of the request node of the current message from the node index area so as to call the corresponding system interface according to the node handle and configure the starting node through the node attribute of the request node corresponding to the current message; and if the node index area does not have the node handle corresponding to the request node of the current message, calling the corresponding system interface through the request node of the current message to create the node handle corresponding to the request node of the current message and storing the node handle into the node index area.
In an exemplary embodiment of the present invention, based on the foregoing scheme, the processing unit 440 is configured to: judging whether the current message is to be processed in the message queue or not based on the message queue monitoring process; if the current message exists in the message queue, processing the current message; and if the current message does not exist in the message queue, ending the message queue monitoring process.
The specific details of each module of the message processing apparatus of the inter-block chain node have been described in detail in the corresponding message processing method of the inter-block chain node, and therefore are not described herein again.
It should be noted that although in the above detailed description several modules or units of the message processing apparatus across blockchain nodes are mentioned, this 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 invention. 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.
In addition, in an exemplary embodiment of the present disclosure, an electronic device capable of implementing the message processing method of the cross-block chain node is also provided.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system, method or program product. Thus, various aspects of the invention may be embodied in the form of: an entirely hardware embodiment, an entirely software embodiment (including firmware, microcode, etc.) or an embodiment combining hardware and software aspects that may all generally be referred to herein as a "circuit," module "or" system.
An electronic device 500 according to such an embodiment of the invention is described below with reference to fig. 5. The electronic device 500 shown in fig. 5 is only an example and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 5, the electronic device 500 is embodied in the form of a general purpose computing device. The components of the electronic device 500 may include, but are not limited to: the at least one processing unit 510, the at least one memory unit 520, a bus 530 connecting various system components (including the memory unit 520 and the processing unit 510), and a display unit 540.
Wherein the storage unit stores program code that is executable by the processing unit 510 to cause the processing unit 510 to perform steps according to various exemplary embodiments of the present invention as described in the above section "exemplary methods" of the present specification. For example, the processing unit 510 may execute step S210 shown in fig. 2, start a message queue monitoring process according to a starting node in a block chain, and create a corresponding node index region through the message queue monitoring process; step S220, obtaining the current message in the message queue of the block chain node through the message queue monitoring process; step S230, obtaining a target parameter of the current message according to the node index area, and configuring a node attribute of the message queue monitoring process according to the target parameter and a request node corresponding to the current message; step S240, updating the node tag field of the target file corresponding to the request node through the node attribute of the message queue monitoring process, so as to process the current message in the request node through the message queue monitoring process.
The storage unit 520 may include readable media in the form of volatile storage units, such as a random access memory unit (RAM)521 and/or a cache memory unit 522, and may further include a read only memory unit (ROM) 523.
The storage unit 520 may also include a program/utility 524 having a set (at least one) of program modules 525, such program modules 525 including, but not limited to: an operating system, one or more application programs, other program modules, and program data, each of which, or some combination thereof, may comprise an implementation of a network environment.
Bus 530 may be one or more of any of several types of bus structures including a memory unit bus or memory unit controller, a peripheral bus, an accelerated graphics port, a processing unit, or a local bus using any of a variety of bus architectures.
The electronic device 500 may also communicate with one or more external devices 570 (e.g., keyboard, pointing device, Bluetooth device, etc.), with one or more devices that enable a user to interact with the electronic device 500, and/or with any devices (e.g., router, modem, etc.) that enable the electronic device 500 to communicate with one or more other computing devices. Such communication may occur via input/output (I/O) interfaces 550. Also, the electronic device 500 may communicate with one or more networks (e.g., a Local Area Network (LAN), a Wide Area Network (WAN), and/or a public network, such as the internet) via the network adapter 560. As shown, the network adapter 560 communicates with the other modules of the electronic device 500 over the bus 530. It should be appreciated that although not shown in the figures, other hardware and/or software modules may be used in conjunction with the electronic device 500, including but not limited to: microcode, device drivers, redundant processing units, external disk drive arrays, RAID systems, tape drives, and data backup storage systems, among others.
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 disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may 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 may be a personal computer, a server, a terminal device, or a network device, etc.) to execute the method according to the embodiments of the present disclosure.
In an exemplary embodiment of the present disclosure, there is also provided a computer-readable storage medium having stored thereon a program product capable of implementing the above-described method of the present specification. In some possible embodiments, aspects of the invention may also be implemented in the form of a program product comprising program code means for causing a terminal device to carry out the steps according to various exemplary embodiments of the invention described in the above-mentioned "exemplary methods" section of the present description, when said program product is run on the terminal device.
Referring to fig. 6, a program product 600 for implementing the above message processing method for a node of a cross blockchain according to an embodiment of the present invention is described, which may employ a portable compact disc read only memory (CD-ROM) and include program codes, and may be run on a terminal device, such as a personal computer. However, the program product of the present invention is not limited in this regard and, in the present document, a 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.
The program product may employ any combination of one or more readable media. The readable medium may be a readable signal medium or a readable storage medium. A 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 (a non-exhaustive list) of the readable storage medium include: an electrical connection having one or more wires, a portable disk, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or 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.
A computer readable signal medium may include a propagated data signal with 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 readable signal medium may also be any readable medium that is not a 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 readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wireline, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, C + + or the like and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computing device, partly on the user's device, as a stand-alone software package, partly on the user's computing device and partly on a remote computing device, or entirely on the remote computing device or server. In the case of a remote computing device, the remote computing device may be connected to the user computing device through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computing device (e.g., through the internet using an internet service provider).
Furthermore, the above-described figures are merely schematic illustrations of processes involved in methods according to exemplary embodiments of the invention, and are not intended to be limiting. It will be readily understood that the processes shown in the above figures are not intended to indicate or limit the chronological order of the processes. In addition, it is also readily understood that these processes may be performed synchronously or asynchronously, e.g., in multiple modules.
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 disclosure may be embodied in the form of a software product, which may be stored in a non-volatile storage medium (which may 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 may 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 disclosure.
Other embodiments of the disclosure will be apparent to those skilled in the art from consideration of the specification and practice of the disclosure disclosed herein. This application is intended to cover any variations, uses, or adaptations of the disclosure following, in general, the principles of the disclosure and including such departures from the present disclosure as come within known or customary practice within the art to which the disclosure pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the disclosure being indicated by the following claims.
It will be understood that the present disclosure 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 present disclosure is limited only by the appended claims.
Claims (10)
1. A message processing method of a cross-block chain node is characterized by comprising the following steps:
starting a message queue monitoring process according to a starting node in a block chain, and creating a corresponding node index area through the message queue monitoring process;
acquiring a current message in a message queue of the block chain node through the message queue monitoring process;
acquiring a target parameter of the current message according to the node index area, and calling a corresponding system interface according to the target parameter to configure the starting node through the node attribute of the request node corresponding to the current message;
and updating a node tag field in a target file corresponding to the request node through the node attribute of the starting node so as to process the current message in the request node through the message queue monitoring process in the starting node.
2. The method of claim 1, wherein obtaining, by the message queue monitoring process, a current message in the message queue of the blockchain node further comprises:
sequencing the messages to be processed in the message queue according to a preset rule to generate a sequence list;
and sequentially acquiring the current messages in the message queue according to the sequence list through the message queue monitoring process.
3. The method of claim 1, wherein the creating, by the message queue monitoring process, the corresponding node index region comprises:
acquiring a preset system interface based on the message queue monitoring process;
creating a corresponding node index area according to the system interface; the node index area is used for storing the corresponding relation between the request node of the current message in the message queue and the node handle of the request node.
4. The method of claim 3, wherein the target parameter comprises the node handle, and before invoking the corresponding system interface according to the target parameter to configure the initiator node with the node attribute of the requesting node corresponding to the current message, the method further comprises:
judging whether the request node of the current message and the request node of the previous message in the message queue are the same node or not;
if the request node of the current message and the request node of the previous message in the message queue are determined to be the same node, directly updating a node tag field in a target file corresponding to the request node through the node attribute of the starting node so as to process the current message in the request node through the message queue monitoring process in the starting node.
5. The method of claim 4, wherein the target parameter comprises a requesting node of the current message, and before invoking a corresponding system interface according to the target parameter to configure the initiating node by a node attribute of the requesting node corresponding to the current message, the method further comprises:
if the request node of the current message is determined not to be the same node as the request node of the previous message in the message queue, calling the corresponding system interface to access the node index area according to the request node of the current message so as to obtain a node handle corresponding to the request node;
and calling the corresponding system interface according to the node handle to configure the starting node through the node attribute of the requesting node of the current message, and updating the node tag field in the target file corresponding to the requesting node through the node attribute of the starting node so as to process the current message in the requesting node through the message queue monitoring process in the starting node.
6. The method of claim 5, wherein after the corresponding system interface is called to access the node index area according to the requesting node of the current message, the method further comprises:
judging whether a node handle corresponding to the request node of the current message exists in the node index area;
if the node index area has the node handle corresponding to the request node of the current message, acquiring the node handle of the request node of the current message from the node index area so as to call the corresponding system interface according to the node handle and configure the starting node through the node attribute of the request node corresponding to the current message;
and if the node index area does not have the node handle corresponding to the request node of the current message, calling the corresponding system interface through the request node of the current message to create the node handle corresponding to the request node of the current message and storing the node handle into the node index area.
7. The method of claim 1, wherein processing the current message by the message queue monitoring process further comprises:
judging whether the current message is to be processed in the message queue or not based on the message queue monitoring process;
if the current message exists in the message queue, processing the current message;
and if the current message does not exist in the message queue, ending the message queue monitoring process.
8. A message processing apparatus across blockchain nodes, comprising:
the starting unit is used for starting a message queue monitoring process according to a starting node in the block chain and creating a corresponding node index area through the message queue monitoring process;
an obtaining unit, configured to obtain, through the message queue monitoring process, a current message in a message queue of the block chain node;
a change unit, configured to obtain a target parameter of the current message according to the node index area, and invoke a corresponding system interface according to the target parameter to configure the start node according to a node attribute of a request node corresponding to the current message;
and the processing unit is used for updating the node tag field in the target file corresponding to the request node through the node attribute of the starting node so as to process the current message in the request node through the message queue monitoring process in the starting node.
9. An electronic device, comprising:
a processor; and
a memory having stored thereon computer readable instructions which, when executed by the processor, implement a method of message processing across blockchain nodes as claimed in any one of claims 1 to 7.
10. A computer-readable medium, on which a computer program is stored which, when being executed by a processor, carries out a method of message processing across blockchain nodes according to any one of claims 1 to 7.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910713843.9A CN110609755A (en) | 2019-08-02 | 2019-08-02 | Message processing method, device, equipment and medium for cross-block chain node |
| PCT/CN2019/118085 WO2021022714A1 (en) | 2019-08-02 | 2019-11-13 | Message processing method for cross-block chain node, device, apparatus and medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910713843.9A CN110609755A (en) | 2019-08-02 | 2019-08-02 | Message processing method, device, equipment and medium for cross-block chain node |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110609755A true CN110609755A (en) | 2019-12-24 |
Family
ID=68890909
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910713843.9A Pending CN110609755A (en) | 2019-08-02 | 2019-08-02 | Message processing method, device, equipment and medium for cross-block chain node |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN110609755A (en) |
| WO (1) | WO2021022714A1 (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111510484A (en) * | 2020-04-10 | 2020-08-07 | 金蝶软件（中国）有限公司 | Block chain processing method, system, device, computer equipment and storage medium |
| CN111930443A (en) * | 2020-10-15 | 2020-11-13 | 杭州云链趣链数字科技有限公司 | Operation and maintenance method, system, computer equipment and storage medium based on block chain |
| CN111967229A (en) * | 2020-09-01 | 2020-11-20 | 申建常 | Efficient label type data analysis method and analysis system |
| US11388229B2 (en) * | 2020-09-25 | 2022-07-12 | Alipay (Hangzhou) Information Technology Co., Ltd. | Methods and apparatuses for transmitting messages |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110046036A (en) * | 2018-12-25 | 2019-07-23 | 阿里巴巴集团控股有限公司 | A kind of operation requests distribution method, device and equipment |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107632893A (en) * | 2016-08-11 | 2018-01-26 | 泰康保险集团股份有限公司 | Message queue processing method and processing device |
| CN108415784A (en) * | 2018-02-27 | 2018-08-17 | 阿里巴巴集团控股有限公司 | The exchange method and device, system, electronic equipment of transregional piece of chain |
| CN109634800A (en) * | 2018-10-19 | 2019-04-16 | 深圳平安财富宝投资咨询有限公司 | Data processing method, system, terminal and readable storage medium storing program for executing |
| WO2019100991A1 (en) * | 2017-11-27 | 2019-05-31 | 北京京东金融科技控股有限公司 | Information processing method, device and system, storage medium, and electronic device |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107609010A (en) * | 2017-07-27 | 2018-01-19 | 北京瑞卓喜投科技发展有限公司 | Information processing method and device based on block chain technology |
| US20190197130A1 (en) * | 2017-12-21 | 2019-06-27 | Microsoft Technology Licensing, Llc | Ensuring consistency in distributed incremental content publishing |
| CN109995666A (en) * | 2019-04-12 | 2019-07-09 | 深圳市元征科技股份有限公司 | A kind of method for message transmission and relevant apparatus |
-
2019
- 2019-08-02 CN CN201910713843.9A patent/CN110609755A/en active Pending
- 2019-11-13 WO PCT/CN2019/118085 patent/WO2021022714A1/en active Application Filing
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107632893A (en) * | 2016-08-11 | 2018-01-26 | 泰康保险集团股份有限公司 | Message queue processing method and processing device |
| WO2019100991A1 (en) * | 2017-11-27 | 2019-05-31 | 北京京东金融科技控股有限公司 | Information processing method, device and system, storage medium, and electronic device |
| CN108415784A (en) * | 2018-02-27 | 2018-08-17 | 阿里巴巴集团控股有限公司 | The exchange method and device, system, electronic equipment of transregional piece of chain |
| CN109634800A (en) * | 2018-10-19 | 2019-04-16 | 深圳平安财富宝投资咨询有限公司 | Data processing method, system, terminal and readable storage medium storing program for executing |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111510484A (en) * | 2020-04-10 | 2020-08-07 | 金蝶软件（中国）有限公司 | Block chain processing method, system, device, computer equipment and storage medium |
| CN111967229A (en) * | 2020-09-01 | 2020-11-20 | 申建常 | Efficient label type data analysis method and analysis system |
| US11388229B2 (en) * | 2020-09-25 | 2022-07-12 | Alipay (Hangzhou) Information Technology Co., Ltd. | Methods and apparatuses for transmitting messages |
| US11924276B2 (en) | 2020-09-25 | 2024-03-05 | Alipay (Hangzhou) Information Technology Co., Ltd. | Methods and apparatuses for transmitting messages |
| CN111930443A (en) * | 2020-10-15 | 2020-11-13 | 杭州云链趣链数字科技有限公司 | Operation and maintenance method, system, computer equipment and storage medium based on block chain |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2021022714A1 (en) | 2021-02-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110609755A (en) | Message processing method, device, equipment and medium for cross-block chain node | |
| CN106815031B (en) | Kernel module loading method and device | |
| CN110413384B (en) | Delay task processing method and device, storage medium and electronic equipment | |
| CN110659142A (en) | Message queue processing method and device, electronic equipment and storage medium | |
| CN108279882B (en) | Framework generation method, device, equipment and computer readable medium | |
| CN110162344B (en) | Isolation current limiting method and device, computer equipment and readable storage medium | |
| CN111538659B (en) | Interface testing method, system, electronic equipment and storage medium of business scene | |
| CN109828830B (en) | Method and apparatus for managing containers | |
| CN109343970B (en) | Application program-based operation method and device, electronic equipment and computer medium | |
| CN114064091A (en) | OTA (over the air) upgrade control method and device, electronic equipment and automatic driving vehicle | |
| CN109683992B (en) | Method and apparatus for managing objects | |
| US11893383B2 (en) | Configuration properties management for software | |
| EP3188071B1 (en) | Application accessing control method and device | |
| CN115167874B (en) | Automatic driving software mirror image deployment method and device, electronic equipment and readable medium | |
| CN110825622A (en) | Software testing method, device, equipment and computer readable medium | |
| CN113282444A (en) | Visualization method and device for business process debugging | |
| CN116302271A (en) | Page display method and device and electronic equipment | |
| CN111176641A (en) | Flow node execution method, device, medium and electronic equipment | |
| CN112395194B (en) | Method and device for accessing test platform | |
| CN115514632A (en) | Resource template arranging method, device and equipment for cloud service and storage medium | |
| CN115291928A (en) | Task automatic integration method and device of multiple technology stacks and electronic equipment | |
| CN111949862B (en) | Method and device for managing business task flow and electronic equipment | |
| CN114327673A (en) | Task starting method and device, electronic equipment and storage medium | |
| CN108288135B (en) | System compatibility method and device, computer readable storage medium and electronic equipment | |
| CN110825461B (en) | Data processing method and device |
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 |