CN113052707A - Application production method and device, computer equipment and storage medium - Google Patents
Application production method and device, computer equipment and storage medium Download PDFInfo
- Publication number
- CN113052707A CN113052707A CN202110484637.2A CN202110484637A CN113052707A CN 113052707 A CN113052707 A CN 113052707A CN 202110484637 A CN202110484637 A CN 202110484637A CN 113052707 A CN113052707 A CN 113052707A
- Authority
- CN
- China
- Prior art keywords
- production
- node
- nodes
- target
- target node
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
- 238000004519 manufacturing process Methods 0.000 title claims abstract description 232
- 238000003860 storage Methods 0.000 title claims abstract description 17
- 238000000034 method Methods 0.000 claims abstract description 49
- 230000001419 dependent effect Effects 0.000 claims description 61
- 230000015654 memory Effects 0.000 claims description 14
- 238000004590 computer program Methods 0.000 claims description 7
- 238000009434 installation Methods 0.000 description 17
- 238000011161 development Methods 0.000 description 10
- 238000004891 communication Methods 0.000 description 8
- 230000008569 process Effects 0.000 description 8
- 238000010586 diagram Methods 0.000 description 7
- 238000012423 maintenance Methods 0.000 description 7
- 238000012545 processing Methods 0.000 description 7
- 230000007246 mechanism Effects 0.000 description 5
- 230000008859 change Effects 0.000 description 4
- 230000006870 function Effects 0.000 description 4
- 238000012356 Product development Methods 0.000 description 3
- 230000008878 coupling Effects 0.000 description 3
- 238000010168 coupling process Methods 0.000 description 3
- 238000005859 coupling reaction Methods 0.000 description 3
- 230000003287 optical effect Effects 0.000 description 3
- RUPBZQFQVRMKDG-UHFFFAOYSA-M Didecyldimethylammonium chloride Chemical compound [Cl-].CCCCCCCCCC[N+](C)(C)CCCCCCCCCC RUPBZQFQVRMKDG-UHFFFAOYSA-M 0.000 description 1
- 230000002457 bidirectional effect Effects 0.000 description 1
- 238000012790 confirmation Methods 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 238000013500 data storage Methods 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 238000009826 distribution Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000000977 initiatory effect Effects 0.000 description 1
- 230000014759 maintenance of location Effects 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/06—Asset management; Financial planning or analysis
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/02—Banking, e.g. interest calculation or account maintenance
Landscapes
- Business, Economics & Management (AREA)
- Engineering & Computer Science (AREA)
- Finance (AREA)
- Accounting & Taxation (AREA)
- Development Economics (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- Economics (AREA)
- Marketing (AREA)
- Strategic Management (AREA)
- Technology Law (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Human Resources & Organizations (AREA)
- Game Theory and Decision Science (AREA)
- Stored Programmes (AREA)
Abstract
Provided herein are an application commissioning method, apparatus, computer device, and storage medium, wherein the method comprises: acquiring target nodes of a plurality of applications to be put into production; acquiring the dependency relationship between any two target nodes; establishing a production sequence among the target nodes of each application according to the dependency relationship; and putting the applications into production according to the production sequence. According to the method, the target nodes of the applications can be serially connected into the production sequence according to the dependency relationship among the target nodes, the production of the applications is executed according to the production sequence among the nodes, the associated automatic production of multiple applications is realized, and the application production efficiency is improved.
Description
Technical Field
The invention can be used in the technical field of finance, in particular to an application production method, an application production device, computer equipment and a storage medium.
Background
In order to meet the continuous change of business requirements, the product development and release speed of the banking industry is faster and faster. The realization of the functions of the products often requires a plurality of applications to cooperate to provide services. There are sometimes dependencies between these applications, for example, if application a depends on application B, then a change to application B may result in a change to application a, and the normal operation of application a depends on application B. However, since the development of each application is relatively independent in the development stage, developers often develop only the applications that are responsible for the development stage independently, and the details of the production of other applications that are not responsible for the development stage are not known. And the same product may involve dozens or even dozens of applications, and it is difficult for the same developer to integrate and connect in series to complete the production process of the whole product line. In this case, the production sequence among multiple applications often requires manual intervention of operation and maintenance personnel, and real automatic production cannot be realized. Therefore, the production efficiency of the product application is seriously affected.
In view of the above, the present disclosure aims to provide an application production method, an application production apparatus, a computer device, and a storage medium, so as to solve the problem of low application distribution efficiency in the prior art.
Disclosure of Invention
In view of the foregoing problems in the prior art, an object of the present disclosure is to provide an application commissioning method, an application commissioning apparatus, a computer device, and a storage medium, so as to solve the problem of inefficiency caused by the fact that automation of application commissioning cannot be achieved in the prior art.
In order to solve the technical problems, the specific technical scheme is as follows:
in one aspect, provided herein is an application commissioning method comprising:
acquiring target nodes of a plurality of applications to be put into production;
acquiring the dependency relationship between any two target nodes;
establishing a production sequence among the target nodes of each application according to the dependency relationship;
and putting the applications into production according to the production sequence.
Specifically, before the commissioning of each application according to the commissioning sequence, the method further includes:
and judging whether the production sequence has production circulation or not so as to judge whether the production sequence is correct or not.
Specifically, the determining whether a production cycle exists in the production sequence includes:
calculating the number of dependent nodes of each target node in the production sequence;
acquiring a target node with the number of the dependent nodes being zero as a current node, and writing the current node into a traversed node set; other target nodes except the current node in the production sequence form an unretraversed node set;
updating the number of dependent nodes of the target node in the non-traversed node set according to a preset updating rule;
taking the target node with the number of the updated dependent nodes being zero as a new current node until the number of the dependent nodes of all the target nodes in the node set which is not traversed is not zero;
if the non-traversed node set is not empty, the production sequence has a production cycle;
and if the set of nodes which are not traversed is empty, the production sequence has no production cycle.
Further, the updating, according to a preset update rule, the number of dependent nodes of the target node in the non-traversed node set is:
acquiring a target node in the non-traversed node set, wherein the target node has a dependency relationship with the current node and serves as a node to be updated;
and performing a subtraction operation on the number of the dependent nodes of the node to be updated.
Preferably, the determining whether a production cycle exists in the production sequence further includes:
and when the production sequence is judged to have production circulation, sending a production sequence error reporting prompt.
Further, the commissioning each of the applications according to the commissioning order includes:
inquiring the production records of each target node in the production sequence, wherein the production records comprise the starting basis and the production state of each target node;
taking the target node with the finished production state as a produced node;
and according to the starting basis, executing the production of the target node positioned behind the produced node in the production sequence.
Preferably, the commissioning record further comprises a commissioning time limit, and the method further comprises:
acquiring the production start time and the production end time of each target node;
judging whether the production of the target node fails or not according to the production starting time, the production ending time and the production time limit;
and if the target node fails in production, sending production failure alarm information.
In another aspect, this document also provides an application commissioning device comprising:
the system comprises a first acquisition module, a second acquisition module and a third acquisition module, wherein the first acquisition module is used for acquiring target nodes of a plurality of applications to be produced;
the second acquisition module is used for acquiring the dependency relationship between any two target nodes;
a production sequence establishing module, configured to establish a production sequence of the target node of each application according to the dependency relationship;
and the production module is used for producing each application according to the production sequence.
In another aspect, a computer device is also provided herein, which includes a memory, a processor, and a computer program stored on the memory and executable on the processor, and when the processor executes the computer program, the method steps provided in the above technical solution are implemented.
In another aspect, a computer-readable storage medium is provided, which stores a computer program, which when executed by a processor implements the method steps provided in the above technical solution.
By adopting the technical scheme, the application production method, the application production device, the computer equipment and the storage medium can string all target nodes of all applications into a production sequence according to the dependency relationship among the target nodes, and the production of the applications is executed according to the production sequence among the nodes, so that the associated automatic production of multiple applications is realized, and the production efficiency is improved.
In order to make the aforementioned and other objects, features and advantages of the present invention comprehensible, preferred embodiments accompanied with figures are described in detail below.
Drawings
In order to more clearly illustrate the embodiments or technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art that other drawings can be obtained according to the drawings without creative efforts.
Fig. 1 is a schematic diagram illustrating steps of an application commissioning method provided in an embodiment of the present disclosure;
FIG. 2 is a schematic diagram illustrating the steps of determining whether a production cycle exists in a production sequence in the embodiment of the present disclosure;
FIG. 3 is a schematic diagram illustrating a step of updating the number of dependent nodes of a target node in an unrotated node in the embodiment of the present disclosure;
FIG. 4 shows a schematic diagram of the steps of commissioning applications according to a commissioning order in an embodiment herein;
fig. 5 is a schematic structural diagram of an application commissioning device provided in an embodiment of the present disclosure;
fig. 6 shows a schematic structural diagram of a computer device provided in an embodiment herein.
Description of the symbols of the drawings:
10. a first acquisition module;
20. a second acquisition module;
30. a production sequence establishing module;
40. a production module;
602. a computer device;
604. a processor;
606. a memory;
608. a drive mechanism;
610. an input/output module;
612. an input device;
614. an output device;
616. a presentation device;
618. a graphical user interface;
620. a network interface;
622. a communication link;
624. a communication bus.
Detailed Description
The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments herein without making any creative effort, shall fall within the scope of protection.
It should be noted that the terms "first," "second," and the like in the description and claims herein and in the above-described drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments herein described are capable of operation in sequences other than those illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, apparatus, article, or device that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or device.
In order to meet the continuous change of business requirements, the development and the upgrade of product applications in the financial industry are more and more frequent, and the rapid completion of the update, the release and the production of products is also one of the important challenges for developing operation and maintenance personnel. In practice, a product often depends on a plurality of applications to cooperate with each other for realizing the functions, and the plurality of applications often have dependency relationships. In order to improve the product development efficiency and shorten the product development period, the applications are generally distributed to a plurality of development teams for collaborative development, and then the applications are connected in series according to the dependency relationship between the applications during production for production. However, since a development team only knows the applications that it is responsible for developing, the details of the commissioning of the applications that other development teams are responsible for are not known. Therefore, the production sequence among the multiple applications needs manual intervention of operation and maintenance personnel, real automatic production cannot be realized, and the production efficiency of products is reduced. In addition, when the production sequence among a plurality of applications is spurious, and the production sequence of two or more applications is in a dead cycle, the production of the product is also failed in a serious case. Therefore, the operation and maintenance personnel are required to carefully check the production sequence between the applications, and the working pressure of the operation and maintenance personnel is increased.
In order to solve the above problems, embodiments herein provide an application commissioning method, apparatus, computer device and storage medium, which can implement automatic commissioning of a product and improve commissioning efficiency of the product. The application commissioning method and device provided by the embodiment of the invention can be used in the financial field and can also be used in any field except the financial field. Fig. 1 is a schematic diagram of the steps of a method for applying a production method provided in the embodiments herein, and the present specification provides the method operation steps as described in the embodiments or flowcharts, but may include more or less operation steps based on conventional or non-inventive labor. The order of steps recited in the embodiments is merely one manner of performing the steps in a multitude of orders and does not represent the only order of execution. When an actual system or apparatus product executes, it can execute sequentially or in parallel according to the method shown in the embodiment or the figures. Specifically, as shown in fig. 1, the method may include:
s110: acquiring target nodes of a plurality of applications to be put into production;
in this specification embodiment, the target node of the application may include a shutdown node and/or a startup node, and a first installation node and/or a second installation node.
The shutdown node can be the shutdown running time of the previous version of the application, the upgrading and iteration of financial products are very frequent, and for a product to be produced, a certain application can be developed for the first time, and if the previous version is not available, the application can have no shutdown node; in contrast, the start node is the start runtime of an application in post-production, and for an application that is abandoned after a product update, the application may not have a start node. And if the version of a certain application is updated during the production at this point, the version of the application has both the previous version and the next version, and the version of the application corresponds to the shutdown node of the previous version and the startup node of the next version.
The first installation node is used for installing the application batch version, and the second installation node is used for installing the application online version; the batch version is used for meeting the processing requirements of a bank on batch services, such as end-of-day batch services, wherein the batch processing of all services on the day is carried out by the bank at night, the account entry processing of all services on the day is carried out, account information is changed, and the like; the online version is opposite to the batch version and is used for meeting the processing requirement of the bank system on services needing immediate processing, such as deposit and withdrawal services of depositors. For some applications, the target node may only have one of the first installation node and the second installation node; it is also possible to include both the first and second installation nodes.
S120: acquiring the dependency relationship between any two target nodes;
in this embodiment of the present description, obtaining a dependency relationship between any two target nodes may be obtaining a dependency relationship between target nodes belonging to the same application, or obtaining a dependency relationship between two target nodes across applications. The dependency relationship between target nodes in the same application is generally as follows: the first installation node and/or the second installation node depend on the shutdown node; the initiating node relies on the first installation node and/or the second installation node. The first installation node and the second installation node may be in a serial production relationship (i.e. when both installation nodes exist, one depends on the other), or in a parallel production relationship, i.e. the two installation nodes have no dependency relationship with each other.
It should be noted that, in this embodiment of the present specification, the dependency relationship refers to a "coupled" (or closely associated) relationship between two target nodes, and when the target node a1 of the application a depends on the target node B2 of the application B, the normal operation of the target node a1 of the application a depends on the normal operation of the target node B2 of the application B. Due to the inherent complexity of the business system, the "dependency" between applications is inevitable, and the dependency between applications often refers to the call relationship between applications. Which is basically embodied in code, for example, if Application a depends on Application B, Application a may call an API (Application Program Interface) exposed by Application B, while Application B cannot call the API of Application a.
S130: establishing a production sequence among the target nodes of each application according to the dependency relationship;
namely, according to the dependency relationship among all target nodes included in each application to be put into production, establishing a production sequence: when the target node A1 of application A depends on the target node B2 of application B, the target node B2 is commissioned before the target node A1 is commissioned.
S140: and putting the applications into production according to the production sequence.
Therefore, according to the application commissioning method provided in the embodiment of the present specification, a commissioning sequence among applications is combed according to a dependency relationship among target nodes of a plurality of applications, and then commissioning of the applications is performed according to the dependency relationship, so that manual intervention is not required, automation of commissioning of products is realized, and improvement of commissioning efficiency of the products is facilitated. In addition, in the embodiment of the specification, the application production sequence is managed by the dependency relationship among the nodes, so that the granularity is finer and the management precision is higher.
Preferably, in this embodiment of the present specification, the naming of each target node is further normalized, and a naming rule of the target node is specified as: application name + node name + version number. For example, the shutdown node of the a application is named as Astop20120201, where the version number may be the boot time of the target node, and the boot time of the shutdown node of the a application is 2012-02/01. The name corresponding to the shutdown node is stop; the name corresponding to the starting node is start; the name corresponding to the first installation node is batch; and the name corresponding to the second installation node is online.
Therefore, the condition that a plurality of target nodes have the same name can be avoided, and the confusion of the dependency relationship when the dependency relationship between any two target nodes is obtained is avoided; the time spent on repeated confirmation of the two sides of the dependency relationship when the dependency relationship between the target nodes is obtained can be reduced, and the efficiency of obtaining the dependency relationship is improved; and the establishment of a production sequence is facilitated on the premise that the target nodes have unified naming rules.
It should be noted that, in the embodiment of the present specification, the dependency relationship should be a one-way dependency relationship, that is, when the target node a1 depends on the target node B2, the target node B2 should be commissioned first, and then the target node a1 should be commissioned; if the target node B2 depends on the target node a1, the production sequence is that the target node a1 is produced first and then the target node B2 is produced, i.e., the new production sequence will be inconsistent with the previous production sequence, i.e., the production sequence has a production cycle, which will result in the production process being unable to continue. When the production sequence between two or more than two target nodes has production cycle, the production failure can be caused when the production sequence is serious.
Since the "dependency" relationship between applications usually refers to the call relationship between applications, the "dependency" between applications may be bidirectional, for example, application a may call application B, which may also call application a in turn.
To solve the problem that the production sequence has dead cycles to cause product production failure, in the embodiment of the present specification, preferably, in step S140: before the applications are put into production according to the production sequence, the method further comprises the following steps:
and judging whether the production sequence has production circulation or not so as to judge whether the production sequence is correct or not.
As shown in fig. 2, determining whether a production cycle exists in the production sequence may further include the following steps:
s210: calculating the number of dependent nodes of each target node in the production sequence;
s220: acquiring a target node with the number of the dependent nodes being zero as a current node, and writing the current node into a traversed node set; other target nodes except the current node in the production sequence form an unretraversed node set;
the traversed node set may be a queue, a data stack, or other storage structure having data storage functionality.
S230: updating the number of dependent nodes of the target node in the non-traversed node set according to a preset updating rule;
s240: taking the target node with the number of the updated dependent nodes being zero as a new current node until the number of the dependent nodes of all the target nodes in the node set which is not traversed is not zero;
s250: if the non-traversed node set is not empty, the production sequence has a production cycle;
s260: and if the set of nodes which are not traversed is empty, the production sequence has no production cycle.
Further, as shown in fig. 3, step S230: the updating the number of dependent nodes of the target node in the non-traversed node set according to the preset updating rule may include the following steps:
s310: acquiring a target node in the non-traversed node set, wherein the target node has a dependency relationship with the current node and serves as a node to be updated;
s320: and performing a subtraction operation on the number of the dependent nodes of the node to be updated.
For example, the following production sequence is followed: a → b → c → d;
that is, the target nodes a, b, c, d are executed sequentially, and according to the explanation of the production sequence, the dependency relationship among the target nodes is as follows: target node b depends on target node a, target node c depends on target node d, and target node d depends on target node c.
Then, the number of dependent nodes of each target node in the dependency order is calculated as: the number of dependent nodes of the target node a is 0; the number of dependent nodes of the target nodes b, c and d is all 1.
Further acquiring a target node (namely a target node a) with the number of the dependent nodes being zero as a current node, and writing the current node into the traversed node set; the other target nodes (i.e., target nodes b, c, and d) form a set of non-traversed nodes.
Furthermore, when the number of dependent nodes of the target node in the non-traversed node set is updated, since only the target node b and the target node a have a dependency relationship, the number of dependent nodes of the target node b is reduced by one, and the number of dependent nodes of other target nodes is unchanged. After updating, the number of dependent nodes of each target node in the non-traversed node set is as follows: the number of dependent nodes of the target node b is 0; the number of dependent nodes of the target nodes c and d is 1.
And (5) performing the next round of traversal: taking the target node b as a new current node, and writing the target node b into the traversed node set; the remaining destination nodes c and d form an unrotated node set.
Because the target node c and the target node b have a dependency relationship, the number of the dependent nodes of the target node c is reduced by one, and the number of the dependent nodes of the target node d is kept unchanged; after updating, the number of dependent nodes of the target node c is 0, and the number of dependent nodes of the target node d is still 1.
Repeating the traversal process, storing the target node c into the traversed node set, and updating the number of the dependent nodes of the target node d to enable the value to be 0;
and storing the target node d into the traversed node set.
So far, the number of dependent nodes of all target nodes in the traversable node set is not 0, and the traversable node set is empty, so that it can be determined that no production cycle exists in the production sequence a → b → c → d, the production sequence is correct, and production can be performed in the production sequence.
In the production order, the same target node may have a dependency relationship with multiple target nodes, for example, the following production order:
namely, the target node n depends on the target node l and the target node m;
calculating the number of dependent nodes of each target node in the production sequence to know: the number of the dependent nodes of the target nodes j and m is 0; the number of the dependent nodes of the target nodes k and l is l; the number of dependent nodes of the target node n is 2.
Therefore, the target nodes j and m are stored in the traversed node set (here, the sequence of storing the target nodes j and m in the traversed node set is not limited); updating the number of the dependent nodes of other target nodes to obtain: the number of dependent nodes of the target node k is 0, and the number of dependent nodes of the target node l is 1; the number of dependent nodes of the target node n is 2-1 to 1.
And then putting the target node k into the traversed node set, and updating the number of the residual dependent nodes of the other target nodes again to obtain: the number of dependent nodes of the target node l is 0; the number of dependent nodes of the target node n is 1.
And then the target node l is put into the traversed node set, the number of the dependent nodes of the target node n is updated, after the updating, the number of the dependent nodes of the target node n is 0, and the target node n is also stored into the traversed node set.
And if the target node with the non-traversed node set and the non-traversed node set have no dependent node of zero and all the nodes in the production sequence are traversed, the production sequence has no cyclic dependence.
In the embodiment of the present specification, not only the determination of the production sequence between different target nodes in the same application but also the determination of the correctness of the production sequence between multiple target nodes across applications is supported. In addition, when the production order is judged:
the application production method has the advantages that the application production method is correct, and when the production of each application is executed according to the production sequence, the number of the dependent nodes of the target node j and the target node k is 0, so that the target nodes j and l can be produced in parallel, and compared with the prior art that only one target node is produced at a time, a plurality of target nodes can be produced in parallel when the number of the target nodes is large.
In the embodiment of the present specification, when step S250: if the non-traversed node set is not empty, the production sequence has a production cycle; further comprising:
and sending a production sequence error reporting prompt.
For example, the following production sequence is followed: e → f → g → h → f;
calculating the number of dependent nodes of each target node in the production sequence as follows: the number of dependent nodes of the target node e is 0; the number of dependent nodes of the target node f is 2; the number of dependent nodes of the target nodes g and h is 1.
Selecting a target node e as a current node, and updating the number of dependent nodes of other target nodes to obtain an updated value, wherein the number of dependent nodes of each target node in the non-traversal node set is as follows: the number of dependent nodes of the target nodes f, g and h is all 1.
At this time, the number of dependent nodes of all target nodes in the non-traversed node set is not zero, which indicates that the traversal of each target node in the production sequence is completed.
However, if the set of non-traversed nodes is not empty (target nodes f, g, and h are also present in the set of non-traversed nodes), then there is a production loop for the production sequence. The production sequence e → f → g → h → f is wrong. And sending a production sequence error reporting prompt to a developer, and prompting the developer to check the dependency relationship among the target nodes.
As shown in fig. 4, in some possible embodiments, step S140: and according to the production sequence, producing each application, further comprising:
s410: inquiring the production records of each target node in the production sequence, wherein the production records comprise the starting basis and the production state of each target node;
the production record is written into a parameter table (or other storage structure) in advance in a normal edit format, and the production record further includes names of target nodes, such as: astop 20120201.
S420: taking the target node with the finished production state as a produced node; and according to the starting basis, executing the production of the target node positioned behind the produced node in the production sequence.
Namely the production sequence is as follows: a → b → c → d; and if the production state of the target node is finished, executing the production step of the target node b according to the starting basis of the target node b. And the production of each target node is sequentially carried out in the production sequence.
The start-up criteria includes a timing start and an automatic start, and the timing start may be an absolute timing start time of the target node, for example: the absolute timing starting time of the target node b is 2021 year, 2 month, 1 day, 4 days; then when the commissioning status of target node a is complete, then commissioning of target node b is initiated at 2/1/4/2021, whenever target node a is complete.
The timed start may also be a relative timed start time for the target node, such as: the relative timing starting time of the target node b is x minutes (or hours) after the target node a finishes the production, and when the production state of the target node a is finished, the target node b is started after x minutes (or hours) after the completion of the target node a.
When the relative timing starting time of the target node b is 0 minute after the target node a finishes the delivery, namely the starting basis of the target node is automatic starting.
In order to monitor the production status of each target node, in this embodiment of the present specification, preferably, the production record may further include a production time limit, and the method further includes:
s510: acquiring the production start time and the production end time of each target node;
when the starting basis of the subsequent target node is automatic starting, the commissioning start time of the subsequent target node is the commissioning end time of the previous target node, and the subsequent target node depends on the previous target node.
S520: judging whether the production of the target node fails or not according to the production starting time, the production ending time and the production time limit;
the production time limit may be a time required for the target node to complete the expected production, the actual production time of the target node may be calculated according to the production end time and the production start time, and the actual production time may be compared with the production time limit to determine whether the target node is produced overtime.
S530: and if the target node fails in production, sending production failure alarm information.
In some possible embodiments, whether the target node fails in production may also be determined according to the starting basis of the target node. For example, in the commissioning sequence a → b → c → d, the commissioning of the target node b is initiated according to the timing of 2021, 2, month, 1, day 4; if the target node b is still not started at the target moment, the fault may occur in the production of the target node a depending on the target node b, or the fault may occur in the production of the target node b, so that production fault alarm information is sent to remind development, operation and maintenance personnel to check the target node a and the target node b.
When the target node has finished production, the method provided by the embodiment of the present specification further includes: and updating the production state of the target node from incomplete updating to complete updating. Therefore, whether the application is released completely can be judged according to the completion condition of each target node.
In summary, according to the application commissioning method provided in the embodiments of the present specification, each target node of an application can be serially connected into a commissioning sequence according to a dependency relationship, and commissioning of the application is performed according to the commissioning sequence among the nodes, so that associated automatic commissioning of multiple applications is realized, and commissioning efficiency is improved; and whether the production sequence is correct or not can be checked, so that operation and maintenance personnel can be reminded to adjust and improve the dependency relationship of the target node with the wrong production sequence in time, and the condition that a plurality of application production cycles are stuck is avoided.
As shown in fig. 5, in an embodiment of the present specification, there is further provided an application commissioning apparatus, including:
a first obtaining module 10, configured to obtain target nodes of multiple applications to be produced;
a second obtaining module 20, configured to obtain a dependency relationship between any two target nodes;
a production sequence establishing module 30, configured to establish a production sequence of the target node of each application according to the dependency relationship;
and the production module 40 is used for producing each application according to the production sequence.
The advantages achieved by the device provided by the embodiment of the specification are consistent with those achieved by the method, and are not described in detail herein.
As shown in fig. 6, for a computer device provided for embodiments herein, the computer device 602 may include one or more processors 604, such as one or more Central Processing Units (CPUs), each of which may implement one or more hardware threads. The computer device 602 may also include any memory 606 for storing any kind of information, such as code, settings, data, etc. For example, and without limitation, memory 606 may include any one or more of the following in combination: any type of RAM, any type of ROM, flash memory devices, hard disks, optical disks, etc. More generally, any memory may use any technology to store information. Further, any memory may provide volatile or non-volatile retention of information. Further, any memory may represent fixed or removable components of computer device 602. In one case, when the processor 604 executes the associated instructions, which are stored in any memory or combination of memories, the computer device 602 may perform any of the operations of the associated instructions. The computer device 602 also includes one or more drive mechanisms 608, such as a hard disk drive mechanism, an optical disk drive mechanism, etc., for interacting with any memory.
The computer device 602 may also include an input/output module 610(I/O) for receiving various inputs (via input device 612) and for providing various outputs (via output device 614)). One particular output mechanism may include a presentation device 616 and an associated Graphical User Interface (GUI) 618. In other embodiments, input/output module 610(I/O), input device 612, and output device 614 may also be excluded, as just one computer device in a network. Computer device 602 may also include one or more network interfaces 620 for exchanging data with other devices via one or more communication links 622. One or more communication buses 624 couple the above-described components together.
Corresponding to the methods in fig. 1-4, the embodiments herein also provide a computer-readable storage medium having stored thereon a computer program, which, when executed by a processor, performs the steps of the above-described method.
Embodiments herein also provide computer readable instructions, wherein when executed by a processor, a program thereof causes the processor to perform the method as shown in fig. 1-4.
It should be understood that, in various embodiments herein, the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of each process should be determined by its function and inherent logic, and should not constitute any limitation to the implementation process of the embodiments herein.
It should also be understood that, in the embodiments herein, the term "and/or" is only one kind of association relation describing an associated object, meaning that three kinds of relations may exist. For example, a and/or B, may represent: a exists alone, A and B exist simultaneously, and B exists alone. In addition, the character "/" herein generally indicates that the former and latter related objects are in an "or" relationship.
Those of ordinary skill in the art will appreciate that the elements and algorithm steps of the examples described in connection with the embodiments disclosed herein may be embodied in electronic hardware, computer software, or combinations of both, and that the components and steps of the examples have been described in a functional general in the foregoing description for the purpose of illustrating clearly the interchangeability of hardware and software. Whether such functionality is implemented as hardware or software depends upon the particular application and design constraints imposed on the implementation. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present disclosure.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the several embodiments provided herein, it should be understood that the disclosed system, apparatus, and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may also be an electric, mechanical or other form of connection.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purposes of the embodiments herein.
In addition, functional units in the embodiments herein may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solutions of the present invention may be implemented in a form of a software product, which is stored in a storage medium and includes several instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the methods described in the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The principles and embodiments of this document are explained herein using specific examples, which are presented only to aid in understanding the methods and their core concepts; meanwhile, for the general technical personnel in the field, according to the idea of this document, there may be changes in the concrete implementation and the application scope, in summary, this description should not be understood as the limitation of this document.
Claims (10)
1. An application commissioning method, comprising:
acquiring target nodes of a plurality of applications to be put into production;
acquiring the dependency relationship between any two target nodes;
establishing a production sequence among the target nodes of each application according to the dependency relationship;
and putting the applications into production according to the production sequence.
2. The method of claim 1, wherein before said commissioning each of said applications according to said commissioning order, further comprising:
and judging whether the production sequence has production circulation or not so as to judge whether the production sequence is correct or not.
3. The method of claim 2, wherein the determining whether a production cycle exists in the production sequence comprises:
calculating the number of dependent nodes of each target node in the production sequence;
acquiring a target node with the number of the dependent nodes being zero as a current node, and writing the current node into a traversed node set; other target nodes except the current node in the production sequence form an unretraversed node set;
updating the number of dependent nodes of the target node in the non-traversed node set according to a preset updating rule;
taking the target node with the number of the updated dependent nodes being zero as a new current node until the number of the dependent nodes of all the target nodes in the node set which is not traversed is not zero;
if the non-traversed node set is not empty, the production sequence has a production cycle;
and if the set of nodes which are not traversed is empty, the production sequence has no production cycle.
4. The method according to claim 3, wherein the updating the number of dependent nodes of the target node in the set of non-traversed nodes according to a preset update rule further comprises:
acquiring a target node in the non-traversed node set, wherein the target node has a dependency relationship with the current node and serves as a node to be updated;
and performing a subtraction operation on the number of the dependent nodes of the node to be updated.
5. The method of claim 4, wherein the determining whether a commissioning cycle exists for the commissioning sequence further comprises:
and when the production sequence is judged to have production circulation, sending a production sequence error reporting prompt.
6. The method of claim 1, wherein said commissioning each of said applications according to said commissioning order further comprises:
inquiring the production records of each target node in the production sequence, wherein the production records comprise the starting basis and the production state of each target node;
taking the target node with the finished production state as a produced node;
and according to the starting basis, executing the production of the target node positioned behind the produced node in the production sequence.
7. The method of claim 6, wherein the commissioning record further comprises a commissioning time limit, the method further comprising:
acquiring the production start time and the production end time of each target node;
judging whether the production of the target node fails or not according to the production starting time, the production ending time and the production time limit;
and if the target node fails in production, sending production failure alarm information.
8. An application commissioning device, comprising:
the system comprises a first acquisition module, a second acquisition module and a third acquisition module, wherein the first acquisition module is used for acquiring target nodes of a plurality of applications to be produced;
the second acquisition module is used for acquiring the dependency relationship between any two target nodes;
a production sequence establishing module, configured to establish a production sequence of the target node of each application according to the dependency relationship;
and the production module is used for producing each application according to the production sequence.
9. A computer device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, characterized in that the processor implements the method steps of any of claims 1 to 7 when executing the computer program.
10. A computer-readable storage medium, characterized in that the computer-readable storage medium stores a computer program which, when being executed by a processor, carries out the method steps of any one of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110484637.2A CN113052707A (en) | 2021-04-30 | 2021-04-30 | Application production method and device, computer equipment and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202110484637.2A CN113052707A (en) | 2021-04-30 | 2021-04-30 | Application production method and device, computer equipment and storage medium |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN113052707A true CN113052707A (en) | 2021-06-29 |
Family
ID=76518101
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202110484637.2A Pending CN113052707A (en) | 2021-04-30 | 2021-04-30 | Application production method and device, computer equipment and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN113052707A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113793063A (en) * | 2021-09-28 | 2021-12-14 | 广东电网有限责任公司 | Method and device for detecting conflict of power distribution network planning project schemes |
| CN115082247A (en) * | 2022-08-19 | 2022-09-20 | 建信金融科技有限责任公司 | System production method, device, equipment, medium and product based on label library |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060064690A1 (en) * | 2004-09-17 | 2006-03-23 | Microsoft Corporation | Exploiting dependency relations in distributed decision making |
| CN110442396A (en) * | 2019-07-31 | 2019-11-12 | 网易（杭州）网络有限公司 | Application program launching method and device, storage medium and electronic equipment |
| CN110490483A (en) * | 2019-08-26 | 2019-11-22 | 中国建设银行股份有限公司 | Operation method, apparatus, equipment and storage medium |
| CN111027831A (en) * | 2019-11-28 | 2020-04-17 | 广东电网有限责任公司 | Investment decision method and system based on economic evaluation model |
| CN111061551A (en) * | 2019-12-06 | 2020-04-24 | 深圳前海微众银行股份有限公司 | Node merging and scheduling method, device, equipment and storage medium |
| CN111737075A (en) * | 2020-06-19 | 2020-10-02 | 浙江大华技术股份有限公司 | Execution sequence determination method and device, storage medium and electronic device |
| CN112035229A (en) * | 2020-08-31 | 2020-12-04 | 腾讯科技（深圳）有限公司 | Calculation graph processing method and device and storage medium |
| CN112099958A (en) * | 2020-11-17 | 2020-12-18 | 深圳壹账通智能科技有限公司 | Distributed multi-task management method and device, computer equipment and storage medium |
-
2021
- 2021-04-30 CN CN202110484637.2A patent/CN113052707A/en active Pending
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20060064690A1 (en) * | 2004-09-17 | 2006-03-23 | Microsoft Corporation | Exploiting dependency relations in distributed decision making |
| CN110442396A (en) * | 2019-07-31 | 2019-11-12 | 网易（杭州）网络有限公司 | Application program launching method and device, storage medium and electronic equipment |
| CN110490483A (en) * | 2019-08-26 | 2019-11-22 | 中国建设银行股份有限公司 | Operation method, apparatus, equipment and storage medium |
| CN111027831A (en) * | 2019-11-28 | 2020-04-17 | 广东电网有限责任公司 | Investment decision method and system based on economic evaluation model |
| CN111061551A (en) * | 2019-12-06 | 2020-04-24 | 深圳前海微众银行股份有限公司 | Node merging and scheduling method, device, equipment and storage medium |
| CN111737075A (en) * | 2020-06-19 | 2020-10-02 | 浙江大华技术股份有限公司 | Execution sequence determination method and device, storage medium and electronic device |
| CN112035229A (en) * | 2020-08-31 | 2020-12-04 | 腾讯科技（深圳）有限公司 | Calculation graph processing method and device and storage medium |
| CN112099958A (en) * | 2020-11-17 | 2020-12-18 | 深圳壹账通智能科技有限公司 | Distributed multi-task management method and device, computer equipment and storage medium |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113793063A (en) * | 2021-09-28 | 2021-12-14 | 广东电网有限责任公司 | Method and device for detecting conflict of power distribution network planning project schemes |
| CN115082247A (en) * | 2022-08-19 | 2022-09-20 | 建信金融科技有限责任公司 | System production method, device, equipment, medium and product based on label library |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10565095B2 (en) | Hybrid testing automation engine | |
| EP2003557A9 (en) | Applicable patch selecting device and applicable patch selecting method | |
| US9020949B2 (en) | Method and system for centralized issue tracking | |
| CN113052707A (en) | Application production method and device, computer equipment and storage medium | |
| CN111399828A (en) | Model-driven logic device modeling method and terminal | |
| JP5989194B1 (en) | Test management system and program | |
| CN113110832A (en) | Intelligent efficient code generation method and device and storage medium | |
| CN109445800B (en) | Version automatic deployment method and system based on distributed system | |
| Seybold et al. | Experiences of models@ run-time with EMF and CDO | |
| US20230376329A1 (en) | Systems and methods for automatically generating guided user interfaces (guis) for tracking and migrating legacy networked resources within an enterprise during a technical migration | |
| CN117291517A (en) | Method and device for constructing approval process | |
| US9959288B2 (en) | Declarative cluster management | |
| CN116383052A (en) | Automatic testing method, device and equipment for batch processing task and storage medium | |
| CN111339055A (en) | Big data cluster capacity expansion method and device | |
| CN113051135A (en) | Application thread pool monitoring method and thread pool monitoring device | |
| CN113342558A (en) | Batch business exception handling method and device, computer equipment and storage medium | |
| CN107492031B (en) | Quasi-real-time financial system account checking method based on function contract bypass analysis | |
| CN112597121A (en) | Logic script processing method and device, electronic equipment and storage medium | |
| CN108701035A (en) | The management of application attribute | |
| CN110188101A (en) | It is a kind of super most according to list processing method, apparatus, equipment and medium | |
| JP7196262B1 (en) | Service provision system and service provision method | |
| KR101866826B1 (en) | Method for calling operational aspect of game server | |
| CN111309370A (en) | Version number directed graph sorting audit method and system for multi-project and multi-system environment | |
| JP7296515B2 (en) | Service provision system and service provision method | |
| CN113778555A (en) | Distributed configuration method and system |
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 |