CN114546432A - Multi-application deployment method, device, equipment and readable storage medium - Google Patents
Multi-application deployment method, device, equipment and readable storage medium Download PDFInfo
- Publication number
- CN114546432A CN114546432A CN202210187522.1A CN202210187522A CN114546432A CN 114546432 A CN114546432 A CN 114546432A CN 202210187522 A CN202210187522 A CN 202210187522A CN 114546432 A CN114546432 A CN 114546432A
- Authority
- CN
- China
- Prior art keywords
- node
- deployment
- legend
- application
- legends
- 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
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/60—Software deployment
- G06F8/61—Installation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/01—Input arrangements or combined input and output arrangements for interaction between user and computer
- G06F3/048—Interaction techniques based on graphical user interfaces [GUI]
- G06F3/0481—Interaction techniques based on graphical user interfaces [GUI] based on specific properties of the displayed interaction object or a metaphor-based environment, e.g. interaction with desktop elements like windows or icons, or assisted by a cursor's changing behaviour or appearance
- G06F3/0483—Interaction with page-structured environments, e.g. book metaphor
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F3/00—Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
- G06F3/01—Input arrangements or combined input and output arrangements for interaction between user and computer
- G06F3/048—Interaction techniques based on graphical user interfaces [GUI]
- G06F3/0484—Interaction techniques based on graphical user interfaces [GUI] for the control of specific functions or operations, e.g. selecting or manipulating an object, an image or a displayed text element, setting a parameter value or selecting a range
- G06F3/04845—Interaction techniques based on graphical user interfaces [GUI] for the control of specific functions or operations, e.g. selecting or manipulating an object, an image or a displayed text element, setting a parameter value or selecting a range for image manipulation, e.g. dragging, rotation, expansion or change of colour
-
- 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/44—Arrangements for executing specific programs
- G06F9/451—Execution arrangements for user interfaces
Landscapes
- Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- General Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Human Computer Interaction (AREA)
- Stored Programmes (AREA)
Abstract
The invention discloses a multi-application deployment method, a multi-application deployment device, multi-application deployment equipment and a readable storage medium, wherein the method comprises the following steps: acquiring a tree topology graph for representing the dependency relationship among a plurality of applications to be deployed; wherein the tree topology comprises: a node legend for characterizing applications and connecting lines for characterizing dependencies; according to the connection relation of all node legends in the tree topology graph through connecting lines, sequencing all node legends in the tree topology graph again to form a deployment queue containing all types of node legends in the tree topology graph; sequentially executing the deployment operation of the application corresponding to each node legend according to the sequence of each node legend in the deployment queue; the invention can carry out one-key deployment on a plurality of applications with complex dependent arrangement.
Description
Technical Field
The present invention relates to the field of computer technologies, and in particular, to a method, an apparatus, a device, and a readable storage medium for deploying multiple applications.
Background
With the rise of the micro-service architecture, the operation and maintenance tool for deploying the applications in the micro-service architecture only supports the dependency relationship of scripts under a single application and solves the deployment problem of the single application, and the existing operation and maintenance tool cannot play a role when facing scenes that the dependency among a plurality of applications is complex, the plurality of applications repeatedly utilize the same script and the like, so that in the prior art, when the plurality of applications are deployed and the complex dependency relationship exists between the applications, the existing operation and maintenance tool needs to be manually intervened in the scripts of the applications, the plurality of applications are manually arranged according to the dependency relationship, and then the plurality of applications are manually deployed according to the arrangement result; because the existing operation and maintenance tools cannot be directly used, the requirement for operation and maintenance personnel for realizing the deployment of multiple applications is high.
Therefore, how to perform one-key deployment on a plurality of applications with complex dependent deployment becomes a technical problem which needs to be solved urgently by those skilled in the art.
Disclosure of Invention
The invention aims to provide a multi-application deployment method, a multi-application deployment device, a multi-application deployment equipment and a readable storage medium, which can perform one-key deployment on a plurality of applications with complex dependency arrangement.
According to an aspect of the present invention, there is provided a multi-application deployment method, the method including:
acquiring a tree topology graph for representing the dependency relationship among a plurality of applications to be deployed; wherein the tree topology comprises: a node legend for characterizing applications and connecting lines for characterizing dependencies;
according to the connection relation of all node legends in the tree topology graph through connecting lines, sequencing all node legends in the tree topology graph again to form a deployment queue containing all types of node legends in the tree topology graph;
and executing the deployment operation of the application corresponding to each node legend in sequence according to the sequence of each node legend in the deployment queue.
Optionally, the method further includes:
displaying node legends for representing various applications to be deployed through a first form in a display interface;
in response to a first operation of dragging a target node legend from the first window to a second window in the display interface, arranging the target node legend in the second window according to an end position of the first operation;
responding to a second operation on the target node legend in the second form, displaying a third form in the display interface, and adding information input in the third form as node attribute information to the target node legend;
drawing a connecting line for connecting the first node legend and the second node legend in the second window in response to a third operation on the first node legend and the second node legend in the second window;
responding to a fourth operation on the connecting line in the second window, displaying a fourth window in the display interface, and adding information input in the fourth window as line attribute information to the connecting line;
and in response to a fifth operation triggered in the second form, setting all node legends interconnected by connecting lines in the second form as a tree topology.
Optionally, the node attribute information includes: a deployment script for deploying an application corresponding to the node legend, and parameters included in the deployment script;
the line attribute information includes: the dependency relationship between a first application corresponding to the first node legend and a second application corresponding to the second node legend; wherein the dependency comprises: the first application depends on the second application, or a parameter in the deployment script of the first application depends on a parameter in the deployment script of the second application.
Optionally, the method further includes:
analyzing a root node legend, branches and sub-branches of each branch from the tree topology graph;
each branch at least comprises two levels of node legends, and the node legend of the highest level in each branch is a root node legend;
the node map example of each level in the subbranch is connected with the node map example of at most one lower level.
Optionally, the reordering, according to a connection relationship between node legends in the tree topology graph through a connection line, the node legends in the tree topology graph to form a deployment queue including all types of node legends in the tree topology graph specifically includes:
sequentially traversing each sub-branch from the leftmost sub-branch in the tree-shaped topological graph from left to right, judging whether a node legend which is repeated with the 1 st to the (i-1) th sub-branches exists in the currently traversed ith sub-branch, if so, deleting the repeated node legend in the ith sub-branch, and obtaining a clean tree-shaped topological graph after traversing all the sub-branches;
sequentially traversing each sub-branch from left to right from the leftmost sub-branch in the clean tree topology graph, and sequentially storing each node legend in the currently traversed sub-branch into the deployment queue from a low level to a high level;
sequentially storing other node legends except all traversed subbranches in the clean tree topology map into the deployment queue according to the sequence from a low level to a high level;
and adding corresponding connecting lines between the node legends in the deployment queue according to the connecting lines between the node legends in the clean tree topology graph.
Optionally, the sequentially traversing each sub-branch from left to right from the leftmost sub-branch in the tree topology according to a left-to-right sequence, and determining whether a node legend that is repeated in the 1 st to (i-1) th sub-branches exists in the i-th sub-branch currently traversed, if so, deleting the repeated node legend in the i-th sub-branch, and obtaining a clean tree topology after traversing all the sub-branches, specifically including:
sequentially traversing each node legend from a first node legend of the ith sub-branch according to a sequence from a high level to a low level, and judging whether a node string consisting of a currently traversed target node legend and all node legends located behind the target node legend exists in the nth sub-branch; wherein the Nth subbranch is one of the 1 st subbranch to the (i-1) th subbranch;
if so, deleting the node string, and adding an identifier of a related node legend into the node attribute information of the node legend of the higher level of the target node legend; the associated node legend is a node legend which is the same as the target node legend in the Nth branch;
if not, the node legend of the lower level is continuously traversed.
Optionally, the sequentially executing the deployment operation of the application corresponding to each node legend according to the sequence of each node legend in the deployment queue specifically includes:
receiving a deployment instruction; wherein the deployment instructions comprise: a parameter generation rule for generating parameter values of the dynamic parameters;
sequentially acquiring node legends to be deployed from the deployment queue according to the sequence stored in the deployment queue;
acquiring node attribute information of the node legend to be deployed and line attribute information of a connecting line between the node legend to be deployed and a previous node legend in the deployment queue;
and completing the deployment operation of the node legend to be deployed according to the deployment script in the node attribute information, the dependency relationship in the line attribute information and the parameter generation rule in the deployment instruction.
Optionally, the completing, according to the deployment script in the node attribute information, the dependency relationship in the line attribute information, and the parameter generation rule in the deployment instruction, the deployment operation on the node legend to be deployed specifically includes:
analyzing deployment steps from the deployment script, and analyzing static parameters and/or dynamic parameters from each deployment step;
sequentially traversing each deployment step according to the sequence of the deployment steps, and judging whether the currently traversed target deployment step comprises dynamic parameters;
if so, acquiring a parameter generation rule of the dynamic parameter from the deployment instruction when the parameter type of the dynamic parameter is referred, generating a dynamic parameter value according to the parameter generation rule, and storing the dynamic parameter value into a global place occupation corresponding to the dynamic parameter; and when the parameter type of the dynamic parameter is the reference, acquiring the dynamic parameter value of the dynamic parameter from the global position occupation corresponding to the dynamic parameter.
In order to achieve the above object, the present invention further provides a computer device, which specifically includes: a memory, a processor and a computer program stored on the memory and executable on the processor, the processor implementing the steps of the multi-application deployment method introduced above when executing the computer program.
In order to achieve the above object, the present invention also provides a computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, realizes the above-described steps of the multi-application deployment method.
The multi-application deployment method, the multi-application deployment device, the multi-application deployment equipment and the readable storage medium have the advantages that the tree topology graph recording the dependency relationship among the multiple applications to be deployed is obtained, the tree topology graph is modified to obtain the clean tree topology graph, the clean tree topology is further parsed to implement a one-key deployment operation for multiple applications with complex dependencies, by storing node attribute information of the node legend and line attribute information of the connecting lines in the clean tree topology, can obtain the complex dependency relationship of the applications corresponding to a plurality of node legends, avoids the problem of difficult deployment caused by repeatedly utilizing the same node legend, saves deployment resources, improves the level of automatic deployment of the applications, meanwhile, the dynamic occupation is set in the deployment process, so that the dynamic parameters generated by the application can be transferred and used in the deployed multiple applications; the embodiment achieves multi-level and staged deployment of a single application, so that static parameters and/or dynamic parameters can be transmitted in the application at the same time, and the concurrent deployment efficiency of multiple applications and the deployment efficiency of repeated applications are greatly improved.
Drawings
Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the preferred embodiments. The drawings are only for purposes of illustrating the preferred embodiments and are not to be construed as limiting the invention. Also, like reference numerals are used to refer to like parts throughout the drawings. In the drawings:
fig. 1 is an alternative flowchart of a multi-application deployment method according to an embodiment;
fig. 2 is a schematic diagram illustrating a node diagram of multiple applications in a first frame according to an embodiment one;
FIG. 3 is a schematic diagram of a tree topology provided in accordance with one embodiment;
FIG. 4 is a diagram illustrating a root node legend, branches, and sub-branches in a tree topology provided in the first embodiment;
FIG. 5 is a diagram illustrating deletion of a node string repeated in a tree topology according to an embodiment;
FIG. 6 is a schematic diagram of a clean tree topology provided in accordance with the first embodiment;
FIG. 7 is a schematic diagram of a deployed application according to an embodiment;
fig. 8 is a schematic diagram of an alternative structure of a multi-application deployment apparatus according to a third embodiment;
fig. 9 is an alternative hardware architecture diagram of the computer device according to the fourth embodiment.
Detailed Description
In order to make the objects, technical solutions and advantages of the present invention more apparent, the present invention is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the invention and are not intended to limit the invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Example one
The embodiment of the invention provides a multi-application deployment method, which specifically comprises the following steps of:
step S101: obtaining a tree topology graph used for representing the dependency relationship among a plurality of applications to be deployed; wherein the tree topology comprises: node legends for characterizing applications and connecting lines for characterizing dependencies.
The tree topology graph is composed of node legends of a plurality of applications to be deployed and connecting lines, the directions of arrows in the connecting lines are related to the dependency relationship, and the directions of the arrows of the connecting lines are directed to the depended party.
Specifically, step S101 includes the following steps:
step A1: and displaying node legends for representing various applications to be deployed through a first form in the display interface.
The node legends for characterizing various applications to be deployed are displayed through a first form in the display interface, as shown in fig. 2, one type of application corresponds to one type of node legend.
Step A2: in response to a first operation of dragging a target node legend from the first window to a second window in the display interface, arranging the target node legend in the second window according to an end position of the first operation.
The first operation is a dragging operation and is applied to each target node legend, and the same node legend can appear in the second window and be arranged for multiple times so as to represent that an application corresponding to one node legend is used for multiple times in the arranging process.
Step A3: and in response to a second operation on the target node legend in the second window, displaying a third window in the display interface, and adding information input in the third window as node attribute information to the target node legend.
And the second operation is a click operation and is applied to each target node legend.
Specifically, the node attribute information includes: a deployment script for deploying an application corresponding to the node legend, and parameters included in the deployment script.
In this embodiment, the deployment script includes a plurality of deployment steps, and a part of the deployment steps includes dynamic parameters and/or static parameters; the deployment steps are the minimum execution units of the deployment scripts, a plurality of deployment steps can complete the deployment process of one application, and the deployment steps are executed in series.
It should be noted that the parameter value of the static parameter is a fixed parameter value that has been set before the deployment script is executed; the parameter values of the dynamic parameters are not set before the deployment script is executed, and need to be generated in the process of executing the deployment script.
Step A4: in response to a third operation on the first node legend and the second node legend in the second window, drawing a connecting line for connecting the first node legend and the second node legend in the second window.
Wherein the third operation is a wire operation, preferably, the wire is a wire with an arrow for connecting two node legends using the arrowed wire, for example, as shown in fig. 3, the node legend of the application B points to the node legend of the application G to identify that the application B needs to depend on the application G.
Specifically, the connecting line further includes a dashed line, and as shown in fig. 3, the dashed line represents that the parameters generated by the application C are dynamically transferred to the application E.
Step A5: and responding to a fourth operation on the connecting line in the second window, displaying a fourth window in the display interface, and adding information input in the fourth window as line attribute information to the connecting line.
And the fourth operation is click operation and is used for adding line attribute information to the connecting line.
Specifically, the line attribute information includes: a dependency between a first application corresponding to the first node legend and a second application corresponding to the second node legend.
Further, the dependency relationship includes: the first application depends on the second application, or the parameter in the deployment script of the first application depends on the parameter in the deployment script of the second application; wherein the first application is dependent on the second application means that the second application must have been executed before the first application starts executing.
Further, the step a5 further includes:
and when the connecting line is a dotted line, adding dotted line attribute information to the dotted line, wherein the dotted line attribute information represents a dynamic parameter transfer relationship.
Step A6: and in response to a fifth operation triggered in the second form, setting all node legends interconnected by connecting lines in the second form as a tree topology.
The fifth operation is a setting operation, and is configured to set all node legends connected by a connection line in the second form as a tree topology map, where the tree topology map is shown in fig. 3.
In this embodiment, the tree topology includes: the system comprises a node legend and connecting lines, wherein the node legend is used for representing applications to be deployed, the connecting lines are used for representing dependency relationships among a plurality of applications to be deployed, each node legend has corresponding node attribute information, and each connecting line has corresponding line attribute information. Furthermore, in the tree topology, a node legend for an application may appear in the tree topology many times.
Further, after step a6, the method further comprises:
analyzing a root node legend, branches and sub-branches of each branch from the tree topology graph;
as shown in fig. 4, the root node legend is a node legend located at the highest level of the tree topology map in the tree topology map, for example, the node legend of the application a shown in fig. 4 is the root node legend.
Specifically, each branch includes at least two levels of node legends, and the node legend of the highest level in each branch is the root node legend, for example, application a, application D, application B, and application G shown in fig. 4 are one branch; the node map example of each level in the subbranch is connected with at most one node map example of a lower level, for example, application F and application G shown in fig. 4 are one subbranch, and application B and application G are also one subbranch.
Step S102: and reordering the node legends in the tree topology graph according to the connection relation of the node legends in the tree topology graph through the connecting lines to form a deployment queue containing all types of node legends in the tree topology graph.
The tree-like topological graph is optimized into a clean tree-like topological graph, node legends in the clean tree-like topological graph are stored in a deployment queue in sequence, and ideally, each type of node legend appears only once in the deployment queue, so that the effect of one-key deployment is achieved.
Specifically, step S102 includes:
deleting the node legends and the connecting lines corresponding to the connection relations which repeatedly appear in the tree-like topological graph according to the connection relations among the node legends in the tree-like topological graph through the connecting lines to obtain a clean tree-like topological graph, and sequencing the node legends in the clean tree-like topological graph to form a deployment queue containing all types of node legends in the tree-like topological graph.
Further, step S102 specifically includes the following steps:
step B1: sequentially traversing each sub-branch from the leftmost sub-branch in the tree-shaped topological graph from left to right, judging whether a node legend which is repeated with the 1 st to the (i-1) th sub-branches exists in the currently traversed ith sub-branch, if so, deleting the repeated node legend in the ith sub-branch, and obtaining a clean tree-shaped topological graph after traversing all the sub-branches; wherein i is a positive integer.
For example, a repeating node map, such as that shown by the gray node legend in FIG. 5, and the clean tree topology map is shown in FIG. 6.
Further, step B1 specifically includes the following steps:
step B11: sequentially traversing each node legend from a first node legend of the ith sub-branch according to a sequence from a high level to a low level, and judging whether a node string consisting of a currently traversed target node legend and all node legends located behind the target node legend exists in the nth sub-branch; wherein the Nth subbranch is one subbranch from the 1 st subbranch to the (i-1) th subbranch.
Wherein the node string is composed of one or more node legends.
Step B12: if so, deleting the node string, and adding an identifier of a related node legend into the node attribute information of the node legend of the higher level of the target node legend; the associated node legend is a node legend which is the same as the target node legend in the Nth branch;
if not, the node legend of the lower level is continuously traversed.
Deleting the node string, and adding the identifier of the deleted node legend in the node attribute information of the node legend of the adjacent hierarchy of the deleted node string, wherein the two situations are divided into a first situation, and in the first situation, the identifiers of all the deleted node legends are added in the node attribute information of the previous node legend; for example, the 1 st sub-branch shown in fig. 5 is application B and application G, and the 2 nd sub-branch is application C, application B, and application G, where the 1 st sub-branch exists in the 2 nd sub-branch, so that the application B and the application G in the 2 nd sub-branch are deleted, and the identifiers of the application B and the application G are added in the node attribute information of the application C in the 2 nd sub-branch; the 2 nd sub-branch shown in fig. 5 is application C, application B, and application G, the 3 rd sub-branch is application C, application B, and application G, and the 2 nd sub-branch exists in the 3 rd sub-branch, so the application C, application B, and application G in the 3 rd sub-branch are deleted, and the identifiers of the application C, application B, and application G are added in the node attribute information of the application D. In the second case, the identifier of the node legend of the highest level in the deleted node string is added to the node attribute information of the previous node legend; for example: the 1 st sub-branch shown in fig. 5 is application B and application G, and the 2 nd sub-branch is application C, application B and application G, where the 1 st sub-branch exists in the 2 nd sub-branch, so that application B and application G in the 2 nd sub-branch are deleted, and since application B depends on application G, it is only necessary to add the identifier of application B in the node attribute information of application C in the 2 nd sub-branch.
In this embodiment, deleting the node legend in the repeated node string improves the arrangement efficiency of repeated applications, and thus can improve the repeated deployment efficiency. Meanwhile, the mark of the associated node legend is added to the node attribute information of the node legend of the high level of the target node legend for simplifying the layout complexity of the tree-shaped topological graph and ensuring the integrity of the node attribute information of the node legend corresponding to each application, although the repeated node legend is deleted, the node attribute information of the node legend is not changed, the dependency relationship between the node legend examples in the original tree-shaped topological graph is not changed, the original dependency relationship still exists in the application corresponding to the node legend in the clean tree-shaped topological graph, so that the mark of the associated node legend is added to the node attribute information of the node legend of the high level of the target node legend, the integrity of the node attribute information of the applications corresponding to a plurality of node legends in the deployment process is ensured, and the complex dependency layout between the node legends is simplified, and saves deployment resources.
Step B2: and sequentially traversing each sub-branch from the left-most sub-branch in the clean tree topology graph in the order from left to right, and sequentially storing each node legend in the currently traversed sub-branch into the deployment queue in the order from the low level to the high level.
The root node legend is finally stored in the deployment queue, as shown in fig. 7, the node legend corresponding to the application a is the last deployed node legend in the deployment queue.
In this embodiment, each node legend in the subbranch has a dependency relationship that a node legend at a high level depends on a node legend at a low level, so that each node legend in the subbranch needs to be sequentially stored in the deployment queue according to a sequence from the low level to the high level, so as to ensure that the dependency relationship of an application corresponding to the node legend is simple and accurate.
Step B3: and sequentially storing other node legends except all traversed subbranches in the clean tree topology map into the deployment queue according to the sequence from a low level to a high level.
Step B4: and adding corresponding connecting lines between the node legends in the deployment queue according to the connecting lines between the node legends in the clean tree topology graph.
As shown in fig. 7, the connecting lines include a solid line and a dotted line, where the solid line represents that there is a dependency relationship between applications corresponding to the two node legends, and the dotted line represents that a dynamic parameter is transferred between the applications corresponding to the node legends.
It should be noted that each node legend in the deployment queue retains node attribute information of all node legends of the same type in the clean tree topology graph, and each connection line in the deployment queue retains line attribute information of a corresponding connection line in the clean tree topology graph.
Step S103: and executing the deployment operation of the application corresponding to each node legend in sequence according to the sequence of each node legend in the deployment queue.
Specifically, step S103 includes the following steps:
step C1: receiving a deployment instruction; wherein the deployment instructions comprise: a parameter generation rule for generating parameter values of the dynamic parameter.
Step C2: and acquiring node legends to be deployed from the deployment queue in sequence according to the sequence stored in the deployment queue.
Step C3: and acquiring node attribute information of the node legend to be deployed and line attribute information of a connecting line between the node legend to be deployed and a previous node legend in the deployment queue.
Wherein the node attribute information includes: a deployment script for deploying an application corresponding to a node legend, parameters included in the deployment script, and an identification of an associated node legend.
Specifically, the line attribute information includes: and the dependency relationship between the application to be deployed corresponding to the node legend to be deployed and the previous application corresponding to the previous node legend in the deployment queue and the transfer relationship between the dynamic parameters and the applications corresponding to the node legend.
In this embodiment, because the repeated node strings are deleted, a clean tree-shaped topological graph is obtained, and an identifier of a related node legend is added to the node attribute information of the node legend of the higher level of the target node legend in the clean tree-shaped topological graph, so that the integrity of the node attribute information of each node legend in the deployment queue and the integrity of the dependency relationship between applications corresponding to each node legend are ensured.
Step C4: and completing the deployment operation of the node legend to be deployed according to the deployment script in the node attribute information, the dependency relationship in the line attribute information and the parameter generation rule in the deployment instruction.
In this embodiment, the deployment operation is to determine node attribute information of each node legend in all the deployment steps, obtain parameters included in the deployment script in each node legend, and sequentially execute each deployment step according to a deployment sequence (i.e., an arrow direction of a connection line) to complete deployment of the applications.
Further, the completing the deployment operation on the node legend to be deployed according to the deployment script in the node attribute information, the dependency relationship in the line attribute information, and the parameter generation rule in the deployment instruction specifically includes:
step C41: and analyzing the deployment steps from the deployment script, and analyzing the static parameters and/or the dynamic parameters from each deployment step.
Step C42: and traversing each deployment step in sequence according to the sequence of the deployment steps, and judging whether the currently traversed target deployment step comprises dynamic parameters.
Step C43: if so, acquiring a parameter generation rule of the dynamic parameter from the deployment instruction when the parameter type of the dynamic parameter is referred, generating a dynamic parameter value according to the parameter generation rule, and storing the dynamic parameter value into a global place occupation corresponding to the dynamic parameter; and when the parameter type of the dynamic parameter is a reference, acquiring a dynamic parameter value of the dynamic parameter from the global position occupation corresponding to the dynamic parameter.
The dynamic parameters are generated by the applications corresponding to the deployment steps and stored in the preconfigured global placeholder, and when the dynamic parameters are referred by the applications corresponding to the other deployment steps, the dynamic parameters can be obtained from the global placeholder, so that the transfer of the dynamic parameters in the applications is completed.
In this embodiment, a tree-like topological graph recording dependency relationships among multiple applications to be deployed is obtained, the tree-like topological graph is modified to obtain a clean tree-like topological graph, and the clean tree-like topological graph is further analyzed to implement one-key deployment operation on the multiple applications with complex dependency relationships, the complex dependency relationships of the applications corresponding to multiple node legends can be obtained by storing node attribute information of the node legends and line attribute information of connecting lines in the clean tree-like topological graph, the problem of difficulty in deployment caused by repeated utilization of the same node legend is avoided, deployment resources are saved, the level of automated deployment of the applications is improved, and meanwhile, setting of dynamic occupation in a deployment process is supported so that dynamic parameters generated by the applications can be transmitted and used in the multiple deployed applications; the embodiment achieves multi-level and staged deployment of a single application, so that static parameters and/or dynamic parameters can be transmitted in the application at the same time, and the concurrent deployment efficiency of multiple applications and the deployment efficiency of repeated applications are greatly improved.
Example two
The embodiment of the invention also provides a multi-application deployment method, which specifically comprises the following steps:
step S1: and displaying node legends for representing various applications to be deployed through a first form in the display interface.
And displaying node legends used for representing various applications to be deployed through a first form in the display interface, wherein one type of application corresponds to one type of node legend.
Step S2: in response to a first operation of dragging a target node legend from the first window to a second window in the display interface, arranging the target node legend in the second window according to an end position of the first operation.
The first operation is a drag operation and is applied to each target node legend.
Step S3: responding to a second operation on the target node legend in the second form, displaying a third form in the display interface, and adding information input in the third form as node attribute information to the target node legend;
and the second operation is a click operation and is applied to each target node legend.
Specifically, the node attribute information includes: a deployment script for deploying an application corresponding to the node legend, and parameters included in the deployment script.
In this embodiment, the deployment script includes a plurality of deployment steps, and a part of the deployment steps includes dynamic parameters and/or static parameters; the deployment steps are the minimum execution units of the deployment scripts, a plurality of deployment steps can complete the deployment process of one application, and the deployment steps are executed in series.
It should be noted that the parameter value of the static parameter is a fixed parameter value that has been set before the deployment script is executed; the parameter values of the dynamic parameters are not set before the deployment script is executed, and need to be generated in the process of executing the deployment script.
Step S4: in response to a third operation on the first node legend and the second node legend in the second window, drawing a connecting line for connecting the first node legend and the second node legend in the second window.
Wherein the third operation is a wire operation, preferably, the wire is a wire with an arrow, for example, the first node legend points to the second node legend, and the first node legend needs to depend on the second node legend.
Step S5: and responding to a fourth operation on the connecting line in the second window, displaying a fourth window in the display interface, and adding information input in the fourth window as line attribute information to the connecting line.
And the fourth operation is click operation and is used for adding line attribute information to the connecting line.
Specifically, the line attribute information includes: the dependency relationship between a first application corresponding to the first node legend and a second application corresponding to the second node legend; wherein the dependency comprises: the first application depends on the second application, or a parameter in the deployment script of the first application depends on a parameter in the deployment script of the second application.
Step S6: and in response to a fifth operation triggered in the second form, setting all node legends interconnected by connecting lines in the second form as a tree topology.
In this embodiment, the tree topology includes: the system comprises a node legend and connecting lines, wherein the node legend is used for representing applications to be deployed, the connecting lines are used for representing dependency relationships among a plurality of applications to be deployed, each node legend has corresponding node attribute information, and each connecting line has corresponding line attribute information. In addition, in the tree topology, a node instance for an application may appear in the tree topology many times.
Step S7: and analyzing a root node legend, branches and subbranches of each branch from the tree topology graph.
The root node legend is a node legend located at the highest level of the tree-shaped topological graph, each branch at least comprises two levels of node legends, and the node legend at the highest level in each branch is the root node legend; the node map example of each level in the subbranch is connected with the node map example of at most one lower level.
Step S8: and receiving a deployment instruction aiming at the tree-shaped topological graph so as to perform deployment operation on the application to be deployed corresponding to each node legend in the tree-shaped topological graph.
Wherein the deployment instructions comprise: a parameter generation rule for generating parameter values of the dynamic parameter.
Step S9: sequentially traversing each subbranch from the leftmost subbranch in the tree-shaped topological graph according to the sequence from left to right, judging whether a node legend which is repeated in the 1 st to the (i-1) th subbranch exists in the currently traversed ith subbranch, if so, deleting the repeated node legend in the ith subbranch, and obtaining a clean tree-shaped topological graph after traversing all the subbranches; wherein i is a positive integer.
Specifically, the step S9 includes:
step D1: sequentially traversing each node legend from a high level to a low level from a first node legend of the ith subbranch, and judging whether a node string consisting of a target node legend traversed currently and all node legends behind the target node legend exists in the nth subbranch; wherein the Nth subbranch is one subbranch from the 1 st subbranch to the (i-1) th subbranch; wherein N is a positive integer.
Step D2: if so, deleting the node string, and adding an identifier of a related node legend into the node attribute information of the node legend of the higher level of the target node legend; the associated node legend is a node legend which is the same as the target node legend in the Nth branch;
if not, the node legend of the lower level is continuously traversed.
Deleting the node strings is to avoid the problem of difficult arrangement caused by repeatedly using the same application for arrangement under the condition of ensuring the integrity of the dependency relationship among the rest node legends.
Step S10: and sequentially traversing each sub-branch from the left-most sub-branch in the clean tree topology graph in the order from left to right, and sequentially storing each node legend in the currently traversed sub-branch into the deployment queue in the order from the low level to the high level.
And finally storing the root node legend into a deployment queue.
Specifically, the step S10 includes:
step E1: the node legends in the leftmost subbranch are taken in the clean topology map.
Step E2: and sequentially storing each node legend in the leftmost sub-branch into the deployment queue according to the sequence from bottom to top.
The node legends are sequentially stored from bottom to top, because each node legend in the subbranch has a dependency relationship that a node legend at a high level depends on a node legend at a low level, each node legend in the subbranch needs to be sequentially stored in the deployment queue from the low level to the high level, so as to ensure accuracy of the dependency relationship of the application corresponding to the node legend.
Step E3: and sequentially storing each node legend of the lowest hierarchy into the deployment queue according to the sequence from left to right.
Step E4: the leftmost sub-branch is removed from the clean topology and step E1 is re-executed.
Step S11: and sequentially storing other node legends except all traversed subbranches in the clean tree topology map into the deployment queue according to the sequence from a low level to a high level.
Step S12: and adding corresponding connecting lines between the node legends in the deployment queue according to the connecting lines between the node legends in the clean tree topology graph.
And adding corresponding connecting lines between the node legends in the deployment queue, wherein the connecting lines comprise solid lines and dotted lines, the solid lines represent that the applications corresponding to the two node legends have dependency relationships, and the dotted lines represent that dynamic parameters are transmitted between the applications corresponding to the node legends.
It should be noted that each node legend in the deployment queue retains node attribute information of all node legends of the same type in the clean tree topology graph, and each connection line in the deployment queue retains line attribute information of a corresponding connection line in the clean tree topology graph.
Step S13: and acquiring node legends to be deployed from the deployment queue in sequence according to the sequence stored in the deployment queue.
Step S14: and acquiring node attribute information of the node legend to be deployed and line attribute information of a connecting line between the node legend to be deployed and a previous node legend in the deployment queue.
Wherein the node attribute information includes: a deployment script for deploying an application corresponding to a node legend, parameters included in the deployment script, and an identification of an associated node legend.
Specifically, the line attribute information includes: and the dependency relationship between the application to be deployed corresponding to the node legend to be deployed and the previous application corresponding to the previous node legend in the deployment queue and the transfer relationship between the dynamic parameters and the applications corresponding to the node legend.
Step S15: and completing the deployment operation of the node legend to be deployed according to the deployment script in the node attribute information, the dependency relationship in the line attribute information and the parameter generation rule in the deployment instruction.
The deployment operation is to determine node attribute information of each node legend in all the deployment steps, obtain parameters included in the deployment script in each node legend, and sequentially execute each deployment step according to a deployment sequence (namely, an arrow direction of a connecting line) to complete deployment of the applications.
Specifically, the step S15 includes:
step F1: and analyzing the deployment steps from the deployment script, and analyzing the static parameters and/or the dynamic parameters from each deployment step.
Step F2: and traversing each deployment step in sequence according to the sequence of the deployment steps, and judging whether the currently traversed target deployment step comprises dynamic parameters.
Step F3: if so, acquiring a parameter generation rule of the dynamic parameter from the deployment instruction when the parameter type of the dynamic parameter is referred, generating a dynamic parameter value according to the parameter generation rule, and storing the dynamic parameter value into a global place occupation corresponding to the dynamic parameter; and when the parameter type of the dynamic parameter is the reference, acquiring the dynamic parameter value of the dynamic parameter from the global position occupation corresponding to the dynamic parameter.
Specifically, the dynamic parameter is generated by the application corresponding to the deployment step and stored in the preconfigured global placeholder, and when the dynamic parameter is referred to by the application corresponding to the other deployment step, the dynamic parameter can be obtained from the global placeholder, so as to complete the transfer of the dynamic parameter in the application.
EXAMPLE III
An embodiment of the present invention provides a multi-application deployment apparatus, and as shown in fig. 8, the apparatus specifically includes the following components:
an obtaining module 801, configured to obtain a tree topology diagram for representing a dependency relationship between multiple applications to be deployed; wherein the tree topology comprises: a node legend for characterizing applications and connecting lines for characterizing dependencies;
a sorting module 802, configured to reorder, according to a connection relationship between node legends in the tree topology graph through a connection line, the node legends in the tree topology graph to form a deployment queue including node legends of all types in the tree topology graph;
the deployment module 803 is configured to sequentially execute the deployment operation of the application corresponding to each node legend according to the sequence of each node legend in the deployment queue.
Specifically, the apparatus further comprises:
the drawing module is used for displaying node legends for representing various applications to be deployed through a first window in the display interface; in response to a first operation of dragging a target node legend from the first window to a second window in the display interface, arranging the target node legend in the second window according to an end position of the first operation; responding to a second operation on the target node legend in the second form, displaying a third form in the display interface, and adding information input in the third form as node attribute information to the target node legend; drawing a connecting line for connecting the first node legend and the second node legend in the second window in response to a third operation on the first node legend and the second node legend in the second window; responding to a fourth operation on the connecting line in the second window, displaying a fourth window in the display interface, and adding information input in the fourth window as line attribute information to the connecting line; and in response to a fifth operation triggered in the second form, setting all node legends interconnected by connecting lines in the second form as a tree topology.
Further, the node attribute information includes: a deployment script for deploying an application corresponding to the node legend, and parameters included in the deployment script;
the line attribute information includes: a dependency relationship between a first application corresponding to the first node legend and a second application corresponding to the second node legend; wherein the dependency comprises: the first application depends on the second application, or a parameter in the deployment script of the first application depends on a parameter in the deployment script of the second application.
Specifically, the apparatus further comprises:
the analysis module is used for analyzing a root node legend, branches and sub-branches of each branch from the tree topology graph; each branch at least comprises two levels of node legends, and the node legend of the highest level in each branch is a root node legend; the node map example of each level in the subbranch is connected with the node map example of at most one lower level.
Further, the sorting module 802 specifically includes:
the traversal unit is used for sequentially traversing each sub-branch from the leftmost sub-branch in the tree-shaped topological graph from left to right, judging whether a node legend which is repeated in the 1 st to (i-1) th sub-branches exists in the currently traversed ith sub-branch, if so, deleting the repeated node legend in the ith sub-branch, and obtaining a clean tree-shaped topological graph after traversing all the sub-branches;
the first storage unit is used for sequentially traversing each sub-branch from the leftmost sub-branch in the clean tree-shaped topological graph from left to right, and sequentially storing each node legend in the currently traversed sub-branch into the deployment queue from a low level to a high level;
the second storage unit is used for sequentially storing other node legends except all traversed subbranches in the clean tree topology graph into the deployment queue according to the sequence from a low level to a high level;
and the adding unit is used for adding corresponding connecting lines between the node legends in the deployment queue according to the connecting lines between the node legends in the clean tree topology graph.
Further, the traversal unit is specifically configured to:
sequentially traversing each node legend from a first node legend of the ith sub-branch according to a sequence from a high level to a low level, and judging whether a node string consisting of a currently traversed target node legend and all node legends located behind the target node legend exists in the nth sub-branch; wherein the Nth subbranch is one of the 1 st subbranch to the (i-1) th subbranch; if so, deleting the node string, and adding an identifier of a related node legend into the node attribute information of the node legend of the higher level of the target node legend; the associated node legend is a node legend which is the same as the target node legend in the Nth branch; if not, the node legend of the lower level is continuously traversed.
Further, the deployment module 803 specifically includes:
a receiving unit for receiving a deployment instruction; wherein the deployment instructions comprise: a parameter generation rule for generating parameter values of the dynamic parameters;
the first obtaining unit is used for sequentially obtaining node legends to be deployed from the deployment queue according to the sequence stored in the deployment queue;
a second obtaining unit, configured to obtain node attribute information of the node legend to be deployed and line attribute information of a connection line between the node legend to be deployed and a previous node legend in the deployment queue;
and the deployment unit is used for completing deployment operation on the node legend to be deployed according to the deployment script in the node attribute information, the dependency relationship in the line attribute information and the parameter generation rule in the deployment instruction.
Further, the deployment unit is specifically configured to:
analyzing deployment steps from the deployment script, and analyzing static parameters and/or dynamic parameters from each deployment step;
sequentially traversing each deployment step according to the sequence of the deployment steps, and judging whether the currently traversed target deployment step comprises dynamic parameters;
if so, when the parameter type of the dynamic parameter is quoted, acquiring a parameter generation rule of the dynamic parameter from the deployment instruction, generating a dynamic parameter value according to the parameter generation rule, and storing the dynamic parameter value into a global position occupation corresponding to the dynamic parameter; and when the parameter type of the dynamic parameter is the reference, acquiring the dynamic parameter value of the dynamic parameter from the global position occupation corresponding to the dynamic parameter.
Example four
The present embodiment also provides a computer device, such as a smart phone, a tablet computer, a notebook computer, a desktop computer, a rack server, a blade server, a tower server or a rack server (including an independent server or a server cluster composed of multiple servers) capable of executing a program, and the like. As shown in fig. 9, the computer device 90 of the present embodiment includes at least but is not limited to: a memory 901 and a processor 902 communicatively coupled to each other via a system bus. It is noted that FIG. 9 only shows the computer device 90 having components 901 and 902, but it is understood that not all of the shown components are required and that more or fewer components may be implemented instead.
In this embodiment, the memory 901 (i.e., a readable storage medium) includes a flash memory, a hard disk, a multimedia card, a card-type memory (e.g., SD or DX memory, etc.), a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a read-only memory (ROM), an electrically erasable programmable read-only memory (EEPROM), a programmable read-only memory (PROM), a magnetic memory, a magnetic disk, an optical disk, and the like. In some embodiments, the storage 901 may be an internal storage unit of the computer device 90, such as a hard disk or a memory of the computer device 90. In other embodiments, the memory 901 may also be an external storage device of the computer device 90, such as a plug-in hard disk, a Smart Media Card (SMC), a Secure Digital (SD) Card, a Flash memory Card (Flash Card), or the like, provided on the computer device 90. Of course, the memory 901 may also include both internal and external storage devices for the computer device 90. In the present embodiment, the memory 901 is generally used for storing an operating system and various types of application software installed in the computer device 90. Further, the memory 901 may also be used to temporarily store various types of data that have been output or are to be output.
Processor 902 may be a Central Processing Unit (CPU), controller, microcontroller, microprocessor, or other data Processing chip in some embodiments. The processor 902 is typically used to control the overall operation of the computer device 90.
Specifically, in this embodiment, the processor 902 is configured to execute the program of the multi-application deployment method stored in the memory 901, and when executed, the program of the multi-application deployment method implements the following steps:
acquiring a tree topology graph for representing the dependency relationship among a plurality of applications to be deployed; wherein the tree topology comprises: a node legend for characterizing applications and connecting lines for characterizing dependencies;
according to the connection relation of all node legends in the tree topology graph through connecting lines, sequencing all node legends in the tree topology graph again to form a deployment queue containing all types of node legends in the tree topology graph;
and executing the deployment operation of the application corresponding to each node legend in sequence according to the sequence of each node legend in the deployment queue.
The specific embodiment process of the above method steps can be referred to as embodiment one, and the detailed description of this embodiment is not repeated herein.
EXAMPLE five
The present embodiments also provide a computer readable storage medium, such as a flash memory, a hard disk, a multimedia card, a card type memory (e.g., SD or DX memory, etc.), a Random Access Memory (RAM), a Static Random Access Memory (SRAM), a Read Only Memory (ROM), an Electrically Erasable Programmable Read Only Memory (EEPROM), a Programmable Read Only Memory (PROM), a magnetic memory, a magnetic disk, an optical disk, a server, an App application mall, etc., having stored thereon a computer program that when executed by a processor implements the method steps of:
acquiring a tree topology graph for representing the dependency relationship among a plurality of applications to be deployed; wherein the tree topology comprises: a node legend for characterizing applications and connecting lines for characterizing dependencies;
according to the connection relation of all node legends in the tree topology graph through connecting lines, sequencing all node legends in the tree topology graph again to form a deployment queue containing all types of node legends in the tree topology graph;
and executing the deployment operation of the application corresponding to each node legend in sequence according to the sequence of each node legend in the deployment queue.
The specific embodiment process of the above method steps can be referred to as embodiment one, and the detailed description of this embodiment is not repeated herein.
It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising an … …" does not exclude the presence of other like elements in a process, method, article, or apparatus that comprises the element.
The above-mentioned serial numbers of the embodiments of the present invention are merely for description and do not represent the merits of the embodiments.
Through the above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner.
The above description is only a preferred embodiment of the present invention, and not intended to limit the scope of the present invention, and all modifications of equivalent structures and equivalent processes, which are made by using the contents of the present specification and the accompanying drawings, or directly or indirectly applied to other related technical fields, are included in the scope of the present invention.
Claims (10)
1. A method for deploying multiple applications, the method comprising:
acquiring a tree topology graph for representing the dependency relationship among a plurality of applications to be deployed; wherein the tree topology comprises: a node legend for characterizing applications and connecting lines for characterizing dependencies;
according to the connection relation of all node legends in the tree topology graph through connecting lines, sequencing all node legends in the tree topology graph again to form a deployment queue containing all types of node legends in the tree topology graph;
and executing the deployment operation of the application corresponding to each node legend in sequence according to the sequence of each node legend in the deployment queue.
2. The multi-application deployment method of claim 1, further comprising:
displaying node legends for representing various applications to be deployed through a first form in a display interface;
in response to a first operation of dragging a target node legend from the first window to a second window in the display interface, arranging the target node legend in the second window according to an end position of the first operation;
responding to a second operation on the target node legend in the second form, displaying a third form in the display interface, and adding information input in the third form as node attribute information to the target node legend;
drawing a connecting line for connecting the first node legend and the second node legend in the second window in response to a third operation on the first node legend and the second node legend in the second window;
responding to a fourth operation on the connecting line in the second form, displaying a fourth form in the display interface, and adding information input in the fourth form as line attribute information to the connecting line;
and in response to a fifth operation triggered in the second form, setting all node legends interconnected by connecting lines in the second form as a tree topology.
3. The multi-application deployment method of claim 2, wherein the node attribute information comprises: a deployment script for deploying an application corresponding to the node legend, and parameters included in the deployment script;
the line attribute information includes: the dependency relationship between a first application corresponding to the first node legend and a second application corresponding to the second node legend; wherein the dependency comprises: the first application depends on the second application, or a parameter in the deployment script of the first application depends on a parameter in the deployment script of the second application.
4. The multi-application deployment method of claim 3, further comprising:
analyzing a root node legend, branches and sub-branches of each branch from the tree topology graph;
each branch at least comprises two levels of node legends, and the node legend of the highest level in each branch is a root node legend;
the node map example of each level in the subbranch is connected with the node map example of at most one lower level.
5. The multi-application deployment method according to claim 4, wherein the re-ordering the node legends in the tree topology graph according to the connection relationship between the node legends in the tree topology graph through the connection lines to form a deployment queue containing all types of node legends in the tree topology graph specifically includes:
sequentially traversing each sub-branch from the leftmost sub-branch in the tree-shaped topological graph from left to right, judging whether a node legend which is repeated with the 1 st to the (i-1) th sub-branches exists in the currently traversed ith sub-branch, if so, deleting the repeated node legend in the ith sub-branch, and obtaining a clean tree-shaped topological graph after traversing all the sub-branches;
sequentially traversing each sub-branch from left to right from the leftmost sub-branch in the clean tree topology graph, and sequentially storing each node legend in the currently traversed sub-branch into the deployment queue from a low level to a high level;
sequentially storing other node legends except all traversed subbranches in the clean tree topology graph into the deployment queue according to the sequence from a low level to a high level;
and adding corresponding connecting lines between the node legends in the deployment queue according to the connecting lines between the node legends in the clean tree topology graph.
6. The multi-application deployment method according to claim 5, wherein the step of sequentially traversing each subbranch from left to right from the leftmost subbranch in the tree topology map, and determining whether a node legend that is identical to the node legends in the 1 st to (i-1) th subbranches exists in the ith currently traversed subbranch, if so, deleting the identical node legend in the ith subbranch, and obtaining a clean tree topology map after traversing all the subbranches specifically includes:
sequentially traversing each node legend from a first node legend of the ith sub-branch according to a sequence from a high level to a low level, and judging whether a node string consisting of a currently traversed target node legend and all node legends located behind the target node legend exists in the nth sub-branch; wherein the Nth subbranch is one of the 1 st subbranch to the (i-1) th subbranch;
if so, deleting the node string, and adding an identifier of a related node legend into the node attribute information of the node legend of the higher level of the target node legend; the associated node legend is a node legend which is the same as the target node legend in the Nth branch;
if not, the node legend of the lower level is continuously traversed.
7. The multi-application deployment method according to claim 6, wherein the sequentially executing the deployment operation of the application corresponding to each node legend according to the sequence of each node legend in the deployment queue specifically includes:
receiving a deployment instruction; wherein the deployment instructions comprise: a parameter generation rule for generating parameter values of the dynamic parameters;
sequentially acquiring node legends to be deployed from the deployment queue according to the sequence stored in the deployment queue;
acquiring node attribute information of the node legend to be deployed and line attribute information of a connecting line between the node legend to be deployed and a previous node legend in the deployment queue;
and completing the deployment operation of the node legend to be deployed according to the deployment script in the node attribute information, the dependency relationship in the line attribute information and the parameter generation rule in the deployment instruction.
8. The multi-application deployment method according to claim 7, wherein the completing the deployment operation on the node legend to be deployed according to a deployment script in the node attribute information, a dependency relationship in the line attribute information, and a parameter generation rule in the deployment instruction specifically includes:
analyzing deployment steps from the deployment script, and analyzing static parameters and/or dynamic parameters from each deployment step;
sequentially traversing each deployment step according to the sequence of the deployment steps, and judging whether the currently traversed target deployment step comprises dynamic parameters;
if so, acquiring a parameter generation rule of the dynamic parameter from the deployment instruction when the parameter type of the dynamic parameter is referred, generating a dynamic parameter value according to the parameter generation rule, and storing the dynamic parameter value into a global place occupation corresponding to the dynamic parameter; and when the parameter type of the dynamic parameter is the reference, acquiring the dynamic parameter value of the dynamic parameter from the global position occupation corresponding to the dynamic parameter.
9. A computer device, the computer device comprising: memory, processor and computer program stored on the memory and executable on the processor, characterized in that the processor implements the steps of the method of any of claims 1 to 8 when executing the computer program.
10. A computer-readable storage medium, on which a computer program is stored, which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210187522.1A CN114546432A (en) | 2022-02-28 | 2022-02-28 | Multi-application deployment method, device, equipment and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202210187522.1A CN114546432A (en) | 2022-02-28 | 2022-02-28 | Multi-application deployment method, device, equipment and readable storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN114546432A true CN114546432A (en) | 2022-05-27 |
Family
ID=81680339
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202210187522.1A Pending CN114546432A (en) | 2022-02-28 | 2022-02-28 | Multi-application deployment method, device, equipment and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114546432A (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115167913A (en) * | 2022-08-02 | 2022-10-11 | 统信软件技术有限公司 | Operating system layering method, computing device and storage medium |
| CN115604101A (en) * | 2022-09-29 | 2023-01-13 | 北京亚控科技发展有限公司（Cn） | System management method and related equipment |
| CN115167913B (en) * | 2022-08-02 | 2024-06-04 | 统信软件技术有限公司 | Layering method of operating system, computing equipment and storage medium |
-
2022
- 2022-02-28 CN CN202210187522.1A patent/CN114546432A/en active Pending
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN115167913A (en) * | 2022-08-02 | 2022-10-11 | 统信软件技术有限公司 | Operating system layering method, computing device and storage medium |
| CN115167913B (en) * | 2022-08-02 | 2024-06-04 | 统信软件技术有限公司 | Layering method of operating system, computing equipment and storage medium |
| CN115604101A (en) * | 2022-09-29 | 2023-01-13 | 北京亚控科技发展有限公司（Cn） | System management method and related equipment |
| CN115604101B (en) * | 2022-09-29 | 2024-02-02 | 北京亚控科技发展有限公司 | System management method and related equipment |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10908887B2 (en) | Dynamic container deployment with parallel conditional layers | |
| US20170068676A1 (en) | Layer Identification and Dependency Analysis for Management of Images | |
| CN111061643B (en) | SDK cluster compatibility detection method and device, electronic equipment and storage medium | |
| US11966312B2 (en) | Operation logs visualization device, operation logs visualization method and operation logs visualization program | |
| CN110780897B (en) | Code changing method and device | |
| CN110231994B (en) | Memory analysis method, memory analysis device and computer readable storage medium | |
| CN110928802A (en) | Test method, device, equipment and storage medium based on automatic generation of case | |
| CN113377667A (en) | Scene-based testing method and device, computer equipment and storage medium | |
| CN114546432A (en) | Multi-application deployment method, device, equipment and readable storage medium | |
| CN113259397B (en) | Method, device and equipment for executing plan and readable storage medium | |
| CN111124872A (en) | Branch detection method and device based on difference code analysis and storage medium | |
| CN117234582A (en) | Project code processing method and device, electronic equipment and storage medium | |
| CN109582347B (en) | Method and device for acquiring front-end codes | |
| CN109191379B (en) | Panorama splicing semantic annotation method, system, terminal and storage medium | |
| CN112818129B (en) | Atlas modeling system and method | |
| CN111610908B (en) | Method for generating frame diagram, computer equipment and readable storage medium | |
| CN112433950A (en) | Method for automatically building test environment, electronic equipment and storage medium | |
| CN112363819A (en) | Big data task dynamic scheduling method and device and computing equipment | |
| CN111752821B (en) | Method, device, computer equipment and readable storage medium for packet pressure measurement | |
| CN111444392A (en) | Method, device and equipment for accessing cave library | |
| CN110990475B (en) | Batch task inserting method and device, computer equipment and storage medium | |
| CN116483324A (en) | Multi-terminal parallel development method, device, equipment, medium and product of low-code platform | |
| CN114741637A (en) | Method, device and equipment for generating form page and readable storage medium | |
| CN116661827A (en) | Method, device, equipment and readable storage medium for updating nested component | |
| CN112579079A (en) | File processing method and device, computer equipment and storage medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |