WO2022148086A1

WO2022148086A1 - Information processing method and apparatus, and device and storage medium

Info

Publication number: WO2022148086A1
Application number: PCT/CN2021/124356
Authority: WO
Inventors: 田宇
Original assignee: 田宇
Priority date: 2021-01-05
Filing date: 2021-10-18
Publication date: 2022-07-14
Also published as: CN112667405B; CN112667405A

Abstract

Disclosed are an information processing method and apparatus, and a device and a storage medium. The method comprises: after a target program is run, recording an actual running trajectory of the target program; acquiring a resource application sent when the target program runs a first node, wherein the first node is any one node in the target program; in response to the resource application, acquiring prediction information corresponding to the first node, wherein the prediction information carries a parameter historically transmitted into the first node; and if a parameter transmitted into the first node matches the parameter historically transmitted into the first node, allocating, to the target program, a resource allocated to the first node in advance, otherwise, according to preset resource allocation logic, allocating, to the target program, a resource required by the first node. By means of the present application, the execution efficiency of a target program is improved.

Description

Information processing method, apparatus, equipment and storage medium

This application claims the priority of the Chinese patent application with the application number 202110006858.9 and the invention title "Information Processing Method, Apparatus, Equipment and Storage Medium" filed with the China Patent Office on January 5, 2021, the entire contents of which are incorporated by reference in in this application.

technical field

The present application relates to the technical field of information processing, and more particularly, to an information processing method, apparatus, device, and storage medium.

Background technique

At present, the hardware performance of electronic devices such as computers and smart terminals (smart phones, tablet computers, etc.) is steadily improving day by day, but the execution efficiency of applications in electronic devices has not been greatly improved with the improvement of hardware performance.

Therefore, how to improve the execution efficiency of the application has become an urgent technical problem to be solved.

SUMMARY OF THE INVENTION

The purpose of this application is to provide an information processing method, apparatus, device and storage medium to at least partially overcome the technical problems existing in the prior art.

To achieve the above purpose, the application provides the following technical solutions:

An information processing method, comprising:

Running the target program, and recording the actual running track of the target program; the actual running track includes the running sequence of each node on which the target program has been run, and the parameters passed into each node;

Obtain the resource application sent when the target program runs the first node; the first node is any node in the target program;

In response to the resource application, obtain prediction information corresponding to the first node, where the prediction information carries parameters historically transmitted to the first node;

If the parameters passed to the first node match the parameters passed to the first node in the history, allocate the resources pre-allocated for the first node to the target program; otherwise, according to the preset The resource allocation logic allocates the resources required by the first node to the target program.

In the above method, preferably, the prediction information corresponding to the first node is obtained in the following manner:

When running the second node of the target program, obtain a sub-running trajectory corresponding to the second node, where the sub-running trajectory includes the second node and N-1 running before the second node node;

Searching for the historical sub-trajectory with the greatest similarity to the sub-trajectory corresponding to the second node in the historical running trajectory of the target program;

If the node running after the historical sub-running track in the historical running track is the first node, the first node is the first node according to the preset resource allocation logic based on the parameters passed to the first node in history. Allocate resources as forecast information.

In the above method, preferably, in the historical running trajectories of the target program, searching for the historical sub-running trajectory with the greatest similarity to the sub-running trajectory corresponding to the second node includes:

Convert the sub-running trajectory corresponding to the second node into a data unit of a preset data structure; each element in the data unit corresponds to a node;

respectively calculating the similarity between the data unit and each historical data unit in the historical running track;

Obtain the historical sub-running track corresponding to the historical data unit with the largest similarity of the data unit.

The above method, preferably, after allocating the resources required by the first node to the target program, further comprising:

If the parameter passed to the first node matches the historical parameter passed to the first node, and the similarity between the historical sub-trajectory and the sub-trajectory corresponding to the second node is greater than the threshold, the The reference count corresponding to the first node is incremented by 1;

If the parameter passed to the first node matches the historical parameter passed to the first node, but the similarity between the historical sub-trajectory and the sub-trajectory corresponding to the second node is less than or equal to the threshold , or, if the parameter passed to the first node does not match the parameter passed to the first node in the history, the reference count corresponding to the first node is decremented by 1.

The above method, preferably, also includes:

predicting a third node running after said first node;

Determine the prediction information corresponding to the third node, and execute at least part of the program segment of the second node; the prediction information corresponding to the third node carries the resources allocated for the third node, and the historical incoming parameters of the third node.

The above method, preferably, also includes:

Acquiring a resource planning file configured by the user, the resource planning file recording the priority of resources used by multiple specified programs and/or the usage amount of resources;

The resource planning file is used to adjust the amount of resources allocated to the plurality of specified programs according to the priorities of the plurality of specified programs and/or the usage of resources.

The above method, preferably, also includes:

Determine the actual associated program of the target program according to the actual running track of the target program;

comparing the actual associated program of the target program with the standard associated program corresponding to the target program;

If the actual associated program of the target program includes a non-standard associated program, the non-standard associated program is determined as a malicious program.

An electronic device including a memory and a processor;

the memory is used to store programs;

The processor is configured to execute the program stored in the memory to implement each step of the information processing method described in any one of the above.

A computer-readable storage medium on which a program is stored, characterized in that, when the program is executed by a processor, each step of the information processing method described in any one of the above is implemented.

The information processing method, device, device and storage medium provided by the present application record the actual running track of the target program after the target program runs; obtain the resource application issued when the target program runs the first node; the first node is the target program in the target program. Any node; in response to the resource application, obtain the prediction information corresponding to the first node, and the prediction information carries the parameters passed into the first node in history; if the parameters passed into the first node and the parameters passed into the first node in history If there is a match, the resources pre-allocated for the first node are allocated to the target program; otherwise, resources required by the first node are allocated to the target program according to the pre-set resource allocation logic. Since the target program is pre-allocated with the resources required by the first node, when the target program runs the first node, the resources required by the first node can be directly allocated to the first node to avoid executing the preset resource allocation logic , and the preset resource allocation logic is usually more complex, there are many factors to be considered, and it takes a certain amount of time to allocate resources. Therefore, by allocating resources to the target program in advance, the time for the target program to wait for resource allocation can be reduced, thereby improving the performance of the target program. The execution efficiency of the target program.

Description of drawings

In order to explain the embodiments of the present invention or the technical solutions in the prior art more clearly, the following briefly introduces the accompanying drawings that need to be used in the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description are only These are some embodiments of the present invention. For those of ordinary skill in the art, other drawings can also be obtained according to these drawings without creative efforts.

Fig. 1 is a kind of realization flow chart of the information processing method provided by the embodiment of this application;

Fig. 2 is a kind of realization flow chart of finding the historical sub-running trajectory with the greatest similarity of the sub-running trajectory corresponding to the second node in the historical running trajectory of the target program provided by the embodiment of the present application;

FIG. 3 is a schematic structural diagram of an information processing apparatus provided by an embodiment of the present application;

FIG. 4 is a block diagram of a hardware structure of an electronic device provided by an embodiment of the present application.

The terms "first", "second", "third", "fourth", etc. (if any) in the description and claims and the above-mentioned drawings are used to distinguish similar parts and not necessarily to describe a particular order or sequence. It is to be understood that the data so used may be interchanged under appropriate circumstances so that the embodiments of the application described herein can be practiced in sequences other than those illustrated herein.

Detailed ways

The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only a part of the embodiments of the present invention, but not all of the embodiments. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative efforts shall fall within the protection scope of the present invention.

The information processing methods provided in the embodiments of the present application can be applied to electronic devices, and the electronic devices can be mobile communication terminals, such as smart phones, tablet computers, etc., and the electronic devices can also be personal computers, such as desktop computers, all-in-one computers, Laptop etc.

An implementation flow chart of the information processing method provided by the present application is shown in Figure 1, and may include:

Step S101 : run the target program, and record the actual running track of the target program; the actual running track includes the running sequence of each node on which the target program has been run, and the parameters passed into each node.

In the embodiment of the present application, each time the target program runs, the actual running track of the target program is recorded.

The parameters passed to each node represent the resources required by the node and the amount of resources. Since the resource required by the node may be a resource that cannot be quantified, when the resource is a resource that cannot be quantified, the resource amount may be set to a preset value, such as 0.

The target program can be any program in the electronic device, for example, it can be an application program, or it can be a kernel program, or it can be a driver program or the like.

The nodes of the target program may include: functions, calling interfaces (Application Program Interface, API), program binary interfaces (Application Binary Interface, ABI), conditional branches or specified program fragments and other objects that need to apply for resources, the first node may be the above Any of several types of nodes.

The resources described in the embodiments of the present application may be system resources, may include resources of types such as memory, programs, and hardware, and may specifically include but are not limited to at least one of the following: resources used for computing, resources used for interrupt processing , resources for implementing synchronization functions, resources for memory management, resources for allocating address space, resources for file access, resources for device access, resources for managing time and timers, for Resources for page table processing, resources for handling exceptions (terminations, traps, errors, etc.), resources for implementing program scheduling and other system functions that directly or indirectly affect running continuity, resources for implementing signal processing, using resources for system calls, resources for communication, etc.

Step S102: Acquire a resource application issued when the target program runs the first node; the first node is any node in the target program.

The resource application may be a resource application automatically generated according to its own running logic during the running of the target program, or may be a resource application generated in response to a user's operation.

Step S103: In response to the above resource application, obtain prediction information corresponding to the first node. The prediction information carries the resources pre-allocated for the first node and the parameters passed into the first node in history. If the parameter matches the parameter passed to the first node in the history, step S104 is executed; otherwise, the resource required by the first node is allocated to the target program according to the preset resource allocation logic.

Among them, the following method can be used to determine whether the parameters passed to the first node match the parameters passed to the first node in history:

Determine the resources requested by the first node and the amount of resources according to the parameters passed into the first node;

Determine the resources and the amount of resources historically requested by the first node according to the parameters passed to the first node in history;

If the resources requested by the first node are the same as the resources historically requested by the first node, and the difference between the amount of resources requested by the first node and the amount of resources historically requested by the first node is within the preset range, determine The parameter matches the parameter passed into the first node in history, otherwise, it is determined that the parameter passed into the first node does not match the parameter passed into the first node in history.

Step S104: Allocate the resource pre-allocated for the first node to the target program.

In this application, the resources required by the first node of the target program are allocated in advance, and when the target program actually runs to the second node, a sub-running trajectory corresponding to the second node can be obtained, and the sub-running trajectory includes N Nodes, respectively the second node and the N-1 nodes running before the second node, find the historical sub-trajectory with the greatest similarity to the sub-trajectory corresponding to the second node in the historical running trajectory of the target program; if The node running after the historical sub-running track in the historical running track is the first node. Based on the parameters passed to the first node in the history, the first node of the target program is allocated the required resources according to the preset resource allocation logic, that is, , the resource represented by the parameter passed into the first node in the history is used as the resource to be applied for by the first node, and the resource is allocated to the first node in advance according to the preset resource allocation logic. The preset resource allocation logic may be a relatively mature resource allocation logic in the prior art, for example, resources are allocated to nodes according to real-time usage of system resources and program priorities. The specific implementation manner is not the focus of the present application, and will not be described in detail here.

If the node running after the historical sub-running track in the historical running track is not the first node, but the fourth node, then the fourth node of the target program will be the fourth node of the target program based on the parameters passed to the fourth node based on the history and the preset resource allocation logic. Allocate the required resources, that is, the resources represented by the parameters historically passed to the fourth node are used as the resources to be applied for by the fourth node, and resources are allocated to the fourth node in advance according to the preset resource allocation logic.

If the historical running trajectory of the target program is damaged (for example, a large amount of data is lost, etc.) or there is no historical running trajectory when it is first run, the simulated running trajectory of the target program can be automatically generated, and the simulated running trajectory can be used as the historical running trajectory.

The simulated running trajectory of the target program is not a trajectory generated by running the target program, but is based on the relationship of each node marked by the developer of the target program, the frequency of use of the node, and the parameters or parameter values that each node may pass in. The range of running trajectories that may be generated by the target program generated by the simulation, the simulated running trajectories can be pre-generated and stored in the server, before the target program runs for the first time (for example, when the electronic equipment is powered on for the first time after leaving the factory) or the historical running trajectories are damaged , the simulation running track can be downloaded from the server.

In the embodiment of the present application, before the target application program runs for the first time or when the historical running trajectory is damaged, the trajectory prediction of the target program is performed by simulating the running trajectory to prevent the target program from running for the first time or when the historical running trajectory is damaged. Happening.

Among them, in the actual running trajectory of the target program, the timing position of the first node is located after the second node, that is to say, based on the actual running trajectory of the target program, the first node will be executed after the second node is executed. Specifically, it may be the first node that is executed after the second node is executed.

Wherein, if the parameters passed to the first node do not match the parameters passed to the first node in the history, resources required by the first node are allocated to the target program according to the preset resource allocation logic.

If the prediction information corresponding to the first node is not obtained, it means that resources are not allocated to the first node in advance, or, although the prediction information corresponding to the first node is obtained, the parameters and history passed to the first node are passed into the first node. The parameters of the nodes do not match, indicating that the prediction information corresponding to the first node does not match the actual usage of the user. In this case, the target program needs to be allocated the resources required by the first node in real time according to the preset resource allocation logic.

In the information processing method provided by the embodiment of the present application, after the target program runs, the actual running track of the target program is recorded; the resource application sent when the target program runs the first node is obtained; the first node is any node in the target program; For resource application, obtain the prediction information corresponding to the first node. The prediction information carries the resources pre-allocated for the first node and the parameters passed into the first node in history; if the parameters passed into the first node and the history passed in The parameters of the first node match, and the resources pre-allocated for the first node match the resources applied for by the first node, and the resources pre-allocated for the first node are allocated to the target program; otherwise, the target program is allocated according to the preset resource allocation logic The program allocates the resources needed by the first node. Since the target program is pre-allocated with the resources required by the first node, when the target program runs the first node, the resources required by the first node can be directly allocated to the first node to avoid executing the preset resource allocation However, resource allocation logic is usually more complex, and there are many factors to be considered. Therefore, by allocating resources to the target program in advance, the time for the target program to wait for resource allocation can be reduced, thereby improving the execution efficiency of the target program.

In an optional embodiment, an implementation flow chart of finding the historical sub-trajectory with the greatest similarity to the sub-running trajectory corresponding to the second node in the historical running trajectory of the target program is shown in FIG. 2 , which may include: :

Step S201: Convert the sub-running trajectory corresponding to the second node into a data unit of a preset data structure; each element in the data unit corresponds to a node.

The above-mentioned preset data structure may be a matrix, or may be other structures, for example, may be a linear structure.

If the preset data structure is a matrix, the nodes can be sequentially written into an empty matrix of preset size to form a data block. Each node corresponds to an element in the data block. If a matrix cannot be filled with nodes, the The position where the data corresponding to the node is not filled in the matrix is filled with the preset value.

For example, the sub-trajectory corresponding to the second node is converted into a data block of 8 × 8 size. If the number of nodes in the sub-trajectory corresponding to the second node is less than 64, the data corresponding to the node that is not filled in the matrix is filled in the pre- set value.

Each element in the data block stores data corresponding to a node, and the data corresponding to a node may include, but is not limited to, at least part of the following data: the address of the node (which can be a physical address, a virtual address, or an IO address), the node In the time sequence position in the running track, the resource and resource amount requested by the node, as well as the parameters and parameter values passed in by the node.

Step S202: Calculate the similarity between the data unit transferred from the sub-running trajectory corresponding to the second node and each historical data unit in the historical running trajectory, respectively.

Taking the data unit as a data block as an example, each data block can be regarded as a frame of image, and the similarity between two data blocks can be calculated by using the method of calculating image similarity. For example, the Euclidean distance between two data blocks is calculated, and the Euclidean distance is used to represent the similarity between the two image blocks. The smaller the Euclidean distance, the higher the similarity.

Step S203: Obtain the historical sub-running track corresponding to the historical data unit with the largest similarity of the data unit.

In an optional embodiment, after allocating the resources required by the first node to the target program, it may further include:

If the parameters passed to the first node match the parameters passed to the first node in history, and the similarity between the historical sub-trajectories and the sub-trajectories corresponding to the second node is greater than the threshold, the reference count corresponding to the first node is added to 1. In the embodiment of the present application, if the parameters passed to the first node match the parameters passed to the first node in history, and the similarity between the historical sub-trajectories and the sub-trajectories corresponding to the second node is greater than the threshold, it means that the prediction is accurate. When the running track of the target program is reached, the reference technology corresponding to the first node is incremented by 1. The reference count represents the frequency of the sub-running program corresponding to the first node being used by the user, and the larger the reference count, the higher the frequency of the sub-running program corresponding to the first node being used by the user.

If the parameters passed to the first node match the parameters passed to the first node in history, but the similarity between the historical sub-trajectories and the sub-trajectories corresponding to the second node is less than or equal to the threshold, or, the parameters passed to the first node If it does not match the parameters passed to the first node in history, the reference count corresponding to the first node is decremented by 1. If the parameters passed to the first node match the parameters passed to the first node in history, but the similarity between the historical sub-trajectories and the sub-trajectories corresponding to the second node is less than or equal to the threshold, or, the parameters passed to the first node If it does not match the parameters passed to the first node in history, it means that the running trajectory of the target program is not accurately predicted. In this case, the reference count corresponding to the first node is decremented by 1.

Based on this, when searching for the historical sub-trajectories with the greatest similarity to the sub-trajectories corresponding to the second node in the historical running trajectories of the target program, if the history with the greatest similarity to the sub running trajectories corresponding to the second node is found, If there are multiple sub-trajectories, you can judge the reference counts of the nodes after each historical sub-trajectory, determine the node with the largest reference count, and assign the historical sub-trajectories before the node with the largest reference count in each historical sub-trajectory. As the final historical sub-trajectory with the greatest similarity to the sub-travel corresponding to the second node.

In an optional embodiment, the information processing method provided in this embodiment of the present application may further include:

Predict the third node running after the first node;

The prediction information corresponding to the third node is determined, and at least a part of the program segment of the second node is executed; the prediction information corresponding to the third node carries the resources allocated for the third node and the parameters historically transmitted to the third node.

Optionally, it may be determined according to the type of the third node whether to execute part of the program segments or all the program segments of the third node. Specifically, if the third node of the target program is a human-computer interaction program, the program segment of the initialization part of the third node of the target program can be executed. If the third node of the target program is a non-human-computer interaction program (for example, background service program), all program fragments of the third node can be executed.

Optionally, if the third node of the target program is a human-computer interaction program, and the user provides the interaction data required for human-computer interaction in advance, all program fragments of the third node of the target program can be executed. The third node is a human-computer interaction type program, and the user does not provide interaction data required for human-computer interaction in advance, then the program fragment of the initialization part of the third node of the target program can be executed.

The third node is a node adjacent to the first node and located after the first node.

In the embodiment of the present application, when the target program runs to the first node, the node that needs to be run after the first node can be predicted according to the sub-prediction trajectory corresponding to the first node. If the predicted node is the second node, it can be run in advance. The second node can reduce the startup time of the second node and further improve the execution efficiency of the target program when the operation of the first node ends.

In addition, if the second node is not executed after the first node is executed, indicating that the actual running trajectory of the target program deviates from the predicted trajectory of the target program, the execution of at least part of the program segments of the second node is terminated to avoid unnecessary programs. Fragment execution results in a waste of resources.

Obtain the resource planning file configured by the user, which records the priority and/or resource usage of multiple specified programs, and is used to record the priority and/or resource usage of multiple specified programs Adjusts the amount of resources allocated for multiple specified programs.

That is to say, in this embodiment of the present application, the user may provide a resource planning file to the operating system of the electronic device, so that the operating system can learn the resource planning requirements of the user for each specified program, and the resource planning requirements record the resource planning requirements of multiple specified programs. Priority and/or resource usage.

If the resource planning file only records the priority of resources used by multiple specified programs, in the case of resource shortage, when allocating resources to multiple specified programs is involved, the operating system records the priority of each specified program according to the resource planning file. The program with higher priority allocates resources first.

If the resource planning file only records the usage of resources used by multiple specified programs, when resources need to be allocated to any one of the multiple specified programs, the operating system records the resource usage of each specified program according to the resource planning file as the specified program. Programs allocate resources.

If the resource planning file records not only the priority of resources used by multiple designated programs, but also the usage of resources used by multiple designated programs, in the case of resource shortage, when it comes to allocating resources to multiple designated programs, The operating system allocates resources preferentially to programs with higher priorities according to the priorities of each designated program recorded in the resource planning file, and the amount of resources allocated is the amount of resource usage recorded in the planning file.

Optionally, the user may provide a resource rule file to the operating system through a visual resource configuration interface provided by the operating system, so that the user can adjust the resources allocated by the operating system to the program at any time. At the same time, the resource usage of the operating system can be displayed in real time on the visual resource configuration interface, so that the user can monitor the resource usage of the operating system in real time through the visual resource configuration interface. In addition, the running track of the program can also be displayed on the visual resource configuration interface. When debugging the program or when the program runs in error, the user can more easily and accurately locate the location of the problem through the visual program running track, that is, through the visual interface display The actual and predicted running trajectories of the program.

In the embodiment of the present application, the user can specify the usage of resources by any program. In this way, even in the case of insufficient resources, the operating system can adjust the resources allocated to each program according to the user's wishes, thereby ensuring that the user needs The program executes quickly and stably.

The actual associated program of the target program is determined according to the actual running track of the target program.

In the actual running process of the target program, it may interact with programs other than the target program, and these programs other than the target program are called associated programs of the target program.

Compare the actual associated program of the target program with the standard associated program corresponding to the target program.

For a target program, the associated programs that the target program can interact with during the running process are pre-defined when the target program is published. Therefore, the standard associated programs corresponding to the target program are known.

If the actual associated program of the target program includes a non-standard associated program, it means that the actual associated program of the target program includes an associated program that does not belong to the standard associated program corresponding to the target program, and the associated program is a malicious program (plug-in or Trojan horse, etc.).

After the non-standard associated program is determined as a malicious program, prompt information can also be output to notify the user that there is a malicious program.

Further, the actual running track of the malicious program can also be recorded, and then the malicious behavior of the malicious program can be determined according to the actual running track of the malicious program.

In an optional embodiment, if the target program uses one or more dynamic link library files, a link instruction triggered by the user can be obtained, and in response to the link instruction, some or all of the dynamic link library files selected by the user are linked into the target program. program, using the linked target program as a copy of the target program.

Correspondingly, the aforementioned running target program may be a copy of the running target program, and by running the copy of the target program, a time-consuming dynamic linking process can be avoided, thereby speeding up the running speed of the target program.

In an optional embodiment, the information processing method provided by the embodiment of the present application is applied to an electronic device, and the information processing method provided by the embodiment of the present application may further include:

After the electronic device starts to run, the actual running track of the electronic device is recorded, and the actual running track of the electronic device records each program that has been run in the electronic device, the running sequence of each program, and the adjacent start running time. Interval between programs to start running time.

When the first program in the electronic device runs, the prediction information corresponding to the first program is obtained, and the prediction information corresponding to the first program includes: a prediction interval, where the prediction interval is the time between the start time of the second program and the first program. The interval of the start run time.

Optionally, the sub-running track corresponding to the first program can be obtained, and the sub-running track corresponding to the first program includes the first program and M-1 programs that run before the first program; the historical running track of the electronic device Find the historical sub-trajectory with the greatest similarity to the sub-trajectory corresponding to the first program in the The program is the second program, and the interval between the second program and the first program after the historical sub-trajectory with the greatest similarity to the sub-trajectory corresponding to the first program in the historical running trajectories of the electronic device is used as the prediction interval.

The second program is started and run in the background, and after the first program runs the prediction interval, the second program is transferred to the foreground to run.

If the second program is the target program, the target program can be run in advance to further improve the running efficiency of the target program.

Corresponding to the method embodiment, the embodiment of the present application further provides an information processing apparatus. A schematic structural diagram of the information processing apparatus provided by the embodiment of the present application is shown in FIG. 3 , which may include:

Operation module 301, resource application acquisition module 302, comparison module 303 and allocation module 304; wherein,

The running module 301 is used to run the target program and record the actual running track of the target program; the actual running track includes the running sequence of each node on which the target program has been run, and the parameters passed into each node;

The resource application acquisition module 302 is configured to acquire the resource application sent by the target program when running the first node; the first node is any node in the target program;

The comparison module 303 is configured to, in response to the resource application, obtain prediction information corresponding to the first node, where the prediction information carries parameters historically transmitted to the first node;

The allocation module 304 is configured to allocate the resource pre-allocated for the first node to the target program if the parameter passed to the first node matches the parameter passed to the first node in the history; Otherwise, resources required by the first node are allocated to the target program according to preset resource allocation logic.

The information processing device provided by the embodiment of the present application records the actual running track of the target program after the target program runs; obtains the resource application sent when the target program runs the first node; the first node is any node in the target program; and responds In the resource application, the prediction information corresponding to the first node is obtained, and the prediction information carries the parameters passed into the first node in history; if the parameters passed into the first node match the parameters passed into the first node in history, it will be preset as The resources allocated by the first node are allocated to the target program; otherwise, resources required by the first node are allocated to the target program according to preset resource allocation logic. Since the target program is pre-allocated with the resources required by the first node, when the target program runs the first node, the resources required by the first node can be directly allocated to the first node to avoid executing the preset resource allocation However, resource allocation logic is usually more complex, and there are many factors to be considered. Therefore, by allocating resources to the target program in advance, the time for the target program to wait for resource allocation can be reduced, thereby improving the execution efficiency of the target program.

In an optional embodiment, the information processing apparatus provided in this embodiment of the present application may further include:

A sub-running trajectory acquisition module, configured to acquire a sub-running trajectory corresponding to the second node when running the second node of the target program, the sub-running trajectory including the second node and the second node in the second N-1 nodes running before the node;

A search module is used to search the historical sub-running track with the greatest similarity of the sub-running track corresponding to the second node in the historical running track of the target program;

The prediction module is used for if the node running after the historical sub-running track in the historical running track is the first node, based on the parameters passed into the first node based on history, according to the preset resource allocation logic: The first node allocates resources as prediction information.

In an optional embodiment, the search module includes:

a conversion unit, configured to convert the sub-running trajectory corresponding to the second node into a data unit of a preset data structure; each element in the data unit corresponds to a node;

a calculation unit, used for calculating the similarity between the data unit and each historical data unit in the historical running track;

An acquiring unit, configured to acquire the historical sub-running track corresponding to the historical data unit with the largest similarity of the data unit.

In an optional embodiment, the information processing apparatus provided in this embodiment of the present application may further include: a counting module, configured to: if the parameters passed into the first node and the history parameters passed into the first node match, and the similarity between the historical sub-trajectory and the sub-trajectory corresponding to the second node is greater than the threshold, add 1 to the reference count corresponding to the first node; if the parameter passed to the first node is the same as The parameters passed into the history of the first node match, but the similarity between the historical sub-running trajectory and the sub-running trajectory corresponding to the second node is less than or equal to the threshold, or, the information passed to the first node. If the parameter does not match the parameter passed into the first node from the history, the reference count corresponding to the first node is decremented by 1.

a pre-execution module, configured to execute at least part of the program segment of the second node after predicting a third node that runs after the first node, and after determining the prediction information corresponding to the third node; the third node The corresponding prediction information carries the resources allocated to the third node and the parameters historically transmitted to the third node.

A resource planning module, configured to obtain a resource planning file configured by a user, the resource planning file records the priority of resources used by multiple specified programs and/or the usage amount of the resources; the resource planning file is used for according to the multiple The priority of the designated programs and/or the amount of resource usage adjusts the amount of resources allocated to the plurality of designated programs.

a malicious program detection module, configured to determine the actual associated program of the target program according to the actual running track of the target program; compare the actual associated program of the target program with the standard associated program corresponding to the target program; if the The actual associated programs of the target program include non-standard associated programs, and the non-standard associated programs are determined to be malicious programs.

The dynamic link module is used to obtain the link instruction triggered by the user, and in response to the link instruction, link part or all of the dynamic link library files selected by the user into the target program, and use the linked target program as a copy of the target program.

Correspondingly, the running module 301 is specifically configured to run the copy of the target program.

The program pre-running module is used to record the actual running track of the electronic device after the electronic device starts to run, and the actual running track of the electronic device records each program that has been run in the electronic device, and the running sequence of each program. , and the interval between the start-run times of programs adjacent to the start-run times.

The information processing apparatus provided by the embodiments of the present application can be applied to electronic equipment, such as a PC terminal, a cloud platform, a server, and a server cluster. Optionally, FIG. 4 shows a block diagram of a hardware structure of an electronic device provided by an embodiment of the present application. Referring to FIG. 4 , the hardware structure of the electronic device may include:

At least one processor 1 , at least one communication interface 2 , at least one memory 3 and at least one communication bus 4 .

In the embodiment of the present application, the number of the processor 1, the communication interface 2, the memory 3, and the communication bus 4 is at least one, and the processor 1, the communication interface 2, and the memory 3 complete the communication with each other through the communication bus 4;

The processor 1 may be a central processing unit CPU, or a specific integrated circuit ASIC (Application Specific Integrated Circuit), or one or more integrated circuits configured to implement embodiments of the present invention, etc.;

The memory 3 may include high-speed RAM memory, and may also include non-volatile memory (non-volatile memory), etc., such as at least one disk memory;

Wherein, the memory stores a program, and the processor can call the program stored in the memory, and the program is used for:

Optionally, the refinement function and extension function of the program may refer to the above description.

An embodiment of the present application further provides a storage medium, where the storage medium can store a program suitable for the processor to execute, and the program is used for:

Those of ordinary skill in the art can realize that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Skilled artisans may implement the described functionality using different methods for each particular application, but such implementations should not be considered beyond the scope of the present invention.

In the several embodiments provided in this application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. On the other hand, the shown or discussed mutual coupling or direct coupling or communication connection may be through some interfaces, indirect coupling or communication connection of devices or units, and may be in electrical, mechanical or other forms.

The units described as separate components may or may not be physically separated, and components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution in this embodiment.

In addition, each functional unit in each embodiment of the present invention may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit.

It should be understood that, in the embodiments of the present application, the rights, various embodiments, and features can be combined with each other, and the aforementioned technical problems can be solved.

The functions, if implemented in the form of software functional units and sold or used as independent products, may be stored in a computer-readable storage medium. Based on such understanding, the technical solution of the present invention can be embodied in the form of a software product in essence, or the part that contributes to the prior art or the part of the technical solution. The computer software product is stored in a storage medium, including Several instructions are used to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of the present invention. The aforementioned storage medium includes: U disk, mobile hard disk, Read-Only Memory (ROM, Read-Only Memory), Random Access Memory (RAM, Random Access Memory), magnetic disk or optical disk and other media that can store program codes .

The above description of the disclosed embodiments enables any person skilled in the art to make or use the present invention. Various modifications to these embodiments will be readily apparent to those skilled in the art, and the generic principles defined herein may be implemented in other embodiments without departing from the spirit or scope of the invention. Thus, the present invention is not intended to be limited to the embodiments shown herein, but is to be accorded the widest scope consistent with the principles and novel features disclosed herein.

Claims

An information processing method, comprising:

Run the target program, and record the actual running track of the target program; the actual running track includes the running sequence of each node that the target program has run, and the parameters passed into each node; the parameters of each node are each The resources and amount of resources required by the node;

Obtain the resource application sent when the target program runs the first node; the first node is any node in the target program;

In response to the resource application, obtain prediction information corresponding to the first node, where the prediction information carries parameters historically transmitted to the first node;

If the parameters passed to the first node match the parameters passed to the first node in the history, allocate the resources pre-allocated for the first node to the target program; otherwise, according to the preset The resource allocation logic allocates the resources required by the first node to the target program.
The method according to claim 1, wherein the prediction information corresponding to the first node is obtained in the following manner:

When running the second node of the target program, obtain a sub-running trajectory corresponding to the second node, where the sub-running trajectory includes the second node and N-1 running before the second node node;

Searching for the historical sub-trajectory with the greatest similarity to the sub-trajectory corresponding to the second node in the historical running trajectory of the target program;

If the node running after the historical sub-running track in the historical running track is the first node, the first node is the first node according to the preset resource allocation logic based on the parameters passed to the first node in history. Allocate resources as forecast information.
The method according to claim 2, wherein, in the historical running trajectories of the target program, searching for the historical sub-running trajectory with the greatest similarity to the sub-running trajectory corresponding to the second node comprises:

Convert the sub-running trajectory corresponding to the second node into a data unit of a preset data structure; each element in the data unit corresponds to a node;

respectively calculating the similarity between the data unit and each historical data unit in the historical running track;

Obtain the historical sub-running track corresponding to the historical data unit with the largest similarity of the data unit.
The method according to claim 2, wherein after allocating the resources required by the first node to the target program, the method further comprises:

If the parameter passed to the first node matches the historical parameter passed to the first node, and the similarity between the historical sub-trajectory and the sub-trajectory corresponding to the second node is greater than the threshold, the The reference count corresponding to the first node is incremented by 1;

If the parameter passed to the first node matches the historical parameter passed to the first node, but the similarity between the historical sub-trajectory and the sub-trajectory corresponding to the second node is less than or equal to the threshold , or, if the parameter passed to the first node does not match the parameter passed to the first node in the history, the reference count corresponding to the first node is decremented by 1.
The method of claim 1, further comprising:

predicting a third node running after said first node;

Determine the prediction information corresponding to the third node, and execute at least part of the program segment of the second node; the prediction information corresponding to the third node carries the resources allocated for the third node, and the historical incoming parameters of the third node.
The method of claim 1, further comprising:

Acquiring a resource planning file configured by the user, the resource planning file recording the priority of resources used by multiple specified programs and/or the usage amount of resources;

The resource planning file is used to adjust the amount of resources allocated to the plurality of specified programs according to the priorities of the plurality of specified programs and/or the usage of resources.
The method of claim 1, further comprising:

Determine the actual associated program of the target program according to the actual running track of the target program;

comparing the actual associated program of the target program with the standard associated program corresponding to the target program;

If the actual associated program of the target program includes a non-standard associated program, the non-standard associated program is determined as a malicious program.
An information processing device, comprising:

an operation module, used to run the target program and record the actual running track of the target program; the actual running track includes the running sequence of each node on which the target program has run, and the parameters passed into each node; the The parameters of the nodes are the resources and resources required by each node;

a resource application acquisition module, configured to acquire a resource application issued when the target program runs a first node; the first node is any node in the target program;

A comparison module, configured to obtain prediction information corresponding to the first node in response to the resource application, where the prediction information carries the resources pre-allocated for the first node, and the historical input to the first node the parameters of a node;

an allocation module, configured to allocate the pre-allocated first node to the first node if the parameters passed to the first node and the historical parameters passed to the first node match the resources applied for by the first node Allocate the resource of the target program to the target program; otherwise, allocate the resource required by the first node to the target program according to the preset resource allocation logic.
An electronic device, comprising a memory and a processor;

the memory is used to store programs;

The processor is configured to execute the program stored in the memory, so as to implement each step of the information processing method according to any one of claims 1-7.
A computer-readable storage medium on which a program is stored, characterized in that, when the program is executed by a processor, each step of the information processing method according to any one of claims 1-7 is implemented.