CN112540772B - Application publishing method and system, electronic device and storage medium - Google Patents
Application publishing method and system, electronic device and storage medium Download PDFInfo
- Publication number
- CN112540772B CN112540772B CN202011537234.1A CN202011537234A CN112540772B CN 112540772 B CN112540772 B CN 112540772B CN 202011537234 A CN202011537234 A CN 202011537234A CN 112540772 B CN112540772 B CN 112540772B
- Authority
- CN
- China
- Prior art keywords
- node
- target
- application
- state
- publishing
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 47
- 230000004044 response Effects 0.000 claims description 26
- 238000004590 computer program Methods 0.000 claims description 3
- 230000003247 decreasing effect Effects 0.000 claims description 2
- 238000004891 communication Methods 0.000 description 10
- 238000010586 diagram Methods 0.000 description 8
- 238000012545 processing Methods 0.000 description 4
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000008569 process Effects 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000013515 script Methods 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 230000009471 action Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 230000006870 function Effects 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 230000003287 optical effect Effects 0.000 description 1
- 230000001737 promoting effect Effects 0.000 description 1
- 238000012546 transfer Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/60—Software deployment
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/70—Software maintenance or management
- G06F8/71—Version control; Configuration management
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Computer Security & Cryptography (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The disclosure provides an application publishing method, an application publishing system, an electronic device and a storage medium, wherein the application comprises at least one service, and the service comprises at least two groups. The method comprises the following steps: receiving an application issuing instruction; determining a first group of at least two groups of target services in the application according to the application issuing instruction; determining a target release node of the first group, and marking the target release node as a state to be released; receiving an application request from a user; determining the state of a node corresponding to the application request; and responding to the node corresponding to the application request in the state to be issued, and forwarding the application request to the node in the non-issued state.
Description
Technical Field
The disclosure relates to the technical field of data processing, and in particular relates to an application publishing method and system, electronic equipment and storage medium.
Background
The release of the traditional application new version needs to be stopped at night for release. The internet cloud application is characterized in that the version release is available for 7×24 hours frequently and rapidly, and the new version application is required to be released on the premise of not affecting the service.
Disclosure of Invention
In view of the above, an object of the present disclosure is to provide an application publishing method and system, an electronic device, and a storage medium.
Based on the above object, a first aspect of the present disclosure provides an application publishing method, wherein the application includes at least one service, the service includes at least two packets, the method includes:
Receiving an application issuing instruction;
Determining a first group of at least two groups of target services in the application according to the application issuing instruction;
determining a target release node of the first group, and marking the target release node as a state to be released;
receiving an application request from a user;
determining the state of a node corresponding to the application request;
And responding to the node corresponding to the application request in the state to be issued, and forwarding the application request to the node in the non-issued state.
In a second aspect of the present disclosure, there is provided an application publishing system, wherein the application includes at least one service, the service including at least two packets, the system comprising:
An application publishing interface configured to: receiving an application issuing instruction, determining a first group of at least two groups of target services in the application according to the application issuing instruction, marking a target issuing node of the first group as a state to be issued, and forwarding state information of the target issuing node to a database;
A database electrically coupled to the application publishing interface and configured to: storing state information of the target publishing node;
A plurality of nodes electrically coupled to the database, respectively, and configured to: determining whether the target issuing node is the target issuing node according to the state information of the target issuing node in the database, and entering the state to be issued in response to the target issuing node;
A request distribution unit electrically coupled to the database and the node, respectively, and configured to: and receiving an application request from a user, calling state information of the node corresponding to the application request from the database, and forwarding the application request to a node in a non-release state in response to the node corresponding to the application request being in the state to be released.
In a third aspect of the present disclosure, there is provided an electronic 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 of the first aspect when executing the program.
In a fourth aspect of the present disclosure, there is provided a non-transitory computer readable storage medium, characterized in that the non-transitory computer readable storage medium stores computer instructions for causing the computer to perform the method of the first aspect.
From the above, it can be seen that the application publishing method, the system, the electronic device and the storage medium provided by the embodiment of the disclosure can publish the application on the premise of not affecting any transaction of the user on the system, can improve the usability and experience of the system, reduce the system personnel to be online at night, and improve the working efficiency.
Drawings
In order to more clearly illustrate the technical solutions of the present disclosure or the prior art, the following description will briefly introduce the drawings required for the embodiments or the prior art descriptions, and it is obvious that the drawings in the following description are merely the disclosure, and other drawings may be obtained according to these drawings without inventive effort for a person skilled in the art.
FIG. 1A illustrates a schematic diagram of an exemplary system provided by an embodiment of the present disclosure;
FIG. 1B shows a schematic diagram of a database-stored data structure model, according to an embodiment of the present disclosure;
FIG. 2 illustrates a schematic diagram of an exemplary method provided by an embodiment of the present disclosure;
fig. 3 shows a schematic hardware structure of an exemplary electronic device provided by an embodiment of the disclosure.
Detailed Description
For the purposes of promoting an understanding of the principles and advantages of the disclosure, reference will now be made to the embodiments illustrated in the drawings and specific language will be used to describe the same.
It is to be noted that unless otherwise defined, technical or scientific terms used in the present disclosure should be taken in a general sense as understood by one of ordinary skill in the art to which the present disclosure pertains. The terms "first," "second," and the like, as used in this disclosure, do not denote any order, quantity, or importance, but rather are used to distinguish one element from another. The word "comprising" or "comprises", and the like, means that elements or items preceding the word are included in the element or item listed after the word and equivalents thereof, but does not exclude other elements or items. The terms "connected" or "connected," and the like, are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. "upper", "lower", "left", "right", etc. are used merely to indicate relative positional relationships, which may also be changed when the absolute position of the object to be described is changed.
Since the new version of the traditional application is released, the release is required to be stopped at night. In view of this, the present disclosure provides an application release method, an application release system, an electronic device, and a storage medium for releasing a new version of a cloud application without affecting the use of a user. The application publishing method comprises the following steps: receiving an application issuing instruction; determining a first group of target services in the application according to the application issuing instruction; determining a target release node of the first group, and marking the target release node as a state to be released; receiving an application request from a user; determining the state of a node corresponding to the application request; and responding to the node corresponding to the application request in the state to be issued, and forwarding the application request to the node in the non-issued state. According to the application publishing method, the system, the electronic device and the storage medium, services in the application to be published are divided into at least two groups, so that grouping publishing can be performed, and operation of the services can be achieved by single copies in each group. According to the application release method, the system, the electronic device and the storage medium, the cloud application new version can be released on the premise that any transaction of a user on the system is not affected, the availability and experience of the system can be improved, system staff can be reduced to be online at night, and the working efficiency is improved.
Fig. 1A shows a schematic diagram of an exemplary system provided by an embodiment of the present disclosure.
As shown in fig. 1A, the application publishing system 100 includes an application publishing interface 102, a database 104, a request distribution unit 108, and a plurality of nodes (e.g., nodes 106a, 106b, and 106 c) for completing the publishing of applications, including the publishing of updated versions of applications, the publishing of new applications, and the like. An application may include multiple services, e.g., a shopping APP, which may include member services, shopping services, etc. One service may be made up of multiple copies, each of which may be run independently to complete the corresponding service. Further, the services may be further divided into at least two groups, for example, the services may be divided into a first group and a second group, and the first group may be issued first, and after the first group completes the issue, the second group may be issued, where the first group may include at least one copy, and the second group may also include at least one copy. In some embodiments, the service may include four copies, the first set may include two copies, and the second set may include two copies.
As shown in fig. 1A, the application publishing interface 102 may receive the application publishing instruction 110 and determine a first set of target services in an application to be published from the application publishing instruction 110. The application issue instructions 110 may be initiated by a system administrator. In some embodiments, the target service and the first group therein in the application to be published may be determined from the service grouping information 114 (Service Group File). The service grouping information 114 may include grouping information for each service and a dependency relationship between services in an application. The grouping method for each service is not limited, and may be performed according to the serial number sequence of the copies, or may be performed according to the generation time sequence of the copies, and the specific grouping method may be selected as required. According to the dependency relationship, when determining the target service, starting from the basic service, namely, starting from the service which does not depend on other services, after the release of the service which does not depend on other services is completed, determining the service which only has the dependency relationship with the released service as the target service, and so on until all the services of the application are released. Services may be grouped into 2 groups in Service Group File and may be grouped by service name + group index, e.g., grouping S1 services may be labeled S1-G1, S1-G2 for batched at the time of distribution.
After determining the first group of target services, the application publishing interface 102 may mark the target publishing node of the first group as a state to be published (stand) and forward state information (i.e., state to be published) of the target publishing node to the database 104. In some embodiments, the target publishing node of the first group may be determined according to the node to which the first group corresponds, e.g., the first group of a certain service corresponds to node 106a and node 106b, then node 106a and node 106b may be determined to be target publishing nodes. In some embodiments, the manner in which the state of the target publishing node may be marked may be to mark the IP of the target publishing node as the corresponding state, e.g., when the node is a server, the IP of the corresponding server may be marked as the state to be published (stand).
As shown in fig. 1A, a database 104 is electrically coupled to the application publishing interface 102 and may store state information of the target publishing node.
As shown in fig. 1A, a plurality of nodes (e.g., nodes 106a, 106b, and 106 c) are respectively electrically coupled to the database 104, and may determine whether the node is the target publishing node according to the state information of the target publishing node in the database 104, and enter the to-be-published state in response to the node being the target publishing node. For example, when node 106a and node 106b request node state information from database 104, knowing that they are determined to be target publishing nodes based on the state information, they can begin entering the to-be-published state and no longer accept new application requests. In some embodiments, the node may include a self-checking module (e.g., self-checking module 1062a, 1062b, or 1062 c) to obtain its respective status information from database 104 in real-time. The implementation manner of the self-checking module can be, for example, running a corresponding self-checking program on the node, or embedding the self-checking program in the service so that the service can realize the self-checking function when running on the node.
As shown in fig. 1A, the request distribution unit 108 is electrically coupled to the database 104 and the nodes 106a, 106b, and 106c, respectively, and may receive an application request 112 from a user, call state information of a node corresponding to the application request 112 from the database 104, and forward the application request 112 to a node in a non-published state in response to the node corresponding to the application request 112 being in the to-be-published state. For example, the nodes corresponding to the application request 112 are the node 106a, the node 106b, and the node 106c, and when the request distribution unit 108 is in the to-be-distributed state according to the states of the target distribution nodes (the node 106a and the node 106 b) recorded in the database 104, the application request 112 is not sent to the node 106a and the node 106b, but only the application request 112 is forwarded to the node 106c. In this way, the release of applications by node 106a and node 106b is not affected, and any operations or transactions by the user on the system are not affected.
In some embodiments, the system 100 may be a cloud system, alternatively the system 100 may be a high availability cluster (Highly Available, HA for short). The application publishing interface 102 may be an HA-control in the HA, where the HA-control is an entry for application publishing, and may determine an implementation manner according to a specific context of an enterprise, for example: web programs, shell scripts, etc. Database 104 may be a Redis, which is an open source memory database, in which data may be stored in key-value pairs (key-value), which may be of list type in embodiments of the present disclosure. The request distribution unit 108 may be a load balancer nginx and is loaded with a hap-plug in plug-in or module, where hap-plug in is a high availability release plug-in or module of nginx, and there are two implementation manners, one is to write a Lua script as a plug-in, and the other is to develop an nginx sub-module. The hap-plug in plug-in or module may grab the state information of the node corresponding to the application request from the database 104 to determine whether the node is in a state to be published. By adding mechanisms such as a load balancing high-availability plug-in, a memory database, a status report and the like in the system 100, the availability of the system 100 when the new version application is released is improved to 100%.
In some embodiments, the state of a node may include: wait to issue state (stand), ready to issue state (ready), issue state (publishing), application start state (started), complete issue state (Published). Wherein the to-be-issued status (stand) indicates that the node is to perform application issue, to which new requests cannot be redistributed; ready to issue status (ready) indicates that the node has no pending requests, and service issue can be performed; a publication status (publishing) indicates that the node is publishing; an application started state (started) indicates that the service has started but cannot be loaded; the complete publication status (Published) indicates that the service has been published and that the load may make a request for distribution.
FIG. 1B shows a schematic diagram of a database-stored data structure model, according to an embodiment of the present disclosure. As shown in fig. 1B, the database 104 may store state information corresponding to all nodes in the system 100. In the stored data structure, the node information may be represented as its IP address.
In some embodiments, since the target publishing node (e.g., node 106a or node 106 b) has entered the to-be-published state, the target publishing node may be further configured to:
determining a number of requests being processed in response to having entered the to-be-issued state; in some embodiments, the request being processed is all requests being processed on the target distribution node;
in response to the number decreasing to zero, entering a ready-to-release state and updating the state information, sending the updated state information to the database 104, and updating the corresponding state information in the database 104.
In some embodiments, this may be accomplished by a self-checking module (e.g., self-checking module 1062a, 1062b, or 1062 c) that detects the number of requests currently being processed by the node and, after the number of requests has been reduced to zero, enters a ready-to-issue state and sends updated state information to the database 104. In some embodiments, if the self-checking module is implemented in a mode of running a self-checking program in a service, the above steps may be completed by a service before update (for example, service version 1.0), and when the self-checking enters a ready to release state (ready), the service before update exits, and then release of a new service (for example, service version 2.0) may be started until the release is completed, and the self-checking is continued by the new service (for example, service version 2.0).
In some embodiments, the application publishing interface 102 may be further configured to:
determining whether the target publishing node (e.g., node 106a or node 106 b) enters a ready-to-publish state based on state information of the target publishing node in the database 104;
in response to the target publishing node having entered a ready to publish state, marking the target publishing node as a publish state and forwarding state information of the target publishing node to database 104;
the database 104 may be further configured to:
and storing the updated state information of the target issuing node.
In some embodiments, the target publishing node (e.g., node 106a or node 106 b) may be further configured to:
Entering the release state according to the state information of the target release node in the database 104, and releasing the first group, for example, pushing a new version application package corresponding to the first group, and restarting the application;
in response to the first group of publications being completed, entering an application start state, and sending updated state information to the database 104;
the database 104 may be further configured to:
and storing the updated state information of the target issuing node.
In some embodiments, the number of the target publishing nodes corresponding to the first group is a plurality, and the application publishing interface 102 may be further configured to:
determining whether a plurality of the target publishing nodes (e.g., node 106a and node 106 b) enter an application launch state based on state information of the first set of corresponding plurality of the target publishing nodes in the database 104;
In response to the first group of the plurality of target publishing nodes having entered an application start state, indicating that the first group has been published, marking the first group of the plurality of target publishing nodes as a completed publishing state and forwarding state information of the first group of the plurality of target publishing nodes to database 104;
the database 104 may be further configured to:
and storing state information (namely, the completion release state) of a plurality of target release nodes corresponding to the first group.
In some embodiments, the application publishing interface 102 is configured to:
Determining a second group of target services in the application according to the application issuing instruction 110, marking target issuing nodes of the second group as to-be-issued states, and forwarding state information of the target issuing nodes of the second group to the database 104;
A database 104 configured to: and storing the state information of the target issuing nodes of the second group.
The release process of the second group is substantially the same as that of the first group, and will not be described in detail herein. When the second group also completes the publication, the target service is the publication completed.
It should be noted that, in the above embodiment, the target service is divided into two groups for distribution, and it is known that when the target service is divided into more groups, each group may be sequentially distributed in substantially the same manner as in the foregoing embodiment, which is not described herein.
In some embodiments, the request distribution unit 108 is configured to:
In response to a node (e.g., node 106a or node 106 b) corresponding to the application request being in the completion published state, the application request is forwarded to the node in the completion published state.
It should be noted that, in the foregoing publishing process, the state of the node may include: the ready-to-issue state (stand), ready-to-issue state (ready), issue state (issue), application start state (issued), completion issue state (Published), when the state information that the request distribution unit 108 grabs from the database 104 is in the ready-to-issue state (stand), ready-to-issue state (ready), issue state (issue), or application start state (issued), the application request cannot be forwarded to the corresponding node, and thus the aforementioned non-issue state may be any one of the ready-to-issue state (stand), ready-to-issue state (ready), issue state (issue), or application start state (issued). When a node is in the complete release state (Published), the application request may be forwarded to the corresponding node.
It should be noted that, in the foregoing embodiments, the marking node state is described as an example, and in some embodiments, the service packet may be marked, and in such embodiments, the node corresponding to the service is known, so when the service is marked, the node information corresponding to the service may be equivalent to that the corresponding node is considered to be also marked, and further, the state information of the corresponding node is known.
Fig. 2 shows a schematic structural diagram of an exemplary method provided by an embodiment of the present disclosure.
As shown in fig. 2, the method 200 may include the following steps.
At step 202, an application issue instruction may be received, the application comprising at least one service, the service comprising at least two packets;
At step 204, a first set of target services in the application may be determined in accordance with the application issuance instruction;
At step 206, a target publishing node of the first group may be determined and marked as to-be-published;
At step 208, an application request from a user may be received;
at step 210, a state of a node corresponding to the application request may be determined;
in step 212, in response to the node corresponding to the application request being in the to-be-published state, the application request may be forwarded to the node in the non-published state.
Optionally, in step 214, in response to the node corresponding to the application request being in the complete release state, the application request is forwarded to the node in the complete release state.
In some embodiments, the method 200 may further include:
Determining whether the target publishing node is in a ready to publish state, wherein the ready to publish state is entered when the number of requests being processed by the target publishing node drops to zero;
and in response to the target publishing node having entered a ready to publish state, marking the target publishing node as a publish state and publishing the first group.
In some embodiments, the method 200 may further include:
And in response to completion of the first set of publications, marking the target publication node as an application start state.
In some embodiments, the number of the target publishing nodes corresponding to the first group is a plurality, and the method 200 may further include:
determining whether a plurality of target issuing nodes corresponding to the first group enter an application starting state;
In response to the first group of corresponding plurality of target publishing nodes entering an application start state, marking the first group of corresponding plurality of target publishing nodes as a complete publishing state;
determining a second group of target services in the application according to the application issuing instruction;
And determining the target release nodes of the second group, and marking the target release nodes of the second group as a state to be released.
It is understood that the method may be performed by any apparatus, device, platform, cluster of devices, having computing, processing capabilities.
It should be noted that the method of the present disclosure may be performed by a single device, such as a computer or server. The method of the embodiment can also be applied to a distributed scene, and is completed by mutually matching a plurality of devices. In the case of such a distributed scenario, one of the devices may perform only one or more steps of the methods of the present disclosure, which interact with each other to complete the methods.
It should be noted that the foregoing describes specific embodiments of the present disclosure. Other embodiments are within the scope of the following claims. In some cases, the actions or steps recited in the claims can be performed in a different order than in the embodiments and still achieve desirable results. In addition, the processes depicted in the accompanying figures do not necessarily require the particular order shown, or sequential order, to achieve desirable results. In some embodiments, multitasking and parallel processing are also possible or may be advantageous.
The system of the foregoing embodiment is used to implement the corresponding method in the foregoing embodiment, so the corresponding method in the foregoing embodiment has the beneficial effects of the corresponding system embodiment, which is not described herein again.
Based on the same inventive concept, corresponding to the method of any embodiment, one or more embodiments of the present disclosure further provide an electronic device, including a memory, a processor, and a computer program stored on the memory and capable of running on the processor, where the processor executes the program to implement the method of application publishing according to any embodiment.
Fig. 3 shows a schematic hardware structure of a more specific electronic device 300 according to this embodiment, where the device 300 may include: a processor 302, a memory 304, an input/output interface 306, a communication interface 308, and a bus 310. Wherein the processor 302, the memory 304, the input/output interface 306, and the communication interface 308 are communicatively coupled to each other within the device via a bus 310.
The processor 302 may be implemented by a general-purpose CPU (Central Processing Unit ), a microprocessor, an Application SPECIFIC INTEGRATED Circuit (ASIC), or one or more integrated circuits, etc. for executing related programs to implement the technical solutions provided in the embodiments of the present disclosure.
The Memory 304 may be implemented in the form of ROM (Read Only Memory), RAM (Random Access Memory ), static storage, dynamic storage, etc. Memory 304 may store an operating system and other application programs, and when the technical solutions provided by the embodiments of the present specification are implemented in software or firmware, relevant program codes are stored in memory 304 and invoked for execution by processor 302.
The input/output interface 306 is used for connecting with an input/output module to realize information input and output. The input/output module may be configured as a component in a device (not shown in the figure) or may be external to the device to provide corresponding functionality. Wherein the input devices may include a keyboard, mouse, touch screen, microphone, various types of sensors, etc., and the output devices may include a display, speaker, vibrator, indicator lights, etc.
The communication interface 308 is used to connect a communication module (not shown in the figure) to enable communication interaction between the present device and other devices. The communication module may implement communication through a wired manner (such as USB, network cable, etc.), or may implement communication through a wireless manner (such as mobile network, WIFI, bluetooth, etc.).
Bus 310 includes a path to transfer information between components of the device (e.g., processor 302, memory 304, input/output interface 306, and communication interface 308).
It should be noted that although the device 300 described above shows only the processor 302, the memory 304, the input/output interface 306, the communication interface 308, and the bus 310, the device may include other components necessary to achieve proper operation in a particular implementation. Furthermore, it will be understood by those skilled in the art that the above-described apparatus may include only the components necessary to implement the embodiments of the present description, and not all the components shown in the drawings.
The electronic device 300 of the foregoing embodiment is configured to implement the corresponding application publishing method in any of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiment, which is not described herein.
The computer readable media of the present embodiments, including both permanent and non-permanent, removable and non-removable media, may be used to implement information storage by any method or technology. The information may be computer readable instructions, data structures, modules of a program, or other data. Examples of storage media for a computer include, but are not limited to, phase change memory (PRAM), static Random Access Memory (SRAM), dynamic Random Access Memory (DRAM), other types of Random Access Memory (RAM), read Only Memory (ROM), electrically Erasable Programmable Read Only Memory (EEPROM), flash memory or other memory technology, compact disc read only memory (CD-ROM), digital Versatile Discs (DVD) or other optical storage, magnetic cassettes, magnetic tape magnetic disk storage or other magnetic storage devices, or any other non-transmission medium, which can be used to store information that can be accessed by a computing device.
Those of ordinary skill in the art will appreciate that: the discussion of any of the embodiments above is merely exemplary and is not intended to suggest that the scope of the disclosure, including the claims, is limited to these examples; the technical features of the above embodiments or in different embodiments may also be combined under the idea of the present disclosure, the steps may be implemented in any order, and there are many other variations of the different aspects of the present disclosure as described above, which are not provided in details for the sake of brevity.
Additionally, well-known power/ground connections to Integrated Circuit (IC) chips and other components may or may not be shown within the provided figures, in order to simplify the illustration and discussion, and so as not to obscure the present disclosure. Furthermore, the devices may be shown in block diagram form in order to avoid obscuring the present disclosure, and this also takes into account the fact that specifics with respect to the implementation of such block diagram devices are highly dependent upon the platform on which the present disclosure is to be implemented (i.e., such specifics should be well within purview of one skilled in the art). Where specific details (e.g., circuits) are set forth in order to describe example embodiments of the disclosure, it should be apparent to one skilled in the art that the disclosure can be practiced without, or with variation of, these specific details. Accordingly, the description is to be regarded as illustrative in nature and not as restrictive.
While the present disclosure has been described in conjunction with specific embodiments thereof, many alternatives, modifications, and variations of those embodiments will be apparent to those skilled in the art in light of the foregoing description. For example, other memory architectures (e.g., dynamic RAM (DRAM)) may use the embodiments discussed.
The present disclosure is intended to embrace all such alternatives, modifications and variances which fall within the broad scope of the appended claims. Accordingly, any omissions, modifications, equivalents, improvements and the like that may be made within the spirit and principles of the disclosure are intended to be included within the scope of the disclosure.
Claims (14)
1. An application publishing method, wherein the application includes at least one service, the service including at least two packets, the method comprising:
Receiving an application issuing instruction;
Determining a first group of at least two groups of target services in the application according to the application issuing instruction; each of the at least two packets includes at least one copy; each copy can independently run to complete a corresponding task;
determining a target release node of the first group, and marking the target release node as a state to be released;
receiving an application request from a user;
determining the state of a node corresponding to the application request;
And responding to the node corresponding to the application request in the state to be issued, and forwarding the application request to the node in the non-issued state.
2. The method of claim 1, further comprising:
Determining whether the target publishing node is in a ready to publish state, wherein the ready to publish state is entered when the number of requests being processed by the target publishing node drops to zero;
and in response to the target publishing node having entered a ready to publish state, marking the target publishing node as a publish state and publishing the first group.
3. The method of claim 2, further comprising:
And in response to completion of the first set of publications, marking the target publication node as an application start state.
4. The method of claim 3, wherein the number of the target publishing nodes corresponding to the first set is a plurality, the method further comprising:
determining whether a plurality of target issuing nodes corresponding to the first group enter an application starting state;
In response to the first group of corresponding plurality of target publishing nodes entering an application start state, marking the first group of corresponding plurality of target publishing nodes as a complete publishing state;
determining a second group of target services in the application according to the application issuing instruction;
And determining the target release nodes of the second group, and marking the target release nodes of the second group as a state to be released.
5. The method of claim 4, further comprising:
And forwarding the application request to the node in the completion release state in response to the node corresponding to the application request being in the completion release state.
6. An application publication system, wherein the application includes at least one service, the service including at least two packets, the system comprising:
an application publishing interface configured to: receiving an application issuing instruction, determining a first group of at least two groups of target services in the application according to the application issuing instruction, marking a target issuing node of the first group as a state to be issued, and forwarding state information of the target issuing node to a database; each of the at least two packets includes at least one copy; each copy can independently run to complete a corresponding task;
A database electrically coupled to the application publishing interface and configured to: storing state information of the target publishing node;
A plurality of nodes electrically coupled to the database, respectively, and configured to: determining whether the target issuing node is the target issuing node according to the state information of the target issuing node in the database, and entering the state to be issued in response to the target issuing node;
A request distribution unit electrically coupled to the database and the node, respectively, and configured to: and receiving an application request from a user, calling state information of the node corresponding to the application request from the database, and forwarding the application request to a node in a non-release state in response to the node corresponding to the application request being in the state to be released.
7. The system of claim 6, wherein the target publishing node is configured to:
Determining a number of requests being processed in response to having entered the to-be-issued state;
In response to the number of requests being processed decreasing to zero, entering a ready-to-issue state and updating state information, and sending the updated state information to the database.
8. The system of claim 7, wherein the application publishing interface is configured to:
Determining whether the target release node enters a release preparation state according to the state information of the target release node in the database;
In response to the target publishing node having entered a ready to publish state, marking the target publishing node as a publish state and forwarding state information of the target publishing node to a database;
The database is configured to:
and storing the updated state information of the target issuing node.
9. The system of claim 8, wherein the target publishing node is configured to:
entering the release state according to the state information of the target release node in the database, and releasing the first group;
And responding to the completion of the first group of release, entering an application starting state, and sending updated state information to the database.
10. The system of claim 9, wherein the number of the target publishing nodes corresponding to the first group is a plurality, the application publishing interface configured to:
Determining whether a plurality of target release nodes enter an application starting state according to state information of the plurality of target release nodes corresponding to the first group in the database;
in response to the first set of corresponding plurality of target publishing nodes having entered an application launch state, marking the first set of corresponding plurality of target publishing nodes as a complete publishing state and forwarding state information of the first set of corresponding plurality of target publishing nodes to a database;
The database is configured to:
and storing state information of a plurality of target issuing nodes corresponding to the first group.
11. The system of claim 10, wherein the application publishing interface is configured to:
Determining a second group of target services in the application according to the application issuing instruction, marking the target issuing nodes of the second group as to-be-issued states, and forwarding state information of the target issuing nodes of the second group to a database;
A database configured to: and storing the state information of the target issuing nodes of the second group.
12. The system of claim 11, wherein the request distribution unit is configured to:
And forwarding the application request to the node in the completion release state in response to the node corresponding to the application request being in the completion release state.
13. An electronic device comprising a memory, a processor and a computer program stored on the memory and executable on the processor, wherein the processor implements the method of any one of claims 1 to 5 when the program is executed by the processor.
14. A non-transitory computer readable storage medium storing computer instructions for causing a computer to perform the method of any one of claims 1 to 5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011537234.1A CN112540772B (en) | 2020-12-23 | 2020-12-23 | Application publishing method and system, electronic device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011537234.1A CN112540772B (en) | 2020-12-23 | 2020-12-23 | Application publishing method and system, electronic device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112540772A CN112540772A (en) | 2021-03-23 |
| CN112540772B true CN112540772B (en) | 2024-06-18 |
Family
ID=75017644
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011537234.1A Active CN112540772B (en) | 2020-12-23 | 2020-12-23 | Application publishing method and system, electronic device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112540772B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113282400B (en) * | 2021-06-29 | 2022-06-17 | 中国平安人寿保险股份有限公司 | Application publishing method, device, equipment and storage medium based on interface routing |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108156208A (en) * | 2016-12-02 | 2018-06-12 | 阿里巴巴集团控股有限公司 | A kind of dissemination method of application data, device and system |
Family Cites Families (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20180157690A1 (en) * | 2016-12-01 | 2018-06-07 | Facebook, Inc. | Data publishing service with low-latency read access |
| CN107608689B (en) * | 2017-08-07 | 2020-01-21 | 阿里巴巴集团控股有限公司 | Method and device for updating application program on client and electronic equipment |
| WO2020101747A1 (en) * | 2018-01-08 | 2020-05-22 | All Purpose Networks, Inc. | Publish-subscribe broker network overlay system |
-
2020
- 2020-12-23 CN CN202011537234.1A patent/CN112540772B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108156208A (en) * | 2016-12-02 | 2018-06-12 | 阿里巴巴集团控股有限公司 | A kind of dissemination method of application data, device and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112540772A (en) | 2021-03-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| TWI743458B (en) | Method, device and system for parallel execution of blockchain transactions | |
| US10291704B2 (en) | Networked solutions integration using a cloud business object broker | |
| US8799477B2 (en) | Hypervisor selection for hosting a virtual machine image | |
| CN106462407B (en) | Code services for language independent scheduling | |
| JP2020510908A (en) | Method and system for scheduling a computer process or task in a distributed system | |
| CN110391938B (en) | Method and apparatus for deploying services | |
| CN111262897B (en) | Service call routing processing method, device and system | |
| US10078579B1 (en) | Metrics-based analysis for testing a service | |
| CN110650209B (en) | Method and device for realizing load balancing | |
| CN113495797A (en) | Message queue and consumer dynamic creation method and system | |
| CN117278434A (en) | Flow playback method and device and electronic equipment | |
| WO2023040612A1 (en) | Order processing method and apparatus | |
| CN111917579A (en) | Distributed training method, device, equipment and storage medium | |
| CN112787999A (en) | Cross-chain calling method, device, system and computer readable storage medium | |
| CN112540772B (en) | Application publishing method and system, electronic device and storage medium | |
| CN110795143B (en) | Method, apparatus, computing device, and medium for processing functional modules | |
| CN113592506B (en) | Repeated payment processing method and device, electronic equipment and storage medium | |
| EP3872630A2 (en) | Request processing method and apparatus, electronic device, and computer storage medium | |
| CN113760262A (en) | Task processing method, device, computer system and computer readable storage medium | |
| CN111581578A (en) | Interface request processing method and device | |
| CN117270833B (en) | Service calling and issuing method, medium and computer equipment | |
| US20240061857A1 (en) | Migration and validation of data from tabular structures to non-relational data stores | |
| CN113761548B (en) | Data transmission method and device for Shuffle process | |
| CN113805858B (en) | Method and device for continuously deploying software developed by scripting language | |
| JPWO2018074479A1 (en) | Data processing apparatus and data processing method |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant |