CN115168010A

CN115168010A - Process execution method and device, electronic equipment and readable storage medium

Info

Publication number: CN115168010A
Application number: CN202210878208.8A
Authority: CN
Inventors: 崔英云
Original assignee: Guangdong Oppo Mobile Telecommunications Corp Ltd
Current assignee: Guangdong Oppo Mobile Telecommunications Corp Ltd
Priority date: 2022-07-25
Filing date: 2022-07-25
Publication date: 2022-10-11

Abstract

The application discloses a process execution method, a process execution device, an electronic device and a readable storage medium, wherein the process execution method comprises the following steps: acquiring the priority of each process link, wherein each process link is generated by at least two processes corresponding to the process link and the interactive relationship between the processes, and the priority of the process link is set based on preset information corresponding to the process link, wherein the preset information comprises at least one of user operation information of each process and the interactive relationship strength between the two processes with the interactive relationship; determining an execution sequence of each process link based on the priority of each process link; each process link is executed based on its execution order. The accuracy of acquiring the process link priority can be improved, the efficiency of executing a plurality of process links is improved, and the use experience of a user is improved.

Description

Process execution method and device, electronic equipment and readable storage medium

Technical Field

The present application relates to the field of information technology, and in particular, to a process execution method, an apparatus, an electronic device, and a readable storage medium.

Background

At present, with the rapid development of electronic information technology, more and more processes can be executed by electronic devices. Although, different priorities may be set for different processes, and the processes are scheduled based on the priorities. However, the current method for setting the process priority has insufficient accuracy.

Disclosure of Invention

The application provides a process execution method, a process execution device, an electronic device and a readable storage medium, so as to overcome the defects.

In a first aspect, an embodiment of the present application provides a process execution method, including: acquiring the priority of each process link, wherein each process link is generated by at least two processes corresponding to the process link and the interactive relationship between the processes, and the priority of the process link is set based on preset information corresponding to the process link, wherein the preset information comprises at least one of user operation information of each process and the interactive relationship strength between the two processes with the interactive relationship; determining an execution sequence of each process link based on the priority of each process link; each process chain is executed based on its execution order.

In a second aspect, an embodiment of the present application further provides a process execution device, including: the device comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring the priority of each process link, each process link is generated by at least two processes corresponding to the process link and the interactive relationship between the processes, and the priority of the process link is set based on preset information corresponding to the process link, wherein the preset information comprises at least one of user operation information of each process and the interactive relationship strength between the two processes with the interactive relationship; a determining unit configured to determine an execution order of each process link based on a priority of each process link; and the execution unit is used for executing each process link based on the execution sequence of each process link.

In a third aspect, an embodiment of the present application further provides an electronic device, including: one or more processors; a memory; one or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the one or more processors, the one or more programs configured to perform the method of the first aspect.

In a fourth aspect, an embodiment of the present application further provides a computer-readable storage medium, where a program code is stored, and the program code may be called by a processor to execute the method according to the first aspect.

In a fifth aspect, the present application also provides a computer program product, which includes a computer program/instruction, and when executed by a processor, the computer program/instruction implements the above method.

According to the process execution method, the process execution device, the electronic equipment and the readable storage medium, the priority of each process link is firstly obtained, and then the execution sequence of each process link is determined based on the priority of each process link; and executing each process link based on the execution sequence of each process link. Since the priority of the process link is set, the more information associated with the process link is considered, the more accurate the acquired priority will generally be. In the application, the priority of the process link is set based on the preset information corresponding to the process link, and the preset information includes at least one of user operation information of each process and strength of an interaction relationship between two processes having the interaction relationship, that is, the preset information is wider, and it can be known that the acquired priority of the process link has higher accuracy. Moreover, each process link is executed based on the execution sequence of the process links acquired by the priority with higher accuracy, so that the efficiency of executing a plurality of process links can be improved, the waiting time of a user is reduced, and the use experience of the user is improved. Further, in the conventional method for determining priorities of multiple processes, after the priorities of the processes are determined, it is necessary to wait for the next scheduling period to arrive and then execute the processes corresponding to the priorities, and timeliness is poor.

Additional features and advantages of embodiments of the present application will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by the practice of embodiments of the present application. The objectives and other advantages of the embodiments of the application may be realized and attained by the structure particularly pointed out in the written description and claims hereof as well as the appended drawings.

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings required to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the description below are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.

Fig. 1 is a block diagram illustrating an electronic device according to an embodiment of the present disclosure;

FIG. 2 is a flow chart of a method for executing a process according to an embodiment of the present application;

FIG. 3 is a diagram illustrating a process link according to an embodiment of the present disclosure;

FIG. 4 is a diagram illustrating a process chain according to yet another embodiment of the present application;

FIG. 5 illustrates a schematic diagram of a graph structure provided by an embodiment of the present application;

FIG. 6 is a flow chart of a method for performing a process according to another embodiment of the present application;

FIG. 7 is a diagram illustrating one embodiment of step S220;

FIG. 8 is a diagram of one embodiment of step S221;

FIG. 9 is a schematic diagram of a display interface provided by an embodiment of the present application;

FIG. 10 is a diagram of another embodiment of step S220;

FIG. 11 is a diagram of still another embodiment of step S220;

FIG. 12 is a diagram illustrating a process execution method according to an embodiment of the present application;

fig. 13 is a block diagram illustrating a structure of a process execution apparatus according to an embodiment of the present application;

fig. 14 shows a block diagram of an electronic device according to an embodiment of the present application;

FIG. 15 is a block diagram illustrating a computer-readable storage medium provided in an embodiment of the present application;

fig. 16 shows a block diagram of a computer program product according to an embodiment of the present application.

Detailed Description

In order to make the technical solutions of the present application better understood, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. The components of the embodiments of the present application, as generally described and illustrated in the figures herein, could be arranged and designed in a wide variety of different configurations. Thus, the following detailed description of the embodiments of the present application, as presented in the figures, is not intended to limit the scope of the claimed application, but is merely representative of selected embodiments of the application. All other embodiments, which can be derived by a person skilled in the art from the embodiments of the present application without making any creative effort, shall fall within the protection scope of the present application.

It should be noted that: like reference numbers and letters refer to like items in the following figures, and thus, once an item is defined in one figure, it need not be further defined and explained in subsequent figures. Meanwhile, in the description of the present application, the terms "first", "second", and the like are used only for distinguishing the description, and are not to be construed as indicating or implying relative importance.

At present, with the rapid development of electronic information technology, more and more processes can be executed by electronic devices. Although, different priorities may be set for different processes, and the processes are scheduled based on the priorities. However, the current method of setting process priorities is not accurate enough. How to accurately set the priority of the process is an urgent problem to be solved.

Currently, a system program run by an electronic device generally sets different priorities for different types of processes, and then preferentially selects a process with a higher priority for scheduling execution. For example, the system program may assign a higher priority to processes currently in the foreground and a lower priority to processes not currently in the foreground. For another example, the system program may also preset some key types, for example, set the interface refresh type process and the audio type process as the key types, and may assign a higher priority when the type of the process belongs to the key type, and may assign a lower priority when the type of the process does not belong to the key type. As another example, the process may also obtain a higher priority through a priority request.

However, the inventors have found in their research that the setting accuracy is not high in the above setting method of the priority. For example, if there is process a, process B, and process C, where process a calls a Remote Procedure Call (RPC) service to process B, process B waits for process C to release the lock, and process C waits to be scheduled by the CPU for execution. At this time, a more complex relationship chain relationship exists among the process a, the process B, and the process C, and according to the above method, a more accurate priority cannot be obtained. Further, the inventor also finds that the timeliness of acquiring the priority is not high by the above setting method for the priority. For example, if there are process a and process B, when process a depends on the response of process B to execute, it is necessary to wait for the next scheduling period to respond to the scheduling request after the priority is set.

Therefore, in order to overcome the above-mentioned drawbacks, the present application provides a process execution method, an apparatus, an electronic device, and a readable storage medium.

Referring to fig. 1, fig. 1 shows a block diagram of an electronic device 100 according to an embodiment of the present disclosure, where the electronic device 100 includes a processor 110 and a memory 120.

For some embodiments, the memory 120 may store a system program corresponding to the electronic device 100, for example, if the electronic device 100 is a smart phone, the memory 120 may store a system program of the smart phone; if the electronic device 100 is a notebook computer or a desktop computer, the memory 120 may store a computer system program. The electronic device 100 may run a system program stored in the memory 120. The memory 120 may also store various application programs, which may be run in a system program run by the electronic device 100. Wherein the application may include at least one process. Further, the processes may have different types, and the different types of processes may correspond to different functions, for example, a display refresh class process may be used to refresh a display interface; a data request class process may be used to request that data be obtained.

The memory 120 may be an electronic memory such as a flash memory, an EEPROM (electrically erasable and programmable read only memory), an EPROM, a hard disk, or a ROM, among others.

Further, the processor 110 may be configured to execute the system program stored in the memory 120, so that the electronic device 100 may run the system program; the processor 110 may also execute applications stored in the memory 120. When the processor 110 executes a plurality of applications, the plurality of applications may correspond to a plurality of processes, and there may be an interaction relationship between the processes. Where at least two processes may constitute a process link, there may be multiple process links for multiple processes. Therefore, when executing a plurality of process links, the processor 110 may obtain the priority of each process link, and determine the execution order of each process link based on the priority of each process link. For specific methods, reference may be made to the description of the following examples.

Processor 110 may include one or more processing cores, among other things. The processor 110 may connect various portions within the entire electronic device 100 using various interfaces and lines, obtain priorities of the process links, determine an execution order of the process links, and execute each process link according to the execution order. Alternatively, the processor 110 may be implemented in at least one hardware form of a Micro Control Unit (MCU), a Digital Signal Processing (DSP), a Field-Programmable Gate Array (FPGA), and a Programmable Logic Array (PLA).

Referring to fig. 2, fig. 2 shows a process execution method provided in the embodiment of the present application, where the method may be applied to the electronic device 100 in the foregoing embodiment, and specifically, the processor 110 in the electronic device 100 may be used as a main body for executing the process execution method, and specifically, the method includes steps S110 to S130.

Step S110: the method comprises the steps of obtaining the priority of each process link, wherein each process link is generated by at least two processes corresponding to the process link and the interactive relationship between the processes, the priority of the process link is set based on preset information corresponding to the process link, and the preset information comprises at least one of user operation information of each process and the interactive relationship strength between the two processes with the interactive relationship.

As can be seen from the foregoing description, when the electronic device runs, there may exist a plurality of processes running simultaneously, where there may exist an interaction relationship among the plurality of processes, for example, there exist a process a, a process B, and a process C, where the process a calls a remote procedure call RPC service to the process B, the process B waits for the process C to release a lock, and the process C waits for the central processing unit CPU to schedule and execute, and then there exists an interaction relationship among the process a, the process B, and the process C.

Furthermore, at least two processes may form a process link, and each process in the process link may be regarded as a node, and there may be an edge relationship between nodes having an interaction relationship. Wherein the process link may include at least two processes and an interaction relationship between each process in the process link. The processes with the interaction relationship may be represented as having a call relationship, for example, if the process a and the process B have an interaction relationship, the process a may need to call the process B, the process B may need to call the process a, and the process a and the process B may call each other. Specifically, edges between nodes may have directivity, and the calling relationship between processes corresponding to the nodes is represented by the directivity. Specifically, the direction of the edge between two nodes is from the call sender to the call receiver. For example, if an edge pointing to the second node from the first node exists between the first node and the second node, it may be characterized that the process corresponding to the first node has a call relationship with the process corresponding to the second node. For example, if node a initiates a data request to node B, node a acts as the call sender and node B acts as the call receiver, so the edge between node a and node B may be pointed to by node a to node B. Optionally, one node may also serve as both a call sender and a call receiver. For example, the node a and the node B may invoke each other, that is, both the node a and the node B are the invocation sender and the invocation receiver. The edge between node a and node B may be pointed to node B by node a and node B to node a at this time.

Referring to fig. 3, fig. 3 is a schematic diagram of a process chain. Fig. 3 includes node a, node B, and node C. If node a needs to invoke node B, node B needs to invoke node C. Then in the node link formed by node a, node B and node C at this time, there may be an edge pointed to by node a to node B between node a and node B, and an edge pointed to by node B to node C between node B and node C.

Referring to fig. 4, fig. 4 is a schematic diagram of another node link. Fig. 4 includes node a, node B, and node C. If the node A and the node B call each other, and the node A and the node C call each other, the node B needs to call the node C. Then, in the node link formed by node a, node B and node C, an edge pointing to node B from node a and an edge pointing to node a from node B may exist between node a and node B; an edge pointed to the node C by the node A and an edge pointed to the node A by the node C can exist between the node A and the node C; there may be an edge between node C and node B that is pointed to by node B towards node C.

Furthermore, there may be a plurality of node links, and the plurality of node links may be constructed as a graph structure, and each node in the graph structure may correspond to one process. Referring to fig. 5, fig. 5 is a schematic diagram illustrating a graph structure formed by a plurality of node links. Specifically, fig. 5 includes node a, node B, node C, node D, and node E. The node A needs to call the node B, the node B calls the node C, the node B also calls the node D, and the node B also needs to call the node E. Therefore, it can be seen that fig. 5 includes a first node link, a second node link, and a third node link. The first node link is composed of a node A, a node B and a node C; the second node link is composed of a node a, a node B and a node D; the third node link is formed by node a, node B, and node E.

For some embodiments, the priority of a process link can be used to characterize the importance of the process link, and process links with higher importance generally need to be executed preferentially, i.e., the priority of a process link is proportional to the importance of the process link. Furthermore, for multiple process links, the priority of each process link may be obtained, and then the corresponding process link is executed according to the priority from high to low, that is, the process in the process link with the highest importance degree may be executed first in the multiple process links.

Specifically, the priority of the process link may be set based on preset information corresponding to the process link. The preset information may include specific information of a plurality of corresponding processes in the process link. It is easily understood that at least two processes can be included in the process link, so that the priority of the process link can be comprehensively determined by each process included in the process link.

And because the priority of the process link can be used for representing the importance degree of the process link, the weight value corresponding to each process can be determined by determining the importance degree of each process in the process link, namely the priority of the process link can be determined. Wherein the weight value is positively correlated with the priority.

For some embodiments, the weight value of each process in the process link may be related to the strength of the interaction relationship between the processes. The strength of the interaction relationship can be used for representing the strength of the interaction relationship among the processes, and the stronger the interaction relationship among the processes is, the stronger the strength of the interaction relationship is; the weaker the interaction between processes, the less the strength of the interaction. The strength of the interaction relationship is related to the weight value of the process, so that the stronger the strength of the interaction relationship between the processes is, the larger the weight value of the process is; the weaker the strength of the interaction relationship between the processes is, the smaller the weight value of the processes is, that is, the strength of the interaction relationship is positively correlated with the weight value.

Further, the strength of the interaction relationship may be determined by interaction information between different processes. Because the communication types of the processes with different interaction relationships are different, and the importance degrees of the processes corresponding to different communication types are different, the weight value of the process can be set based on the communication types. Thus, the interaction information may include a communication type. The communication type may be used to characterize a communication mode between different processes, for example, data may be called between the process a and the process B in an instruction mode, for example, the process a sends a data acquisition instruction to the process B, and the process B sends corresponding data to the process a after receiving the data acquisition instruction. For another example, data communication may be performed between the process a and the process B in a shared storage manner, that is, there is a shared memory X, and both the process a and the process B may read or write data processes in the shared memory X. It is obvious that the above-mentioned way of communicating between the process a and the process B through the data acquisition instruction is of lower importance than the way of communicating through the shared memory. Therefore, a higher weight value may be set for processes communicating through the shared memory, while a lower weight value may be set for processes communicating through the data acquisition instruction.

Optionally, there may be interactions between processes, and the interaction frequency may be different between different processes, where the interaction frequency may be used to characterize the number of interactions within a specified duration. For example, some processes may have only a small number of interactions, e.g., 1, occurring within a specified time period, while other processes may have a larger number of interactions, e.g., 10, occurring within a specified time period. It is easy to understand that the importance degree of the process with a large number of interactions in a specified time length is relatively high. Thus, for further embodiments, the interaction information may also include interaction frequency. A higher weight value may be set for processes with higher interaction frequency and a lower weight value may be set for processes with lower interaction frequency.

Optionally, the strength of the interaction relationship between the processes may also be determined by the degree of interdependence between the processes. Wherein the degree of interdependence can be used to characterize the degree of interdependence between the at least two processes. The higher the degree of interdependence is, the higher the importance degree of the process is, and a larger weight value can be set at the moment; the lower the degree of interdependency, the lower the degree of importance of the process, in which case a smaller weight value may be set.

As can be seen from the above analysis, the mutual information includes at least one of communication type, mutual frequency and degree of mutual dependency, and the priority of the process link can be determined by the mutual information.

For other embodiments, the weight value of each process in the process link may also be related to user operation information corresponding to the process. For example, the operation information of the user may include focus information, where the focus information may characterize whether the application corresponding to the process is the application in which the user focuses. For example, the process link includes a process a and a process B, where the process a corresponds to an application a and the process B corresponds to an application B. At this time, if the user focus is in the application a, the focus information may include the application a, a higher weight value of the process a corresponding to the application a may be set, and if the focus information does not include the application B, a lower weight value of the process B corresponding to the application B may be set.

For another example, the user operation information may further include interaction frequency information, where the interaction frequency information is used to characterize a frequency of interaction between the user and an application corresponding to a certain process. It is easy to understand that the higher the frequency of user interaction with a certain application, the higher the importance of the corresponding process of the application, i.e. a higher weight value can be set, the higher the priority. Therefore, the interaction frequency information is in positive correlation with the priority of the process. For example, the process link includes a process a and a process B, where the process a corresponds to the application a and the process B corresponds to the application B. The number of times that the user interacts with the application program a and the application program B respectively within a specified duration may be obtained, for example, if the specified duration is 1min, the user interacts with the application program a 5 times within 1min, and interacts with the application program B1 time, the importance degree of the process a is greater than that of the process B, and thus, the weight value corresponding to the process a may be set to be higher than that of the process B.

For another example, the user operation information may further include window information, where the window information is used to characterize whether an application corresponding to a certain process is presented in a display module, for example, a display screen, of the electronic device. It is easy to understand that, if an application program appears in a display module of an electronic device, a process corresponding to the application program is important, and a higher weight value can be set for the process; if the application is not present in the display module of the electronic device, a lower weight value may be set for the process.

Further, as can be seen from the above analysis, the user operation information may include focus information, interaction frequency information, and window information, and the priority of the process link may be determined by each type of user operation information. Specific methods can be described with reference to the following examples.

Step S120: the execution order of each process link is determined based on the priority of each process link.

For some embodiments, a graph structure formed by each process link may be traversed, and each process link corresponding to the graph structure and a process included in each process link may be obtained.

Specifically, the graph structure may be represented by a two-dimensional vector, wherein the process corresponding to each node of the graph structure may be uniquely determined by the two-dimensional vector. Each process link in the graph structure can be obtained by traversing the graph structure, and each traversed process link is stored as a one-dimensional vector, that is, a one-dimensional vector group consisting of a plurality of one-dimensional vectors can be obtained. Optionally, the one-dimensional vector may further include a priority corresponding to each process link, and the execution order of the process links may be determined by the priority. For example, the execution order of the process links may be determined in order of priority from high to low.

Continuing with fig. 5, taking fig. 5 as an example, process a in fig. 5 may be used as a starting point to access process a and then to access a node connected to a, i.e., process B. Further, one of the nodes connected to the process B is accessed, i.e., one is determined from the process C, the process D, and the process E. In the diagram structure shown in fig. 5, process C, process D, and process E may be regarded as having a sequential order, and thus process C may be accessed first. At this point process C is not connected to the next node, so the process link from process a through process B to process C has been determined. At this point, the node to which the process a is connected, i.e., the process B, can be accessed by returning to take the process a as a starting point again. Among the plurality of nodes connected to the process B at this time, the node which has not been accessed includes the process D and the process E, and therefore, the process D can be accessed first. At this point process D is not connected to the next node, so the process link from process a through process B to process C has been determined. At this point, it is possible to return to take process a again as a starting point, and then, by the similar method as described above, it is possible to determine a process link from process a, through process B, to process E. Therefore, based on the graph structure example shown in fig. 5, a first one-dimensional vector may be traversed, including a process link formed by process a, process B, and process C; a second one-dimensional vector comprising a process link formed by a process A, a process B and a process D; and a third one-dimensional vector comprising a process link formed by the process A, the process B and the process D.

Further, the priority of each process link obtained in the foregoing steps may be taken as a feature vector, and the feature vector is merged into the one-dimensional vector corresponding to each process link, for example, the feature vector is taken as a first vector of the one-dimensional vector corresponding to each process link. The feature vector corresponding to the priority can be characterized by a natural number. The higher the priority, the larger the corresponding natural number, i.e. the priority and the natural number may be in a positive correlation. Then, the sequence of each of the plurality of one-dimensional vectors, that is, the sequence of each process link, may be determined by sorting the first vector of the plurality of one-dimensional vectors from large to small, that is, the sequence of the plurality of process links is determined.

Step S130: each process link is executed based on its execution order.

Through the steps, the execution sequence of each process link can be determined, and the corresponding process link can be directly executed based on the execution sequence.

Further, the one-dimensional vector may include a plurality of processes, and may further include a weight value corresponding to each node, that is, a weight value representing a process corresponding to each node, which may be used to represent an importance degree of the process. Therefore, when a certain process link is executed, a process corresponding to a node with a high weight value can be preferentially executed according to the weight value corresponding to each node in the process link. For example, for the first one-dimensional vector obtained in the above-mentioned example of fig. 5, if the weight value of process a is 90, the weight value of process B is 40, and the weight value of process C is 60, then the process a, the process C, and the process B may be obtained according to the order of the weight values. Therefore, when the process link corresponding to the first one-dimensional vector is executed, the process A can be executed firstly, then the process C is executed, and finally the process B is executed, each process in the process link can be executed in sequence without waiting for the next scheduling period, so that the method has better timeliness.

Furthermore, after a process link is executed, the next process link can be executed continuously until each process link obtained by traversal is executed.

According to the process execution method, the process execution device, the electronic equipment and the readable storage medium, the priority of each process link is firstly obtained, and then the execution sequence of each process link is determined based on the priority of each process link; and executing each process link based on the execution sequence of each process link. Since the wider the information associated with the process link is, the more accurate the obtained priority will generally be when setting the priority of the process link. In the application, the priority of the process link is set based on preset information corresponding to the process link, and the preset information includes at least one of user operation information of each process and strength of an interaction relationship between two processes having the interaction relationship, that is, the preset information is wider, and it can be known that the acquired priority of the process link has higher accuracy. Moreover, each process link is executed based on the execution sequence of the process links acquired by the priority with higher accuracy, so that the efficiency of executing a plurality of process links can be improved, the waiting time of a user is reduced, and the use experience of the user is improved. Further, in the conventional method for determining priorities of multiple processes, after the priorities of the processes are determined, it is necessary to wait for the next scheduling cycle to arrive and then execute the processes corresponding to the priorities, and timeliness is poor.

Referring to fig. 6, fig. 6 shows a process execution method provided in the embodiment of the present application, which may be applied to the electronic device 100 in the foregoing embodiment, and specifically, the processor 110 in the electronic device 100 may be used as a main body for executing the process execution method, and specifically, the method includes steps S210 to S250.

Step S210: and constructing a graph structure by using a plurality of process links, wherein each node in the graph structure corresponds to one process, and an edge between any two nodes is used for representing the interactive relationship between the processes corresponding to the two nodes.

Step S220: and setting the weight values of at least part of nodes in the graph structure based on the preset information.

For some embodiments, multiple process links may be constructed into a graph structure, where each node in the graph structure corresponds to one process, and an edge between any two nodes is used to represent an interaction relationship between the processes corresponding to the two nodes, and the specific node and the edge between the nodes in the process link described in the foregoing embodiments are similar, and are not described here again.

Further, the method for constructing the process link into the graph structure may be a method for constructing the graph structure by combining a plurality of process links; or the node in each process link in the process may be extracted, and then a graph structure including a plurality of nodes and an interaction relationship between the nodes may be regenerated, which is not limited in this embodiment.

Further, the nodes in the graph structure may have a weight value, and the priority of the process link may be obtained by setting the weight value of the node. Wherein, the weight value and the priority are in positive correlation.

For some embodiments, the preset information may include user operation information of each process, and optionally, please refer to fig. 7, where fig. 7 shows an implementation diagram of step S220, specifically including step S221 and step S222.

Step S221: and determining the user interaction degree of each node based on the user operation information corresponding to the process of each node in the graph structure.

Step S222: the method comprises the steps of setting a weight value of a node based on the user interaction degree of the node, wherein the user interaction degree is positively correlated with the weight value.

Since the process corresponds to the application program, and the object operated by the user is generally the application program, the user operation information of the process includes the user operation information of the application program corresponding to the process.

The user operation information of the process may be determined based on a relationship between the user and the application program corresponding to the process. Specifically, referring to fig. 8, fig. 8 shows an implementation diagram of step S221, which includes step S2211 and step S2212.

Step S2211: based on the user operation information corresponding to the process of each node in the graph structure, searching a first type application, a second type application and a third type application in the application program corresponding to each node, wherein the first type application is the application where the user focus is located, the second type application is the application where the user focus is not located but has interaction with the user, and the third type application is the application which has no interaction with the user.

Step S2212: and respectively setting user interaction degrees for nodes corresponding to the first type application, the second type application and the third type application, wherein the user interaction degrees of the first type application, the second type application and the third type application are reduced in sequence.

It is easy to understand that there may be multiple applications corresponding to processes interacting with the user, where some applications may be objects currently operated by the user, for example, inputting an instruction to the application, or looking at content displayed by the application, etc.; while another portion of the applications may be applications associated with the application currently being operated by the user; still other portions of the application may be neither operated by the user nor associated with the application operated by the user. In this case, different user interactive programs may be set for the nodes corresponding to the respective application programs.

Specifically, as can be known from the above analysis, the application program may include a first type application, a second type application, and a third type application, where the first type application is an application where a user focus is located, the second type application is an application where a user focus is not located but there is interaction with the user, and the third type application is an application where the user focus is not interacted with the user, and the application where the user focus is located may be an application operated by the user.

Referring to fig. 9, fig. 9 shows a display interface 130 of an electronic device 100, wherein a first application 131, a second application 132 and a third application 133 are displayed in the display interface 130. The first application 131 does not interact with the user, the second application 132 is an application that is not focused on by the user but interacts with the user, and the third application 133 is an application that is focused on by the user. Accordingly, it can be known that the first application 131 belongs to the third type application, the second application 132 belongs to the second type application, and the third application 133 belongs to the first type application.

Further, the application program type of each node in the graph structure can be determined, and then the user interaction degree is set for each node based on the type, wherein the user interaction degrees of the first type application, the second type application and the third type application are sequentially reduced, and the user interaction degree is positively correlated with the weight value corresponding to the node. Therefore, after determining the application type of each node, the weight value of the node may also be set. For example, a higher weight value may be set for a node corresponding to a first type of application, a median weight value may be set for a node corresponding to a second type of application, and a smaller weight value may be set for a node corresponding to a third type of application.

For other embodiments, a starting point included in the graph structure may also be determined, the starting point also being a node. Generally, the importance of the starting point in the graph structure is higher, and the weight value corresponding to the starting point should also be higher. Therefore, when determining the user interaction degree of each node in the graph structure, the starting point may be excluded, and the user interaction degree of each node may be determined based on the user operation information corresponding to the process of each node except the starting point in the graph structure.

For some embodiments, the preset information may include the strength of the interaction between two processes having an interaction, please refer to fig. 10, where fig. 10 shows an implementation diagram of step S220, and specifically includes step S223.

Step S223: and setting a weight value between the two nodes based on the strength of the interaction relationship between the two nodes on each edge in the graph structure, wherein the strength of the interaction relationship is positively correlated with the weight value.

For some embodiments, the strength of the interaction relationship between node processes may also affect the importance of the processes, so that the weight values between corresponding nodes may be set based on the strength of the interaction relationship between the processes. Because the strength of the interaction relationship is related to the weight value of the process, the stronger the strength of the interaction relationship between the processes is, the larger the weight value of the process is; the weaker the strength of the interaction relationship between the processes is, the smaller the weight value of the processes is, that is, the strength of the interaction relationship is positively correlated with the weight value.

Optionally, the strength of the interaction relationship between the processes may be determined in advance based on the interaction information between the two processes, and as can be seen from the foregoing description of the embodiment, the interaction information includes at least one of a communication type, an interaction frequency, and an interdependence degree. Therefore, an initial weight value, for example, 0, may be set for each node. And then acquiring the interaction information of each node, and adjusting the weight value of each node based on the interaction information.

For example, if the interaction information includes a communication type, the weight value of the node is adjusted based on the communication type corresponding to the node. Specifically, in the process a and the process B shown in the foregoing embodiment, the importance degree of the manner in which the process a and the process B communicate through the data acquisition instruction is lower than that of the manner in which the process a and the process B communicate through the shared memory. Therefore, a larger weight value, for example, 20, may be added to the process of communicating through the shared memory, so as to obtain the weight value updated by the communication type. And a weight value of a smaller value, for example, 3, is added to the manner of communication by the data acquisition instruction, resulting in a weight value updated by the communication type.

For another example, the interaction information may further include an interaction frequency, and the weight value of the node may be adjusted based on the interaction frequency corresponding to the node. Specifically, if the process a has a large number of interactions within a specified duration, that is, the process a has a high interaction frequency, a weight value with a large numerical value, for example, 20, may be added to the node corresponding to the process a at this time, so as to obtain a weight value updated by the interaction frequency; if the process a has a few interactions within a specified duration, that is, the process a has a low interaction frequency, a weight value with a small value, for example, 3, may be added to the node corresponding to the process a, so as to obtain a weight value updated by the interaction frequency.

For another example, the interaction information may further include an interdependency degree, and the weight value of the node may be adjusted based on the interdependency degree corresponding to the node. Specifically, if the degree of interdependence between the process a and the process B is high, a weight with a large numerical value, for example, 20, may be added to the node corresponding to the process a and the node corresponding to the process B to obtain a weight value updated by the degree of interdependence; if the degree of interdependence between the process a and the process B is low, a weight with a small value, for example, 3, may be added to the node corresponding to the process a and the node corresponding to the process B, so as to obtain a weight value updated by the degree of interdependence.

It should be noted that, in some processes, only one or two types of interaction information may be included, and the weight value of a process may be updated only through the interaction information included in the process.

For some embodiments, the preset information may further include a type of the starting process, please refer to fig. 11, where fig. 11 shows an implementation diagram of step S220, and specifically includes step S224 and step S225.

Step S224: and determining the service type of the system key service process corresponding to each starting point in the graph structure.

Step S225: the weight value of each origin is set based on the service type of the origin.

It is easy to understand that the process link is important because the process corresponding to the starting point in the process link. Therefore, the priority of the process corresponding to the starting point in the process link can have a large influence on the priority of the process link. Therefore, the preset information may include a type of the starting point in the process link, that is, a service type corresponding to the key service process corresponding to the starting point, so that the weight value of the starting point may be set by the service type.

For some embodiments, the at least two processes forming the link may include a starting point, and since the process corresponding to the starting point is an important process among the plurality of processes in the process link, the system key service process may be used as the starting point in the process link. Further, as can be seen from the foregoing analysis, different processes may have different types, and thus it is easy to know that the system critical service process may also include a plurality of service types, for example, a system critical service process of service type a, and a system critical service process of service type B.

Further, system critical service processes of different service types may have different degrees of importance. Therefore, different importance levels of the system key service processes of different service types can be represented by allocating different weight values to the system key service processes of different service types. For example, a weight value of A1 may be assigned to the system critical service process of service type a, and a weight value of B1 may be assigned to the system critical service process of service type B. If the system critical service process of service type a is more important than the system critical service process of service type B, A1 may be made larger than B1.

In particular, the service types may include a display class and a multimedia class. For example, if the application is a video playing application or a music playing application, the corresponding process may be a multimedia system key service process. If the application is a display application, the corresponding process may be a system key service process of the display class. For some embodiments, the weight value corresponding to the system key service process of the display class is greater than the weight value corresponding to the system key service process of the multimedia class. For example, the process corresponding to the starting point a is a system key service process of a display class, and the process corresponding to the starting point B is a system key service process of a multimedia class. A greater weight value, e.g. 50, may be set for the process corresponding to the starting point a, while a lesser weight value, e.g. 30, may be set for the process corresponding to the starting point B.

Step S230: and traversing the graph structure based on a node traversal method to obtain the priority of each process link, wherein the weight value is positively correlated with the priority.

For some embodiments, the weight values of at least some of the nodes in the graph nodes are obtained through the foregoing steps. Then, the priority of each process link can be obtained by traversing the graph structure. For example, each node in the graph structure may be obtained through a traversal method, where at least some of the nodes have weight values. And then averaging the weight value of each node in the process link to be used as the priority of the process link. Optionally, a higher adjustment coefficient may be assigned to the weight value corresponding to the node that is farther in the process link, and a lower adjustment coefficient may be assigned to the weight value corresponding to the node that is farther in the process link. For example, the process link includes node a, node B, and node C, where node a is the starting point, node B is the call recipient of node a, and node C is the call recipient of node B. A higher adjustment factor, e.g. 2.0, may be assigned to the weight value of node a, a slightly lower adjustment factor, e.g. 1.2, to the weight value of node B, and a lower adjustment factor, e.g. 0.8, to the weight value of node C. And then, based on the weight values corresponding to the nodes in the process link adjusted by the adjustment coefficient, the priority of the link is obtained.

Step S240: the execution order of each process link is determined based on the priority of each process link.

Step S250: each process link is executed based on its execution order.

The steps S240 and S250 are already described in detail in the foregoing embodiments, and are not described herein again.

According to the process executing method, the process executing device, the electronic device and the readable storage medium, firstly, a plurality of process links are constructed into a graph structure, then, the weight values of at least part of nodes in the graph structure are set based on the preset information, then, the weight values of at least part of nodes in the graph structure are set based on the preset information, and finally, each process link is executed. The process link priority is comprehensively determined by setting the weight value of the process in the process link and based on the weight value of the process, so that the accuracy is high. And the process in the process link is executed during execution, so that the priority of the next process to be executed does not need to be determined every time, and the overall execution efficiency of the system is improved.

Referring to fig. 12, fig. 12 is a schematic diagram 1200 illustrating a process execution method according to an embodiment of the present application, where the method may be applied to the electronic device 100 in the foregoing embodiment, and specifically, the processor 110 in the electronic device 100 may be used as a main body for executing the process execution method.

The schematic diagram 1200 includes a Producer (Producer) 1210, a presentation layer (PresentationLayer) 1220, and a Consumer (Consumer) 1230. The producer 1210 may collect the processes and the preset information for setting the process weight values described in the foregoing embodiments through a system call (useraaware Tracepoint API) when the electronic device runs each application, and transmit the preset information to the weight calculator in the presentation layer 1220. The weight calculator receives data transmitted by a producer, generates a graph structure through a user awareness layer (UserAware Graph), sets weight values for at least part of nodes according to the data, and sets priority for process links in the graph structure according to the weight values. The process chain is finally executed by the central processor scheduler in consumer 1230. The weight calculator can acquire the service type of the system key service process through system call, such as the system key service process of a display class or the system key service process of a multimedia class; the process can also be determined from the first language process or the second language process by a system call. The first language process may be a process written in C + + language, and the second language process may be a process written in Java language. The weight calculator may also directly obtain an application type of the application program, including the first type of application, the second type of application, or the third type of application.

When the graph structure is generated through the user awareness layer, the processor can be called to carry out operation. However, since the Data operation amount is large, the hardware acceleration unit may also be configured to accelerate, for example, by Single Instruction Multiple Data (SIMD).

Optionally, when the data obtained by the system call changes, the weight calculator may be triggered to update, so as to update the graph structure and the weight values of at least part of the nodes. When the service type of the system key service process acquired by the weight calculator changes, the weight of part of the nodes can be updated.

It should be noted that the consumer 1230 may further include a blocking scheduler (blocker scheduler), a Page cache remover (Page cache eventor), a Page allocator (Page allocator), and the like, and may execute the process link through the blocking scheduler, the Page cache remover, the Page allocator, and the like.

Referring to fig. 13, a block diagram of a process execution apparatus 1300 according to an embodiment of the present application is shown, which is applied to fault detection of a circuit to be detected, and includes: an acquisition unit 1310, a determination unit 1320, and an execution unit 1330.

An obtaining unit 1310, configured to obtain a priority of each process link, where each process link is generated by at least two processes corresponding to the process link and an interaction relationship between the processes, and the priority of the process link is set based on preset information corresponding to the process link, where the preset information includes at least one of user operation information of each process and an interaction relationship strength between two processes having an interaction relationship.

Further, the obtaining unit 1310 is further configured to construct a graph structure by using the multiple process links, where each node in the graph structure corresponds to one process, and an edge between any two nodes is used to represent an interaction relationship between the processes corresponding to the two nodes; setting weight values of at least part of nodes in the graph structure based on the preset information; and traversing the graph structure based on a node traversal method to obtain the priority of each process link, wherein the weight value is positively correlated with the priority. And the direction of the edge between the two nodes is from the call sender to the call receiver.

Further, the obtaining unit 1310 is further configured to determine a user interaction degree of each node based on the user operation information corresponding to the process of each node in the graph structure; the method comprises the steps of setting a weight value of a node based on the user interaction degree of the node, wherein the user interaction degree is positively correlated with the weight value.

Further, the obtaining unit 1310 is further configured to search, in an application program corresponding to each node, a first type application, a second type application, and a third type application based on the user operation information corresponding to the process of each node in the graph structure, where the first type application is an application where a user focus is located, the second type application is an application where a user focus is not located but there is interaction with the user, and the third type application is an application where the user does not interact with the user; and respectively setting user interaction degrees for nodes corresponding to the first type application, the second type application and the third type application, wherein the user interaction degrees of the first type application, the second type application and the third type application are reduced in sequence.

Further, the obtaining unit 1310 is further configured to determine a user interaction degree of each node based on user operation information corresponding to a process of each node except for a starting point in the graph structure.

Further, the obtaining unit 1310 is further configured to set a weight value between two nodes on each edge of the graph structure based on an interaction strength between the two nodes, where the interaction strength is positively correlated with the weight value. The method comprises the steps that the interactive relationship strength between two processes with interactive relationship is determined in advance based on interactive information between the two processes, wherein the interactive information comprises at least one of communication type, interactive frequency and interdependency degree.

Further, the obtaining unit 1310 is further configured to determine a service type of a system key service process corresponding to each starting point in the graph structure; the weight value of each starting point is set based on the service type of the starting point. The service types comprise a display type and a multimedia type, and the weight value corresponding to the system key service process of the display type is greater than the weight value corresponding to the system key service process of the multimedia type.

A determining unit 1320, configured to determine an execution order of each process link based on the priority of each process link.

An execution unit 1330 configured to execute each process link based on the execution order of each process link.

It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.

In the several embodiments provided in the present application, the coupling between the units may be electrical, mechanical or other type of coupling.

In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.

Referring to fig. 14, a block diagram of an electronic device according to an embodiment of the present application is shown. The electronic device 1400 may be a smart phone, a tablet computer, or other electronic device capable of running an application. The electronic device 1400 in the present application may include one or more of the following components: a processor 1410, and a memory 1420, wherein an application may be stored in the memory 1420 and configured to be executed by the one or more processors 1410, the application configured to perform a method as described in the aforementioned method embodiments.

Processor 1410 may include one or more processing cores. The processor 1410 interfaces with various interfaces and circuitry throughout the electronic device 1400 to perform various functions of the electronic device 1400 and process data by executing or executing instructions, programs, code sets, or instruction sets stored in the memory 1420, and invoking data stored in the memory 1420. Alternatively, the processor 1410 may be implemented in hardware using at least one of Digital Signal Processing (DSP), field-Programmable Gate Array (FPGA), and Programmable Logic Array (PLA). The processor 1410 may integrate one or more of a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), a modem, and the like. Wherein, the CPU mainly processes an operating system, a user interface, an application program and the like; the GPU is used for rendering and drawing display content; the modem is used to handle wireless communications. It is to be understood that the modem may not be integrated into the processor 1410, but may be implemented by a communication chip.

The Memory 1420 may include a Random Access Memory (RAM) or a Read-Only Memory (Read-Only Memory). The memory 1420 may be used to store instructions, programs, code, sets of codes, or sets of instructions. The memory 1420 may include a program storage area and a data storage area, wherein the program storage area may store instructions for implementing an operating system, instructions for implementing at least one function, instructions for implementing the various method embodiments described below, and the like. The storage data area may also store data created by the electronic device 1400 in use.

Referring to fig. 15, a block diagram of a computer-readable storage medium according to an embodiment of the present application is shown. The computer readable medium 1500 has stored therein program code that can be called by a processor to perform the method described in the above method embodiments.

The computer-readable storage medium 1500 may be an electronic memory such as a flash memory, an EEPROM (electrically erasable programmable read only memory), an EPROM, a hard disk, or a ROM. Alternatively, the computer-readable storage medium 1500 includes a non-volatile computer-readable storage medium. The computer readable storage medium 1500 has storage space for program code 1510 to perform any of the method steps of the method described above. The program code can be read from or written to one or more computer program products. The program code 1510 may be compressed, for example, in a suitable form.

Referring to fig. 16, a block diagram of a computer program product 1600 provided in an embodiment of the present application is shown. Included in the computer program product 1600 are computer programs/instructions 1610, which computer programs/instructions 1610, when executed by a processor, implement the steps of the above-described method.

Finally, it should be noted that: the above embodiments are only used to illustrate the technical solutions of the present application, and not to limit the same; although the present application has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not depart from the spirit and scope of the corresponding technical solutions in the embodiments of the present application.

Claims

1. A process execution method, comprising:

acquiring the priority of each process link, wherein each process link is generated by at least two processes corresponding to the process link and the interaction relationship between the processes, and the priority of the process link is set based on preset information corresponding to the process link, wherein the preset information comprises at least one of user operation information of each process and the interaction relationship strength between the two processes with the interaction relationship;

determining an execution sequence of each process link based on the priority of each process link;

each process link is executed based on its execution order.

2. The method of claim 1, wherein the obtaining the priority of each process link comprises:

constructing a graph structure by using a plurality of process links, wherein each node in the graph structure corresponds to one process, and an edge between any two nodes is used for representing an interactive relationship between the processes corresponding to the two nodes;

setting weight values of at least part of nodes in the graph structure based on the preset information;

and traversing the graph structure based on a node traversal method to obtain the priority of each process link, wherein the weight value is positively correlated with the priority.

3. The method according to claim 2, wherein the preset information includes user operation information of each process, the user operation information of the process includes user operation information of an application program corresponding to the process, and the setting the weight of at least some nodes in the graph structure based on the preset information includes:

determining the user interaction degree of each node based on the user operation information corresponding to the process of each node in the graph structure;

the method comprises the steps of setting a weight value of a node based on the user interaction degree of the node, wherein the user interaction degree is positively correlated with the weight value.

4. The method according to claim 3, wherein the determining the user interaction degree of each node based on the user operation information corresponding to the process of each node in the graph structure comprises:

based on user operation information corresponding to the process of each node in the graph structure, searching a first type application, a second type application and a third type application in an application program corresponding to each node, wherein the first type application is an application where a user focus is located, the second type application is an application where the user focus is not located but where interaction exists with the user, and the third type application is an application where interaction does not exist with the user;

and respectively setting user interaction degrees for nodes corresponding to the first type application, the second type application and the third type application, wherein the user interaction degrees of the first type application, the second type application and the third type application are sequentially reduced.

5. The method according to claim 3, wherein the determining the user interaction degree of each node based on the user operation information corresponding to the process of each node in the graph structure comprises:

and determining the user interaction degree of each node based on the user operation information corresponding to the process of each node except the starting point in the graph structure.

6. The method according to claim 2, wherein the preset information includes strength of interaction between two processes having interaction, and the setting of the weight of at least some nodes in the graph structure based on the preset information includes:

and setting a weight value between the two nodes based on the strength of the interaction relationship between the two nodes on each edge in the graph structure, wherein the strength of the interaction relationship is positively correlated with the weight value.

7. The method of claim 6, wherein the strength of the interaction between two processes in which the interaction exists is determined in advance based on interaction information between the two processes, wherein the interaction information comprises at least one of communication type, interaction frequency and degree of interdependency.

8. The method according to claim 2, wherein the at least two processes include a starting point, the starting point is a system key service process, the preset information further includes a type of the starting point process, and the setting the weight of at least some nodes in the graph structure based on the preset information includes:

determining the service type of a system key service process corresponding to each starting point in the graph structure;

the weight value of each starting point is set based on the service type of the starting point.

9. The method of claim 8, wherein the service types comprise a display class and a multimedia class, and wherein the weight value corresponding to the system key service process of the display class is greater than the weight value corresponding to the system key service process of the multimedia class.

10. The method of claim 2, wherein the direction of the edge between the two nodes is from a call sender to a call recipient.

11. A process execution apparatus, comprising:

the device comprises an acquisition unit, a processing unit and a processing unit, wherein the acquisition unit is used for acquiring the priority of each process link, each process link is generated by at least two processes corresponding to the process link and the interactive relationship between the processes, the priority of the process link is set based on preset information corresponding to the process link, and the preset information comprises at least one of user operation information of each process and the strength of the interactive relationship between the two processes with the interactive relationship;

a determining unit configured to determine an execution order of each process link based on a priority of each process link;

and the execution unit is used for executing each process link based on the execution sequence of each process link.

12. An electronic device, comprising: one or more processors;

a memory;

one or more applications, wherein the one or more applications are stored in the memory and configured to be executed by the one or more processors, the one or more programs configured to perform the method of any of claims 1-10.

13. A computer-readable storage medium, having stored thereon program code that can be invoked by a processor to perform the method according to any one of claims 1 to 10.

14. A computer program product comprising computer programs/instructions, characterized in that the computer programs/instructions, when executed by a first processor, implement the method of any of claims 1-10.