CN115328529A - Application management method and related equipment - Google Patents

Application management method and related equipment Download PDF

Info

Publication number
CN115328529A
CN115328529A CN202210763045.9A CN202210763045A CN115328529A CN 115328529 A CN115328529 A CN 115328529A CN 202210763045 A CN202210763045 A CN 202210763045A CN 115328529 A CN115328529 A CN 115328529A
Authority
CN
China
Prior art keywords
application
state
data
resource
sub
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.)
Granted
Application number
CN202210763045.9A
Other languages
Chinese (zh)
Other versions
CN115328529B (en
Inventor
林伟
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Wellintech Co Ltd
Original Assignee
Beijing Wellintech Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Wellintech Co Ltd filed Critical Beijing Wellintech Co Ltd
Priority to CN202210763045.9A priority Critical patent/CN115328529B/en
Publication of CN115328529A publication Critical patent/CN115328529A/en
Priority to PCT/CN2023/103792 priority patent/WO2024002229A1/en
Application granted granted Critical
Publication of CN115328529B publication Critical patent/CN115328529B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/70—Software maintenance or management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/60—Software deployment
    • G06F8/65—Updates
    • 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
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44—Arrangements for executing specific programs
    • G06F9/445—Program loading or initiating
    • G06F9/44505—Configuring for program initiating, e.g. using registry, configuration files
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G06F9/5055—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals considering software capabilities, i.e. software resources associated or available to the machine
    • Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
    • Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
    • Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
    • Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Physics & Mathematics (AREA)
  • Computer Security & Cryptography (AREA)
  • Stored Programmes (AREA)
  • Debugging And Monitoring (AREA)
  • Multi Processors (AREA)

Abstract

The application relates to an application management method and related equipment, and relates to the technical field of software. In the present application, first target data is obtained, where the first target data includes application data of a first application. And transmitting the first target data to a target computing node, and controlling the first application to enter a starting state from a stopping state. Receiving a stop instruction for stopping the first application, controlling the first application to enter a stop state from an operating state, and recovering the computer resources of the target computing node allocated to the first application. The application program starting method and the application program stopping device can simplify the process of starting the application program and the process of stopping using the application program.

Description

Application management method and related equipment
Technical Field
The present application relates to the field of software technologies, and in particular, to an application management method and a related device.
Background
An Application (APP), also called an application, refers to a computer program that performs one or more specific tasks, can run in a user mode to interact with a user, and can have a visual user interface.
At present, an application developer can upload a developed application to an application store, and a user who needs to use the APP can download the application from the application store and store the downloaded application to a local terminal device (such as a mobile phone, a tablet computer, a smart television, and the like). And then, the user can install the APP through the local terminal equipment and operate the APP.
However, in the current technical scheme, the APP can be operated only after the local terminal device needs to be downloaded and installed, and the process of operating the APP is complicated.
Disclosure of Invention
The application management method and the related device can simplify the process of starting the application program.
The technical scheme of the application is as follows:
in a first aspect, the present application provides an application management method, including:
first target data is obtained, wherein the first target data comprises application data of a first application. And transmitting the first target data to the target computing node, and controlling the first application to enter a starting state from a stopping state. And receiving a stopping instruction for stopping the first application, controlling the first application to enter a stopping state from a running state, and recovering the computer resources of the target computing node allocated to the first application.
In some implementations, the application data includes: any combination of structure information of the application, function of the application, data parameter of the application and resource demand information of the application. The structure information is used for reflecting the incidence relation between the applications; the resource demand information includes: address information of the target computing node, memory requirement information and CPU requirement information.
In some implementations, the method for acquiring the first target data may include: acquiring first application data, wherein the first application data is application data of a first application. And determining a target computing node. Compiling the first application data according to the node information of the target computing node to generate first target data, wherein the first target data is matched with the target computing node.
In some implementations, the target compute node includes a first container. The method for controlling the first application to enter the starting state from the stopping state may include: and controlling to allocate a first resource to the first container so that the first container runs the first target data through the first resource, wherein the first resource is a computer resource corresponding to the resource demand information of the first application.
In some implementations, the application data further includes run mode information, and the application management method may further include: and if the running mode information is first mode information, controlling to create a first container, wherein the first mode information is used for indicating that the application is run in an exclusive mode.
In some implementations, the target compute node includes a second container. The method for controlling the first application to enter the starting state from the stopping state may include: if the operation mode information is second mode information, determining a second container according to the structural information of the first application, wherein the second container is a container of a first father application, the first father application can call the first application to realize the function of the first application, and the structural information of the first application comprises an incidence relation between the first application and the first father application; the second mode information is used to indicate that the application is running in the sharing mode. And operating the first target data by utilizing a second resource allocated to the second container, wherein the second resource is a computer resource corresponding to the resource demand information of the first father application.
In some implementations, the structural information of the first application includes an association between the first application and a first sub-application, and the first application can call the first sub-application to implement a function of the first sub-application. The application management method may further include: and monitoring the structural information of the first application.
In some implementations, the application management method may further include: monitoring the state of the first sub-application, wherein the state of the first sub-application comprises a running state and a stopping state.
In some implementations, the first sub-application includes at least one application. The method for receiving a stop instruction for stopping the first application, controlling the first application to enter a stop state from an operating state, and recovering the computer resources allocated to the first application by the target computing node includes: and if the states of the applications in the first sub-application are all the stop states, controlling the first application to enter the stop state from the running state, and recovering the computer resources distributed to the first application by the target computing node.
In some implementations, the application management method may further include: and if the application with the running state exists in the first sub-application, rejecting a stopping instruction for stopping the first application.
In some implementations, the application management method may further include: a launch instruction for launching the first sub-application is received. And acquiring application data of the first sub-application, and compiling the application data of the first sub-application into second target data. And transmitting the second target data to the target computing node, and controlling to allocate a third resource to the third container, so that the third container runs the second target data through the third resource, wherein the third resource is a computer resource corresponding to the resource demand information of the first sub-application. And receiving a stopping instruction for stopping the first sub-application, controlling the first sub-application to enter a stopping state from an operating state, and recycling the third resource.
In some implementations, the application management method may further include: and sending a first query message to the target computing node, wherein the first query message is used for querying the application in the running state. A first response message is received from the target computing node, the first response message including an identification of the application in a running state.
In some implementations, the application management method may further include: and sending a first subscription message to the target computing node, wherein the first subscription message is used for subscribing the application with the changed state. In the event of a change in the state of an application, state change information is received from the target computing node, the state change information indicating that the state of the application has changed.
In a second aspect, the present application provides an application management apparatus, comprising: an acquisition unit and a processing unit.
An obtaining unit configured to obtain first target data, where the first target data includes application data of a first application. And the processing unit is used for transmitting the first target data to the target computing node and controlling the first application to enter the starting state from the stopping state. The acquisition unit is further used for receiving a stop instruction for stopping the first application. And the processing unit is also used for controlling the first application to enter a stop state from the running state and recovering the computer resources of the target computing node allocated to the first application.
In some implementations, the application data includes: any combination of structure information of the application, function of the application, data parameter of the application and resource demand information of the application. The structure information is used for reflecting the incidence relation between the applications; the resource demand information includes: address information of the target computing node, memory requirement information and CPU requirement information.
In some implementations, the obtaining unit is further configured to obtain first application data, where the first application data is application data of a first application. And the processing unit is also used for determining a target computing node. And the processing unit is also used for compiling the first application data according to the node information of the target computing node to generate first target data, and the first target data is matched with the target computing node.
In some implementation manners, the processing unit is further configured to control allocation of a first resource to the first container, so that the first container runs the first target data through the first resource, where the first resource is a computer resource corresponding to the resource requirement information of the first application.
In some implementations, the application data also includes run mode information. And the processing unit is further used for controlling to create a first container if the running mode information is first mode information, and the first mode information is used for indicating that the application is run in an exclusive mode.
In some implementations, the target compute node includes a second container. If the operation mode information is second mode information, determining a second container according to the structural information of the first application, wherein the second container is a container of a first father application, the first father application can call the first application to realize the function of the first application, and the structural information of the first application comprises an incidence relation between the first application and the first father application; the second mode information is used to indicate that the application is running in the sharing mode. And operating the first target data by utilizing a second resource allocated to the second container, wherein the second resource is a computer resource corresponding to the resource demand information of the first father application.
In some implementations, the structural information of the first application includes an association between the first application and a first sub-application, and the first application can call the first sub-application to implement a function of the first sub-application. And the processing unit is also used for monitoring the structural information of the first application.
In some implementations, the processing unit is further configured to monitor a state of the first sub-application, where the state of the first sub-application includes a running state and a stopped state.
In some implementations, the first sub-application includes at least one application. And the processing unit is also used for controlling the first application to enter a stop state from an operating state and recovering the computer resource distributed to the first application by the target computing node if the states of the applications in the first sub-application are all stop states.
In some implementations, the processing unit is further configured to reject the stop instruction for stopping the first application if there is an application in the first sub-application, the application being in the running state.
In some implementations, the obtaining unit is further configured to receive a start instruction for starting the first sub-application. The obtaining unit is further configured to obtain application data of the first sub-application, and compile the application data of the first sub-application into second target data. And the processing unit is further configured to transmit the second target data to the target computing node, and control to allocate a third resource to the third container, so that the third container runs the second target data through the third resource, where the third resource is a computer resource corresponding to the resource demand information of the first sub-application. The acquisition unit is further used for receiving a stop instruction for stopping the first sub-application. And the processing unit is also used for controlling the first sub-application to enter a stop state from the running state and recycling the third resource.
In some implementations, the application management apparatus can further include a sending unit. And the sending unit is used for sending a first query message to the target computing node, wherein the first query message is used for querying the application in the running state. The obtaining unit is further configured to receive a first response message from the target computing node, where the first response message includes an identifier of the application in the running state.
In some implementations, the sending unit is configured to send a first subscription message to the target computing node, where the first subscription message is used to subscribe an application whose state is changed. And the acquisition unit is also used for receiving state change information from the target computing node when the state of the application is changed, wherein the state change information is used for indicating that the state of the application is changed.
In a third aspect, the present application provides an electronic device. The electronic device includes: a processor, a memory for storing processor-executable instructions; the processor is configured to execute the instructions, so that the electronic device implements the method according to any one of the possible implementation manners of the first aspect.
In a fourth aspect, the present application provides a computer readable storage medium having stored thereon computer program instructions; the computer program instructions, when executed by an electronic device, cause the electronic device to implement the method as described in any one of the possible implementations of the first aspect.
In a fifth aspect, the present application provides a computer program product comprising computer readable code or a non-transitory computer readable storage medium carrying computer readable code, which when run in an electronic device, a processor in the electronic device implements the method according to any one of the possible implementations of the first aspect.
Based on any one of the first aspect to the fifth aspect, the present application has at least the following advantages:
in the present application, an application management device (e.g., a deployment module in an operation and maintenance system) obtains first target data, where the first target data includes application data of a first application. And then, the deployment module transmits the first target data to the target computing node and controls the first application to enter a starting state from a stopping state. And receiving a stopping instruction for stopping the first application, controlling the first application to enter a stopping state from an operating state, and recovering the computer resources of the target computing node allocated to the first application. Therefore, the local terminal does not need to download and install the application, the first application can be controlled and started through the deployment module, and the process of starting the application program is simplified. And, without using the first application, the deployment module may control the first application to stop running and reclaim the computing resources allocated for the first application. Therefore, the utilization rate of resources can be improved, the user does not need to uninstall the application program, and the process of not using the application program is simplified.
It is to be understood that both the foregoing general description and the following detailed description are exemplary and explanatory only and are not restrictive of the application.
Drawings
The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the present application and, together with the description, serve to explain the principles of the application and are not to be construed as limiting the application.
FIG. 1 is a diagram illustrating a model and predefined relationships provided in an embodiment of the present application;
FIG. 2A is a schematic diagram of a data model provided by an embodiment of the present application;
fig. 2B is a schematic composition diagram of an APP model provided in an embodiment of the present application;
fig. 3 is a schematic flowchart of an application management method according to an embodiment of the present application;
fig. 4 is another schematic flowchart of an application management method according to an embodiment of the present application;
fig. 5 is another schematic flowchart of an application management method according to an embodiment of the present application;
fig. 6 is another schematic flowchart of an application management method according to an embodiment of the present application;
fig. 7 is a schematic composition diagram of an application management system according to an embodiment of the present application;
fig. 8 is a schematic structural diagram of an application management apparatus according to an embodiment of the present application;
fig. 9 is another schematic structural diagram of an application management apparatus according to an embodiment of the present application.
Detailed Description
In order to make the technical solutions of the present application better understood by those of ordinary skill in the art, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings.
It should be noted that the terms "first," "second," and the like in the description and claims of this application and in the accompanying drawings are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used is interchangeable under appropriate circumstances such that the embodiments of the application described herein are capable of operation in sequences other than those illustrated or described herein. The embodiments described in the following exemplary embodiments do not represent all embodiments consistent with the present application. Rather, they are merely examples of apparatus and methods consistent with certain aspects of the application, as detailed in the appended claims.
It will be further understood that the terms "comprises" and/or "comprising," when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, and/or components.
"and/or" is used to describe the association relationship of the associated objects, meaning that three relationships may exist. For example, a and/or B, may represent: a exists alone, A and B exist simultaneously, and B exists alone. The character "/" generally indicates that the former and latter associated objects are in an "or" relationship.
An application program, also known as an application, refers to a computer program that performs one or more specific tasks, can operate in a user mode to interact with a user, and can have a visual user interface.
At present, an application developer can upload a developed application to an application store, and a user who needs to use the APP can download the application from the application store and store the downloaded application to a local terminal device (such as a mobile phone, a tablet computer, a smart television, and the like). And then, the user can install the APP through the local terminal equipment and operate the APP.
However, in the current technical scheme, the APP can be operated only after the local terminal device needs to be downloaded and installed, and the process of operating the APP is complicated. And, after the application is not used (i.e., stopped running) by the local terminal, the application may be uninstalled to save storage resources of the local terminal device. That is, in the current technical solution, the completion flow of operating the application program includes: copying an application (downloading an application), transferring an application (installing an application), starting an application, stopping an application, and uninstalling an application, the process of operating an application program is cumbersome. In the case of unused application programs, if the application is not uninstalled, storage resources are also occupied. In addition, in the current technical scheme, when the application program is updated, the uninstalling and installing operation needs to be executed again, and the process is complicated. In addition, the currently downloaded files are executable program files, and the data size of the files is large, which affects the transmission speed.
Based on this, an application management method is provided in an embodiment of the present application, where the method may be applied to an operation and maintenance system (for example, a deployment module in the operation and maintenance system), and the deployment module in the operation and maintenance system obtains first target data, where the first target data includes application data of a first application. And then, the deployment module transmits the first target data to the target computing node and controls the first application to enter a starting state from a stopping state. And receiving a stopping instruction for stopping the first application, controlling the first application to enter a stopping state from an operating state, and recovering the computer resources of the target computing node allocated to the first application. Therefore, the local terminal does not need to download and install the application, the first application can be controlled and started through the deployment module, and the process of starting the application program is simplified. And, without using the first application, the deployment module may control the first application to stop running and reclaim the computing resources allocated for the first application. Therefore, the utilization rate of resources can be improved, the user does not need to uninstall the application program, and the process when the application program is not used is simplified. In addition, when the application program is updated, the technical scheme can still be adopted so as to simplify the process of using the application program.
It should be noted that, in an industry-related scenario, an industry internet platform may be constructed based on hardware devices such as a server and a computer, and the industry internet platform may include: an operation and maintenance system (such as a deployment module of the operation and maintenance system), an application warehouse (such as a storage module in the application warehouse), and an operation system. The application developer can upload the developed application to the industrial internet platform, and the user needing to use the application can download the application from the industrial internet platform.
For example, the method may be specifically implemented on a hardware device corresponding to an operation and maintenance system (e.g., a deployment module of the operation and maintenance system), for example: the hardware devices may include servers, computers, and the like. The server may be a single server, or may be a server cluster formed by a plurality of servers. In some embodiments, the server cluster may also be a distributed cluster. The application is not limited to the specific implementation manner of the hardware devices corresponding to the application warehouse and the application store.
It should be noted that, in the embodiment of the present application, the implementation step at the operation and maintenance system (for example, the deployment module of the operation and maintenance system) side may be implemented by a hardware device corresponding to the deployment module of the operation and maintenance system. The storage module side implementation steps in the application repository related in the embodiment of the present application may be implemented by hardware devices corresponding to the storage modules in the application repository. The implementation steps at the side of the operating system related in the embodiment of the present application may be implemented by hardware devices corresponding to the operating system. The deployment module of the operation and maintenance system, the storage module in the application warehouse and the operation system can be deployed on the same hardware device. Alternatively, the deployment module of the operation and maintenance system, the storage module in the application repository, and the running system may be deployed on different hardware devices.
The application management method provided by the embodiment of the present application is described below by taking a deployment module and an application repository as examples.
In the embodiment of the present application, the method for managing an application may be divided into three stages, where the three stages include: stage one, stage two and stage three. In the first stage, an application is developed, and a developed application (which may be referred to as a finished application) is generated. And the second stage is starting the finished product application. And the third stage is stopping the application of the finished product.
In some embodiments, the first application (i.e., the product application) may implement only the program logic of the functional function of the first application itself.
In an embodiment of the present application, the process of developing the first application may be as follows:
1) An APP model (i.e., application model) of the first application is created and a unique identifier (e.g., globally unique identifier) is assigned to the APP model of the first application. For example, a developer of a first application may create an APP model of the first application in a development studio.
2) Defining a data model on which the APP model of the first application depends, and issuing data predefinitions of the data model on which the APP model of the first application depends (data predefinitions of the first application for short).
It should be noted that, in the present application, a model and a predefined concept are mentioned, where the model is information describing a structure of an object when an abstraction is modeled, and the predefined concept is information determining the model of the structure and configuring parameters. The information of the model is recorded in the predefining, the predefining is used for instantiating the object, the instantiating object is used for constructing the structure of the object according to the structure of the model, and the parameter value is used as the initial value of the object. Predefinitions can also be referred to by other models as child predefinitions.
For example, when creating a data model, operations may include: building a model, and distributing names and identifications; adding members and specifying member types; deleting the member; add or delete child predefinitions; setting a predefined initial value; updating the model version; publishing a model version generation predefined, etc. When creating the predefined, the operations may include: specifying a model version release (creation) predefinition; assigning a name and an identification; set predefined parameter values (values for attributes and members), and so on.
Fig. 1 is a schematic diagram of a model and a predefined relationship provided in an embodiment of the present application.
As shown in FIG. 1, a model may include basic attributes and a list of members; the basic attribute may include information such as name, description, globally Unique Identifier (GUID), version, and the like; the member list may include: "Member 1: name + type "," member 2: name + type "," member 3: name + type ", etc.
The predefinitions may include basic attributes and a list of members; the basic attributes may include information such as name, description, GUID, model GUID + version, etc.; the member list may include: "member 1+ value", "member 2+ value", "member 3+ value", and the like.
The data model in the step 2) is a concept in the database, describes the structure of a data object in the database, and is abstract description of an objective world object.
Exemplarily, fig. 2A is a schematic diagram of a data model provided in an embodiment of the present application. As shown in fig. 2A, the data model may include: basic attributes, a member list, and a sub-model list. The data model with sub-models is a composite data model, such as: in the figure, a data model A is a composite data model, and a data model B and a data model C are submodels of the data model A.
In the data model, basic attributes describe inherent attributes of data, including name, description, GUID, temporal attributes (such as precision), spatial attributes (such as coordinate system and geometric shape), and the like; the member list describes freely defined fields, and each member describes the field name and the data type of the member, such as: member 1, member 2, etc. The sub-model list records predefined identifications of data of the data model referred to as the sub-model, and establishes a dependency relationship between the sub-model and the data model, for example, the sub-model list of the data model a includes predefined identifications of data model B and data model C, such as: "name B1+ reference model ID + parameter value", "name B2+ reference model ID + parameter value", "name C3+ reference model ID + parameter value", and the like.
For example, the motor devices all have parameters such as rotation speed, temperature, current and the like, a data model of the motor devices is established, the data model of the motor devices may include members of the rotation speed, the temperature and the current, and the like motors may be uniformly described through the data model of the motor devices.
For another example, assuming that a fixed plate production line, a static plate production line and an assembly production line are all arranged in the compressor workshop, a data model of the compressor workshop is established, and the data model of the compressor workshop can internally comprise sub models: a fixed disc production line, a static disc production line, a final assembly production line and the like. The data model of the compressor plant may describe a compressor plant model of the same type.
3) Defining the resource object (resource object of the first application) depended by the APP model of the first application to a resource library, and allocating a unique identifier (such as a global unique identifier) to the resource object of the first application.
Wherein a resource object is a concept in a database. The binary file data are organized and managed in an objectification mode, an identification is distributed to each resource object, and the APP model of the first application can access the data of the resource objects through the identification of the resource objects.
For example, an icon is defined as a dependency between a resource object and an APP model of a first application, and the APP model of the first application may use this icon. For another example, the video file is defined as a dependency relationship between the resource object and the APP model of the first application, and then the APP model of the first application can read the video file through the dependency relationship and play the video file.
4) Establishing a predefined list of dependent data of the first application on an APP model of the first application, selecting a predefined list of data of the first application from a system warehouse of the first application, and recording an identification of the predefined list of dependent data of the first application. The data predefinition in the system warehouse of the first application can be built by a developer or purchased from an application store.
5) Establishing a dependent resource list of the first application on the APP model of the first application, selecting a resource object of the first application from the resource library, and recording the identification of the resource object of the first application on the dependent resource list of the first application. The resource objects in the resource library can be built by developers or purchased from application stores.
6) Program logic to write a functional function of the APP model of the first application.
7) And generating a predefined APP model of the first application (referred to as the predefined APP model of the first application for short, and may also be referred to as configuration information of the first application) according to the APP model of the first application, and assigning a unique identifier (such as a globally unique identifier) to the predefined APP model of the first application. The predefined identity of the first application is the identity of the first application.
Wherein, when the predefinition of the first application is released, the predefined parameter values (such as the value of the attribute and the value of the member) can be set.
In other embodiments, a first application (i.e., a product application) may implement program logic for the functional functions of multiple applications, i.e., the first application may call other applications to implement the functions of other applications. The process of developing the first application is described below by taking an example in which the plurality of applications include a first application and a first sub-application (also referred to as a second application), that is, the first application can call the first sub-application to implement the function of the first sub-application.
In an embodiment of the present application, the process of developing the first application may be as follows:
a) The above-mentioned step 1) -step 5) is performed.
b) Adding a sub-APP list of the APP model of the first application, selecting a predefined of the first sub-application as a sub-APP from a system repository of the first application, and recording a predefined identification of the first sub-application on the sub-APP list of the APP model of the first application. The predefined of the first sub-application is the first sub-application obtained from the application store. The predefined identification of the first sub-application is the identification of the first sub-application as described in the previous embodiments.
Wherein, predefined parameter values (such as attribute values and member values) can be set when the predefinition of the first application is issued.
Exemplarily, fig. 2B is a schematic composition diagram of an APP model of a first application provided in an embodiment of the present application.
As shown in fig. 2B, the APP model of the first application may include: basic properties, a list of dependent data, a list of functional functions, and a list of sub-APPs.
The basic attributes may include: name, description, and GUID (i.e., a unique identification of the APP model of the first application).
The dependency data list records data models or resource objects required to be used by the APP model of the first application, and a relationship is established between the APP model of the first application and the dependent data models or resource objects. For example, "data 1: data ID "," data 2: data ID "or the like represents a predefined identification of data or an identification of a resource object of the data model that is relied upon. The list of dependent data may include the predefined list of dependent data and/or the list of dependent resources.
The list of function functions may include: function 1, function 2, etc. of the APP model of the first application, which are implementations of program logic of the APP model of the first application.
The sub APP list records information of the first sub application, and an association relationship is established between the APP model of the first application and the first sub application. For example, the sub APP list may include the identity and configuration parameters of the first sub application, such as sub APP-B1, APP-C2, APP-D3, and so on. That is, the APP models B, C, D, and the like may be the first sub-applications described above.
c) The above-mentioned step 6) -step 7) is performed.
After the first application is developed, the process of stage two and stage three, i.e., the deployment module starting the first application and stopping the first application, is described below.
Fig. 3 is a flowchart illustrating an application management method according to an embodiment of the present application. As shown in fig. 3, the application management method may include:
301. the deployment module obtains first target data.
Wherein the first target data comprises application data of the first application.
In an embodiment of the present application, the application data includes: any combination of structure information of the application, function of the application, data parameter of the application and resource demand information of the application.
Illustratively, the application data may include structural information of the application and functional functions of the application. Alternatively, or additionally, the application data may include: structural information of the application, functional functions of the application, and data parameters of the application. Alternatively, the application data may include: the application information comprises application structure information, application function, application data parameters and application resource demand information.
Wherein the structure information is used for reflecting the incidence relation between the applications.
For example, the application a and the application B have an association relationship, and the application B is a sub-application of the application a, that is, the application a may call the application B to implement the function of the application B. The application A and the application C have an incidence relation, and the application C is a parent application of the application, namely the application C can call the application A to realize the function of the application A.
Alternatively, the structure information of the application may include a sub-application list of the application.
The present embodiment does not limit the expression form of the structural information. For example, the structure information may be represented by a tree structure.
In the embodiment of the present application, the function of the application is used to implement the function of the application.
The functional functions are not limited in the embodiments of the present application. For example, the function may include: a function (code) for starting an application, a function code for stopping running an application, a function code implementing call logic, a function code for asynchronous callback, a function code for timed callback, etc.
It should be noted that the data parameters of the application may include: configuration information of an application (which may also be referred to as application engineering), data information of an application (which may also be referred to as data engineering), an APP model of an application, a data model of an application, data predefinitions of an application, data objects of an application, and so forth.
The resource requirement information of the application is used for indicating a computing node running the application and resources required by the application during running. The resource requirement information of the application comprises: address information of the target computing node, memory requirement information, and Central Processing Unit (CPU) requirement information. The target computing node is a computing node running a first application.
Illustratively, the resource requirement information of the application a includes: internet Protocol (IP) address (e.g. 111.111.000.100), memory requirement information of 10 megabytes, and CPU requirement information of 500 megabytes (or 4 cores). That is, the application a runs on a computing node (e.g., computing node a) with an IP address of 111.111.000.100, and needs to occupy 10 megabits of the memory of the computing node a and 500 megabits of the CPU of the computing node a.
It should be noted that the resource requirement information is not limited in the embodiments of the present application. For example, the resource requirement information may also include video memory.
It should be noted that, in the embodiment of the present application, the application data may include data (such as a model, a predefined model, a data model, an APP model, and the like) shown in fig. 1, fig. 2A, and fig. 2B.
It is understood that the application data includes: the application structure information, the application function, the application data parameters and the application resource requirement information. The structure information is used for reflecting the incidence relation between the applications; the resource demand information includes: address information of the target computing node, memory requirement information and CPU requirement information. Therefore, the deployment module can acquire relevant parameters of the application through the application data, and the application function is realized by combining the functional function of the application and the incidence relation between the applications. In addition, the application is deployed at the appropriate computing node by combining the resource demand information of the application, so that the computing node for deploying the application can run the application, and the running stability of the application is improved.
It should be noted that, in some embodiments, the first target data may be machine code. The deployment module may generate the first target data from the application data.
Fig. 4 is a flowchart illustrating an application management method according to an embodiment of the present application. As shown in fig. 4, in the application management method, 301 may include:
401. the deployment module obtains first application data.
The first application data is application data of a first application.
In an embodiment of the present application, the application data of the first application may be data codes expressed by a programming language.
It should be noted that the embodiment of the present application does not limit the programming language. For example, the programming Language may be a database Language, such as Structured Query Language (SQL). As another example, the programming language may be the computer programming language Java language. As another example, the programming language may be the computer programming language Java.
Illustratively, the first application data may include: data expressed by a database language (such as structure information, data parameters and resource requirement information), and code expressed by a computer programming language Python language (such as a function).
In one possible implementation, an application repository (or may be referred to as a storage module) stores a plurality of application data therein. The deployment module may obtain the first application data from the application repository based on the identification of the first application.
402. The deployment module determines a target compute node.
In a possible implementation manner, the deployment module may determine the target computing node according to address information of the target computing node in the resource demand information of the first application. And the target computing node is a computing node corresponding to the address information in the resource demand information.
Illustratively, if the IP address in the address information of the resource demand information is 111.111.000.100, the target computing node is a computing node with an IP address of 111.111.000.100.
In another possible implementation manner, the deployment module may determine the target computing node according to a resource requirement in the resource requirement information of the first application. Wherein the resource requirement is indicative of a computing resource required by the application. Specifically, the deployment module may obtain resource information of a plurality of computing nodes. The deployment module may then compare the resource requirements of the first application to the resource information of the plurality of compute nodes. Then, the deployment module takes a computing node of the plurality of computing nodes that meets the resource requirement of the first application as a target computing node.
Illustratively, suppose the plurality of computing nodes includes: the system comprises a computing node A (CPU 4 core, memory 8000 Mm) and a computing node B (CPU 8 core, memory 10000 Mm). If the resource requirement of the application a is 9000 million of the CPU6 core and the memory, the deployment module uses the computing node B as a target computing node of the application a.
403. The deployment module compiles the first application data according to the node information of the target computing node to generate first target data.
Wherein the first target data matches the target computing node.
It should be noted that matching the first target data with the target computing node means that the target computing node can identify and execute the first target data.
In one possible implementation manner, the deployment module stores a correspondence (which may be referred to as a first correspondence) between the node information and the code type. The deployment module may determine a target code type according to the node information of the target computing node and the first corresponding relationship, where the target code type is a machine code type that can be identified by the target computing node. Then, the deployment module may compile the first application data according to the object code type to generate first object data, where the first object data is a machine code of the object code type.
It should be noted that, in the embodiment of the present application, node information of a computing node is not limited. For example, the node information of the computing node may include: CPU manufacturer, CPU model, memory model, operating system type, etc.
Illustratively, as shown in table 1, it shows the correspondence between node information and code types.
TABLE 1
CPU manufacturers CPU model Operating system type Code type
Manufacturer A Type A System type A Code type A
Manufacturer B Type B System type B Code type B
Manufacturer C Type C System type C Code type C
That is, in the case that the CPU manufacturer of the compute node is manufacturer a, the CPU model is model a, and the operating system type is system type a, the code type of the machine code that can be identified by the compute node is code type a. Under the condition that the CPU manufacturer of the computing node is manufacturer B, the CPU model is type B, and the operating system type is system type B, the code type of the machine code which can be identified by the computing node is code type B. Under the condition that the CPU manufacturer of the computing node is manufacturer C, the CPU model is type C, and the operating system type is system type C, the code type of the machine code which can be identified by the computing node is code type C.
For example, in conjunction with table 1, if the CPU manufacturer of the target computing node is manufacturer a, the CPU model is model a, and the operating system type is system type a, the deployment module may compile the first application data into machine code of code type a (i.e., the first target data).
In another possible implementation manner, the deployment module performs adaptation according to node information of the target computing node to determine the target code type. Then, the deployment module may compile the first application data according to the object code type to generate first object data, where the first object data is a machine code of the object code type.
Optionally, the node information of the computing node may further include: the object code type.
It is to be appreciated that the deployment module obtains first application data, the first application data being application data of a first application. Then, the deployment module may determine a target computing node, and compile the first application data according to node information of the target computing node to generate first target data, where the first target data is matched with the target computing node. That is, the deployment module may compile the first target data that matches the target compute node according to the node information of the target compute node. Therefore, the first target data can be guaranteed to run at any computing node, and the adaptability of the first target data to other computing nodes is improved.
302. The deployment module transmits the first target data to the target computing node and controls the first application to enter a starting state from a stopping state.
In one possible implementation manner, the deployment module sends a first start request to the target computing node, where the first start request is used to instruct to start the first application, and the first start request includes the first target data. Thereafter, the target computing node may receive a first launch request from the deployment module and execute the first target data to cause the first application to enter a launch state from a stop state.
It should be noted that, in the embodiment of the present application, the running of the target data (i.e., compiled application data, that is, machine code) by the target computing node refers to running (or starting) an application program corresponding to the target data, and generating an instance (i.e., a running object) of the application program corresponding to the target data.
It should be noted that the runtime objects include: object attributes (e.g., application identification, model identification, version information, parent identification, etc.), structure information of the object, data parameters of the object, and container attributes of the object.
In one possible design, the target compute node includes a first container for running the application. The deployment module may control the target computing node to allocate a first resource to the first container, so that the first container runs the first target data through the first resource, and the first resource is a computer resource corresponding to the resource demand information of the first application.
It should be noted that the first resource may be resource requirement information in the first application data.
Illustratively, suppose the first resource is: the memory requirement information is 10 million, the CPU requirement information is 500 million (or 4 cores), and the display memory is 400 million. The target compute node may allocate 10 megabits of memory, 500 megabits of CPU, 400 megabits of memory for the first container and copy the first target data to the first container, so that the runtime engine in the first container runs the first target data through 10 megabits of memory, 500 megabits of CPU, 400 megabits of memory, generating an instance (i.e., a runtime object) of the first application.
It should be noted that the runtime engine has basic capabilities of the application (e.g., download capability, scheduling capability, etc.). Thus, compared with the executable application program file downloaded in the current technical scheme, the application data in the technical scheme of the application does not include relevant data of basic capability. Therefore, the data volume of the application data can be reduced, and the transmission speed can be improved.
In some embodiments, the application data may also include run mode information. The operation mode information includes first mode information or second mode information. The first mode information is used to indicate that the application is operated in an exclusive mode. The second mode information is used to indicate that the application is running in the sharing mode.
It should be noted that, in the embodiment of the present application, running an application in an exclusive mode means that the application runs in a process form and needs to occupy a container in which target data is not run. Running an application in shared mode means that the application runs in thread form and can share a container with the application's parent application. The shared mode running application comprises a serial running application and a parallel running application. The serial running of the application means that a plurality of applications share one thread, and the parallel running of the application means that a plurality of applications use different threads.
In a possible implementation manner, before controlling to allocate computer resources corresponding to the resource requirement information of the first application to the first container so that the first container runs the first target data through the first resource, the deployment module may determine, according to the running mode information in the first application data, whether to create a container for the first application. And if the operation mode information is the first mode information, the deployment module controls the target computing node to create a first container.
It can be appreciated that if the first application runs the application in the exclusive mode, the deployment module needs to create a first container for the first application and allocate resources required by the first application to the first container. Therefore, the first container can run the first target data through the resource to achieve the effect of starting the first application.
In other embodiments, the target compute node includes a second container. And if the operation mode information is second mode information, the deployment module determines a second container according to the structural information of the first application. The second container is a container of the first parent application, the first parent application can call the first application to realize the function of the first application, and the structural information of the first application comprises an association relation between the first application and the first parent application.
In one possible implementation, the deployment module stores a correspondence between the application and the container. The deployment module may determine the first parent application based on the structural information of the first application. Thereafter, the deployment module can determine a second container from the first parent application. And then, the deployment module runs the first target data by using a second resource allocated to the second container, wherein the second resource is a computer resource corresponding to the resource demand information of the first parent application.
In the embodiments of the present application, the correspondence between the application and the container is not limited. For example, the correspondence between the application and the container may be a correspondence between an application identification and a container identification.
Illustratively, it is assumed that the structure information of the first application includes: the first parent application is application a, the container of application a is container a, and the container a has been allocated the second resource to run application a when the target compute node runs application a. If the operation mode information of the first application is the second mode information, it may be determined that the container a is a container in which the first application is operated. Thereafter, the deployment module may transmit the first target data to container a and execute the first target data by container a using the second resource.
It is to be understood that in the case where the operation mode information is the second mode information, it is explained that the first application and the first parent application may share one container. The deployment module may determine the second container based on the structural information of the first application. Since the deployment module has controlled the allocation of the second resource running the first parent application to the second container when the second container is created. The deployment module may run the first target data using the second resource allocated for the second container. Therefore, the second container can run the first target data through the resource to achieve the effect of starting the first application.
303. The deployment module receives the first stop instruction, controls the first application to enter a stop state from an operating state, and recovers the computer resources of the target computing node allocated to the first application.
The first stop instruction is a stop instruction for stopping the first application.
It should be noted that, the source of the first stop instruction is not limited in the embodiments of the present application. For example, the target computing node may send a first stop instruction to the deployment module. For another example, the first application may send a first stop instruction to the deployment module. For another example, the other computing node may send a first stop instruction to the deployment module.
In one possible implementation, the first stop instruction includes an identification of the first application. The deployment module may send a first stop request to the target computing node according to the identifier of the first application, where the first stop request is used to instruct to control the first application to enter a stop state from an operating state, and to recover the computer resource of the target computing node allocated to the first application. Thereafter, the target computing node may receive the first stop request, control the first application to enter a stop state from the run state, and reclaim the computer resources of the target computing node allocated for the first application.
It is to be appreciated that the deployment module obtains first target data that includes application data of the first application. And then, the deployment module transmits the first target data to the target computing node and controls the first application to enter a starting state from a stopping state. Therefore, the local terminal does not need to download and install the application, the first application can be controlled and started through the deployment module, and the process of starting the application program is simplified. The deployment module may then receive a stop instruction for stopping the first application, control the first application to enter a stopped state from the running state, and reclaim computer resources of the target compute node allocated for the first application. In this way, the deployment module may control the first application to cease operation and reclaim the computing resources allocated for the first application without using the first application. Therefore, the utilization rate of resources can be improved, the user does not need to uninstall the application program, and the process when the application program is not used is simplified.
In some embodiments, the structural information of the first application may further include an association relationship between the first application and a first sub-application, and the first application may be capable of calling the first sub-application to implement a function of the first sub-application. The deployment module may listen for structural information of the first application.
In one possible implementation, the deployment module may send a structure query message to the target computing node, the structure query message being used to query the structure information of the first application. Thereafter, the target computing node, in response to the structure query message, sends a structure response message to the deployment module, the structure response message including structure information of the first application.
Illustratively, at time a, the structure information of the first application (e.g., application a) includes: the application A-application B and the application A-application C, namely the sub-applications of the application A comprise the application B and the application C. At time B, the configuration information of application a includes: application A-application B, application A-application C, and application A-application D, i.e., the sub-applications of application A include application B, application C, and application D. That is, application a at time B has one more sub-application (i.e., application D) added to it as compared to application a at time a. Optionally, the structure information of the application a may further include: application E-application A, application E is the parent application of application A.
In another possible implementation, the target computing node may periodically send a fabric response message to the deployment module.
Illustratively, the target computing node may send the configuration information of application a to the deployment module every 1 minute. For example, a list of sub-applications of application a.
It is to be understood that the structural information of the first application includes an association relationship between the first application and the first sub-application, and the deployment module may listen to the structural information of the first application. In this manner, the deployment module can learn about changes to the associated application of the first application.
Optionally, the deployment module may query structural information of the target application.
Illustratively, the deployment module may query the target application for its sub-applications (list) by its ID.
In some embodiments, the deployment module may listen to a state of the first sub-application, the state of the first sub-application including a run state and a stop state.
Illustratively, the first sub-application of the first application includes: application A, application B and application C. Wherein, the application A and the application B are in a running state, and the application C is in a stopping state.
In one possible implementation, the deployment module may send a status query message to the target computing node, the status query message being used to query the status of the first sub-application. Thereafter, the target computing node, in response to the status query message, sends a status response message to the deployment module, the status response message including the status of the first sub-application.
It can be appreciated that monitoring the state of the first sub-application by the deployment module can ensure that the state of the sub-application associated with the first application is known.
In some embodiments, after the deployment module receives the stop instruction to stop the first application, the deployment module may determine whether the first sub-applications in the first application are all in a stopped state.
In an embodiment of the application, the first sub-application comprises at least one application. The deploying module receives a stopping instruction for stopping the first application, controls the first application to enter a stopping state from an operating state, and recovers the computer resources allocated to the first application by the target computing node, and may include: and if the states of the applications in the first sub-application are all the stop states, the deployment module controls the first application to enter the stop state from the running state, and recovers the computer resources distributed to the first application by the target computing node.
Illustratively, suppose that the first sub-application comprises: application A, application B and application C. And if the states of the application A, the application B and the application C are all in a stop state, controlling the first application to enter the stop state from the running state, and recovering the computer resources distributed to the first application by the target computing node.
It is to be appreciated that the first application can invoke the first sub-application to implement the functionality of the first sub-application. When the states of the first sub-application are all the stop states, the first application does not call the first sub-application, and the first application is not used. The deployment module may then control the first application to enter a stopped state from the running state and reclaim computer resources allocated by the target compute node for the first application. Therefore, the deployment module can control the first application in combination with the state of the first sub-application, so that the first application is prevented from being stopped running when other applications are called, and the accuracy of stopping the running of the application is improved.
In some embodiments, if there is an application in the first sub-application whose state is the running state, the stop instruction for stopping the first application is rejected.
Illustratively, suppose that the first sub-application comprises: application A, application B and application C. If the states of the application A and the application B are the stop state and the state of the application C is the running state, the deployment module rejects the stop instruction for stopping the first application, namely, does not stop running the first application and does not recycle the computer resource allocated to the first application.
It is understood that in the case that there is an application in the first sub-application in the running state, it is indicated that the first application is still calling the first sub-application, and the first application is being used. The deployment module may reject the stop instruction to stop the first application. Therefore, the first application can be prevented from being stopped running when other applications are called, and the accuracy of stopping running of the applications is improved.
It should be noted that, in the embodiment of the present application, the first sub-application may be started after the first application is started.
In some embodiments, the deployment module may receive a launch instruction for launching the first sub-application. The deployment module may then obtain the application data of the first sub-application and compile the application data of the first sub-application into second target data. Then, the deployment module may transmit the second target data to the target computing node, and control to allocate a third resource to the third container, so that the third container runs the second target data through the third resource, where the third resource is a computer resource corresponding to the resource demand information of the first sub-application. Then, the deployment module may receive a stop instruction for stopping the first sub-application, control the first sub-application to enter a stop state from the running state, and reclaim the third resource.
Illustratively, suppose a first application needs to invoke a first sub-application. The first application may then send a launch instruction to launch the first sub-application to the deployment module. And after the first application calls the first sub-application, the first application may send a stop instruction for stopping the first sub-application to the deployment module.
It should be noted that, specifically for the process of starting and stopping the first sub-application by the deployment module, reference may be made to the process of starting and stopping the first application by the deployment module, which is not described herein again.
It is to be appreciated that the deployment module receives a launch instruction for launching the first sub-application. The deployment module may then obtain the application data of the first sub-application and compile the application data of the first sub-application into second target data. The deployment module may then transmit the second target data to the target compute node, controlling allocation of a third resource to the third container, such that the third container runs the second target data over the third resource. Then, the deployment module receives a stop instruction for stopping the first sub-application, controls the first sub-application to enter a stop state from an operating state, and recovers the third resource. Therefore, the local terminal does not need to download and install the application, the first sub-application can be controlled and started through the deployment module, and the process of starting the application program is simplified. And under the condition that the first sub-application is not used, the deployment module can control the first sub-application to stop running and recycle the third resource. Therefore, the utilization rate of resources can be improved, the user does not need to uninstall the application program, and the process when the application program is not used is simplified.
It should be noted that the state of the child application may affect the stop and operation of the parent application. If the user cannot know the state of the application in time, an erroneous operation may be performed on the application.
Fig. 5 is a flowchart illustrating an application management method according to an embodiment of the present application. As shown in fig. 5, the application management method may include:
501. the deployment module sends a first query message to a target compute node.
The first query message is used for querying the application in the running state.
In the embodiment of the present application, the target computing node refers to a node or an environmental system that runs an application, and the target computing node may also be referred to as a running system.
Accordingly, the target computing node receives a first query message from the deployment module.
502. The target computing node queries the application in a running state.
In one possible implementation, the target computing node stores therein a correspondence between the application and the application state. The target computing node may query the application in the running state according to the correspondence between the application and the application state and the running state.
503. The target computing node sends a first response message to the deployment module.
Wherein the first response message comprises an identification of the application in the running state.
504. The deployment module receives a first response message from the target computing node.
It will be appreciated that after the deployment module sends the first query message to the target computing node, the deployment module may receive a first response message from the target computing node, the first response message including an identification of the application in the running state. In this way, the deployment module can learn about the application in the running state, and avoid stopping the application in the running state.
In some embodiments, the deployment module may query the state of the target application based on the identification of the target application. The deployment module may send a second query message to the target computing node, the second query message for a state of the target application, the second query message including an identification of the target application. The target computing node may then determine the state of the target application based on the identity of the target application. The target computing node may then send a second response message to the deployment module, the second response message including the state of the target application.
Optionally, the query message may also query the state of the application having the association relationship. For example, the deployment module may query the status of the child application based on the parent application ID and the child application name.
Optionally, the query message may include target computing node address information. The query message is used to query the state of the application deployed in the target compute node.
Fig. 6 is a flowchart illustrating an application management method according to an embodiment of the present application. As shown in fig. 6, the application management method may include:
601. the deployment module sends a first subscription message to the target computing node.
The first subscription message is used for subscribing the application with the changed state.
The state change includes: from the operating state to the stopped state and from the stopped state to the operating state.
602. The target computing node receives a first subscription message from the deployment module.
603. The target computing node detects whether the state of the application is changed.
In one possible implementation, the target computing node may periodically detect the state of the application according to the application identifier.
Optionally, the target computing node may listen to the state of the application.
In some embodiments, if the state of the application changes, the target computing node executes 604.
604. And the target computing node generates state change information to the deployment module.
Wherein the state change information is used for indicating that the state of the application is changed.
Illustratively, the state change information is: the application a changes from the running state to the stopped state, and the application B changes from the stopped state to the running state.
Accordingly, in the event that the state of the application changes, the deployment module may receive state change information from the target computing node.
Optionally, the subscription message may include an identifier of the target application, and the subscription message is used to subscribe to a state of the target application. That is, the target computing node may send the state of the target application to the deployment module in the event that the state of the target application changes.
Optionally, the subscription message may also subscribe to the state of the application having the association relationship. For example, the deployment module may subscribe to the state of the child application based on the parent application ID and the child application name.
Optionally, the subscription message may include target computing node address information. The subscription message is used to subscribe to the state of an application deployed in the target computing node.
It is to be appreciated that the deployment module sends the first subscription message to the target computing node. Thereafter, in the event that the state of the application changes, the deployment module may receive state change information from the target computing node, the state change information indicating that the state of the application changed. In this way, the deployment module can learn the state of the application in real time.
In some embodiments, the deployment module may query the application and the state of the application based on the target compute node.
For example, the deployment module may query applications (such as application a, application B, and application C) deployed in the computing node addressed to address a, where the state of application a is a running state, and the states of application B and application C are stopped states.
The application management method of the present application is described below with reference to specific examples. As shown in fig. 7, the application management system includes a storage module (i.e., an application repository), a deployment module, and a run system (i.e., a target compute node). The application warehouse stores an application A, an application B, an application C, an application D, an application E, an application F and an application G. The application B, the application D and the application G are all sub-applications of the application a, that is, the application a can call the application B, the application D and the application G to realize corresponding application functions. Application C is a sub-application of application B. Application E is a sub-application of application D, and application F is a sub-application to which E is not applied.
The operation modes of the application a, the application B, the application C, the application D, and the application G are exclusive modes, and the operation modes of the application E and the application F are shared modes.
When the application a is started, the deployment module may obtain target data of the application a from the storage module. Then, the deployment module determines that the operation mode of the application a is the exclusive mode, controls the operation system to create the operation container 1, allocates resources for the operation container 1, and sends the target data of the application a to the operation system, so that the operation container a operates the target data of the application a. Thereafter, when application a in the run container 1 (referred to as run application a for short) needs to call application B, the run application a may send a request to the deployment module to run application B. After that, the deployment module acquires the target data of the application B from the storage module. And the deployment module determines that the running mode of the application B is an exclusive mode, controls the running system to create a running container 2, allocates resources for the running container 2, and sends target data of the application B to the running system. When the running application B needs to call the application C, the deployment module may start the application C according to the target data of the application C.
It should be noted that, for the processes of starting the application D, the application E, the application F, and the application G, reference may be made to the description of the starting applications a to C, which is not described herein again. Since the running modes of the application E and the application F are both the sharing mode, the application E and the application F can be started in the running container of the application D (i.e., the parent application).
When stopping running the application a, the deployment module may detect whether the states of the application B, the application D, and the application G are in a stopped state. When detecting whether the states of the application B and the application D are in the stop state, the deployment module may detect whether the states of the sub-applications of the application B and the application D are in the stop state. For example, where the state of application C is a stopped state, the deployment module may determine that the state of application B is a stopped state. When the state of the application E is a stop state, the state of the application F is an operating state, and the deployment module may determine that the state of the application D is an operating state. Therefore, when the states of the application C, the application E, the application F, and the application G are all the stop states, the deployment module may stop running the application a, change the state of the application a to the stop state, and recycle the running resources of the running container 1.
It is understood that, in practical implementation, the application store, the application repository, the local terminal, and the like according to the embodiments of the present application may include one or more hardware structures and/or software modules for implementing the corresponding application management method, and these executing hardware structures and/or software modules may constitute an electronic device. Those of skill in the art will readily appreciate that the present application is capable of hardware or a combination of hardware and computer software implementing the exemplary algorithm steps described in connection with the embodiments disclosed herein. Whether a function is performed as hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present application.
Based on such understanding, taking a hardware structure and/or a software module included in an application store as an example, the embodiment of the present application also correspondingly provides an application management apparatus, which can be applied to the deployment module (e.g., a hardware device corresponding to the application store). Fig. 8 is a schematic structural diagram of an application management apparatus according to an embodiment of the present application. As shown in fig. 8, the application management apparatus may include: an acquisition unit 801, a processing unit 802, and a transmission unit 803.
An obtaining unit 801 is configured to obtain first target data, where the first target data includes application data of a first application. The processing unit 802 is configured to transmit the first target data to the target computing node, and control the first application to enter a start state from a stop state. The obtaining unit 801 is further configured to receive a stop instruction for stopping the first application. The processing unit 802 is further configured to control the first application to enter a stop state from the running state, and to reclaim the computer resources of the target computing node allocated to the first application.
In some implementations, the application data includes: any combination of structure information of the application, function of the application, data parameter of the application and resource demand information of the application. The structure information is used for reflecting the incidence relation between the applications; the resource demand information includes: address information of the target computing node, memory requirement information and Central Processing Unit (CPU) requirement information.
In some implementations, the obtaining unit 801 is further configured to obtain first application data, where the first application data is application data of a first application. The processing unit 802 is further configured to determine a target computing node. The processing unit 802 is further configured to compile first application data according to the node information of the target computing node, and generate first target data, where the first target data matches the target computing node.
In some implementations, the processing unit 802 is further configured to control allocation of a first resource to the first container, so that the first container runs the first target data through the first resource, where the first resource is a computer resource corresponding to the resource requirement information of the first application.
In some implementations, the application data also includes run mode information. The processing unit 802 is further configured to control creation of the first container if the operation mode information is first mode information, where the first mode information is used to instruct that the application is operated in an exclusive mode.
In some implementations, the target compute node includes a second container. If the operation mode information is second mode information, determining a second container according to the structural information of the first application, wherein the second container is a container of a first father application, the first father application can call the first application to realize the function of the first application, and the structural information of the first application comprises an incidence relation between the first application and the first father application; the second mode information is used to indicate that the application is running in the shared mode. And running the first target data by utilizing a second resource allocated to the second container, wherein the second resource is a computer resource corresponding to the resource demand information of the first parent application.
In some implementations, the structural information of the first application includes an association between the first application and a first sub-application, and the first application can call the first sub-application to implement a function of the first sub-application. The processing unit 802 is further configured to listen to structure information of the first application.
In some implementations, the processing unit 802 is further configured to monitor a state of the first sub-application, where the state of the first sub-application includes a running state and a stopped state.
In some implementations, the first sub-application includes at least one application. The processing unit 802 is further configured to, if the states of the applications in the first sub-application are all stopped states, control the first application to enter the stopped state from the running state, and recycle the computer resource allocated to the first application by the target computing node.
In some implementations, the processing unit 802 is further configured to reject the stop instruction for stopping the first application if there is an application in the first sub-application, where the application is in a running state.
In some implementations, the obtaining unit 801 is further configured to receive a start instruction for starting the first sub-application. The obtaining unit 801 is further configured to obtain application data of the first sub-application, and compile the application data of the first sub-application into second target data. The processing unit 802 is further configured to transmit the second target data to the target computing node, and control to allocate a third resource to the third container, so that the third container runs the second target data through the third resource, where the third resource is a computer resource corresponding to the resource requirement information of the first sub-application. The obtaining unit 801 is further configured to receive a stop instruction for stopping the first sub-application. The processing unit 802 is further configured to control the first sub-application to enter a stop state from the running state, and recycle the third resource.
In some implementations, the sending unit 803 is configured to send a first query message to the target computing node, where the first query message is used to query an application in a running state. The obtaining unit 801 is further configured to receive a first response message from the target computing node, where the first response message includes an identifier of the application in the running state.
In some implementations, the sending unit 803 is configured to send a first subscription message to the target computing node, where the first subscription message is used to subscribe to an application with a changed state. The obtaining unit 801 is further configured to receive status change information from the target computing node when the status of the application changes, where the status change information indicates that the status of the application changes.
Fig. 9 shows still another possible structure of the application management apparatus involved in the above-described embodiment. The application management apparatus includes: a processor 901 and a communication interface 902. The processor 901 is used for controlling and managing the actions of the device, for example, performing the various steps in the method flows shown in the above-described method embodiments, and/or other processes for performing the techniques described herein. The communication interface 902 is used to support the communication of the application management device with other network entities. The application management device may further comprise a memory 903 and a bus 904, the memory 903 being used for storing program codes and data of the device.
The processor 901 may implement or execute various exemplary logical blocks, units and circuits described in connection with the present disclosure. The processor may be a central processing unit, general purpose processor, digital signal processor, application specific integrated circuit, field programmable gate array or other programmable logic device, transistor logic device, hardware component, or any combination thereof. Which may implement or perform the various illustrative logical blocks, units, and circuits described in connection with the present disclosure. A processor may also be a combination of computing functions, e.g., comprising one or more microprocessors, a DSP and a microprocessor, or the like.
The memory 903 may include volatile memory, such as random access memory; the memory may also include non-volatile memory, such as read-only memory, flash memory, a hard disk, or a solid state disk; the memory may also comprise a combination of memories of the kind described above.
The bus 904 may be an Extended Industry Standard Architecture (EISA) bus or the like. The bus 904 may be divided into an address bus, a data bus, a control bus, and the like. For ease of illustration, only one thick line is shown in FIG. 9, but this does not indicate only one bus or one type of bus.
Through the above description of the embodiments, it is clear to those skilled in the art that, for convenience and simplicity of description, the foregoing division of the functional modules is merely used as an example, and in practical applications, the above function distribution may be completed by different functional modules according to needs, that is, the internal structure of the device may be divided into different functional modules to complete all or part of the above described functions. For the specific working processes of the system, the apparatus and the unit described above, reference may be made to the corresponding processes in the foregoing method embodiments, and details are not described here again.
As described above, in the embodiment of the present application, the functional modules may be divided according to the above method examples for each execution subject involved in the application management method. The integrated module can be realized in a hardware form, and can also be realized in a software functional module form. In addition, it should be noted that, in the embodiment of the present application, division of a module is schematic, and is only one logic function division, and another division manner may be provided in actual implementation. For example, the functional blocks may be divided for the respective functions, or two or more functions may be integrated into one processing block.
With regard to the application management apparatus in the foregoing embodiment, the specific manner in which each module performs operations and the beneficial effects thereof have been described in detail in the foregoing method embodiment, and are not described herein again.
The embodiment of the present application further provides an electronic device, where the electronic device may be a hardware device corresponding to an application store, or a device on a development side, or the user equipment. The electronic device includes: a processor, a memory for storing processor-executable instructions; the processor is configured to execute the instructions, so that the electronic device implements the method according to the foregoing embodiments.
In an exemplary embodiment, the present application further provides a computer readable storage medium, on which computer program instructions are stored; the computer program instructions, when executed by an electronic device, cause the electronic device to implement the method as described in the previous embodiments.
Alternatively, the computer-readable storage medium may be a non-transitory computer-readable storage medium, for example, a ROM, a Random Access Memory (RAM), a CD-ROM, a magnetic tape, a floppy disk, an optical data storage device, and the like.
In an exemplary embodiment, the present application further provides a computer program product, which includes computer readable code or a non-volatile computer readable storage medium carrying computer readable code, when the computer readable code runs in an electronic device, a processor in the electronic device implements the method according to the foregoing embodiment.
Other embodiments of the present application will be apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any variations, uses, or adaptations of the invention following, in general, the principles of the application and including such departures from the present disclosure as come within known or customary practice within the art to which the invention pertains. It is intended that the specification and examples be considered as exemplary only, with a true scope and spirit of the application being indicated by the following claims.
It will be understood that the present application is not limited to the precise arrangements described above and shown in the drawings and that various modifications and changes may be made without departing from the scope thereof. The scope of the application is limited only by the appended claims.

Claims (29)

1. An application management method, comprising:
acquiring first target data, wherein the first target data comprises application data of a first application;
transmitting the first target data to a target computing node, and controlling the first application to enter a starting state from a stopping state;
receiving a stop instruction for stopping the first application, controlling the first application to enter a stop state from an operating state, and recovering the computer resources of the target computing node allocated to the first application.
2. The method of claim 1, wherein the application data comprises: any combination of structure information of the application, function of the application, data parameter of the application and resource demand information of the application;
wherein the structural information is used for reflecting the incidence relation between the applications; the resource demand information includes: address information of the target computing node, memory requirement information and Central Processing Unit (CPU) requirement information.
3. The method of claim 2, wherein the obtaining first target data comprises:
acquiring first application data, wherein the first application data is application data of a first application;
determining the target computing node;
compiling the first application data according to the node information of the target computing node to generate the first target data, wherein the first target data is matched with the target computing node.
4. The method of claim 3, wherein the target computing node comprises a first container, and wherein controlling the first application to enter a start state from a stop state comprises:
and controlling to allocate a first resource to a first container so that the first container runs the first target data through the first resource, wherein the first resource is a computer resource corresponding to the resource demand information of the first application.
5. The method according to claim 4, wherein the application data further includes operation mode information, and before the controlling allocates a computer resource corresponding to the resource requirement information of the first application to the first container, so that the first container operates the first target data through the first resource, the method further comprises:
and if the running mode information is first mode information, controlling to create the first container, wherein the first mode information is used for indicating that the application is run in an exclusive mode.
6. The method of claim 3, wherein the target compute node includes a second container, and wherein controlling the first application to enter a launch state from a stop state comprises:
if the operation mode information is second mode information, determining the second container according to the structural information of the first application, wherein the second container is a container of a first parent application, the first parent application can call the first application to realize the function of the first application, and the structural information of the first application comprises an incidence relation between the first application and the first parent application; the second mode information is used for indicating that the application is operated in a sharing mode;
and running the first target data by using a second resource allocated to the second container, wherein the second resource is a computer resource corresponding to the resource demand information of the first parent application.
7. The method according to any one of claims 2-6, wherein the structural information of the first application comprises an association between the first application and a first sub-application, the first application being capable of calling the first sub-application to implement a function of the first sub-application; the method further comprises the following steps:
and monitoring the structural information of the first application.
8. The method of claim 7, further comprising:
monitoring the state of the first sub-application, wherein the state of the first sub-application comprises a running state and a stopping state.
9. The method according to claim 8, wherein the first sub-application comprises at least one application, and the receiving a stop instruction for stopping the first application, controlling the first application to enter a stop state from a running state, and reclaiming the computer resources allocated to the first application by the target computing node comprises:
and if the states of the applications in the first sub-application are the stop states, controlling the first application to enter the stop state from the running state, and recovering the computer resources distributed to the first application by the target computing node.
10. The method of claim 9, further comprising:
and if the application with the running state exists in the first sub-application, rejecting the stop instruction for stopping the first application.
11. The method of claim 7, further comprising:
receiving a starting instruction for starting the first sub-application;
acquiring application data of the first sub-application, and compiling the application data of the first sub-application into second target data;
transmitting the second target data to the target computing node, and controlling to allocate a third resource to a third container, so that the third container runs the second target data through the third resource, where the third resource is a computer resource corresponding to the resource demand information of the first sub-application;
and receiving a stopping instruction for stopping the first sub-application, controlling the first sub-application to enter a stopping state from an operating state, and recovering the third resource.
12. The method according to any one of claims 1-6, further comprising:
sending a first query message to the target computing node, wherein the first query message is used for querying an application in a running state;
receiving a first response message from the target computing node, the first response message including an identification of an application in the running state.
13. The method according to any one of claims 1-6, further comprising:
sending a first subscription message to the target computing node, wherein the first subscription message is used for subscribing the application with the changed state;
and receiving state change information from the target computing node when the state of the application is changed, wherein the state change information is used for indicating that the state of the application is changed.
14. An application management method, characterized in that the apparatus comprises:
an acquisition unit configured to acquire first target data, the first target data including application data of a first application;
the processing unit is used for transmitting the first target data to a target computing node and controlling the first application to enter a starting state from a stopping state;
the acquisition unit is further used for receiving a stop instruction for stopping the first application;
the processing unit is further configured to control the first application to enter a stop state from an operating state, and to recover the computer resource of the target computing node allocated to the first application.
15. The method of claim 14, wherein the application data comprises: any combination of structure information of the application, function of the application, data parameter of the application and resource demand information of the application;
the structural information is used for reflecting the incidence relation between the applications; the resource demand information includes: address information of the target computing node, memory requirement information and Central Processing Unit (CPU) requirement information.
16. The method of claim 15,
the acquiring unit is further configured to acquire first application data, where the first application data is application data of the first application;
the processing unit is further configured to determine the target computing node;
the processing unit is further configured to compile the first application data according to the node information of the target computing node, and generate the first target data, where the first target data is matched with the target computing node.
17. The method of claim 16, wherein the target compute node comprises a first container;
the processing unit is further configured to control allocation of a first resource to a first container, so that the first container runs the first target data through the first resource, where the first resource is a computer resource corresponding to the resource demand information of the first application.
18. The method of claim 17, wherein the application data further comprises run mode information;
the processing unit is further configured to control creation of the first container if the operation mode information is first mode information, where the first mode information is used to indicate that an application is operated in an exclusive mode.
19. The method of claim 16, wherein the target compute node comprises a second container;
if the operation mode information is second mode information, determining the second container according to the structural information of the first application, wherein the second container is a container of a first parent application, the first parent application can call the first application to realize the function of the first application, and the structural information of the first application comprises an incidence relation between the first application and the first parent application; the second mode information is used for indicating that the application is operated in a sharing mode;
and running the first target data by using a second resource allocated to the second container, wherein the second resource is a computer resource corresponding to the resource demand information of the first parent application.
20. The method according to any one of claims 14 to 19, wherein the structural information of the first application comprises an association relationship between the first application and a first sub-application, and the first application can call the first sub-application to realize the function of the first sub-application;
the processing unit is further configured to monitor structural information of the first application.
21. The method of claim 20,
the processing unit is further configured to monitor a state of the first sub-application, where the state of the first sub-application includes an operating state and a stop state.
22. The method of claim 21, wherein the first sub-application comprises at least one application;
the processing unit is further configured to, if the states of the applications in the first sub-application are the stop state, control the first application to enter the stop state from the running state, and recycle the computer resource allocated to the first application by the target computing node.
23. The method of claim 22,
the processing unit is further configured to reject the stop instruction for stopping the first application if an application in the running state exists in the first sub-application.
24. The method of claim 20,
the obtaining unit is further configured to receive a start instruction for starting the first sub-application;
the acquiring unit is further configured to acquire application data of the first sub-application and compile the application data of the first sub-application into second target data;
the processing unit is further configured to transmit the second target data to the target computing node, and control to allocate a third resource to a third container, so that the third container runs the second target data through the third resource, where the third resource is a computer resource corresponding to the resource demand information of the first sub-application;
the obtaining unit is further configured to receive a stop instruction for stopping the first sub-application;
the processing unit is further configured to control the first sub-application to enter a stop state from an operating state, and recycle the third resource.
25. The method according to any of claims 14-19, wherein the apparatus further comprises a transmitting unit;
the sending unit is configured to send a first query message to the target computing node, where the first query message is used to query an application in a running state;
the obtaining unit is further configured to receive a first response message from the target computing node, where the first response message includes an identifier of the application in the running state.
26. The method according to any of claims 14-19, wherein the apparatus further comprises a transmitting unit;
the sending unit is configured to send a first subscription message to the target computing node, where the first subscription message is used to subscribe an application with a changed state;
the obtaining unit is further configured to receive state change information from the target computing node when the state of the application is changed, where the state change information is used to indicate that the state of the application is changed.
27. An electronic device, comprising: a processor; a memory; and a computer program; wherein the computer program is stored on the memory, and when executed by the processor, causes the electronic device to implement the method of any of claims 1-13.
28. A computer-readable storage medium comprising a computer program, which, when run on an electronic device, causes the electronic device to carry out the method according to any one of claims 1-13.
29. A computer program product comprising computer readable code or a non-transitory computer readable storage medium carrying computer readable code, wherein when the computer readable code is run in an electronic device, a processor in the electronic device implements the method of any one of claims 1-13.
CN202210763045.9A 2022-06-30 2022-06-30 Application management method and related equipment Active CN115328529B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN202210763045.9A CN115328529B (en) 2022-06-30 2022-06-30 Application management method and related equipment
PCT/CN2023/103792 WO2024002229A1 (en) 2022-06-30 2023-06-29 Application management method and related device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202210763045.9A CN115328529B (en) 2022-06-30 2022-06-30 Application management method and related equipment

Publications (2)

Publication Number Publication Date
CN115328529A true CN115328529A (en) 2022-11-11
CN115328529B CN115328529B (en) 2023-08-18

Family

ID=83917092

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202210763045.9A Active CN115328529B (en) 2022-06-30 2022-06-30 Application management method and related equipment

Country Status (2)

Country Link
CN (1) CN115328529B (en)
WO (1) WO2024002229A1 (en)

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN116662020A (en) * 2023-08-01 2023-08-29 鹏城实验室 Dynamic management method and system for application service, electronic equipment and storage medium
WO2024002229A1 (en) * 2022-06-30 2024-01-04 北京亚控科技发展有限公司 Application management method and related device

Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130232402A1 (en) * 2012-03-01 2013-09-05 Huawei Technologies Co., Ltd. Method for Processing Sensor Data and Computing Node
CN103475677A (en) * 2012-06-07 2013-12-25 中兴通讯股份有限公司 Method, device and system for virtual node management in PaaS cloud platform
US20190317825A1 (en) * 2018-04-16 2019-10-17 Kazuhm, Inc. System for managing deployment of distributed computing resources
CN110535671A (en) * 2018-05-23 2019-12-03 龙芯中科技术有限公司 The management method and device of cloud platform
CN111352797A (en) * 2018-12-20 2020-06-30 波音公司 System and method for monitoring software application processes
CN113051134A (en) * 2021-04-20 2021-06-29 中国工商银行股份有限公司 Application system monitoring management method, device, equipment and storage medium
CN113821333A (en) * 2020-06-20 2021-12-21 华为技术有限公司 Android application program migration method and device
CN114185551A (en) * 2022-02-17 2022-03-15 浙江口碑网络技术有限公司 Applet compiling method, applet running method and device and storage medium
CN114237809A (en) * 2020-09-08 2022-03-25 华为云计算技术有限公司 Computer system, container management method and device

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20210216343A1 (en) * 2020-01-09 2021-07-15 International Business Machines Corporation Safely processing integrated flows of messages in a multi-tenant container
CN113824830A (en) * 2021-09-18 2021-12-21 维沃移动通信有限公司 Application management method and device
CN115328529B (en) * 2022-06-30 2023-08-18 北京亚控科技发展有限公司 Application management method and related equipment

Patent Citations (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20130232402A1 (en) * 2012-03-01 2013-09-05 Huawei Technologies Co., Ltd. Method for Processing Sensor Data and Computing Node
CN103475677A (en) * 2012-06-07 2013-12-25 中兴通讯股份有限公司 Method, device and system for virtual node management in PaaS cloud platform
US20190317825A1 (en) * 2018-04-16 2019-10-17 Kazuhm, Inc. System for managing deployment of distributed computing resources
CN110535671A (en) * 2018-05-23 2019-12-03 龙芯中科技术有限公司 The management method and device of cloud platform
CN111352797A (en) * 2018-12-20 2020-06-30 波音公司 System and method for monitoring software application processes
CN113821333A (en) * 2020-06-20 2021-12-21 华为技术有限公司 Android application program migration method and device
CN114237809A (en) * 2020-09-08 2022-03-25 华为云计算技术有限公司 Computer system, container management method and device
CN113051134A (en) * 2021-04-20 2021-06-29 中国工商银行股份有限公司 Application system monitoring management method, device, equipment and storage medium
CN114185551A (en) * 2022-02-17 2022-03-15 浙江口碑网络技术有限公司 Applet compiling method, applet running method and device and storage medium

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2024002229A1 (en) * 2022-06-30 2024-01-04 北京亚控科技发展有限公司 Application management method and related device
CN116662020A (en) * 2023-08-01 2023-08-29 鹏城实验室 Dynamic management method and system for application service, electronic equipment and storage medium
CN116662020B (en) * 2023-08-01 2024-03-01 鹏城实验室 Dynamic management method and system for application service, electronic equipment and storage medium

Also Published As

Publication number Publication date
CN115328529B (en) 2023-08-18
WO2024002229A1 (en) 2024-01-04

Similar Documents

Publication Publication Date Title
CN115328529B (en) Application management method and related equipment
CN112214330A (en) Method and device for deploying master nodes in cluster and computer-readable storage medium
CN110673853B (en) Compiling method, device and system
CN115061717B (en) Application management method, application subscription method and related equipment
CN111324571A (en) Container cluster management method, device and system
CN107294750B (en) Cloud cluster energy self-identification distributed configuration management method and device
CN106569880B (en) Method and system for dynamically sharing resources between Android applications
CN111897539A (en) Method and device for deploying applications according to service roles
CN113190282A (en) Android operating environment construction method and device
WO2024002222A1 (en) Application management method and related device
CN115098112B (en) Method, equipment and medium for deploying financial cloud application resources
CN112242920A (en) Cloud platform deployment method, device and node
CN116257438A (en) Updating method of interface test case and related equipment
WO2024002302A1 (en) Application management method, application subscription method, and related device
WO2024002217A1 (en) Application management method and related device
CN110569104A (en) Management method and computer storage medium for task training in deep learning system
CN107621946B (en) Software development method, device and system
CN113448650A (en) Live broadcast function plug-in loading method, device, equipment and storage medium
CN111897565A (en) Data processing method, device and equipment based on Internet of things
CN115357198B (en) Mounting method and device of storage volume, storage medium and electronic equipment
CN111400032A (en) Resource allocation method and device
CN114221865B (en) Method, device, equipment and storage medium for realizing business function of Internet of things terminal
CN116382713A (en) Method, system, device and storage medium for constructing application mirror image
CN114675940A (en) Application instance construction method, device and equipment
CN114461249A (en) Micro-service deployment method, device, code server and storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant