CN115328529B

CN115328529B - Application management method and related equipment

Info

Publication number: CN115328529B
Application number: CN202210763045.9A
Authority: CN
Inventors: 林伟
Original assignee: Beijing Wellintech Co Ltd
Current assignee: Beijing Wellintech Co Ltd
Priority date: 2022-06-30
Filing date: 2022-06-30
Publication date: 2023-08-18
Anticipated expiration: 2042-06-30
Also published as: WO2024002229A1; CN115328529A

Abstract

The application relates to an application management method and related equipment, and relates to the technical field of software. In the application, first target data is acquired, wherein the first target data comprises 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. And receiving a stop instruction for stopping the first application, controlling the first application to enter a stop state from a running state, and recovering the computer resources of the target computing node allocated for the first application. The application 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 related devices.

Background

An Application (APP) is also known as an application, and refers to a computer program that may run in a user mode and interact with a user to perform some or more specific tasks, and may have a visual user interface.

Currently, a developer of an application can put the developed application on a shelf in an application store, a user who needs to use the APP can download the application from the application store, and the downloaded application is saved to a local terminal device (such as a mobile phone, a tablet computer, a smart television, etc.). Then, the user can install the APP through the local terminal equipment and run the APP.

However, in the current technical scheme, after the local terminal equipment needs to be downloaded and installed, the APP can be operated, and the APP operation process is complicated.

Disclosure of Invention

The application provides an application management method and related equipment, which can simplify the process of starting an application program.

The technical scheme of the application is as follows:

in a first aspect, the present application provides an application management method, the method comprising:

first target data is acquired, wherein the first target data comprises application data of a first application. The first target data is transmitted to the target computing node, and the first application is controlled to enter the starting state from the 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 an application, function functions of the application, data parameters of the application, and resource requirement information of the application. The structure information is used for reflecting the association relation between the applications; the resource demand information includes: address information of the target computing node, memory demand information and CPU demand information of the central processing unit.

In some implementations, the method for acquiring the first target data may include: and acquiring first application data, wherein the first application data is application data of the first application. A target computing node is determined. And compiling first application data according to the node information of the target computing node, generating first target data, and matching the first target data with the target computing node.

In some implementations, the target computing node includes a first container. The method for controlling the first application to enter the start state from the stop 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 operation mode information, and the application management method may further include: 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 runs in the exclusive mode.

In some implementations, the target computing node includes a second container. The method for controlling the first application to enter the start state from the stop state may include: if the running mode information is second mode information, determining a second container according to the structure 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 structure information of the first application comprises the association 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 running the first target data by using a second resource allocated for 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 is capable of invoking 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: the state of the first sub-application is monitored, 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 the stop instruction for stopping the first application, controlling the first application to enter the stop state from the running state, and recovering the computer resources allocated by the target computing node to the first application includes: and if the states of the applications in the first sub-application are all stop states, controlling the first application to enter the stop states from the running states, and recovering the computer resources allocated 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 start instruction for starting a 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 for 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 the running state, and recovering 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 an 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. When the state of the application is changed, state change information indicating that the state of the application is changed is received from the target computing node.

In a second aspect, the present application provides an application management apparatus, comprising: an acquisition unit and a processing unit.

And the acquisition unit is used for acquiring first target data, wherein the first target data comprises application data of the 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 also used for receiving a stopping instruction for stopping the first application. The processing unit is further used for controlling the first application to enter a stop state from a running state and recovering the computer resources of the target computing node allocated to the first application.

In some implementations, the acquiring unit is further configured to acquire first application data, where the first application data is application data of the first application. And the processing unit is also used for determining the target computing node. The processing unit is further used for compiling first application data according to the node information of the target computing node, generating first target data, and the first target data is matched with the target computing node.

In some implementations, the processing unit is further configured to control to allocate 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 is further configured to control to create a first container if the running mode information is first mode information, where the first mode information is used to indicate running the application in the exclusive mode.

In some implementations, the target computing node includes a second container. If the running mode information is second mode information, determining a second container according to the structure 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 structure information of the first application comprises the association 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 running the first target data by using a second resource allocated for 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 is capable of invoking the first sub-application to implement a function of the first sub-application. And the processing unit is also used for monitoring the structure 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 the stop state from the running state and recovering the computer resources allocated 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 a stop instruction for stopping the first application if the application whose state is the running state exists in the first sub-application.

In some implementations, 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 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 acquisition unit is further used for receiving a stopping instruction for stopping the first sub-application. And the processing unit is also used for controlling the first sub-application to enter the stop state from the running state and recovering the third resource.

In some implementations, the application management apparatus may further include a transmitting 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 acquisition unit is further configured to receive a first response message from the target computing node, where the first response message includes an identification of an application in a 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 for subscribing to an application whose state is changed. The acquisition unit is further 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 the state of the application to be changed.

In a third aspect, the present application provides an electronic device. An electronic device includes: a processor, a memory for storing processor-executable instructions; the processor is configured to execute the instructions to cause the electronic device to implement the method as described in any one of the possible implementations of the first aspect.

In a fourth aspect, the present application provides a computer readable storage medium having computer program instructions stored thereon; the computer program instructions, when executed by an electronic device, cause the electronic device to implement a 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, causes a processor in the electronic device to implement a method as described in any one of the possible implementations of the first aspect.

Based on any one of the first to fifth aspects, the present application has at least the following advantages:

in the application, an application management device (such as a deployment module in an operation and maintenance system) acquires first target data, wherein the first target data comprises application data of a first application. The deployment module then transmits the first target data to the target computing node, controlling the first application to enter the startup state from the stopped 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. Therefore, the local terminal does not need to download and install the application, and can control and start the first application through the deployment module, so that the process of starting the application program is simplified. And under the condition that the first application is not used, the deployment module can control the first application to stop running and recover the computing resources allocated for the first application. Therefore, the utilization rate of resources can be improved, the user is not required 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 as claimed.

Drawings

The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate embodiments consistent with the application and together with the description, serve to explain the principles of the application and do not constitute a undue limitation on the application.

FIG. 1 is a schematic diagram of a model and a predefined relationship provided by an embodiment of the present application;

FIG. 2A is a schematic diagram of a data model according to an embodiment of the present application;

FIG. 2B is a schematic diagram of the composition of an APP model according to an embodiment of the present application;

FIG. 3 is a flowchart illustrating an application management method according to an embodiment of the present application;

FIG. 4 is a schematic flow chart of an application management method according to an embodiment of the present application;

FIG. 5 is a schematic flow chart of an application management method according to an embodiment of the present application;

FIG. 6 is a schematic flow chart of an application management method according to an embodiment of the present application;

FIG. 7 is a schematic 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 device according to an embodiment of the present application;

fig. 9 is another schematic structural diagram of an application management device according to an embodiment of the present application.

Detailed Description

In order to enable a person skilled in the art to better understand the technical solutions of the present application, the technical solutions of 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 the claims of the present application and the above figures are used for distinguishing between similar objects and not necessarily for describing a particular sequential or chronological order. It is to be understood that the data so used may be interchanged where appropriate such that the embodiments of the application described herein may be implemented in sequences other than those illustrated or otherwise described herein. The implementations described in the following exemplary examples do not represent all implementations consistent with the application. Rather, they are merely examples of apparatus and methods consistent with aspects of the application as detailed in the accompanying 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 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 together, and B exists alone. The character "/" generally indicates that the context-dependent object is an "or" relationship.

An application program, also called an application, refers to a computer program that can run in a user mode and interact with a user to perform some specific task or tasks, and can have a visual user interface.

However, in the current technical scheme, after the local terminal equipment needs to be downloaded and installed, the APP can be operated, and the APP operation process is complicated. And, after the local terminal does not use (i.e., stops running) the application, the application may be uninstalled to save storage resources of the local terminal device. That is, in the current technical solution, the completion procedure of the operation application program includes: copying the application (downloading the application), transmitting the application (installing the application), starting the application, stopping the application, unloading the application, and operating the application program is complicated. Under the condition that the application program is not used, if the application program is not unloaded, storage resources are 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 current downloaded file is an executable program file, the data volume of the file is large, and the transmission speed is influenced.

Based on this, the embodiment of the application provides an application management method, which can be applied to an operation and maintenance system (such as a deployment module in the operation and maintenance system), wherein the deployment module in the operation and maintenance system acquires first target data, and the first target data comprises application data of a first application. The deployment module then transmits the first target data to the target computing node, controlling the first application to enter the startup state from the stopped 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. Therefore, the local terminal does not need to download and install the application, and can control and start the first application through the deployment module, so that the process of starting the application program is simplified. And under the condition that the first application is not used, the deployment module can control the first application to stop running and recover the computing resources allocated for the first application. Therefore, the utilization rate of resources can be improved, the user is not required 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 of the application can be still adopted so as to simplify the process of using the application program.

It should be noted that, in an industrial related scenario, an industrial internet platform may be constructed based on hardware devices such as a server, a computer, and the like, where the industrial 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 put the developed application on the industrial internet platform, and the user needing to use the application can download the application from the industrial internet platform.

The method may be implemented on a hardware device corresponding to an operation and maintenance system (such as 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 implementations, the server cluster may also be a distributed cluster. The specific implementation manner of the hardware equipment corresponding to the application warehouse and the application store is not limited.

It should be noted that, the implementation steps on the operation and maintenance system (such as a deployment module of the operation and maintenance system) side in the embodiment of the present application may be implemented by hardware devices corresponding to the deployment module of the operation and maintenance system. The steps of implementing the storage module side in the application warehouse in the embodiment of the application can be implemented by hardware equipment corresponding to the storage module in the application warehouse. The implementation steps of the operation system side in the embodiment of the application can be implemented by hardware equipment corresponding to the operation 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 equipment. Alternatively, the deployment modules of the operation and maintenance system, the storage modules 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 application is described below by taking a deployment module and an application warehouse as examples.

In the embodiment of the present application, the method for managing the application may be divided into three phases, where the three phases include: stage one, stage two and stage three. Wherein, stage one is to develop an application, and generate an application (which may be referred to as a finished product application) after development. And the second stage is to start the finished product application. And the third stage is to stop the application of the finished product.

In some embodiments, the first application (i.e., the off-the-shelf application) may implement only the program logic of the first application's own functional functions.

In the embodiment of the present application, the process of developing the first application may be as follows:

1) An APP model of the first application (i.e., an application model) is created and assigned a unique identifier (e.g., a globally unique identifier). For example, a developer of a first application may create an APP model of the first application in a development studio.

2) Defining an APP model dependent data model of the first application, and publishing data predefining of the APP model dependent data model of the first application (abbreviated as data predefining of the first application).

It should be noted that, in the present application, a model is information describing a structure of an object at the time of modeling abstraction, and a predefined concept is information defining a model of a structure and configured with parameters. The information of the model is recorded on the predefine, the predefine is used for instantiating the object, the instantiated object is a structure for constructing the object according to the structure of the model, and the parameter value is taken as an initial value of the object. The predefinals can also be referenced as sub-predefinals by other models.

For example, in creating a data model, operations may include: newly creating a model, and distributing names and identifications; adding a member, and designating a member type; deleting the member; adding or deleting sub-predefining; setting a sub-predefined initial value; updating the model version; publishing a model version generation pre-definition, etc. When creating the predefined, the operations may include: specifying a model version release (creation) predefine; assigning a name and an identification; setting predefined parameter values (values of attributes and values of members), and the like.

FIG. 1 is a schematic diagram of a model and a predefined relationship provided by an embodiment of the present application.

As shown in fig. 1, the model may include basic attributes and a member list; the basic attributes may include information of name, description, globally unique identifier (globally unique identifier, GUID), version, etc.; the member list may include: "Member 1: name + type "," member 2: name + type "," member 3: name + type ", etc.

The predefining may include basic attributes and member lists; the basic attributes may include information such as name, description, GUID, model GUID + version, etc.; the member list may include: information such as "Member 1+ value", "Member 2+ value", "Member 3+ value", and the like.

The data model in the step 2) is a concept in a database, describes the structure of the data objects in the database, and is an abstract description of the objective world objects.

Fig. 2A is a schematic diagram of a data model according to an embodiment of the present application. As shown in fig. 2A, the data model may include: basic attributes, member lists, and submodel lists. The data model with sub-models is a composite data model, such as: the data model A in the figure is a composite data model, and the data model B and the data model C are sub-models of the data model A.

In the data model, the basic attributes describe the inherent attributes of the data, including names, descriptions, GUIDs, time attributes (such as precision), space attributes (such as coordinate system and geometric shape), and the like; the member list describes freely defined fields, each member describing its field name, data type, such as: member 1, member 2, etc. The sub-model list records the predefined identifications of the data models referenced as sub-models, and establishes the dependency relationship between the sub-models and the data models, for example, the sub-model list of the data model a includes the predefined identifications of the data model B and the 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 equipment has parameters such as rotating speed, temperature, current and the like, a data model of the motor equipment is established, the data model of the motor equipment can comprise members of the rotating speed, the temperature and the current, and the data model of the motor equipment can be used for uniformly describing similar motors.

For another example, assuming that the compressor shop is internally provided with a fixed disc production line, a fixed disc production line and a final assembly production line, a data model of the compressor shop is built, and the internal part of the data model of the compressor shop can comprise a sub-model: a fixed disc production line, a final assembly production line and the like. The data model of the compressor shop may describe a similar compressor shop model.

3) Defining resource objects on which the APP model of the first application depends (resource objects of the first application for short) to a resource library, and allocating unique identifiers (such as global unique identifiers) to the resource objects of the first application.

Where the resource object is a concept in the database. The binary file data is subjected to objectification organization and management, an identifier is allocated for each resource object, and the APP model of the first application can access the data of the resource object through the identifier of the resource object.

For example, defining an icon as a dependency between a resource object and the APP model of the first application, 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 may play by reading the video file through the dependency relationship.

4) And establishing a dependent data predefined list of the first application on an APP model of the first application, selecting the data predefined of the first application from a system warehouse of the first application, and recording an identification of the data predefined of the first application on the dependent data predefined list of the first application. The predefined data in the system warehouse of the first application may be self-built by a developer or purchased from an application store.

5) And establishing a first application dependent resource list on the APP model of the first application, selecting a resource object of the first application from a resource library, and recording the identification of the resource object of the first application on the first application dependent resource list. The resource objects in the resource library can be built by a developer or purchased from an application store.

6) Program logic for writing a functional function of the APP model of the first application.

7) The method comprises the steps of generating a predefine of the APP model of the first application (predefine of the first application for short, which 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 predefine of the first application. The predefined identification of the first application is the identification of the first application.

Wherein, when the predefining of the first application is issued, predefined parameter values (such as the value of the attribute and the value of the member) can also be set.

In other embodiments, a first application (i.e., an off-the-shelf application) may implement the program logic of the functional functions of multiple applications, i.e., the first application may invoke other applications to implement the functions of other applications. In the following, a procedure for developing the first application will be described taking as an example that the plurality of applications includes a first application and a first sub-application (which may also be referred to as a second application), i.e. the first application may call the first sub-application to implement a function of the first sub-application.

a) The steps 1) to 5) are performed.

b) Adding a sub-APP list of the APP model of the first application, selecting a pre-definition of the first sub-application as a sub-APP from a system repository of the first application, and recording a pre-definition identification of the first sub-application on the sub-APP list of the APP model of the first application. The predefining 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 described in the previous embodiments.

Wherein, when the predefining of the first application is issued, predefined parameter values (such as attribute values and member values) can also be set.

Fig. 2B is a schematic diagram illustrating the composition of an APP model of the first application according to the embodiment of the present application.

As shown in fig. 2B, the APP model of the first application may include: basic attributes, dependency data list, function list, and child APP list.

The basic attributes may include: name, description, and GUID (i.e., unique identification of the APP model of the first application).

The dependency data list records the data model or resource object that the APP model of the first application needs to use, and a relationship is established between the APP model of the first application and the dependent data model or resource object. For example, "data 1: data ID "," data 2: the data ID "etc. represents an identification of the data predetenninion of the dependent data model or an identification of the resource object. The list of dependent data may comprise 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. are functional functions of the APP model of the first application, which are implementations of the program logic of the APP model of the first application.

Information of the first sub-application is recorded in the sub-APP list, and an association relationship is established between an APP model of the first application and the first sub-application. For example, the child APP list may include identification and configuration parameters for a first child application such as child APP-B1, APP-C2, APP-D3, and the like. That is, the APP model B, APP model C, the APP model D, and the like may be the first sub-application described above.

c) Step 6) to step 7) are performed.

After the first application development is completed, stage two and stage three are described below, i.e., the process by which the deployment module starts the first application and stops the first application.

Fig. 3 is a flowchart of 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 acquires first target data.

Wherein the first target data includes application data of the first application.

In an embodiment of the present application, the application data includes: any combination of structure information of an application, function functions of the application, data parameters of the application, and resource requirement information of the application.

By way of example, the application data may include structural information of the application and functional functions of the application. Alternatively, or in addition, the application data may include: structure information of the application, function functions of the application, data parameters of the application. Alternatively, the application data may include: the application structure information, the application function, the application data parameter and the application resource demand information.

Wherein the structure information is used for reflecting the association 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 association relationship, and the application C is a father 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.

It should be noted that, the embodiment of the present application is not limited to the expression form of the structural information. For example, the structure information may be represented by a tree structure.

In the embodiment of the application, the applied function is used for realizing the function of the application.

It should be noted that the functional functions are not limited by the embodiment of the present application. For example, the functional functions may include: function functions (code) for starting an application, function code for stopping running an application, function code for implementing call logic, function code for asynchronous callback, function code for timing 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), APP model of an application, data predefining of an application, data object of an application, etc.

The application resource demand information is used for indicating the computing node running the application and the resources required by the application during running. The resource requirement information of the application includes: address information of the target computing node, memory requirement information, and central processing unit (central processing unit, CPU) requirement information. The target computing node is a computing node running the first application.

Illustratively, the resource requirement information of application a includes: internet protocol (Internet Protocol, IP) address (e.g., 111.111.000.100), memory requirement information of 10 megabytes, CPU requirement information of 500 megabytes (or 4 cores). That is, application a runs on a computing node (e.g., computing node a) with an IP address of 111.111.000.100, which requires 10 mega memory occupied by computing node a and 500 mega CPU occupied by computing node a.

It should be noted that, the embodiment of the present application does not limit the resource requirement information. For example, the resource requirement information may also include a 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, a data model, an APP model, etc.) 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 parameter and the application resource demand information. The structure information is used for reflecting the association relation between the applications; the resource demand information includes: address information of the target computing node, memory demand information and CPU demand information of the central processing unit. In this way, the deployment module can acquire relevant parameters of the application through the application data, and the functions of the application are realized by combining the function functions of the application and the association relation between the applications. And in combination with the resource demand information of the application, the application is deployed on a proper computing node, 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 by applying the data.

Fig. 4 is a flowchart of 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 code expressed by a programming language.

It should be noted that the embodiment of the present application is not limited to a programming language. For example, the programming language may be a database language, such as a structured query language (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 language.

Illustratively, the first application data may include: data represented by a database language (e.g., structural information, data parameters, and resource requirement information), code represented by a computer programming language Python language (e.g., function functions).

In one possible implementation, the application repository (or may be referred to as a storage module) stores a plurality of application data. 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 computing node.

In one possible implementation, the deployment module may determine the target computing node according to address information of the target computing node in the resource requirement information of the first application. 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 requirement 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, the deployment module may determine the target computing node according to the resource requirement in the resource requirement information of the first application. Wherein the resource requirements are used to indicate the computing resources 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 with the resource information of the plurality of computing nodes. The deployment module then takes as a target computing node a computing node of the plurality of computing nodes that meets the resource requirements of the first application.

Illustratively, provided that the plurality of computing nodes includes: compute node A (CPU 4 core, 8000 megabits of memory), compute node B (CPU 8 core, 10000 megabits of memory). If the resource requirement of the application A is CPU6 core and memory 9000 megabytes, the deployment module takes the computing node B as a target computing node of the application A.

403. The deployment module compiles first application data according to 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, the first target data matches with the target computing node means that the target computing node may identify and execute the first target data.

In one possible implementation, the deployment module stores a correspondence (which may be referred to as a first correspondence) between node information and code types. The deployment module may determine an object code type according to the node information of the object computing node and the first correspondence, where the object code type is a machine code type that the object computing node can identify. The deployment module may then compile the first application data according to the object code type, generating first object data, the first object data being machine code of the object code type.

It should be noted that, the node information of the computing node is not limited in the embodiment of the present application. 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, the correspondence between node information and code types is shown.

TABLE 1

CPU manufacturer	CPU model	Operating system type	Code type
				Manufacturer A	Model A	System type A	Code type A
Manufacturer B	Model B	System type B	Code type B
				Manufacturer C	Model C	System type C	Code type C

That is, in the case where the CPU vendor of the computing node is vendor a, the CPU model is model a, and the operating system type is system type a, the code type of the machine code that the computing node can recognize is code type a. When the CPU manufacturer of the computing node is manufacturer B, the CPU model is model 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. When the CPU manufacturer of the computing node is manufacturer C, the CPU model is model 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 vendor of the target computing node is vendor a, the CPU model is model a, the operating system type is system type a, and 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, and determines the target code type. The deployment module may then compile the first application data according to the object code type, generating first object data, the first object data being machine code of the object code type.

Optionally, the node information of the computing node may further include: object code type.

It can be appreciated that the deployment module obtains first application data, which is application data of the first application. Then, the deployment module can determine the target computing node, compile the first application data according to the node information of the target computing node, and generate first target data, wherein the first target data is matched with the target computing node. That is, the deployment module may compile first target data that matches the target computing node based on the node information of the target computing node. Therefore, the first target data can be ensured to run on any computing node, and the suitability of the first target data and 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 the starting state from the stopping state.

In one possible implementation, the deployment module sends a first launch request to the target computing node, the first launch request indicating launch of the first application, the first launch request including the first target data. Thereafter, the target computing node may receive a first launch request from the deployment module and run the first target data to cause the first application to enter the launch state from the stopped state.

It should be noted that, in the embodiment of the present application, the target computing node running target data (i.e., compiled application data, i.e., machine code) refers to running (or starting) an application corresponding to the target data, and generating an instance (i.e., a running object) of the application corresponding to the target data.

The running object includes: object properties (e.g., application identification, model identification, version information, parent application identification, etc.), object structure information, object data parameters, and object container properties.

In one possible design, a target computing node includes a first container for running an 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 requirement information of the first application.

It should be noted that the first resource may be resource requirement information in the first application data.

Illustratively, if the first resource is: the memory requirement information is 10 megabytes, the CPU requirement information is 500 megabytes (or 4 cores), and the video memory is 400 megabytes. The target compute node may allocate 10 megamemories, 500 megacpus, 400 megamemories to the first container and copy the first target data to the first container such that the running engine in the first container runs the first target data through the 10 megamemories, 500 megacpus, 400 megamemories to generate an instance (i.e., a running object) of the first application.

The running engine has basic capabilities (e.g., download capabilities, scheduling capabilities, etc.) of the application. In this way, compared with the executable application files downloaded in the current technical scheme, the application data in the technical scheme of the application does not comprise the relevant data of the basic capability. Thus, 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 operating 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 running in 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 of non-running target data. Running an application in a shared mode means that the application runs in a thread form and can share a container with the parent application of the application. The shared mode running application comprises a serial running application and a parallel running application. Serial running applications refer to multiple applications sharing a thread, and parallel running applications refer to multiple applications using different threads.

In one possible implementation manner, before controlling to allocate, for the first container, a computer resource corresponding to the resource requirement information of the first application, 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 the 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 will be appreciated that if the first application runs the application in exclusive mode, the deployment module needs to create a first container for the first application and allocate resources required by the first application for the first container. Thus, the first container can run the first target data through the resource, and the effect of starting the first application is achieved.

In other embodiments, the target computing node includes a second container. If the operation mode information is the second mode information, the deployment module determines a second container according to the structure information of the first application. 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 structure information of the first application comprises the association relation between the first application and the first father application.

In one possible implementation, the deployment module has stored therein 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 may 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 for the second container, wherein the second resource is a computer resource corresponding to the resource demand information of the first parent application.

It should be noted that, the correspondence between the application and the container in the embodiment of the present application is not limited. For example, the correspondence between the application and the container may be a correspondence between the application identification and the container identification.

Illustratively, the structural information of the first application is assumed to include: the first parent application is application A, the container of application A is container A, and container A has been allocated a second resource to run application A when the target computing 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 for operating the first application. Thereafter, the deployment module may transmit the first target data to container a and run the first target data by container a using the second resource.

It will be appreciated that in the case where the operation mode information is the second mode information, it is explained that the first application may share one container with the first parent application. The deployment module may determine the second container based on the structural information of the first application. Since the deployment module has already controlled the allocation of the second resource running the first parent application for the second container when the second container is created. The deployment module may run the first target data using the second resources allocated for the second container. Thus, the second container can run the first target data through the resource, and the effect of starting the first application is achieved.

303. The deployment module receives a first stop instruction, controls the first application to enter a stop state from an operation state, and recovers the computer resources of the target computing node distributed for the first application.

The first stopping instruction is a stopping instruction for stopping the first application.

It should be noted that, in the embodiment of the present application, the source of the first stop instruction is not limited. 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 nodes 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 a running state, and recover the computer resource of the target computing node allocated to the first application. The target computing node may then receive the first stop request, control the first application to enter a stopped state from the running state, and reclaim the computer resources of the target computing node allocated for the first application.

It is understood that the deployment module obtains first target data, the first target data including application data of the first application. The deployment module then transmits the first target data to the target computing node, controlling the first application to enter the startup state from the stopped state. Therefore, the local terminal does not need to download and install the application, and can control and start the first application through the deployment module, so that the process of starting the application program is simplified. The deployment module may then receive a stop instruction to stop the first application, control the first application to enter a stopped state from a running state, and reclaim computer resources of the target computing node allocated for the first application. In this way, the deployment module may control the first application to stop running 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 is not required to uninstall the application program, and the process when the application program is not used is simplified.

In some embodiments, the structure information of the first application may further include an association relationship between the first application and the first sub-application, where the first application is capable of invoking the first sub-application to implement a function of the first sub-application. The deployment module may monitor the 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. The target computing node then sends a fabric response message to the deployment module in response to the fabric query message, the fabric response message including the fabric information of the first application.

Illustratively, at time a, the structural information of the first application (e.g., application a) includes: application A-application B, application A-application C, i.e., sub-applications of application A include application B and application C. At time B, the structure information of application a includes: application A-application B, application A-application C, 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 adds a sub-application (i.e., application D) 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 sub-application list of application a.

It may be understood that the structure information of the first application includes an association relationship between the first application and the first sub-application, and the deployment module may monitor the structure information of the first application. In this manner, the deployment module may learn about changes to the associated application of the first application.

Alternatively, the deployment module may query the structural information of the target application.

Illustratively, the deployment module may query the sub-applications (list) of the target application for the ID of the target application.

In some embodiments, the deployment module may monitor the state of the first sub-application, including the running state and the stopped state.

Illustratively, the first sub-application of the first application includes: application a, application B and application C. Wherein, application A and application B are in running state, application C is in stop state.

In one possible implementation, the deployment module may send a status query message to the target computing node, the status query message to query the status of the first sub-application. The target computing node then sends a status response message to the deployment module in response to the status query message, the status response message including the status of the first sub-application.

It can be appreciated that the deployment module monitors the state of the first sub-application, and can ensure that the state of the sub-application associated with the first application is known.

In some embodiments, after the deployment module receives a 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 deployment module receives a stop instruction for stopping the first application, controls the first application to enter a stop state from an operation state, and recovers computer resources allocated by the target computing node for the first application, and may include: and if the states of the applications in the first sub-application are all stop states, the deployment module controls the first application to enter the stop states from the running states, and recovers the computer resources allocated by the target computing node for the first application.

Illustratively, provided that the first sub-application includes: 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 allocated by the target computing node for the first application.

It is understood that the first application may invoke the first sub-application to implement the functionality of the first sub-application. And under the condition that the states of the first sub-applications are all in a stop state, the first application is not called, and the first application is not used. Then, the deployment module may control the first application to enter a stopped state from the running state, and reclaim the computer resources allocated by the target computing node for the first application. Therefore, the deployment module can control the first application by combining the state of the first sub-application, so that the first application is prevented from being stopped by calling other applications, and the accuracy of stopping the application from running is improved.

In some embodiments, if there is an application in the first sub-application whose state is the running state, a stop instruction for stopping the first application is rejected.

Illustratively, provided that the first sub-application includes: application a, application B and application C. If the states of the application A and the application B are in a stop state and the state of the application C is in an operation state, the deployment module refuses a stop instruction for stopping the first application, namely, the first application is not stopped to be operated, and the computer resources allocated for the first application are not recovered.

It will be appreciated that in the case where there is an application in the first sub-application whose state is running, it is stated that the first application is still calling the first sub-application, the first application being used. The deployment module may reject a stop instruction to stop the first application. Therefore, the first application can be prevented from being stopped when other applications are called, and the accuracy of stopping the application operation 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. And then, the deployment module can acquire the application data of the first sub-application and compile the application data of the first sub-application into second target data. And then, the deployment module can transmit the second target data to the target computing node, and control the third container to allocate a third resource, so that the third container runs the second target data through the third resource, and the third resource is a computer resource corresponding to the resource demand information of the first sub-application. The deployment module may then receive a stop instruction to stop the first sub-application, control the first sub-application to enter a stopped state from the running state, and reclaim the third resource.

Illustratively, if the first application needs to call the 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 the first sub-application and stopping the first sub-application by the deployment module, the process of starting the first application and stopping the first application by the deployment module may be referred to, which is not described herein.

It is understood that the deployment module receives a launch instruction for launching the first sub-application. And then, the deployment module can acquire 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 computing node, controlling the allocation of the third resource to the third container such that the third container runs the second target data through 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 operation state, and recovers the third resource. Therefore, the local terminal does not need to download and install the application, and can control the first sub-application to be started through the deployment module, so that 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 recover the third resource. Therefore, the utilization rate of resources can be improved, the user is not required 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 stopping and running 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 of 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 the target computing 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 running an application or an environmental system, 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 applications in the running state.

In one possible implementation, the target computing node has stored therein a correspondence between applications and application states. The target computing node may query the application in the running state according to the corresponding relationship 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 includes an identification of the application in a running state.

504. The deployment module receives a first response message from the target computing node.

It is 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 a running state. In this way, the deployment module can know 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 identity 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 a state of the target application based on the identification 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 with the association relationship. For example, the deployment module may query the status of the child applications based on the parent application ID and the child application name.

Alternatively, the query message may include target computing node address information. The query message is used to query the state of an application deployed in the target computing node.

Fig. 6 is a flowchart of 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 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 a change in the state of the application has occurred.

In one possible implementation, the target computing node may periodically detect the state of the application based on the application identification.

Alternatively, the target computing node may monitor the state of the application.

In some embodiments, if the state of the application changes, the target computing node executes 604.

604. The target computing node generates state change information to the deployment module.

The state change information is used for indicating that the state of the application is changed.

Exemplary, 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 a change occurs to the state of the application, the deployment module may receive state change information from the target computing node.

Optionally, the subscription message may include an identification of the target application, where the subscription message is used to subscribe to the state of the target application. That is, in the event that a change occurs in the state of the target application, the target computing node may send the state of the target application to the deployment module.

Optionally, the subscription message may also subscribe to the state of the application with 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.

Alternatively, the subscription message may include target computing node address information. The subscribe message is used to subscribe to the state of an application deployed in the target computing node.

It is appreciated that the deployment module sends a first subscription message to the target computing node. Then, in the case that the state of the application is changed, the deployment module may receive state change information from the target computing node, where the state change information is used to indicate that the state of the application is changed. Thus, the deployment module can know the state of the application in real time.

In some embodiments, the deployment module may query the application and the state of the application according to the target computing node.

For example, the deployment module may query applications (e.g., 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 state of application B and application C is a stopped state.

The application management method of the present application is described below in connection with specific examples. As shown in fig. 7, the application management system includes a storage module (i.e., an application repository), a deployment module, and an operating system (i.e., a target computing 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, namely 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 does not apply a sub-application of E.

The running modes of the application a, the application B, the application C, the application D and the application G are exclusive modes, and the running modes of the application E and the application F are shared modes.

When the application a is started, the deployment module may acquire target data of the application a from the storage module. And then, the deployment module determines that the running mode of the application A is the exclusive mode, and controls the running system to create the running container 1, allocate resources for the running container 1 and send target data of the application A to the running system so that the running container A runs the target data of the application A. Thereafter, when an application a in the running container 1 (simply referred to as the running application a) needs to call an application B, the running application a may send a request to the deployment module to run the application B. And then, 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 the exclusive mode, and controls the running system to create a running container 2, allocate resources for the running container 2 and send target data of the application B to the running system. When the running application B needs to call the application C, the deployment module can start the application C according to the target data of the application C.

It should be noted that, for the process of starting the application D, the application E, the application F, and the application G, reference may be made to the above description of starting the application a-application C, which is not repeated here. Since the running modes of application E and application F are both sharing modes, application E and application F can be launched in the running container of application D (i.e., the parent application).

When the application a is stopped, the deployment module may detect whether the states of the application B, the application D, and the application G are stopped states. When detecting whether the states of the application B and the application D are in a stopped state, the deployment module may detect whether the states of the sub-applications of the application B and the application D are in a stopped 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 the stop state and the state of the application F is the running state, the deployment module may determine that the state of the application D is the running state. Therefore, when the states of the application C, the application E, the application F, and the application G are all stopped states, the deployment module may stop running the application a, change the state of the application a to the stopped state, and recover the running resources of the running container 1.

It will be appreciated that, in actual implementation, the application store, the application repository, the local terminal, etc. according to the embodiments of the present application may include one or more hardware structures and/or software modules for implementing the foregoing corresponding application management method, where the executing hardware structures and/or software modules may constitute an electronic device. Those of skill in the art will readily appreciate that the various illustrative algorithm steps described in connection with the embodiments disclosed herein may be implemented as hardware or combinations of hardware and computer software. Whether a function is implemented as hardware or computer software driven 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 application correspondingly provides an application management device, which can be applied to the deployment module (such as a hardware device corresponding to the application store). Fig. 8 is a schematic structural diagram of an application management device 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. A processing unit 802 is configured to transmit first target data to the target computing node, and control the first application to enter the startup state from the stopped 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 stopped state from a running state, and reclaim computer resources of the target computing node allocated to the first application.

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 node information of the target computing node, and generate first target data, where the first target data is matched with the target computing node.

In some implementations, the processing unit 802 is further configured to control to allocate 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 to create a first container if the running mode information is first mode information, where the first mode information is used to indicate that the application is running in the exclusive mode.

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 is capable of invoking the first sub-application to implement a function of the first sub-application. The processing unit 802 is further configured to monitor the 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 control the first application to enter the stopped state from the running state if the states of the applications in the first sub-application are all stopped states, and recover the computer resources allocated by the target computing node for the first application.

In some implementations, the processing unit 802 is further configured to reject a stop instruction for stopping the first application if there is an application in the first sub-application whose state is the 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 stopped state from the running state, and reclaim 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 the application in the 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 identification 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 the application with the changed state. The obtaining unit 801 is further configured to receive, when the state of the application is changed, state change information from the target computing node, where the state change information is used to indicate that the state of the application is changed.

Fig. 9 shows still another possible structure of the application management apparatus involved in the above-described embodiment. The application management device comprises: a processor 901 and a communication interface 902. The processor 901 is configured to control and manage the actions of the apparatus, for example, to perform various steps in the method flows shown in the method embodiments described above, and/or to perform other processes of the techniques described herein. The communication interface 902 is used to support communication of the application management device with other network entities. The application management device may also include a memory 903 and a bus 904, the memory 903 for storing program codes and data for the device.

Wherein the processor 901 may implement or perform the various exemplary logic blocks, units and circuits described in connection with the present disclosure. The processor may be a central processing unit, a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. Which may implement or perform the various exemplary logic blocks, units and circuits described in connection with this disclosure. A processor may also be a combination that performs computing functions, e.g., including one or more microprocessors, a combination of a DSP and a microprocessor, and the like.

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, hard disk or solid state disk; the memory may also comprise a combination of the above types of memories.

Bus 904 may be an extended industry standard architecture (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 not only one bus or one type of bus.

From the foregoing description of the embodiments, it will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-described division of functional modules is illustrated, and in practical application, the above-described functional allocation may be implemented by different functional modules according to needs, i.e. the internal structure of the apparatus is divided into different functional modules to implement all or part of the functions described above. The specific working processes of the above-described systems, devices and units may refer to the corresponding processes in the foregoing method embodiments, which are not described herein.

As described above, the embodiment of the present application may divide functional modules for each execution subject involved in the application management method according to the above-described method example. The integrated modules may be implemented in hardware or in software functional modules. In addition, it should be noted that, in the embodiment of the present application, the division of the modules is schematic, only one logic function is divided, and another division manner may be implemented in actual implementation. For example, each functional module may be divided corresponding to each function, or two or more functions may be integrated in one processing module.

The specific manner in which each module performs the operation and the beneficial effects of the application management device in the foregoing embodiment are described in detail in the foregoing method embodiment, and are not described herein again.

The embodiment of the application also provides electronic equipment which can be hardware equipment corresponding to the application store, development side equipment or user equipment. An electronic device includes: a processor, a memory for storing processor-executable instructions; the processor is configured to execute the instructions, to cause the electronic device to implement the method as described in the previous embodiments.

In an exemplary embodiment, embodiments of the application also provide 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 the previous embodiments.

Alternatively, the above-described computer-readable storage medium may be a non-transitory computer-readable storage medium, which may be, 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 also provides a computer program product comprising a computer readable code, or a non-transitory computer readable storage medium carrying computer readable code, which when run in an electronic device, causes a processor in the electronic device to carry out a method as described in the previous embodiments.

Other embodiments of the application will be apparent to those skilled in the art from consideration of the specification and practice of the application disclosed herein. This application is intended to cover any variations, uses, or adaptations of the application 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 application 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 is to be understood that the application is not limited to the precise arrangements and instrumentalities shown in the drawings, which have been described above, and that various modifications and changes may be effected without departing from the scope thereof. The scope of the application is limited only by the appended claims.

Claims

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 stopping instruction for stopping the first application, controlling the first application to enter a stopping state from an operating state, and recycling the computer resources of the target computing node allocated to the first application;

wherein the target computing node includes a second container, the controlling the first application to enter a startup state from a stopped state, comprising:

if the running mode information is second mode information, determining the second container according to the structure 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 structure information of the first application comprises the association relation between the first application and the first father application; the second mode information is used for indicating to run the application in the sharing mode;

and operating the first target data by using a second resource allocated for the second container, wherein the second resource is a computer resource corresponding to the resource demand information of the first parent application.

2. The method of claim 1, wherein the application data comprises: any combination of structure information of an application, a function of the application, data parameters of the application and resource demand information of the application;

the structure information is used for reflecting the association relation between the applications; the resource requirement information includes: and the address information, the memory demand information and the CPU demand information of the central processing unit of the target computing node.

3. The method of claim 2, wherein the acquiring the first target data comprises:

acquiring first application data, wherein the first application data is application data of the first application;

determining the target computing node;

compiling the first application data according to the node information of the target computing node, and generating the first target data, wherein the first target data is matched with the target computing node.

4. A method according to claim 3, wherein the target computing node comprises a first container, the controlling the first application from a stopped state to a started state comprising:

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 of claim 4, wherein the application data further includes run mode information, and wherein prior to the controlling allocating the computer resource corresponding to the resource requirement information of the first application to the first container to cause the first container to run the first target data via 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 to run the application in the exclusive mode.

6. The method according to any of claims 2-5, wherein the structure information of the first application comprises an association between the first application and a first sub-application, the first application being capable of invoking the first sub-application to implement a function of the first sub-application; the method further comprises the steps of:

and monitoring the structure information of the first application.

7. The method of claim 6, wherein the method further comprises:

and monitoring the state of the first sub-application, wherein the state of the first sub-application comprises a running state and a stopping state.

8. The method of claim 7, wherein the first sub-application comprises at least one application, the receiving a stop instruction to stop the first application, controlling the first application to enter a stop state from a run state, and recovering computer resources allocated by the target computing node for the first application, comprises:

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 states from the running states, and recovering the computer resources allocated to the first application by the target computing node.

9. The method of claim 8, wherein the method further comprises:

and if the application with the running state exists in the first sub-application, rejecting the stopping instruction for stopping the first application.

10. The method of claim 6, wherein the method further comprises:

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 for a 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 recovering the third resource.

11. The method according to any one of claims 1-5, further comprising:

sending a first query message to the target computing node, wherein the first query message is used for querying an application in an operating state;

a first response message is received from the target computing node, the first response message including an identification of an application in the running state.

12. The method according to any one of claims 1-5, further comprising:

sending a first subscription message to the target computing node, wherein the first subscription message is used for subscribing to an application with 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 the state of the application to be changed.

13. An application management apparatus, the apparatus comprising:

the device comprises an acquisition unit, a storage unit and a processing unit, wherein the acquisition unit is used for acquiring first target data, and the first target data comprises application data of a first application;

a processing unit, configured to transmit the first target data to a target computing node, and control the first application to enter a startup state from a stopped state;

The acquisition unit is further used for receiving a stopping instruction for stopping the first application;

the processing unit is further used for controlling the first application to enter a stop state from an operation state and recovering the computer resources of the target computing node distributed to the first application;

the target computing node includes a second container;

the processing unit is further configured to determine, if the running mode information is second mode information, the second container according to structure information of the first application, where the second container is a container of a first parent application, and the first parent application can call the first application to implement a function of the first application, and the structure information of the first application includes an association relationship between the first application and the first parent application; the second mode information is used for indicating to run the application in the sharing mode;

the processing unit is further configured to run the first target data by using a second resource allocated to the second container, where the second resource is a computer resource corresponding to the resource requirement information of the first parent application.

14. The apparatus of claim 13, wherein the application data comprises: any combination of structure information of an application, a function of the application, data parameters of the application and resource demand information of the application;

15. The apparatus of claim 14, wherein the device comprises a plurality of sensors,

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 node information of the target computing node, and generate first target data, where the first target data is matched with the target computing node.

16. The apparatus of claim 15, wherein the target computing node comprises a first container;

the processing unit is further configured to control to allocate 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 resource requirement information of the first application.

17. The apparatus of claim 16, wherein the application data further comprises operating mode information;

The processing unit is further configured to control to create the first container if the running mode information is first mode information, where the first mode information is used to indicate running an application in an exclusive mode.

18. The apparatus according to any of claims 13-17, wherein the structure information of the first application comprises an association between the first application and a first sub-application, the first application being capable of invoking the first sub-application to implement a function of the first sub-application;

the processing unit is further configured to monitor structure information of the first application.

19. The apparatus of claim 18, wherein the device comprises a plurality of sensors,

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 running state and a stopping state.

20. The apparatus of claim 19, wherein the first sub-application comprises at least one application;

and the processing unit is further configured to control the first application to enter a stop state from an running state if the states of the applications in the first sub-application are all the stop state, and to recover the computer resources allocated by the target computing node for the first application.

21. The apparatus of claim 20, wherein the device comprises a plurality of sensors,

the processing unit is further configured to reject the stop instruction for stopping the first application if the application in the running state exists in the first sub-application.

22. The apparatus of claim 18, wherein the device comprises a plurality of sensors,

the acquisition unit is further used for receiving a starting 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 resource requirement 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 stopped state from an running state, and recover the third resource.

23. The apparatus according to any one of claims 13-17, wherein the apparatus further comprises a transmitting unit;

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 identification of an application in the running state.

24. The apparatus according to any one of claims 13-17, wherein the apparatus further comprises a transmitting unit;

the sending unit is used for sending a first subscription message to the target computing node, wherein the first subscription message is used for subscribing the application with changed state;

the acquiring unit is further configured to receive, when the state of the application is changed, state change information from the target computing node, where the state change information is used to indicate that the state of the application is changed.

25. An electronic device, comprising: a processor; a memory; a computer program; wherein the computer program is stored on the memory, which when executed by the processor, causes the electronic device to carry out the method according to any one of claims 1-12.

26. A computer readable storage medium comprising a computer program, characterized in that the computer program, when run on an electronic device, causes the electronic device to implement the method of any one of claims 1-12.