CN110391938B - Method and apparatus for deploying services - Google Patents
Method and apparatus for deploying services Download PDFInfo
- Publication number
- CN110391938B CN110391938B CN201910680637.2A CN201910680637A CN110391938B CN 110391938 B CN110391938 B CN 110391938B CN 201910680637 A CN201910680637 A CN 201910680637A CN 110391938 B CN110391938 B CN 110391938B
- Authority
- CN
- China
- Prior art keywords
- service
- deployment
- identifier
- relation
- current
- 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 46
- 230000008859 change Effects 0.000 claims description 19
- 238000012508 change request Methods 0.000 claims description 14
- 238000004590 computer program Methods 0.000 claims description 9
- 230000004044 response Effects 0.000 claims description 6
- 108091026890 Coding region Proteins 0.000 claims 2
- 238000010586 diagram Methods 0.000 description 12
- 230000006870 function Effects 0.000 description 6
- 238000012545 processing Methods 0.000 description 6
- 238000004891 communication Methods 0.000 description 5
- 230000003287 optical effect Effects 0.000 description 4
- 238000005516 engineering process Methods 0.000 description 3
- 230000009286 beneficial effect Effects 0.000 description 2
- 230000001419 dependent effect Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 125000000484 butyl group Chemical group [H]C([*])([H])C([H])([H])C([H])([H])C([H])([H])[H] 0.000 description 1
- 238000004364 calculation method Methods 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 125000001495 ethyl group Chemical group [H]C([H])([H])C([H])([H])* 0.000 description 1
- 239000000835 fiber Substances 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 238000012423 maintenance Methods 0.000 description 1
- 125000002496 methyl group Chemical group [H]C([H])([H])* 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 125000001147 pentyl group Chemical group C(CCCC)* 0.000 description 1
- 125000001436 propyl group Chemical group [H]C([*])([H])C([H])([H])C([H])([H])[H] 0.000 description 1
- 238000012216 screening Methods 0.000 description 1
- 239000004065 semiconductor Substances 0.000 description 1
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F8/00—Arrangements for software engineering
- G06F8/60—Software deployment
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/50—Network service management, e.g. ensuring proper service fulfilment according to agreements
- H04L41/5041—Network service management, e.g. ensuring proper service fulfilment according to agreements characterised by the time relationship between creation and deployment of a service
- H04L41/5051—Service on demand, e.g. definition and deployment of services in real time
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- General Engineering & Computer Science (AREA)
- Theoretical Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Physics & Mathematics (AREA)
- General Physics & Mathematics (AREA)
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The embodiment of the disclosure discloses a method and a device for deploying services, and the method and the device can be applied to the field of cloud computing. One embodiment of the method comprises: receiving a service deployment request input by a user, wherein the service deployment request comprises a service identifier of a current service to be deployed; determining the service identifier of the preposed service of the current service based on the service identifier of the current service, and determining the deployment sequence of the current service and each preposed service; searching a service deployment file of the current service and a service deployment file of the preposed service from a pre-stored associated data set; and deploying each service in the current service and the preposed service according to the deployment sequence and the service deployment file of each service so that the preposed service is deployed before the current service. The implementation method can deploy only the current service and the preposed service depended by the current service, thereby improving the problems of low deployment efficiency and low resource utilization rate possibly caused by full deployment.
Description
Technical Field
Embodiments of the present disclosure relate to the field of computer technologies, and in particular, to a method and an apparatus for deploying a service.
Background
With the continuous development of computer technologies, services provided by cloud computing platforms are more and more diversified.
When a cloud computing platform is built, diversified services need to be deployed on the cloud computing platform. In the related art, all services are generally deployed in a full-scale deployment manner. Since different cloud computing platforms need different services to be deployed, in the related art, in order to improve service deployment efficiency, there is a need to deploy only the services that need to be deployed.
Disclosure of Invention
Embodiments of the present disclosure propose methods and apparatuses for deploying services.
In a first aspect, an embodiment of the present disclosure provides a method for deploying a service, the method including: receiving a service deployment request input by a user, wherein the service deployment request comprises a service identifier of a current service to be deployed; determining a service identifier of a preposed service of the current service and determining the current service and the deployment sequence of each preposed service based on the service identifier of the current service, wherein the preposed service is a service on which the current service depends; searching a service deployment file of the current service and a service deployment file of the preposed service from a pre-stored associated data set, wherein the associated data in the associated data set comprises a corresponding service identifier and the service deployment file; and deploying each service in the current service and the preposed service according to the deployment sequence and the service deployment file of each service so that the preposed service is deployed before the current service.
In some embodiments, determining the service identifier of the pre-service of the current service based on the service identifier of the current service, and determining the deployment order of the current service and the pre-services comprises: and finding out the deployment relation corresponding to the service identification of the current service from a pre-stored service identification-deployment relation table, wherein the deployment relation comprises the service identification of the preposed service of the current service and the deployment sequence of the current service and each preposed service.
In some embodiments, determining the service identifier of the pre-service of the current service based on the service identifier of the current service, and determining the deployment order of the current service and each pre-service comprises: searching a relation pair with a former identifier as a service identifier of the current service from a prestored relation pair set, and storing the searched relation pair as a target relation pair into a target relation pair set, wherein the relation pair in the relation pair set comprises the corresponding former identifier and the latter identifier, and the former identifier and the latter identifier in the relation pair respectively indicate the service to be deployed and the front service on which the service to be deployed directly depends; and executing the following searching steps on the searched relation pair: searching a relation pair with the same former identifier and the same latter identifier in the relation pair from the relation pair set; in response to the finding, storing the found relationship pair as a target relationship pair in a target relationship pair set, and continuing to execute the finding step on the newly found relationship pair; and responding to the condition that the service is not found, obtaining the service identification of the preposed service of the current service according to the target relation pair set, and obtaining the deployment sequence of the current service and each preposed service according to the sequential deployment relation of each target relation pair described in the target relation pair set.
In some embodiments, obtaining the deployment sequence of the current service and each pre-service according to the sequential deployment relationship between the services described by each target relationship pair in the target relationship pair set includes: and converting the target relation pair set into a directed acyclic graph according to the sequential deployment relation among the services described by each target relation pair in the target relation pair set, so as to obtain the deployment sequence of each service in the current service and the preposed service.
In some embodiments, the method further comprises: receiving a relation pair change request input by a user, wherein the relation pair change request comprises a relation pair to be changed and change contents of the relation pair; and changing the relation pair set according to the relation pair needing to be changed and the change content of the relation pair.
In a second aspect, an embodiment of the present disclosure provides an apparatus for deploying a service, the apparatus including: the service deployment unit is configured to receive a service deployment request input by a user, wherein the service deployment request comprises a service identifier of a current service required to be deployed; the determining unit is configured to determine a service identifier of a preposed service of a current service based on the service identifier of the current service, and determine the current service and a deployment sequence of each preposed service, wherein the preposed service is a service on which the current service depends; the searching unit is configured to search a service deployment file of a current service and a service deployment file of a pre-service from a pre-stored associated data set, wherein the associated data in the associated data set comprises a corresponding service identifier and the service deployment file; and the deployment unit is configured to deploy each service in the current service and the preposed service according to the deployment sequence and the service deployment file of each service so that the preposed service is deployed before the current service.
In some embodiments, the determining unit is further configured to: and finding out the deployment relation corresponding to the service identification of the current service from a pre-stored service identification-deployment relation table, wherein the deployment relation comprises the service identification of the preposed service of the current service and the deployment sequence of the current service and each preposed service.
In some embodiments, the determining unit is further configured to: searching a relation pair with a former identifier as a service identifier of the current service from a prestored relation pair set, and storing the searched relation pair as a target relation pair into a target relation pair set, wherein the relation pair in the relation pair set comprises the corresponding former identifier and the latter identifier, and the former identifier and the latter identifier in the relation pair respectively indicate the service to be deployed and the front service on which the service to be deployed directly depends; and executing the following searching steps on the searched relation pair: searching a relation pair with the same former identifier and the same latter identifier in the relation pair from the relation pair set; in response to the finding, storing the found relationship pair as a target relationship pair in a target relationship pair set, and continuing to execute the finding step on the newly found relationship pair; and responding to the condition that the service is not found, obtaining the service identification of the preposed service of the current service according to the target relation pair set, and obtaining the deployment sequence of the current service and each preposed service according to the sequential deployment relation of each target relation pair described in the target relation pair set.
In some embodiments, obtaining the deployment sequence of the current service and each pre-service according to the sequential deployment relationship between the services described by each target relationship pair in the target relationship pair set includes: and converting the target relation pair set into a directed acyclic graph according to the sequential deployment relation among the services described by each target relation pair in the target relation pair set, so as to obtain the deployment sequence of each service in the current service and the preposed service.
In some embodiments, the apparatus further comprises a change unit configured to: receiving a relation pair change request input by a user, wherein the relation pair change request comprises a relation pair to be changed and change contents of the relation pair; and changing the relation pair set according to the relation pair needing to be changed and the change content of the relation pair.
In a third aspect, an embodiment of the present disclosure provides an electronic device, including: one or more processors; a storage device having one or more programs stored thereon; when executed by the one or more processors, cause the one or more processors to implement a method as described in any implementation of the first aspect.
In a fourth aspect, embodiments of the present disclosure provide a computer-readable medium on which a computer program is stored, which when executed by a processor implements the method as described in any of the implementations of the first aspect.
The method and the device for deploying the service, provided by the embodiment of the disclosure, may first receive a service deployment request input by a user, where the service deployment request includes a service identifier of a current service to be deployed. Then, based on the service identifier of the current service, the service identifier of the pre-service of the current service is determined, and the deployment sequence of the current service and each pre-service is determined. Wherein the pre-service is a service on which the current service depends. And then searching the service deployment file of the current service and the service deployment file of the preposed service from the pre-stored associated data set. And the associated data in the associated data set comprises corresponding service identification and service deployment files. And finally, deploying the services in the current service and the preposed service according to the deployment sequence and the service deployment file of each service so that the preposed service is deployed before the current service. According to the method and the device provided by the embodiment of the disclosure, only the service needing to be deployed is deployed without deploying the service which does not need to be deployed by screening the preposed service which has a dependency relationship with the current service needing to be deployed, so that the service deployment efficiency can be improved, and meanwhile, the resource utilization rate is improved without allocating resources to the service which does not need to be deployed.
Drawings
Other features, objects and advantages of the disclosure will become more apparent upon reading of the following detailed description of non-limiting embodiments thereof, made with reference to the accompanying drawings in which:
FIG. 1 is an exemplary system architecture diagram in which one embodiment of the present disclosure may be applied;
FIG. 2 is a flow diagram of one embodiment of a method for deploying a service, according to the present disclosure;
FIG. 3 is a schematic diagram of one application scenario of a method for deploying a service in accordance with an embodiment of the present disclosure;
FIG. 4 is a flow diagram of another embodiment of a method for deploying a service according to the present disclosure;
FIG. 5 is a block diagram of one embodiment of an apparatus for deploying a service according to the present disclosure;
FIG. 6 is a schematic structural diagram of an electronic device suitable for use in implementing embodiments of the present disclosure.
Detailed Description
The present disclosure is described in further detail below with reference to the accompanying drawings and examples. It is to be understood that the specific embodiments described herein are merely illustrative of the relevant invention and not restrictive of the invention. It should be noted that, for convenience of description, only the portions related to the related invention are shown in the drawings.
It should be noted that, in the present disclosure, the embodiments and features of the embodiments may be combined with each other without conflict. The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.
Fig. 1 illustrates an exemplary system architecture 100 of a method for deploying a service or an apparatus for deploying a service to which embodiments of the present disclosure may be applied.
As shown in fig. 1, the system architecture 100 may include terminal devices 101, 102, 103, a network 104, and a server 105. The network 104 serves as a medium for providing communication links between the terminal devices 101, 102, 103 and the server 105. Network 104 may include various connection types, such as wired, wireless communication links, or fiber optic cables, among others.
The terminal devices 101, 102, 103 may interact with the server 105 via the network 104 to receive or send messages or the like. Various applications, such as a search-class application, a service deployment-class application, a shopping-class application, etc., may be installed on the terminal devices 101, 102, 103.
The terminal apparatuses 101, 102, and 103 may be hardware or software. When the terminal devices 101, 102, 103 are hardware, they may be various electronic devices having a display screen, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like. When the terminal apparatuses 101, 102, 103 are software, they can be installed in the electronic apparatuses listed above. It may be implemented as multiple pieces of software or software modules (e.g., multiple pieces of software or software modules to provide a distributed service), or as a single piece of software or software module. And is not particularly limited herein.
The server 105 may interact with the terminal devices 101, 102, 103 via a network to receive or send messages or the like. The server 105 may be implemented as a distributed cluster of servers providing various services or as a single server. For example, a server on which the service requested to be deployed is deployed based on a service deployment request sent by the terminal apparatus 101, 102, 103. The server may receive a service deployment request sent by the terminal device 101, 102, 103, where the service deployment request includes a service identifier of a current service to be deployed. And then determining the service identifier of the preposed service of the current service based on the service identifier of the current service, and determining the deployment sequence of the current service and each preposed service. Wherein the pre-service is a service on which the current service depends. And then searching the service deployment file of the current service and the service deployment file of the preposed service from the pre-stored associated data set. And the associated data in the associated data set comprises corresponding service identification and service deployment files. And finally, deploying the services in the current service and the preposed service according to the deployment sequence and the service deployment file of each service so that the preposed service is deployed before the current service.
It should be noted that the method for deploying the service provided by the embodiment of the present disclosure is generally performed by the server 105, and accordingly, the apparatus for deploying the service is generally disposed in the server 105.
It should be understood that the number of terminal devices, networks, and servers in fig. 1 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
With continued reference to FIG. 2, a flow 200 of one embodiment of a method for deploying a service in accordance with the present disclosure is shown. The method for deploying the service comprises the following steps:
The service deployment request includes a service identification of a current service to be deployed.
In this embodiment, an execution subject (for example, the server 105 shown in fig. 1) of the method for deploying the service may receive a service deployment request input by a user through a terminal device by a wired connection manner or a wireless connection manner. The service deployment request comprises a service identifier of a current service to be deployed. The current service to be deployed may be a service which the user currently requests to be deployed. Therein, current services may include, by way of example and not limitation, storage services, computing services, big data services, and the like.
The service identification may be various information for identifying the service. As an example, the service identifier may be "a" or "001" for identifying a service. It is noted that the service has a unique correspondence with the service identification. The service identification corresponding to each service generally follows the same encoding rule. As an example, if the service identifier of the service a is encoded by letters (e.g., the service identifier of the service a is a), the service b, the service c, etc. are encoded by letters. For example, at this time, the service identifier of the service B may be B, and the service identifier of the service C may be C.
Wherein the pre-service is a service on which the current service depends. It should be noted that one service depends on another service, which generally means that when a service is deployed, a service needs to be deployed in an environment after the service on which the service depends is deployed.
Furthermore, here, the pre-service of the current service may be understood as all services that need to be deployed before the current service is deployed. Specifically, the front-end service of the current service may be divided into a service on which the current service directly depends and a service on which the current service indirectly depends. For example, when a certain service a is deployed, if the deployment of the service a needs to directly adopt interface information of another service B, the other service B is a service on which the service a directly depends. In addition, if the deployment of the service a needs to indirectly adopt the interface information of another service C, if the service B that the service a directly depends on needs to directly adopt the interface information of another service C, the other service C is the service that the service a indirectly depends on.
In this embodiment, the executing body may find service identifiers of all pre-positioned services of the current service from the service identifier-pre-positioned service identifier correspondence table by using the service identifier of the current service, and obtain the deployment order of the current service and each pre-positioned service according to the coding order of the service identifiers of each pre-positioned service. The service identifier-pre-service identifier correspondence table may be a correspondence table that is generated based on statistics of a large number of service identifiers and stores correspondence between a plurality of service identifiers and service identifiers of pre-services corresponding to the service identifiers. In the service identifier-pre-service identifier correspondence table, one service identifier may correspond to a plurality of pre-service identifiers. In addition, since the service identifiers generally have a certain encoding rule, the service identifiers encoded according to the encoding rule generally have a certain order. If the encoding rule may be numbering in sequence by using english letters, service identifiers obtained after numbering are A, B, C and the like, so that the services can be preset to be deployed in the sequence from a to Z or from Z to a. Therefore, the execution body can obtain the current service and the deployment order of each preposed service according to the obtained coding order of the plurality of preposed service identifications.
In an optional implementation manner of each embodiment of the present disclosure, determining, based on the service identifier of the current service, a service identifier of a pre-service of the current service, and determining a deployment order of the current service and each pre-service may include:
and finding out the deployment relation corresponding to the service identification of the current service from a pre-stored service identification-deployment relation table. The deployment relationship comprises the service identification of the preposed service of the current service and the deployment sequence of the current service and each preposed service.
The pre-stored service identifier-deployment relationship table may be a correspondence relationship table generated based on statistics of a large number of services and storing correspondence relationships between a plurality of service identifiers and deployment relationships. In the service identifier-deployment relationship table, one service identifier corresponds to one deployment relationship, and the deployment relationship includes the service identifier of the service that is pre-positioned by the corresponding service identifier, and the deployment sequence of each pre-positioned service that includes the service and the service.
As an example, if a certain service identifier in the service identifier-deployment relationship table is a, the deployment relationship corresponding to the service identifier is B-C-D-a. The service identifier A is used for indicating a service A, the service identifier B is used for indicating a service B, the service identifier C is used for indicating a service C, and the service identifier D is used for indicating a service D. The front-end services of the service A are B, C and D, and the deployment sequence of the front-end services of the service A and the service A is as follows: the method comprises the steps of deploying a service B, deploying a service C, deploying a service D and deploying a service A.
In this implementation manner, the execution subject may directly search for the pre-service of the current service and obtain the deployment sequence of the current service and each pre-service by using the service identifier of the current service. Only one search is needed, the search efficiency is high, and the service deployment efficiency is improved.
And the associated data in the associated data set comprises corresponding service identification and service deployment files. The service deployment file is generally a file for deploying a service.
In this embodiment, the executing entity may find the service deployment file of the current service from the associated data set by using the service identifier of the current service. And searching the service deployment file of the preposed service from the associated data set by adopting the service identifier of the preposed service.
And step 204, deploying the current service and each service in the pre-service according to the deployment sequence and the service deployment file of each service so that the pre-service is deployed before the current service.
In this embodiment, the execution main body may deploy each service respectively by using the corresponding service deployment file according to the deployment order of each service.
In this embodiment, the execution main body may deploy the service based on the deployment requirement of the user, and the service that does not need to be deployed is not required to be deployed, so that the service deployment efficiency may be improved.
With continued reference to fig. 3, fig. 3 is a schematic diagram of an application scenario 300 of the method for deploying a service according to the present embodiment. In the application scenario of fig. 3, an operation and maintenance person 301 inputs a service deployment request to a server 303 through a terminal 302. The service deployment request may be: please deploy the service identified as a. The service identifier A is used for identifying the service A.
After receiving the service deployment request, the server 303 may perform the following steps:
firstly, based on the service identifier a, the service identifier of the pre-service of the service a is obtained as follows: B. and C, performing treatment. The service identifier B is used for identifying the service B, and the service identifier C is used for identifying the service C. And the deployment sequence of the services A, B and C is as follows: deploying the third, deploying the second and deploying the first.
Then, the server 303 finds out that the service deployment file of the current service a is the service deployment file 1, the service deployment file of the pre-service B is the service deployment file 2, and the service deployment file of the pre-service C is the service deployment file 3 from the prestored associated data sets { (a, service deployment file 1), (B, service deployment file 2), (C, service deployment file 3), (D, service deployment file 4), (E, service deployment file 5) }.
Finally, the server 303 may deploy the service c by using the service deployment file 3, deploy the service b by using the service deployment file 2, and deploy the service a by using the service deployment file 1 according to the deployment sequence of each service in the service a, the service b, and the service c.
The method for deploying the service provided by the above embodiment of the present disclosure includes receiving a service deployment request input by a user, where the service deployment request includes a service identifier of a current service to be deployed. Then, based on the service identifier of the current service, the service identifier of the prepositive service of the current service is determined, and the deployment sequence of the current service and each prepositive service is determined. Wherein the pre-service is a service on which the current service depends. And then searching the service deployment file of the current service and the service deployment file of the preposed service from the pre-stored associated data set. And the associated data in the associated data set comprises corresponding service identification and service deployment files. And finally, deploying the services in the current service and the preposed service according to the deployment sequence and the service deployment file of each service so that the preposed service is deployed before the current service. The method of the embodiment can deploy the service based on the deployment requirement of the user, does not need to deploy the service which does not need to be deployed, can improve the service deployment efficiency, and is beneficial to improving the resource utilization rate because the resource does not need to be distributed to the service which does not need to be deployed.
With further reference to FIG. 4, a flow 400 of yet another embodiment of a method for deploying a service is illustrated. The flow 400 of the method for deploying a service includes the steps of:
The service deployment request includes a service identification of a current service to be deployed.
Wherein the pre-service is a service on which the current service depends.
Wherein, the step 402 may include a step 4021 and a step 4022.
The relation pairs in the relation pair set comprise corresponding former identifications and latter identifications, and the former identifications and the latter identifications in the relation pairs respectively indicate the services to be deployed and the former services on which the services to be deployed directly depend. The pre-service on which the service to be deployed directly depends generally refers to a pre-service on which interface information of the service to be deployed needs to be directly adopted when the service to be deployed is deployed.
In addition, since there may be a plurality of front-end services on which the service to be deployed directly depends, there may be a plurality of back-end identifiers corresponding to the front-end identifiers in one relationship pair. As an example, if the preceding identifier is a, the following identifier may be B and C. Wherein, A indicates the service to be deployed, and B and C respectively indicate the preposed service directly depended by the service to be deployed.
In this embodiment, the executing entity may find, from the relationship pair set, a relationship pair whose previous identifier is the service identifier of the current service, by using the service identifier of the current service. As an example, if the service identifier of the current service is a, and the relationship pair set is { (a, B, C), (B, D), (M, a) }, the execution body may find the relationship pair (a, B, C) from the relationship pair set. At this time, the services on which the current service a directly depends are B and C. In this embodiment, the execution subject may store the searched relationship pair as a target relationship pair in the target relationship pair set. It is noted that the set of target relationship pairs is by default an empty set.
In this embodiment, after the executing main body finds one relationship pair, the executing main body continues to perform the step of finding the found relationship pair. The searching step is performed to obtain the service directly dependent on the service indicated by the subsequent identifier in the searched relation pair. In this way, by repeatedly performing the lookup step, all the pre-services of the current service can be obtained.
In addition, because of each relationship pair in the obtained relationship pair set, the fixed precedence deployment relationship between the service indicated by the former identifier and the service indicated by the latter identifier is: the service indicated by the subsequent identity is deployed before the service indicated by the previous identity, or the service indicated by the previous identity is deployed after the service indicated by the subsequent identity. Therefore, the execution subject may obtain the deployment sequence of the current service and each pre-service by using the sequential deployment relationship between the services described by each target relationship pair in the target relationship pair set.
Optionally, the obtaining, according to the precedence deployment relationship between the services described by each target relationship pair in the target relationship pair set, a deployment sequence of the current service and each pre-service includes:
and according to the sequence of the storage time of each target relation pair in the target relation pair set from back to front, sequentially extracting the deployment sequence of each service from the sequential deployment relation among the services described by each relation pair to obtain the deployment sequence of the current service and each preposed service.
As an example, if the set of target relationship pairs is { (a, B, C), (B, D), (C, D, E), (D, NULL) }. The service identification method comprises the following steps of A, B, C, D and E, wherein A is used for identifying a current service A, B is used for identifying a service B, C is used for identifying a service C, D is used for identifying a service D, and E is used for identifying a service E. The precedence deployment relationship between the services described by the relationship pair (a, B, C) is: deploying the second and the third and then deploying the first. The precedence deployment relationship between the services described in the relationship pair (B, D) is: deploying D first and deploying B second. The precedence deployment relationship between the services described by the relationship pair (C, D, E) is: d and E are deployed first, and C is deployed later. The precedence deployment relationship between services described by the relationship pair (D, NULL) is: d, directly deploying the D. Where NULL indicates absence. In the relation pair (D, NULL), there is no direct pre-service on which the service depends. At this time, first, the execution subject may obtain the first deployment subject from the precedence deployment relationship described by the last relationship pair in the target relationship pair set. Then, the deploying E is firstly deployed and then the deploying C is deployed according to the sequential deployment relationship described by the penultimate relationship pair in the target relationship pair set. And then, obtaining deployment B through the sequential deployment relationship described by the third last relationship pair in the target relationship pair set. Finally, the deployment A can be obtained through the sequential deployment relationship described by the first relationship pair in the target relationship pair set. Thus, the obtained deployment sequence of the current service and each prepositive service is from front to back in sequence: butyl, pentyl, propyl, ethyl and methyl. It should be noted that in the present disclosure, the service that has already been deployed is not usually deployed repeatedly.
In some optional implementation manners of this embodiment, obtaining the deployment sequence of the current service and each pre-service according to the precedence deployment relationship between the services described by each target relationship pair in the target relationship pair set may include:
and converting the target relation pair set into a Directed Acyclic Graph (DAG) according to the sequential deployment relation among the services described by each target relation pair in the target relation pair set, and obtaining the deployment sequence of each service in the current service and the preposed service.
In this implementation, the execution subject may convert the target relationship pair into a directed acyclic graph by using a sequential deployment relationship between services described by each target relationship pair in the target relationship pair set. Because the directed acyclic graph is a directed graph and has a topological order, the deployment order of the current service and each preposed service can be directly obtained after the target relation pair is converted into the directed acyclic graph.
In this implementation, the directed acyclic graph generally has multiple degrees of departure, and the structure supports parallel processing. For example, if the service a has three directly dependent front-end services at the same time, it is service b, service c, and service d. Then, at this time, the service b, the service c and the service d are in a parallel relationship, and a parallel processing mode may be adopted for the deployment of the three services, that is, the three services are deployed simultaneously. Therefore, the target relation pair is converted into the directed acyclic graph to obtain the deployment sequence of the current service and each preposed service, a plurality of services with the parallel relation can be deployed at the same time, and the service deployment efficiency is improved.
In some optional implementation manners of this embodiment, the method for deploying a service may further include the following steps:
first, a relationship pair change request input by a user is received. The relationship pair change request includes a relationship pair to be changed and change contents of the relationship pair.
It should be noted that with the increasing number of services and the increasing sophistication of services, there is a need to update the relationship pairs in the relationship pair set in time.
In this implementation, the execution main body may receive a request for changing the relationship input by the user through the terminal through a wired connection manner or a wireless connection manner. The relation pair change request comprises a relation pair needing to be changed and change content of the relation pair. As an example, the relationship pair change request may be: the relationship pair of the required change is (a, B, C), and the change content is: b, C is replaced by D.
Then, the relationship pair set is changed according to the relationship pair to be changed and the change content of the relationship pair.
In this implementation, the execution subject may find a relationship pair to be changed from the relationship pair set, and then change the found relationship pair according to the change content.
In this implementation manner, because the amount of content carried by each relationship pair in the relationship pair set is small, when a service or a pre-service of the service changes, it is only necessary to change some related relationship pairs in the relationship pair set, which is helpful for quickly and accurately adjusting the precedence deployment relationship between the relationship pairs and the described services.
And the associated data in the associated data set comprises corresponding service identification and service deployment files.
And step 404, deploying the current service and each service in the pre-service according to the deployment sequence and the service deployment file of each service so that the pre-service is deployed before the current service.
In the present embodiment, the specific operations of steps 401, 403 and 404 are substantially the same as the operations of steps 201, 203 and 204 in the embodiment shown in fig. 2, and are not repeated herein.
In this embodiment, the execution subject may gradually find the pre-service on which the current service directly depends, the pre-service on which the pre-service directly depends, and the like by using the pre-stored relationship pair set and the service identifier of the current service. Until all the prepositive services of the current service are obtained. All preposed services of the current service can be obtained only by a searching mode, the calculation complexity is low, and the service deployment efficiency is improved. In addition, because each relationship pair in the relationship pair set is stored according to the dependency relationship among the services, the precedence deployment relationship among the services can be described. In this embodiment, the deployment sequence of each service can be obtained step by step while the pre-service is obtained step by step, which is helpful to improve the service deployment efficiency.
With further reference to fig. 5, as an implementation of the method shown in the above figures, the present disclosure provides an embodiment of an apparatus for deploying a service, where the embodiment of the apparatus corresponds to the embodiment of the method shown in fig. 2, and the apparatus may be specifically applied to various electronic devices.
As shown in fig. 5, the apparatus 500 for deploying a service of the present embodiment includes: a request unit 501 configured to receive a service deployment request input by a user, where the service deployment request includes a service identifier of a current service to be deployed; a determining unit 502 configured to determine, based on the service identifier of the current service, a service identifier of a pre-service of the current service, and determine a deployment order of the current service and each pre-service, where the pre-service is a service on which the current service depends; a searching unit 503 configured to search a service deployment file of a current service and a service deployment file of a pre-service from a pre-stored associated data set, where the associated data in the associated data set includes a corresponding service identifier and the service deployment file; a deployment unit 504 configured to deploy each service of the current service and the pre-service according to the deployment order and the service deployment file of each service, so that the pre-service is deployed before the current service.
In some optional implementations of this embodiment, the determining unit 502 is further configured to: and finding out the deployment relation corresponding to the service identification of the current service from a pre-stored service identification-deployment relation table. The deployment relationship comprises a service identifier of a preposed service of the current service and a deployment sequence of the current service and each preposed service.
In some optional implementations of this embodiment, the determining unit 502 is further configured to: the first step is that the relation pair with the former mark as the service mark of the current service is searched from the prestored relation pair set, and the searched relation pair is stored as the target relation pair in the target relation pair set. The relation pairs in the relation pair set comprise corresponding former identifications and latter identifications, and the former identifications and the latter identifications in the relation pairs respectively indicate the services to be deployed and the former services on which the services to be deployed directly depend. And secondly, executing the following searching steps on the searched relation pair: first, from a set of relationship pairs, a relationship pair is found whose leading identity is the same as the trailing identity in the relationship pair. Then, in response to the search, the searched relation pair is stored as a target relation pair in the target relation pair set, and the search step is continuously performed on the newly searched relation pair. And finally, responding to the condition that the service is not found, obtaining the service identification of the preposed service of the current service according to the target relation pair set, and obtaining the deployment sequence of the current service and each preposed service according to the sequential deployment relation of each target relation pair described in the target relation pair set.
In some optional implementation manners of this embodiment, obtaining the deployment sequence of the current service and each pre-service according to the precedence deployment relationship between the services described by each target relationship pair in the target relationship pair set includes: and converting the target relation pair set into a directed acyclic graph according to the sequential deployment relation among the services described by each target relation pair in the target relation pair set, so as to obtain the deployment sequence of each service in the current service and the preposed service.
In some optional implementations of this embodiment, the apparatus further includes a changing unit (not shown in the figure). Wherein the changing unit may be configured to: firstly, a relationship pair change request input by a user is received, and the relationship pair change request comprises a relationship pair needing to be changed and change content of the relationship pair. Then, the relationship pair set is changed according to the relationship pair to be changed and the change content of the relationship pair.
The device provided by the embodiment of the disclosure can deploy the service based on the deployment requirement of the user, does not need to deploy the service which does not need to be deployed, can improve the service deployment efficiency, and is beneficial to improving the resource utilization rate because the resource does not need to be allocated to the service which does not need to be deployed.
Referring now to FIG. 6, a schematic diagram of an electronic device (e.g., the server of FIG. 1) 600 suitable for use in implementing embodiments of the present disclosure is shown. The electronic device shown in fig. 6 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 6, the electronic device 600 may include a processing means (e.g., a Central Processing Unit (CPU), a graphics processor, etc.) 601 that may perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)602 or a program loaded from a storage means 608 into a Random Access Memory (RAM) 603. In the RAM 603, various programs and data necessary for the operation of the electronic apparatus 600 are also stored. The processing device 601, the ROM 602, and the RAM 603 are connected to each other via a bus 604. An input/output (I/O) interface 605 is also connected to bus 604.
Generally, the following devices may be connected to the I/O interface 605: input devices 606 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; output devices 607 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; storage 608 including, for example, tape, hard disk, etc.; and a communication device 609. The communication means 609 may allow the electronic device 600 to communicate with other devices wirelessly or by wire to exchange data. While fig. 6 illustrates an electronic device 600 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided. Each block shown in fig. 6 may represent one device or may represent multiple devices as desired.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer-readable medium, the computer program comprising program code for performing the method illustrated by the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network via the communication means 609, or may be installed from the storage means 608, or may be installed from the ROM 602. The computer program, when executed by the processing device 601, performs the above-described functions defined in the methods of embodiments of the present disclosure. It should be noted that the computer readable medium of the embodiments of the present disclosure may be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In embodiments of the disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In embodiments of the present disclosure, however, a computer readable signal medium may comprise a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
The computer readable medium may be embodied in the electronic device; or may exist separately without being assembled into the electronic device. The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: receiving a service deployment request input by a user, wherein the service deployment request comprises a service identifier of a current service to be deployed; determining a service identifier of a preposed service of the current service and determining the current service and the deployment sequence of each preposed service based on the service identifier of the current service, wherein the preposed service is a service on which the current service depends; searching a service deployment file of the current service and a service deployment file of the preposed service from a pre-stored associated data set, wherein the associated data in the associated data set comprises a corresponding service identifier and the service deployment file; and deploying each service in the current service and the preposed service according to the deployment sequence and the service deployment file of each service so that the preposed service is deployed before the current service.
Computer program code for carrying out operations for embodiments of the present disclosure may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in the embodiments of the present disclosure may be implemented by software or hardware. The described units may also be provided in a processor, and may be described as: a processor includes a request unit, a determination unit, a lookup unit, and a deployment unit. Where the names of these units do not in some cases constitute a limitation on the unit itself, for example, a requesting unit may also be described as a "unit that receives a service deployment request input by a user".
The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the invention in the present disclosure is not limited to the specific combination of the above-mentioned features, but also encompasses other embodiments in which any combination of the above-mentioned features or their equivalents is possible without departing from the inventive concept as defined above. For example, the above features and (but not limited to) the features disclosed in this disclosure having similar functions are replaced with each other to form the technical solution.
Claims (12)
1. A method for deploying a service, comprising:
receiving a service deployment request input by a user, wherein the service deployment request comprises a service identifier of a current service to be deployed;
determining a service identifier of a pre-service of the current service from a pre-stored service identifier-pre-service identifier corresponding relation table based on the service identifier of the current service, and determining a deployment sequence of the current service and each pre-service according to a coding sequence of the service identifier of each pre-service, wherein the pre-service is a service on which the current service depends;
searching a service deployment file of the current service and a service deployment file of the pre-service from a pre-stored associated data set, wherein the associated data in the associated data set comprises a corresponding service identifier and a service deployment file;
and deploying each service in the current service and the preposed service according to the deployment sequence and the service deployment file of each service so that the preposed service is deployed before the current service.
2. The method of claim 1, wherein the determining a service identifier of a pre-service of the current service based on the service identifier of the current service, and the determining a deployment order of the current service and the pre-services comprises:
and finding out a deployment relation corresponding to the service identifier of the current service from a pre-stored service identifier-deployment relation table, wherein the deployment relation comprises the service identifier of the preposed service of the current service and the deployment sequence of the current service and each preposed service.
3. The method of claim 1, wherein the determining a service identifier of a pre-service of the current service based on the service identifier of the current service, and the determining a deployment order of the current service and the pre-services comprises:
searching a relation pair with a former identifier as a service identifier of the current service from a prestored relation pair set, and storing the searched relation pair as a target relation pair into a target relation pair set, wherein the relation pair in the relation pair set comprises the corresponding former identifier and the latter identifier, and the former identifier and the latter identifier in the relation pair respectively indicate the service to be deployed and the front service on which the service to be deployed directly depends;
and executing the following searching steps on the searched relation pair: searching a relation pair with the same former identifier and the same later identifier in the relation pair from the relation pair set; in response to the finding, storing the found relation pair as a target relation pair in a target relation pair set, and continuing to execute the finding step on the newly found relation pair; and responding to the condition that the service is not found, obtaining the service identification of the preposed service of the current service according to the target relation pair set, and obtaining the deployment sequence of the current service and each preposed service according to the sequential deployment relation of each target relation pair described in the target relation pair set.
4. The method according to claim 3, wherein the obtaining of the deployment sequence of the current service and each pre-service according to the precedence deployment relationship among the services described by each target relationship pair in the target relationship pair set comprises:
and converting the target relation pair set into a directed acyclic graph according to the sequential deployment relation among the services described by each target relation pair in the target relation pair set, so as to obtain the deployment sequence of each service in the current service and the preposed service.
5. The method of claim 3, wherein the method further comprises:
receiving a relation pair change request input by a user, wherein the relation pair change request comprises a relation pair required to be changed and change contents of the relation pair;
and changing the relation pair set according to the relation pair to be changed and the change content of the relation pair.
6. An apparatus for deploying a service, comprising:
the service deployment unit is used for receiving a service deployment request input by a user, wherein the service deployment request comprises a service identifier of a current service to be deployed;
the determining unit is configured to determine a service identifier of a pre-service of the current service from a pre-stored service identifier-pre-service identifier correspondence table based on the service identifier of the current service, and determine a deployment sequence of the current service and each pre-service according to a coding sequence of the service identifier of each pre-service, wherein the pre-service is a service on which the current service depends;
the searching unit is configured to search the service deployment file of the current service and the service deployment file of the pre-service from a pre-stored associated data set, wherein the associated data in the associated data set comprises corresponding service identification and service deployment file;
and the deployment unit is configured to deploy each service in the current service and the preposed service according to the deployment sequence and the service deployment file of each service so that the preposed service is deployed before the current service.
7. The apparatus of claim 6, wherein the determining unit is further configured to:
and finding out the deployment relation corresponding to the service identifier of the current service from a pre-stored service identifier-deployment relation table, wherein the deployment relation comprises the service identifier of the preposed service of the current service and the deployment sequence of the current service and each preposed service.
8. The apparatus of claim 6, wherein the determining unit is further configured to:
searching a relation pair with a former identifier as a service identifier of the current service from a prestored relation pair set, and storing the searched relation pair as a target relation pair into a target relation pair set, wherein the relation pair in the relation pair set comprises the corresponding former identifier and the latter identifier, and the former identifier and the latter identifier in the relation pair respectively indicate the service to be deployed and the front service on which the service to be deployed directly depends;
and executing the following searching steps on the searched relation pair: searching a relation pair with the same former identifier and the same later identifier in the relation pair from the relation pair set; in response to the finding, storing the found relationship pair as a target relationship pair in a target relationship pair set, and continuing to execute the finding step on the newly found relationship pair; and responding to the condition that the service is not found, obtaining the service identification of the preposed service of the current service according to the target relation pair set, and obtaining the deployment sequence of the current service and each preposed service according to the sequential deployment relation of each target relation pair described in the target relation pair set.
9. The apparatus according to claim 8, wherein the obtaining, according to the precedence deployment relationship among the services described by each target relationship pair in the set of target relationship pairs, a deployment order of the current service and each pre-service includes:
and converting the target relation pair set into a directed acyclic graph according to the sequential deployment relation among the services described by each target relation pair in the target relation pair set, so as to obtain the deployment sequence of each service in the current service and the preposed service.
10. The apparatus of claim 8, wherein the apparatus further comprises a changing unit configured to:
receiving a relation pair change request input by a user, wherein the relation pair change request comprises a relation pair required to be changed and change content of the relation pair;
and changing the relation pair set according to the relation pair to be changed and the change content of the relation pair.
11. An electronic device, comprising:
one or more processors;
a storage device having one or more programs stored thereon,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-5.
12. A computer-readable medium, on which a computer program is stored which, when being executed by a processor, carries out the method according to any one of claims 1-5.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910680637.2A CN110391938B (en) | 2019-07-26 | 2019-07-26 | Method and apparatus for deploying services |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910680637.2A CN110391938B (en) | 2019-07-26 | 2019-07-26 | Method and apparatus for deploying services |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110391938A CN110391938A (en) | 2019-10-29 |
| CN110391938B true CN110391938B (en) | 2022-06-14 |
Family
ID=68287365
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910680637.2A Active CN110391938B (en) | 2019-07-26 | 2019-07-26 | Method and apparatus for deploying services |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110391938B (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110825391B (en) * | 2019-10-31 | 2023-10-13 | 北京金山云网络技术有限公司 | Service management method, device, electronic equipment and storage medium |
| CN111596927B (en) * | 2020-05-15 | 2023-08-18 | 北京金山云网络技术有限公司 | Service deployment method and device and electronic equipment |
| CN112162756B (en) * | 2020-09-17 | 2022-04-26 | 武汉联影医疗科技有限公司 | Deployment method and device of software product, computer equipment and storage medium |
| CN112702201A (en) * | 2020-12-23 | 2021-04-23 | 中移（杭州）信息技术有限公司 | Parameter configuration method and system, communication device and computer readable storage medium |
| CN113760320A (en) * | 2021-01-04 | 2021-12-07 | 北京京东振世信息技术有限公司 | Metadata deployment method and device |
| CN113504972A (en) * | 2021-07-26 | 2021-10-15 | 京东科技控股股份有限公司 | Service deployment method and device, electronic equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107832107A (en) * | 2017-11-24 | 2018-03-23 | 泰康保险集团股份有限公司 | System deployment method, apparatus, electronic equipment and storage medium |
| CN108287756A (en) * | 2018-01-25 | 2018-07-17 | 联动优势科技有限公司 | A kind of method and device of processing task |
| CN108762769A (en) * | 2018-06-04 | 2018-11-06 | 万惠投资管理有限公司 | Micro services application layout and dispositions method, device and terminal |
| CN109327490A (en) * | 2017-07-31 | 2019-02-12 | 杭州华为数字技术有限公司 | A kind of method and apparatus for disposing cloud service component |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10178154B2 (en) * | 2012-10-23 | 2019-01-08 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and system for cloud service deployment |
| US10592290B2 (en) * | 2018-01-10 | 2020-03-17 | International Business Machines Corporation | Accelerating and maintaining large-scale cloud deployment |
-
2019
- 2019-07-26 CN CN201910680637.2A patent/CN110391938B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109327490A (en) * | 2017-07-31 | 2019-02-12 | 杭州华为数字技术有限公司 | A kind of method and apparatus for disposing cloud service component |
| CN107832107A (en) * | 2017-11-24 | 2018-03-23 | 泰康保险集团股份有限公司 | System deployment method, apparatus, electronic equipment and storage medium |
| CN108287756A (en) * | 2018-01-25 | 2018-07-17 | 联动优势科技有限公司 | A kind of method and device of processing task |
| CN108762769A (en) * | 2018-06-04 | 2018-11-06 | 万惠投资管理有限公司 | Micro services application layout and dispositions method, device and terminal |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110391938A (en) | 2019-10-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110391938B (en) | Method and apparatus for deploying services | |
| US11146502B2 (en) | Method and apparatus for allocating resource | |
| CN113900721A (en) | Operating system starting method and device and electronic equipment | |
| CN111338944B (en) | Remote Procedure Call (RPC) interface testing method, device, medium and equipment | |
| CN114035879A (en) | Page theme color changing method and device, electronic equipment and computer readable medium | |
| CN111309304A (en) | Method, device, medium and electronic equipment for generating IDL file | |
| EP3879795A1 (en) | Method and apparatus for acquiring information, device, medium and computer program product | |
| CN111324470B (en) | Method and device for generating information | |
| CN110888773B (en) | Method, device, medium and electronic equipment for acquiring thread identification | |
| CN112732302A (en) | Configuration updating method and device of application program and electronic equipment | |
| CN116679930A (en) | Front-end project construction method and device, electronic equipment and storage medium | |
| CN111752644A (en) | Interface simulation method, device, equipment and storage medium | |
| CN111278085A (en) | Method and device for acquiring target network | |
| CN116302271A (en) | Page display method and device and electronic equipment | |
| CN113792869B (en) | Video processing method and device based on neural network chip and electronic equipment | |
| CN115328506A (en) | Application package generation method, loading method, device, medium and equipment | |
| CN109308299B (en) | Method and apparatus for searching information | |
| CN111898061A (en) | Method, device, electronic equipment and computer readable medium for searching network | |
| CN113472565B (en) | Method, apparatus, device and computer readable medium for expanding server function | |
| CN115309410B (en) | Edge cluster application publishing method and device of edge computing scene and electronic equipment | |
| CN110858240A (en) | Front-end module loading method and device | |
| CN111314457B (en) | Method and device for setting virtual private cloud | |
| CN116820354B (en) | Data storage method, data storage device and data storage system | |
| CN112988528B (en) | Log processing method, device and container group | |
| CN116319322B (en) | Power equipment node communication connection method, device, equipment and computer medium |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20240131 Address after: Building 15, 1st Floor A, No. 8 Dongbei Wangxi Road, Haidian District, Beijing, 100193 Patentee after: Baidu Yunzhi (Beijing) Technology Co.,Ltd. Country or region after: China Address before: 2 / F, baidu building, 10 Shangdi 10th Street, Haidian District, Beijing 100085 Patentee before: BEIJING BAIDU NETCOM SCIENCE AND TECHNOLOGY Co.,Ltd. Country or region before: China |