CN109218338B - Information processing system, method and device - Google Patents
Information processing system, method and device Download PDFInfo
- Publication number
- CN109218338B CN109218338B CN201710512665.4A CN201710512665A CN109218338B CN 109218338 B CN109218338 B CN 109218338B CN 201710512665 A CN201710512665 A CN 201710512665A CN 109218338 B CN109218338 B CN 109218338B
- Authority
- CN
- China
- Prior art keywords
- node
- processing
- operation instruction
- target processing
- target
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/60—Scheduling or organising the servicing of application requests, e.g. requests for application data transmissions using the analysis and optimisation of the required network resources
Abstract
The application discloses an information processing system, method and device. One embodiment of the system comprises: the system comprises a control end and an execution end; the control end is used for receiving an information processing request comprising a request type identifier and parameter information, determining a data structure comprising a logical relationship of each target processing node for processing the information processing request according to the request type identifier, and sequentially sending a node operation instruction aiming at each target processing node in the target processing nodes to the execution end based on the parameter information from a root node indicated by the data structure, wherein each target processing node is a processing node in a processing node set pre-deployed on the execution end; the execution end is used for determining whether a target processing node indicated by the received node operation instruction has a father node or not, and if not, the target processing node is directly operated. This embodiment improves information processing efficiency.
Description
Technical Field
The present application relates to the field of computer technologies, and in particular, to the field of internet technologies, and in particular, to an information processing system, method, and apparatus.
Background
At present, an existing information processing system generally receives a service request based on a Spring framework (the Spring framework is an open-source and lightweight Java development framework), distinguishes each service according to a service identifier, and processes different service logics, all of which are in one application and are standard single applications. Information processing using monomer applications is generally inefficient.
Disclosure of Invention
It is an object of the present application to provide an improved information processing system, method and apparatus to solve the technical problems mentioned in the background section above.
In a first aspect, an embodiment of the present application provides an information processing system, where the system includes: a control end and an execution end; the control end is configured to receive an information processing request including a request type identifier and parameter information, determine, according to the request type identifier, a data structure including a logical relationship between target processing nodes for processing the information processing request, and sequentially send, to the execution end, a node operation instruction for each of the target processing nodes, starting from a root node indicated by the data structure, based on the parameter information, where the target processing nodes are processing nodes in a processing node set pre-deployed on the execution end, and each processing node in the processing node set supports a different function; the execution end is used for determining whether a target processing node indicated by the received node operation instruction has a father node or not, and if not, directly operating the target processing node indicated by the received node operation instruction.
In some embodiments, the determining, according to the request type identifier, a data structure including a logical relationship of target processing nodes for processing the information processing request includes: and searching a target request type identifier which is the same as the request type identifier included in the information processing request in an information list comprising the corresponding relation between the request type identifier and the data structure, and acquiring the data structure corresponding to the target request type identifier.
In some embodiments, the sending, from the root node indicated by the data structure, a node execution instruction for each of the target processing nodes to the execution end in sequence based on the parameter information includes: after a node operation instruction is sent to the execution end every time, the operation condition of a target processing node indicated by the sent node operation instruction is detected; and if the completion of the operation of the target processing node indicated by the transmitted node operation instruction is detected, transmitting the node operation instruction of the child node of the target processing node indicated by the transmitted node operation instruction to the execution end.
In some embodiments, the sending, from the root node indicated by the data structure, a node execution instruction for each of the target processing nodes to the execution end in sequence based on the parameter information includes: and if the target processing node indicated by the sent node operation instruction is detected to suspend operation or fail operation, the sent node operation instruction is sent to the execution end again.
In some embodiments, the execution end is further configured to: if it is determined that the target processing node indicated by the received node operation instruction has a parent node, further determining whether all the parent nodes of the target processing node indicated by the received node operation instruction have been operated, and if all the parent nodes have been operated, operating the target processing node indicated by the received node operation instruction.
In some embodiments, the control terminal is further configured to: after a node operation instruction is sent to the execution end every time, at least one of the following target processing nodes indicated by the sent node operation instruction is recorded: and running the log storage server by the log storage server, wherein the running state comprises success, failure and pause.
In a second aspect, an embodiment of the present application provides an information processing method, including: receiving an information processing request comprising a request type identifier and parameter information; determining a data structure including a logical relationship of each target processing node for processing the information processing request according to the request type identifier, wherein each target processing node is a processing node in a processing node set pre-deployed on a connected execution end, and each processing node in the processing node set supports different functions; and sequentially sending a node operation instruction for each target processing node in the target processing nodes to the execution end based on the parameter information from the root node indicated by the data structure, so that the execution end determines whether the target processing node indicated by the received node operation instruction has a parent node or not, and directly operates the target processing node indicated by the received node operation instruction when determining that no parent node exists.
In some embodiments, the determining, according to the request type identifier, a data structure including a logical relationship of target processing nodes for processing the information processing request includes: and searching a target request type identifier which is the same as the request type identifier included in the information processing request in an information list comprising the corresponding relation between the request type identifier and the data structure, and acquiring the data structure corresponding to the target request type identifier.
In some embodiments, the sending, from the root node indicated by the data structure, a node execution instruction for each of the target processing nodes to the execution end in sequence based on the parameter information includes: after a node operation instruction is sent to the execution end every time, the operation condition of a target processing node indicated by the sent node operation instruction is detected; and if the completion of the operation of the target processing node indicated by the transmitted node operation instruction is detected, transmitting the node operation instruction of the child node of the target processing node indicated by the transmitted node operation instruction to the execution end.
In some embodiments, the sending, from the root node indicated by the data structure, a node execution instruction for each of the target processing nodes to the execution end in sequence based on the parameter information includes: and if the target processing node indicated by the sent node operation instruction is detected to suspend operation or fail operation, the sent node operation instruction is sent to the execution end again.
In some embodiments, the above method further comprises: after a node operation instruction is sent to the execution end every time, at least one of the following target processing nodes indicated by the sent node operation instruction is recorded: and running the log storage server by the log storage server, wherein the running state comprises success, failure and pause.
In some embodiments, the execution end is further configured to, when it is determined that the target processing node indicated by the received node operation instruction has a parent node, further determine whether all parent nodes of the target processing node indicated by the received node operation instruction have been completely operated, and if all the parent nodes have been completely operated, operate the target processing node indicated by the received node operation instruction.
In a third aspect, an embodiment of the present application provides an information processing apparatus, including: a receiving unit configured to receive an information processing request including a request type identifier and parameter information; a determining unit, configured to determine, according to the request type identifier, a data structure including a logical relationship between target processing nodes for processing the information processing request, where each target processing node is a processing node in a processing node set pre-deployed on a connected execution end, and each processing node in the processing node set supports different functions; and a sending unit configured to send, to the execution end, a node execution instruction for each of the target processing nodes in sequence based on the parameter information, starting from the root node indicated by the data structure, so that the execution end determines whether the target processing node indicated by the received node execution instruction has a parent node, and directly executes the target processing node indicated by the received node execution instruction when it is determined that there is no parent node.
In some embodiments, the determining unit includes: and the obtaining subunit is configured to search, in an information list including a correspondence between the request type identifier and the data structure, a target request type identifier that is the same as the request type identifier included in the information processing request, and obtain the data structure corresponding to the target request type identifier.
In some embodiments, the sending unit includes: the detection subunit is configured to detect the operation condition of the target processing node indicated by the sent node operation instruction after the node operation instruction is sent to the execution end each time; and the first sending subunit is configured to send, to the execution end, a node operation instruction for a child node of the target processing node indicated by the sent node operation instruction, if it is detected that the target processing node indicated by the sent node operation instruction is completely operated.
In some embodiments, the sending unit includes: and the second sending subunit is configured to, if it is detected that the target processing node indicated by the sent node operation instruction suspends operation or fails to operate, resend the sent node operation instruction to the execution end.
In some embodiments, the above apparatus further comprises: the synchronization unit is configured to record at least one of the following target processing nodes indicated by the transmitted node operation instruction after the node operation instruction is transmitted to the execution end each time: and running the log storage server by the log storage server, wherein the running state comprises success, failure and pause.
In some embodiments, the execution end is further configured to, when it is determined that the target processing node indicated by the received node operation instruction has a parent node, further determine whether all parent nodes of the target processing node indicated by the received node operation instruction have been completely operated, and if all the parent nodes have been completely operated, operate the target processing node indicated by the received node operation instruction.
In a fourth aspect, an embodiment of the present application provides an electronic device, including: one or more processors; storage means for storing one or more programs; when the one or more programs are executed by the one or more processors, the one or more processors implement the method as described in any implementation manner of the second aspect.
In a fifth aspect, the present application provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements the method described in any implementation manner of the second aspect.
The information processing system provided by the embodiment of the application receives an information processing request including a request type identifier and parameter information through a control end, so that the control end determines a data structure including a logical relationship of target processing nodes for processing the information processing request according to the request type identifier, and sequentially sends a node operation instruction for each target processing node in the target processing nodes to a connected execution end based on the parameter information from a root node indicated by the data structure. And determining whether the target processing node indicated by the received node operation instruction has a parent node or not through the execution end, so that the execution end directly operates the target processing node when determining that the target processing node has no parent node. Therefore, the data structure is determined by the control end effectively, the node operation instructions of the target processing nodes indicated by the data structure are sent in sequence, the node operation instructions sent by the control end are received by the execution end and processed, and the information processing efficiency is improved.
The information processing method and the information processing device provided by the embodiment of the application receive the information processing request comprising the request type identifier and the parameter information so as to determine the data structure comprising the logical relationship of each target processing node for processing the information processing request according to the request type identifier; and then, starting from the root node indicated by the data structure, sequentially sending a node operation instruction aiming at each target processing node in each target processing node to the connected execution end based on the parameter information, so that the execution end determines whether the target processing node indicated by the received node operation instruction has a parent node or not, and directly operating the target processing node when determining that the target processing node has no parent node. Therefore, the data structure is effectively determined, the node operation instructions of the target processing nodes indicated by the data structure are sequentially sent, the node operation instructions are received by the execution end and processed, and the information processing efficiency is improved.
Drawings
Other features, objects and advantages of the present application will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
FIG. 1 is an exemplary system architecture diagram in which the present application may be applied;
FIG. 2 is a timing diagram of one embodiment of an information handling system according to the present application;
fig. 3 is a schematic diagram of a directed graph according to the present application.
FIG. 4 is a schematic diagram of an application scenario of an information handling system according to the present application;
FIG. 5 is a flow diagram of one embodiment of an information processing method according to the present application;
FIG. 6 is a schematic block diagram of one embodiment of an information processing apparatus according to the present application;
FIG. 7 is a block diagram of a computer system suitable for use in implementing the electronic device of an embodiment of the present application.
Detailed Description
The present application will be described in further detail with reference to the following drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the related invention are shown in the drawings.
It should be noted that the embodiments and features of the embodiments in the present application may be combined with each other without conflict. The present application will be described in detail below with reference to the embodiments with reference to the attached drawings.
Fig. 1 illustrates an exemplary system architecture 100 to which embodiments of an information processing system, an information processing method, or an information processing apparatus of the present application may be applied.
As shown in fig. 1, the system architecture 100 may include terminal devices 101, 102, 103, networks 104, 106, a control end 105 and an execution end 107. The network 104 is used to provide a medium for communication links between the terminal devices 101, 102, 103 and the control terminal 105. The network 106 serves as a medium for providing a communication link between the control terminal 105 and the execution terminal 107. The networks 104, 106 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
The user may use the terminal devices 101, 102, 103 to interact with the control terminal 105 via the network 104 to receive or transmit information or the like. The terminal devices 101, 102, 103 may have installed thereon various communication client applications, such as a web browser application, a shopping-like application, a game-like application, and the like.
The terminal devices 101, 102, 103 may be various electronic devices including, but not limited to, smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The control end 105 may be a server providing various services, for example, receiving an information processing request sent by the terminal devices 101, 102, and 103, controlling a processing flow of the information processing request, issuing a corresponding node operation instruction to the execution end 107, and the like.
The execution end 107 may be a server that provides various services, for example, receives a node operation instruction from the control end 105 and processes the instruction. The execution end 107 may be pre-deployed with a processing node set, and each processing node in the processing node set may be hardware or software, or even a function in software.
It should be noted that the information processing method provided in the embodiment of the present application is generally executed by the control end 105, and accordingly, the information processing apparatus is generally disposed in the control end 105.
It should be understood that the numbers of terminal devices, networks, control terminals and execution terminals in fig. 1 are merely illustrative. Any number of terminal devices, networks, control terminals and execution terminals may be provided according to implementation requirements.
With continued reference to FIG. 2, a timing diagram for one embodiment of an information handling system according to the present application is shown.
The information processing system of the present embodiment may include: a control end and an execution end; the control end is used for receiving an information processing request comprising a request type identifier and parameter information, determining a data structure comprising a logical relationship of each target processing node for processing the information processing request according to the request type identifier, and sequentially sending a node operation instruction aiming at each target processing node to the execution end based on the parameter information from a root node indicated by the data structure, wherein each target processing node is a processing node in a processing node set which is pre-deployed on the execution end, and each processing node in the processing node set supports different functions; the execution end is used for determining whether a target processing node indicated by the received node operation instruction has a father node or not, and if not, the target processing node is directly operated.
As shown in fig. 2, in step 201, the control terminal receives an information processing request including a request type identifier and parameter information.
In this embodiment, a control terminal (e.g., the control terminal 105 shown in fig. 1) may receive an information processing request including a request type identifier and parameter information from a connected terminal device (e.g., the terminal devices 101, 102, 103 shown in fig. 1) through a wired connection manner or a wireless connection manner. The request type may include, for example, order processing, fee settlement, address inquiry, item information upload, item information removal, and the like. The request type identifier may comprise letters, numbers, combinations thereof, or the like. The parameter information may include, for example, a user number of a user who sent the information processing request, a user name, a region where the user is located, a user contact address (e.g., a telephone number, an email address, etc.), or a device identification of an electronic device used when the user sends the information processing request. The parameter information may also include parameter information relating to the services transacted by the user. For example, if the information processing request sent by the user is an information processing request for settlement of online viewing fees of videos, the parameter information may further include video identifiers of the videos, start times and end times of the videos viewed by the user, or total viewing time lengths.
In step 202, the control end determines a data structure including a logical relationship of each target processing node for processing the information processing request according to the request type identifier.
In this embodiment, after the control end receives the information processing request including the request type identifier and the parameter information, the control end may determine, according to the request type identifier, a data structure including a logical relationship of each target processing node for processing the information processing request. The target processing nodes may be processing nodes in a processing node set pre-deployed on an execution end (e.g., the execution end 107 shown in fig. 1) to which the control end is connected. Each processing node in the set of processing nodes may support different functions. For example, the control end may first determine whether a local (e.g., a cache, a memory, and/or a hard disk) has stored a data structure corresponding to the request type identifier; if not, the control end may determine, by using a pre-deployed SDK (Software Development Kit) tool, each target processing node in the processing node set for processing the information processing request, and generate a data structure including a logical relationship of each target processing node. The SDK tool is typically a collection of development tools used by some software engineers to build application software for a particular software package, software framework, hardware platform, operating system, and the like. The SDK tool may be further configured to maintain a correspondence between the request type identifier and each processing node for processing the information processing request having the request type indicated by the request type identifier, and an execution order of each processing node. It is noted that the data structure may be, for example, a tree structure or a directed graph. Taking a directed graph as an example, as shown in fig. 3, fig. 3 shows a schematic diagram of a directed graph. In fig. 3, processing node "a" may be the root node in the directed graph, while processing node "a" is also the parent node of processing node "B", i.e., processing node "B" is the child node of processing node "a". Processing node "B" is the parent node of processing nodes "C", "D", and "E", i.e., processing nodes "C", "D", and "E" are all child nodes of processing node "B". Processing nodes "C" and "D" are both parents of processing node "F", i.e., processing node "F" is a child of processing nodes "C" and "D". Here, processing nodes "E" and "F" have no child nodes and may be referred to as leaf nodes.
In some optional implementations of this embodiment, each processing node in the processing node set may have a node identifier corresponding thereto. The node identification may comprise numbers, letters, combinations thereof, or the like. It should be noted that the processing node set may be a processing node set obtained by the control end decomposing an application deployed on the execution end in advance for processing the received information processing request. The control end may utilize a pre-deployed SDK tool to break the application into multiple small, independent microservices (i.e., processing nodes) and generate the set of processing nodes. The micro-service can be a Spring Boot-based micro-service, the Spring Boot is a brand new framework, and the design purpose of the micro-service is to simplify the initial building and development process of a new Spring application. The framework uses a specific way to configure, thereby eliminating the need for developers to define a templated configuration.
In some optional implementation manners of this embodiment, the control end may locally store in advance an information list including a correspondence between the request type identifier and the data structure. The control terminal may search the information list for a target request type identifier that is the same as a request type identifier included in the received information processing request, and obtain a data structure corresponding to the target request type identifier.
In step 203, the control end sequentially sends a node operation instruction for each target processing node in the target processing nodes to the execution end based on the parameter information from the root node indicated by the data structure.
In this embodiment, after determining the data structure corresponding to the request type identifier included in the received information processing request, the control end may sequentially send, to the execution end, a node operation instruction for each target processing node in the target processing nodes indicated by the data structure, starting from the root node indicated by the data structure, based on the parameter information included in the information processing request. Here, when the control terminal sends a node execution instruction for the root node to the execution terminal, the node execution instruction may include, for example, part or all of the content of the parameter information. When the control end sends a node operation instruction for a non-root node in each target processing node indicated by the data structure to the execution end, the node operation instruction may include part or all of the content of the parameter information and data produced by a parent node of the non-root node after completion of operation, and the node operation instruction may further include a node identifier of the parent node of the non-root node.
In some optional implementation manners of this embodiment, after the control end sends a node operation instruction to the execution end each time, the control end may detect an operation condition of a target processing node indicated by the node operation instruction. If the control end detects that the target processing node is completely operated, the control end can send a node operation instruction aiming at a child node of the target processing node to the execution end. If the control end detects that the target processing node is suspended from running or fails to run, the control end may send a node running instruction for the target processing node to the execution end again. Here, the execution end may write the operation status information of any one of the target processing nodes into a designated storage location. The control end can read corresponding information from the storage position to detect the operation condition of any target processing node. It should be noted that, the execution end may also be pre-deployed with an SDK agent, and the execution end may receive the node operation instruction sent by the control end by using the SDK agent, and may also monitor the operation status of any target processing node by using the SDK agent. In addition, the control end may send a node execution instruction to the execution end by using a preset message middleware. The message middleware may be, for example, a RabbitMQ, a rocktmq, etc., and this embodiment does not limit this aspect in any way. The RabbitMQ may be a reusable enterprise Message system implemented on The basis of AMQP (Advanced Message Queuing Protocol), and may conform to an open source Protocol (e.g., MPL Protocol, which is an abbreviation of The Mozilla Public License). The RocketMQ can be a distributed open message system, which is an open source, high performance, high throughput message middleware.
In some optional implementation manners of this embodiment, after the control end sends a node operation instruction to the execution end each time, at least one of the following target processing nodes indicated by the node operation instruction may be further recorded: the operation start time, the operation end time, and the operation state, and the recorded information may be synchronized to the connected log storage server. The operating status may include, for example, success, failure, suspension, etc. Here, the control end may also record information (e.g., node identification) of a currently operating target processing node.
In step 204, the execution end determines whether the target processing node indicated by the received node operation instruction has a parent node, and if not, the execution end directly operates the target processing node.
In this embodiment, after receiving a node operation instruction, the execution end may determine whether a target processing node indicated by the node operation instruction has a parent node, and if not, the execution end may directly operate the target processing node. Such as inputting parameter information included in the node operation instruction into the target processing node and operating the target processing node. Here, the execution end may determine whether the target processing node has a parent node by determining whether the node execution instruction includes a node identifier, for example, and this embodiment does not limit this aspect in any way.
In some optional implementation manners of this embodiment, for each node operation instruction received by the execution end, if the execution end determines that a target processing node indicated by the node operation instruction has a parent node, the execution end may further determine whether all the parent nodes of the target processing node have been completely operated, and if so, the execution end may operate the target processing node. Here, the execution end may determine whether all parent nodes of any one target processing node have completed running, for example, by looking at the recorded running state information of the running target processing nodes.
With continued reference to fig. 4, fig. 4 is a schematic diagram of an application scenario of the information processing system according to the present embodiment. In the application scenario of fig. 4, as indicated by reference numeral 401, a user may first send an information processing request for obtaining a picture to a control end through a terminal device, where the information processing request may include a request type identifier and parameter information, and the parameter information may include, for example, a device identifier of the terminal device and a picture identifier of a picture that the user wants to obtain. Then, as shown by reference numeral 402, the control end may determine a data structure including a logical relationship of each target processing node for processing the information processing request according to the request type identifier, where the data structure is assumed to include the target processing node a. Thereafter, as indicated by reference numeral 403, the control end may send a node operation instruction for the target processing node a to the execution end, where the node operation instruction may include the parameter information. Then, as indicated by reference numeral 404, the execution end may determine that the target processing node a has no parent node, and the execution end may input the parameter information into the target processing node a and operate the target processing node a, so that the target processing node a obtains the picture according to the picture identifier, and sends the obtained picture to the terminal device according to the device identifier.
The system provided by the above embodiment of the present application effectively utilizes the determination of the control end on the data structure, sequentially sends the node operation instructions of each target processing node indicated by the data structure, and utilizes the execution end to receive the node operation instructions sent by the control end and process the node operation instructions, thereby improving the information processing efficiency. In addition, the control end controls the processing flow of the received information processing request, so that the processing node with the new function can be accessed more simply and quickly. By pre-deploying the processing node set on the execution end, the processing nodes in the processing node set can be randomly combined based on different service scenes, the existing functions can be reused to the maximum extent, and the development workload can be reduced.
With further reference to FIG. 5, a flow 500 of one embodiment of an information processing method is shown. The process 500 of the information processing method includes the following steps:
In this embodiment, the electronic device (for example, the control terminal 105 shown in fig. 1) on which the information processing method operates may receive an information processing request including a request type identifier and parameter information from a connected terminal device (for example, the terminal devices 101, 102, 103 shown in fig. 1) by a wired connection manner or a wireless connection manner. The request type may include, for example, order processing, fee settlement, address inquiry, item information upload, item information removal, and the like. The request type identifier may comprise letters, numbers, combinations thereof, or the like. The parameter information may include, for example, a user number of a user who sent the information processing request, a user name, a region where the user is located, a user contact address (e.g., a telephone number, an email address, etc.), or a device identification of an electronic device used when the user sends the information processing request. The parameter information may also include parameter information relating to the services transacted by the user. For example, if the information processing request sent by the user is an information processing request for settlement of online viewing fees of videos, the parameter information may further include video identifiers of the videos, start times and end times of the videos viewed by the user, or total viewing time lengths.
In this embodiment, after the electronic device receives the information processing request including the request type identifier and the parameter information, the electronic device may determine, according to the request type identifier, a data structure including a logical relationship of each target processing node for processing the information processing request. The target processing nodes may be processing nodes in a processing node set pre-deployed on an execution end (e.g., the execution end 107 shown in fig. 1) to which the electronic device is connected. Each processing node in the set of processing nodes may support different functions. Here, the explanation of step 502 can refer to the related explanation of step 202 in the embodiment shown in fig. 2, and is not repeated here.
And step 503, starting from the root node indicated by the data structure, sequentially sending a node operation instruction for each target processing node in the target processing nodes to the execution end based on the parameter information, so that the execution end determines whether the target processing node indicated by the received node operation instruction has a parent node, and directly operating the target processing node when determining that the target processing node has no parent node.
In this embodiment, after determining the data structure corresponding to the request type identifier included in the received information processing request, the electronic device may sequentially send, from the root node indicated by the data structure, a node operation instruction for each target processing node indicated by the data structure to the execution end based on the parameter information included in the information processing request, so that the execution end determines whether the target processing node indicated by the received node operation instruction has a parent node, and directly operates the target processing node when determining that the target processing node has no parent node. Here, for the explanation of step 503, reference may be made to the related explanation of step 203 and step 204 in the embodiment shown in fig. 2, and details are not repeated here.
The method provided by the embodiment of the application effectively utilizes the determination of the data structure, sequentially sends the node operation instructions of each target processing node indicated by the data structure, receives the node operation instructions by using the execution end and processes the node operation instructions, and improves the information processing efficiency.
With further reference to fig. 6, as an implementation of the method shown in the above figures, the present application provides an embodiment of an information processing apparatus, which corresponds to the embodiment of the method shown in fig. 5, and which is particularly applicable to various electronic devices.
As shown in fig. 6, the information processing apparatus 600 shown in the present embodiment includes: a receiving unit 601, a determining unit 602, and a transmitting unit 603. Wherein, the receiving unit 601 is configured to receive an information processing request including a request type identifier and parameter information; the determining unit 602 is configured to determine, according to the request type identifier, a data structure including a logical relationship of each target processing node for processing the information processing request, where each target processing node is a processing node in a processing node set pre-deployed on a connected execution end, and each processing node in the processing node set supports different functions; and the sending unit 603 is configured to send, to the execution end, a node operation instruction for each target processing node in the target processing nodes in sequence based on the parameter information, starting from the root node indicated by the data structure, so that the execution end determines whether the target processing node indicated by the received node operation instruction has a parent node, and directly operates the target processing node indicated by the received node operation instruction when it is determined that there is no parent node.
In the present embodiment, in the information processing apparatus 600: the specific processing of the receiving unit 601, the determining unit 602, and the sending unit 603 and the technical effects thereof can refer to the related descriptions of step 501, step 502, and step 503 in the corresponding embodiment of fig. 5, which are not described herein again.
In some optional implementations of this embodiment, the determining unit 602 may include: an obtaining subunit (not shown in the figure), configured to search, in an information list including a correspondence between a request type identifier and a data structure, a target request type identifier that is the same as the request type identifier included in the information processing request, and obtain the data structure corresponding to the target request type identifier.
In some optional implementation manners of this embodiment, the sending unit 603 may include: a detection subunit (not shown in the figure), configured to detect, after each node operation instruction is sent to the execution end, an operation condition of a target processing node indicated by the sent node operation instruction; and a first sending subunit (not shown in the figure), configured to send, to the execution end, a node execution instruction for a child node of the target processing node indicated by the sent node execution instruction if it is detected that the target processing node indicated by the sent node execution instruction is completely executed.
In some optional implementation manners of this embodiment, the sending unit 603 may include: a second sending subunit (not shown in the figure), configured to, if it is detected that the target processing node indicated by the sent node operation instruction suspends operation or fails to operate, send the sent node operation instruction to the execution end again.
In some optional implementations of this embodiment, the apparatus 600 may further include: a synchronization unit (not shown in the figure), configured to record, after each node operation instruction is sent to the execution end, at least one of the following target processing nodes indicated by the sent node operation instruction: and running the log storage server by the log storage server, wherein the running state comprises success, failure and pause.
In some optional implementation manners of this embodiment, the execution end may be further configured to, when it is determined that the target processing node indicated by the received node operation instruction has a parent node, further determine whether all parent nodes of the target processing node indicated by the received node operation instruction have been completely operated, and if all the parent nodes have been completely operated, operate the target processing node indicated by the received node operation instruction.
The device provided by the above embodiment of the present application effectively utilizes the determination of the data structure, sequentially sends the node operation instructions of each target processing node indicated by the data structure, and utilizes the execution end to receive the node operation instructions and process the node operation instructions, thereby improving the information processing efficiency.
Referring now to FIG. 7, shown is a block diagram of a computer system 700 suitable for use in implementing the electronic device of an embodiment of the present application. The electronic device shown in fig. 7 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. 7, the computer system 700 includes a Central Processing Unit (CPU)701, which can perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)702 or a program loaded from a storage section 708 into a Random Access Memory (RAM) 703. In the RAM 703, various programs and data necessary for the operation of the system 700 are also stored. The CPU 701, the ROM 702, and the RAM 703 are connected to each other via a bus 704. An input/output (I/O) interface 705 is also connected to bus 704.
The following components are connected to the I/O interface 705: an input portion 706 including a keyboard, a mouse, and the like; an output section 707 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage section 708 including a hard disk and the like; and a communication section 709 including a network interface card such as a LAN card, a modem, or the like. The communication section 709 performs communication processing via a network such as the internet. A drive 710 is also connected to the I/O interface 705 as needed. A removable medium 711 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 710 as necessary, so that a computer program read out therefrom is mounted into the storage section 708 as necessary.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure 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 in the flow chart. In such an embodiment, the computer program can be downloaded and installed from a network through the communication section 709, and/or installed from the removable medium 711. The computer program executes the above-described functions defined in the system of the present application when executed by the Central Processing Unit (CPU) 701.
It should be noted that the computer readable medium shown in 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 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. 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, wire, fiber optic cable, RF, 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.
The units described in the embodiments of the present application may be implemented by software or hardware. The described units may also be provided in a processor, and may be described as: a processor includes a receiving unit, a determining unit, and a transmitting unit. Here, the names of these units do not constitute a limitation of the unit itself in some cases, and for example, the receiving unit may also be described as "a unit that receives an information processing request including a request type identification and parameter information".
As another aspect, the present application also provides a computer-readable medium, which may be contained in the electronic device described in the above embodiments; or may exist separately without being assembled into the electronic device. The computer readable medium carries one or more programs which, when executed by an electronic device, cause the electronic device to include: receiving an information processing request comprising a request type identifier and parameter information; determining a data structure including a logical relationship of each target processing node for processing the information processing request according to the request type identifier, wherein each target processing node is a processing node in a processing node set pre-deployed on a connected execution end, and each processing node in the processing node set supports different functions; and sequentially sending a node operation instruction for each target processing node in the target processing nodes to the execution end based on the parameter information from the root node indicated by the data structure, so that the execution end determines whether the target processing node indicated by the received node operation instruction has a parent node or not, and directly operates the target processing node indicated by the received node operation instruction when determining that no parent node exists.
The above description is only a preferred embodiment of the application and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention herein disclosed is not limited to the particular combination of features described above, but also encompasses other arrangements formed by any combination of the above features or their equivalents without departing from the spirit of the invention. For example, the above features may be replaced with (but not limited to) features having similar functions disclosed in the present application.
Claims (10)
1. An information processing system is characterized in that the system comprises a control end and an execution end;
the control end is configured to receive an information processing request including a request type identifier and parameter information, determine, according to the request type identifier, a data structure including a logical relationship between target processing nodes for processing the information processing request, and sequentially send, to the execution end, a node operation instruction for each target processing node in the target processing nodes based on the parameter information, starting from a root node indicated by the data structure, where each target processing node is a processing node in a processing node set pre-deployed on the execution end, and each processing node in the processing node set supports different functions;
and the execution end is used for determining whether a target processing node indicated by the received node operation instruction has a father node or not, and if not, directly operating the target processing node indicated by the received node operation instruction.
2. The system of claim 1, wherein determining a data structure including a logical relationship for each target processing node for processing the information processing request based on the request type identification comprises:
and searching a target request type identifier which is the same as the request type identifier included in the information processing request in an information list comprising the corresponding relation between the request type identifier and the data structure, and acquiring the data structure corresponding to the target request type identifier.
3. The system according to claim 1, wherein said sending, from a root node indicated by the data structure, a node operation instruction for each of the target processing nodes to the execution end in turn based on the parameter information comprises:
after a node operation instruction is sent to the execution end every time, detecting the operation condition of a target processing node indicated by the sent node operation instruction;
and if the completion of the operation of the target processing node indicated by the transmitted node operation instruction is detected, transmitting the node operation instruction of the child node of the target processing node indicated by the transmitted node operation instruction to the execution end.
4. The system according to claim 3, wherein said sending, from the root node indicated by the data structure, the node operation instruction for each of the target processing nodes to the execution end in turn based on the parameter information comprises:
and if the target processing node indicated by the sent node operation instruction is detected to be suspended or failed to operate, the sent node operation instruction is sent to the execution end again.
5. The system of claim 1, wherein the execution end is further configured to:
if it is determined that the target processing node indicated by the received node operation instruction has a parent node, further determining whether all the parent nodes of the target processing node indicated by the received node operation instruction have been operated, and if all the parent nodes have been operated, operating the target processing node indicated by the received node operation instruction.
6. The system according to any one of claims 1-5, wherein the control terminal is further configured to:
after a node operation instruction is sent to the execution end every time, at least one of the following target processing nodes indicated by the sent node operation instruction is recorded: and running the log storage server by the log storage server, wherein the running state comprises success, failure and pause.
7. An information processing method, characterized in that the method comprises:
receiving an information processing request comprising a request type identifier and parameter information;
determining a data structure comprising a logical relationship of each target processing node for processing the information processing request according to the request type identifier, wherein each target processing node is a processing node in a processing node set pre-deployed on a connected execution end, and each processing node in the processing node set supports different functions;
and sequentially sending a node operation instruction aiming at each target processing node in the target processing nodes to the execution end based on the parameter information from the root node indicated by the data structure, so that the execution end determines whether the target processing node indicated by the received node operation instruction has a parent node or not, and directly operates the target processing node indicated by the received node operation instruction when determining that no parent node exists.
8. An information processing apparatus characterized in that the apparatus comprises:
a receiving unit configured to receive an information processing request including a request type identifier and parameter information;
a determining unit, configured to determine, according to the request type identifier, a data structure including a logical relationship of each target processing node for processing the information processing request, where each target processing node is a processing node in a processing node set pre-deployed on a connected execution end, and each processing node in the processing node set supports different functions;
and a sending unit, configured to send, to the execution end, a node operation instruction for each target processing node in the target processing nodes in sequence based on the parameter information, starting from the root node indicated by the data structure, so that the execution end determines whether the target processing node indicated by the received node operation instruction has a parent node, and directly operates the target processing node indicated by the received node operation instruction when it is determined that there is no parent node.
9. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of claim 7.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the method of claim 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710512665.4A CN109218338B (en) | 2017-06-29 | 2017-06-29 | Information processing system, method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710512665.4A CN109218338B (en) | 2017-06-29 | 2017-06-29 | Information processing system, method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109218338A CN109218338A (en) | 2019-01-15 |
| CN109218338B true CN109218338B (en) | 2021-05-25 |
Family
ID=64960599
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710512665.4A Active CN109218338B (en) | 2017-06-29 | 2017-06-29 | Information processing system, method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109218338B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110321210A (en) * | 2019-06-28 | 2019-10-11 | 京东数字科技控股有限公司 | Data processing method, device, computer-readable medium and electronic equipment |
| CN113283891A (en) * | 2021-05-13 | 2021-08-20 | 北京字跳网络技术有限公司 | Information processing method and device and electronic equipment |
| CN114579215A (en) * | 2022-03-07 | 2022-06-03 | 首约科技(北京)有限公司 | Automatic control method for program execution logic and sequence |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101645148A (en) * | 2009-06-19 | 2010-02-10 | 中国科学院声学研究所 | Construction order management method applied to operation support system and management system thereof |
| CN105243521A (en) * | 2015-11-20 | 2016-01-13 | 华润电力投资有限公司河南分公司 | Workflow management method and system |
| US9483387B1 (en) * | 2014-03-17 | 2016-11-01 | Amazon Technologies, Inc. | Tree comparison functionality for services |
| CN106250254A (en) * | 2016-07-21 | 2016-12-21 | 腾讯科技（深圳）有限公司 | A kind of task processing method and system |
| CN106408170A (en) * | 2016-08-30 | 2017-02-15 | 北京北信源软件股份有限公司 | Electronic worksheet processing method, workflow engine and electronic worksheet system |
| CN106790693A (en) * | 2017-02-20 | 2017-05-31 | 北京孚耐尔科技有限公司 | The analysis method and system of a kind of network packet |
-
2017
- 2017-06-29 CN CN201710512665.4A patent/CN109218338B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101645148A (en) * | 2009-06-19 | 2010-02-10 | 中国科学院声学研究所 | Construction order management method applied to operation support system and management system thereof |
| US9483387B1 (en) * | 2014-03-17 | 2016-11-01 | Amazon Technologies, Inc. | Tree comparison functionality for services |
| CN105243521A (en) * | 2015-11-20 | 2016-01-13 | 华润电力投资有限公司河南分公司 | Workflow management method and system |
| CN106250254A (en) * | 2016-07-21 | 2016-12-21 | 腾讯科技（深圳）有限公司 | A kind of task processing method and system |
| CN106408170A (en) * | 2016-08-30 | 2017-02-15 | 北京北信源软件股份有限公司 | Electronic worksheet processing method, workflow engine and electronic worksheet system |
| CN106790693A (en) * | 2017-02-20 | 2017-05-31 | 北京孚耐尔科技有限公司 | The analysis method and system of a kind of network packet |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109218338A (en) | 2019-01-15 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110708346B (en) | Information processing system and method | |
| CN108196915B (en) | Code processing method and device based on application container engine and storage medium | |
| WO2020207454A1 (en) | Information pushing method and device | |
| CN108958922B (en) | Method and device for executing task | |
| US20130326502A1 (en) | Installing applications remotely | |
| WO2019015272A1 (en) | Information processing method and device | |
| CN109218338B (en) | Information processing system, method and device | |
| US11934287B2 (en) | Method, electronic device and computer program product for processing data | |
| WO2019029451A1 (en) | Method for publishing mobile applications and electronic apparatus | |
| CN109218041B (en) | Request processing method and device for server system | |
| CN109828830B (en) | Method and apparatus for managing containers | |
| CN110620806B (en) | Information generation method and device | |
| CN109299124B (en) | Method and apparatus for updating a model | |
| CN109348298B (en) | Method and equipment for pushing and playing multimedia data stream | |
| CN116737662A (en) | Method, device, electronic equipment and storage medium for processing business data | |
| CN115167874B (en) | Automatic driving software mirror image deployment method and device, electronic equipment and readable medium | |
| CN106933449B (en) | Icon processing method and device | |
| CN111290873B (en) | Fault processing method and device | |
| CN109960659B (en) | Method and device for detecting application program | |
| CN113283891A (en) | Information processing method and device and electronic equipment | |
| CN112084114A (en) | Method and apparatus for testing an interface | |
| CN112311842A (en) | Method and device for information interaction | |
| CN112799797A (en) | Task management method and device | |
| US20240152504A1 (en) | Data interaction method, apparatus, and electronic device | |
| CN111831530A (en) | Test 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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |