WO2021135574A1 - Data storage method and apparatus, and terminal device - Google Patents

Abstract

A data storage method and apparatus, and a terminal device, applicable to the technical field of data processing. The data storage method comprises: receiving a data storage request, wherein the data storage request comprises a required storage space and a required storage speed (101); and in the case that the required storage speed is greater than a threshold, and a continuous space corresponding to the required storage space exists in an internal storage space, allocating, in the internal storage space, a corresponding first storage space for the data storage request, and in first allocation table information, recording that the first storage space is occupied (103). By allocating, for the data storage request having a required high storage speed, the corresponding storage space in the internal storage space, the present invention can fully use the internal storage space to increase the speed of accessing the storage space, thereby improving the data storage capability of a system, and making the system not be limited to the problem of a "memory wall".

Description

Data storage method, device and terminal equipment Technical field

This application belongs to the field of data processing technology, and particularly relates to data storage methods, devices, and terminal equipment.

Background technique

In the realization of artificial intelligence chips, based on the von Neumann architecture, the improvement of computing power is relatively easy to achieve relative to the improvement of data storage capacity. Among them, data storage is based on on-chip memory and off-chip memory. Data storage capacity refers to the ability of on-chip memory and off-chip memory to store data (such as storage speed, storage capacity, etc.). However, when the data storage capacity cannot match the computing power, the so-called von Neumann "bottleneck" or "memory wall" problem will be formed.

Technical solutions

In order to overcome the "memory wall" problem in related technologies, embodiments of the present application provide data storage methods, devices, and terminal equipment.

This application is realized through the following technical solutions:

In the first aspect, an embodiment of the present application provides a data storage method, including:

Receiving a data storage request, the data storage request including the required storage space and the required storage speed;

In the case where the required storage speed is greater than the threshold, and there is a continuous space corresponding to the required storage space in the internal storage space, allocate the corresponding first storage in the internal storage space for the data storage request And record in the first allocation table information that the first storage space has been occupied.

Optionally, the required storage speed includes the number of storage cycles and/or the storage space per cycle.

Optionally, the first storage space includes a first storage space identifier, a first storage start position, and a first storage end position, based on the first storage space identifier, the first storage start position, and the first storage end position Determine the first storage space mentioned above.

Optionally, the first storage space includes a first storage space identifier, a first storage start position, and a first storage end position, and it may be determined according to the first storage space identifier that the storage space required to be released by the data release request is internal In the storage space, the storage area in the internal storage space is determined according to the first storage start position and the first storage end position, and the determined storage area is released.

In the second aspect, an embodiment of the present application provides a data storage method, including:

Generating a data storage request, the data storage request including the required storage space and the required storage speed;

Sending the data storage request to the control terminal, where the data storage request is used to request the control terminal to allocate a target storage space according to the required storage space and the required storage speed;

Generating a data release request, where the data release request includes the target storage space;

The data release request is sent to the control terminal, and the data release request is used to request the control terminal to release the target storage space.

In a third aspect, an embodiment of the present application provides a data storage device, including:

The storage receiving module is configured to receive a data storage request, where the data storage request includes the required storage space and the required storage speed;

The first allocation module is configured to store the data in the internal storage space when the required storage speed is greater than a threshold and there is a continuous space corresponding to the required storage space in the internal storage space Request to allocate the corresponding first storage space, and record in the first allocation table information that the first storage space is occupied.

In a fourth aspect, an embodiment of the present application provides a data storage device, including:

The first generation module is configured to generate a data storage request, where the data storage request includes the required storage space and the required storage speed;

The first sending module is configured to send the data storage request to the control terminal, and the data storage request is used to request the control terminal to allocate a target storage space according to the required storage space and the required storage speed;

A second generation module, configured to generate a data release request, where the data release request includes the target storage space;

The second sending module is configured to send the data release request to the control terminal, and the data release request is used to request the control terminal to release the target storage space.

In a fifth aspect, an embodiment of the present application provides a terminal device, including a memory, a processor, and a computer program stored in the memory and running on the processor. When the processor executes the computer program, Implement the data storage method according to any one of the first aspect, or implement the data storage method according to the second aspect.

In a sixth aspect, an embodiment of the present application provides a computer-readable storage medium, the computer-readable storage medium stores a computer program, and when the computer program is executed by a processor, the computer program implements the process described in any one of the first aspects. Data storage method, or implement the data storage method as described in the second aspect.

In the seventh aspect, the embodiments of the present application provide a computer program product, which when the computer program product runs on a terminal device, causes the terminal device to execute the data storage method described in any one of the above-mentioned first aspects, or implement the data storage method as described in the first aspect. The data storage method described in the second aspect.

Compared with the prior art, the embodiments of this application have the following beneficial effects:

In the embodiment of the present application, when the required storage speed is greater than the threshold and there is a continuous space corresponding to the required storage space in the internal storage space, the first storage space corresponding to the data storage request is allocated in the internal storage space, that is, By allocating corresponding storage space in the internal storage space for data storage requests with higher storage speeds, so that the data with higher storage speeds can be stored quickly, thereby improving the data storage capacity, so that the data storage capacity It can match the computing power, so that the system will not be limited by the "memory wall" problem.

It should be understood that the above general description and the following detailed description are only exemplary and explanatory, and cannot limit this specification.

Description of the drawings

In order to more clearly describe the technical solutions in the embodiments of the present application, the following will briefly introduce the drawings needed in the description of the embodiments or the prior art. Obviously, the drawings in the following description are only of the present application. For some embodiments, for those of ordinary skill in the art, other drawings may be obtained based on these drawings without creative labor.

FIG. 1 is a schematic diagram of an application scenario of a data storage method provided by an embodiment of the present application;

FIG. 2 is a schematic flowchart of a data storage method provided by an embodiment of the present application;

FIG. 3 is a schematic flowchart of a data storage method provided by an embodiment of the present application;

FIG. 4 is a schematic flowchart of a data storage method provided by an embodiment of the present application;

FIG. 5 is a schematic diagram of the framework of a system to which the data storage method provided by an embodiment of the present application is applied

FIG. 6 is a schematic flowchart of a data storage method provided by an embodiment of the present application;

FIG. 7 is a schematic flowchart of a data storage method provided by an embodiment of the present application;

FIG. 8 is a schematic diagram of a working scenario of a data storage method provided by an embodiment of the present application;

FIG. 9 is a schematic diagram of a storage space allocation process provided by an embodiment of the present application;

FIG. 10 is a schematic flowchart of a data storage method provided by an embodiment of the present application;

FIG. 11 is a flow chart of data exchange between a requesting end and a controlling end provided by an embodiment of the present application;

FIG. 12 is a schematic structural diagram of a data storage device provided by an embodiment of the present application;

FIG. 13 is a schematic structural diagram of a data storage device provided by an embodiment of the present application;

FIG. 14 is a schematic structural diagram of a terminal device provided by an embodiment of the present application;

[Corrected according to Rule 91 02.02.2021]

Embodiments of the present invention

In the implementation of artificial intelligence chips, based on the von Neumann architecture, the improvement of computing power is relatively easy to achieve relative to the improvement of data storage capacity. If the data storage capacity cannot match the computing power, the so-called von Neumann architecture will be formed. Neumann's "bottleneck", or "memory wall" problem.

Among them, data storage is based on on-chip memory and off-chip memory. When data is stored in the above-mentioned on-chip memory and off-chip memory, data is usually stored in the entire off-chip memory and a fixed storage space in the on-chip memory. storage. Because the speed of storing data in the on-chip memory is faster than the speed of storing data in the off-chip memory, and only a part of the storage space in the on-chip memory is used for data storage, the utilization rate of the on-chip memory is low, resulting in data storage The overall speed is slow, which in turn causes the aforementioned "memory wall" problem.

Based on the above-mentioned "memory wall" problem, embodiments of the application provide a data storage method, device, and terminal device, which allocate the corresponding data storage request according to the required storage space and the required storage speed in the received data storage request storage. Specifically, when the required storage speed is greater than the threshold and there is a continuous space corresponding to the required storage space in the internal storage space, the corresponding storage space is allocated in the internal storage space for the data storage request; otherwise, the external storage space Allocate the corresponding storage space for the data storage request. The embodiment of the application allocates corresponding storage space in the internal storage space for data storage requests that require a high storage speed, and can make full use of the internal storage space to provide the required storage space for the data storage request, while accessing the internal storage space The speed is faster than the speed of accessing external storage space, so making full use of internal storage space can increase the speed of accessing storage space, thereby improving the data storage capacity of the system, so that the system will not be limited by the "memory wall" problem and the computing power cannot be fully utilized , And can reduce the demand for external storage space.

For example, the embodiments of the present application can be applied to the exemplary scenario shown in FIG. 1. In this scenario, the request end 10 may send the data storage request and the data release request to the control end 20. The control terminal 20 matches the corresponding storage space for each data storage request according to the required storage space and the required storage speed in the data storage request. Wherein, there is at least one requesting end 10, which may be one or multiple. Correspondingly, the requesting end 10 may generate at least one data storage request and send it to the control end 20, or multiple requesting ends 10 may generate respective data. After the storage requests are sent to the control terminal 20.

In the above scenario, the requester 10 may be a module in the terminal device that needs to apply for storage space, such as CPU (Central Processing Unit, central processing unit), DSP (Digital Signal Processing, digital signal processing unit), etc.; the control end 20 may be a control module in a terminal device. The above-mentioned terminal devices can be computers, tablets, laptops, netbooks, and personal digital assistants (personal digital assistants). Digital assistants, PDAs), smart phones and other terminal devices, the embodiments of this application do not impose any restrictions on the specific types of terminal devices.

In order to enable those skilled in the art to better understand the solutions of the present invention, the technical solutions in the embodiments of the present application will be described clearly and completely with reference to FIG. 1. Obviously, the described embodiments are only a part of the embodiments of the present invention. , Not all examples. Based on the embodiments of the present invention, all other embodiments obtained by those of ordinary skill in the art without creative work shall fall within the protection scope of the present invention.

FIG. 2 is a schematic flowchart of a data storage method provided by an embodiment of the present application. The data storage method may be applied to the control terminal. Referring to Figure 2, the details of the data storage method are as follows:

In step 101, a data storage request is received, where the data storage request includes a required storage space and a required storage speed.

The aforementioned data storage request may be a request generated by a module that needs to apply for storage space, such as a CPU, DSP, etc. in a terminal device. For example, when the aforementioned module needs to apply for storage space, it may first generate a data storage request including the required storage space and the required storage speed, and send it to the control terminal in the terminal device.

In this step, the aforementioned required storage space is used to characterize the size of the storage space required by the data storage request, and the aforementioned required storage speed is used to characterize the storage speed required to store the data corresponding to the data storage request, where The greater the required storage speed, the higher the storage requirement required for the data storage request, and the lower the required storage speed, the lower the storage requirement required for the data storage request.

Exemplarily, because the memory stores data in the form of cyclic cycles, the required storage speed may include the number of storage cycles. According to the required storage space and the number of storage cycles, the KBPC (Kilobyte byte) of the data storage request can be determined. per cycle, the storage space required for each storage cycle), when KBPC stores the data corresponding to the data storage request, the size of the storage space required for each storage cycle, where the larger the KBPC, the storage of the data The higher the storage speed required for storing the data corresponding to the request, and the smaller the KBPC, the lower the storage speed required for storing the data corresponding to the data storage request.

Among them, the storage speed of the internal storage space is faster than that of the external storage space, that is, the storage space that the internal storage space can provide in each storage cycle is greater than the storage space that the external storage space can provide in each storage cycle. It is understandable that the external storage space is generally larger than the internal storage space, but for storing a certain size of data, the number of storage cycles required by the external storage space is more than the number of storage cycles required by the internal storage space.

In addition, the required storage speed may also include the storage space KBPC required for each storage cycle, or the required storage speed may also include the number of storage cycles and the storage space KBPC required for each storage cycle. I limited it.

In step 103, in the case where the required storage speed is greater than the threshold, and there is a continuous space corresponding to the required storage space in the internal storage space, the data storage request is allocated a corresponding second in the internal storage space. A storage space, and record in the first allocation table information that the first storage space has been occupied.

Among them, the above-mentioned required storage speed is greater than the threshold value, indicating that the corresponding data storage request requires a higher storage requirement. Compared with the external storage space, the internal storage space does not depend on the bandwidth, so there will be a faster storage speed. Allocate storage space in the internal storage space for the data storage request. At this time, if there is also a continuous space corresponding to the aforementioned required storage space in the internal storage space, the storage space corresponding to the data storage request can be allocated in the internal storage space. In the embodiment of the present application, by assigning a storage space to the internal storage space for data storage by requesting a data storage request with a higher storage speed, the internal storage space can be fully utilized to store data with a higher storage speed. It only uses a fixed storage space in the internal storage space to store data, and the storage speed of the data that requires a larger storage speed in the internal storage space is faster than the storage speed in the external storage space, so it can greatly improve the data Storage capacity, so that the system will not be limited by the "memory wall" problem, and can reduce the demand for external storage space. In this step, the first allocation table information can be used to record the occupied storage space and available storage space in the internal storage space. After the first storage space is allocated for the data storage request, the first storage space can be recorded In the first allocation table information, before allocating storage space for other data storage requests in the future, the available storage space in the internal storage space is confirmed through the first allocation table information.

Exemplarily, the first storage space may include a first storage space identifier, a first storage start position, and a first storage end position, based on the first storage space identifier, first storage start position, and first storage end The location determines the above-mentioned first storage space. Wherein, the above-mentioned first storage space identifier represents internal storage space, for example, it can represent static random access memory (static random access memory). RAM, SRAM) corresponding storage space.

It should be noted that the above threshold can be set according to actual needs. The threshold can be different for different systems, and the threshold can be different for the same system in different time periods, which is not limited in the embodiment of the present application.

Referring to FIG. 3, based on the embodiment shown in FIG. 2, the foregoing data storage method may further include:

In step 105, in the case that the required storage speed is less than or equal to the threshold, or the continuous space corresponding to the required storage space does not exist in the internal storage space, the corresponding data storage request is allocated in the external storage space. Second storage space, and record in the second allocation table information that the second storage space has been occupied.

Among them, the above-mentioned required storage speed is less than the threshold value, indicating that the storage requirement of the corresponding data storage request is not high, and the internal storage space is relatively small compared with the external storage space, and the storage space is limited. Therefore, the external storage space can be allocated for the data storage request A storage space. The internal storage space is reserved for data storage requests that require a higher storage speed, so that while improving the utilization of the internal storage space, it is possible to use the internal storage space to store data with a higher storage speed as much as possible The data corresponding to the storage request can then improve the computing power of the system as much as possible. In this step, the second allocation table information can be used to record the occupied storage space and available storage space in the external storage space. After the second storage space is allocated for the data storage request, the second storage space can be recorded In the second allocation table information, before allocating storage space for other data storage requests, confirm the available storage space in the external storage space through the second allocation table information.

Exemplarily, the second storage space may include a second storage space identifier, a second storage start position, and a second storage end position, based on the second storage space identifier, second storage start position, and second storage end The location determines the above-mentioned second storage space. Wherein, the above-mentioned second storage space identifier represents an external storage space, for example, it can represent a double data rate synchronous dynamic random access memory (Double Data Rate SDRAM, DDR SDRAM) corresponding storage space.

Referring to FIG. 4, based on the embodiment shown in FIG. 2, after step 101, the above data storage method may further include:

In step 102, each received data storage request is pre-stored in the storage space application queue.

Wherein, before step 103 is executed, the above-mentioned data storage request is read from the above-mentioned storage space application queue.

In this embodiment, a storage space application queue is set up to store each data storage request sent by the requesting end, and the control end can read the data storage request from the storage space application queue before performing step 103. The control end needs to allocate storage space in real time to the received data storage request, reducing the processing pressure on the control end.

Exemplarily, the aforementioned storage space application queue may be a first-in-first-out queue, and the aforementioned data storage request read from the aforementioned storage space application queue may specifically be: the control terminal can apply for a queue from the storage space according to a first-in first-out rule. Read the data storage request in sequence, and then execute step 103.

Exemplarily, each data storage request may correspond to a priority, and the priority of each data storage request is not the same; the above-mentioned reading of the above-mentioned data storage request from the above-mentioned storage space application queue may specifically be: application according to the above-mentioned storage space In the order of priority of each data storage request in the queue, read each data storage request in turn, and execute step 103.

Specifically, the control terminal may first detect whether the storage space application queue is a non-empty queue, and if the storage space application queue is a non-empty queue, apply the queue from the storage space according to the first-in first-out rule or priority order. Read the data storage request in sequence in, and then execute step 103. In the case that the storage space application queue is empty, the subsequent steps do not need to be executed.

Referring to Figure 5, after the requesting end sends a data storage request to the control module (controller unit, CU), the control module CU pre-stores the data storage request in the storage space application queue; the control module CU reads from the storage space application queue in turn For a data storage request, storage space is allocated according to the required storage space and required storage speed of the data storage request, and a memory authorization is sent to the requesting end. Specifically, after the data storage request is allocated to a storage space in the internal storage space, the storage space is recorded in the first allocation table information, and after the data storage request is allocated to a storage space in the external storage space , And record the storage space in the second allocation table.

Exemplarily, the internal storage space may be on-chip storage space, for example, it may be the storage space of SRAM; the first allocation table information may be allocation table information corresponding to the on-chip storage space, for example, it may be allocation table information corresponding to SRAM .

In addition, PM (program memory) in Figure 5 is the instruction memory of the control module CU, and CM (controller unit data memory) is the data memory of the control module CU.

Referring to FIG. 6, based on the embodiment shown in FIG. 2, the foregoing data storage method may further include:

In step 107, a data release request is received, and the data release request includes a corresponding storage space.

Wherein, the aforementioned corresponding storage space may be the first storage space or the second storage space.

Specifically, after allocating the first storage space for the data storage request of the requesting side according to step 103, the requesting side may store the data generated by the task corresponding to the data storage request in the first storage space; after completing the above task , The requesting end may send a data release request requesting the control end to release the first storage space to the control end, so that the internal storage space can be released for other data storage requests in time.

After allocating the second storage space for the data storage request of the requesting end according to step 105, the requesting end can store the data generated by the task corresponding to the data storage request in the first storage space or the second storage space. ; After completing the above tasks, the requesting end can send to the control end a data release request requesting the control end to release the first storage space, so as to give up the internal storage space for other data storage requests in time, or the requesting end can send to the control end Request the control terminal to release the data release request of the second storage space, so as to promptly release the external storage space for other data storage requests.

It should be noted that in step 103, multiple data storage requests that meet the requirements in step 103 may be allocated corresponding first storage spaces, and in this step, each data release request may correspond to a first storage space. Similarly, in step 105, a plurality of data storage requests that meet the requirements in step 105 can be allocated corresponding second storage spaces, and in this step, each data release request can correspond to a second storage space.

In step 109, the corresponding storage space is released according to the data release request, and the storage space is not occupied in the corresponding allocation table information.

Wherein, the aforementioned corresponding allocation table information may be the first allocation table information or the second allocation table information. When the storage space in step 107 is the first storage space, the allocation table here is the first allocation table information; when the storage space in step 107 is the second storage space, the allocation table here is the second allocation table information.

In a possible implementation manner, the first storage space included in the data release request may be extracted, and then the data corresponding to the first storage space in the internal storage space may be released.

Specifically, the first storage space may include a first storage space identifier, a first storage start position, and a first storage end position. Therefore, it can be determined according to the first storage space identifier that the storage space required by the data release request is In the internal storage space, the storage area in the internal storage space is determined according to the first storage start position and the first storage end position, and finally the determined storage area is released.

In this step, after the data corresponding to the first storage space in the internal storage space is released, the release of the first storage space may be recorded in the first allocation table information, indicating that the first storage space is not occupied, It can be divided into storage space corresponding to other data storage requests again, so as to confirm the available storage space in the internal storage space through the first allocation table information before allocating storage space for other data storage requests.

In a possible implementation manner, the second storage space included in the data release request may also be extracted, and then the data corresponding to the second storage space in the external storage space may be released.

Specifically, the second storage space may include a second storage space identifier, a second storage start position, and a second storage end position. Therefore, it may be determined as an external storage space according to the second storage space identifier, and then according to the second storage space. The start position and the second storage end position determine the storage area in the external storage space, and finally release the determined storage area.

In this step, after the data corresponding to the second storage space in the external storage space is released, the release of the second storage space may be recorded in the second allocation table information, indicating that the second storage space is not occupied, It can be divided into storage space corresponding to other data storage requests again, so as to confirm the available storage space in the external storage space through the second allocation table information before allocating storage space for other data storage requests.

In some embodiments, based on the embodiment shown in FIG. 6, the foregoing data storage method may further include:

Pre-store each of the received data release requests in a storage space release queue;

The data release request is read from the storage space application queue, and step 109 is executed.

In this embodiment, a storage space release queue is set to store each data release request sent by the requesting end, and the control end can read the data release request from the storage space release queue before step 109 is executed. The control terminal needs to release the corresponding storage space in real time for the received data release request, and reduce the processing pressure of the control terminal.

Exemplarily, the foregoing storage space release queue may be a first-in first-out queue, and the foregoing reading of the data release request from the storage space release queue may specifically be: the control terminal may access the storage space according to a first-in first-out rule. The data release request is read in the release queue in sequence, and then step 109 is executed.

Exemplarily, each data release request may also correspond to a priority, and the priority of each data release request is not the same; the foregoing reading of the data release request from the storage space release queue may specifically be: In the order of priority of each data release request in the storage space release queue, read each data release request in turn, and execute step 109.

Specifically, the control terminal may first detect whether the storage space release queue is a non-empty queue, and if the storage space release queue is a non-empty queue, release the queue from the storage space according to the first-in first-out rule or priority order. Read the data release request in sequence in, and then execute step 109; and in the case that the storage space release queue is an empty queue, the subsequent steps do not need to be executed.

Referring to Figure 5, after the requesting end sends a data release request to the control module CU, the control module CU pre-stores the data release request in the storage space release queue; the control module CU reads the data release request sequentially from the storage space release queue, which is The requesting end sends a memory authorization and releases the storage space included in the read data release request. Specifically, after the first storage space corresponding to the data release request is released, it may be recorded in the first allocation table information that the first storage space is not occupied, and the second storage space corresponding to the data release request may be released. Afterwards, it is recorded in the second allocation table that the second storage space is not occupied.

In some embodiments, the required storage space may include a work storage space and a result storage space, and the data storage request may include at least one prior data storage request and a subsequent data storage request; wherein, the prior data storage request The data stored in the result storage space of the storage request is the data required for the data storage work corresponding to the subsequent data storage request.

Referring to FIG. 7, the foregoing data storage method may further include:

In step 201, the first data release request sent by the requesting end after the data storage work corresponding to the previous data request is completed is received.

In step 202, the working storage space corresponding to the previous data storage request is released according to the first data release request.

In step 203, after the data storage work corresponding to the subsequent data request is completed, a second data release request is received.

In step 204, according to the second data release request, the result storage space corresponding to the previous data storage request and the working storage space corresponding to the subsequent data storage request are combined.

Wherein, the second data release request may be issued by the requesting end, may also be issued by the control end, or may also be issued by other devices, which is not limited in the embodiment of the present application.

Exemplarily, the embodiment shown in FIG. 7 is described by taking CPU, DSP, and NN0 as examples. Figure 8 is a schematic diagram of a working scenario taking CPU, DSP and NN0 as an example. In this embodiment, the task chain is that the CPU works first, and then sends the first output result to the DSP. The DSP continues to work based on the first output result. After completion, the second output result is given to NN0, and NN0 will complete the subsequent work.

First, at time T1, the CPU needs to apply for a CPU working storage space for the task it is responsible for, and a CPU result storage space for the first output result, then the CPU generates two data storage requests and sends it to the control end. The control end allocates a CPU working storage space and a CPU result storage space to the CPU according to the two data storage requests. The first output result generated after the CPU work is completed is stored in the CPU result storage space, and then the CPU working storage space release request can be sent to the control end, and the DSP is notified to start working. The control terminal releases the CPU working storage space according to the CPU working storage space release request.

The DSP applies for a DSP working storage space for the task it is responsible for, and applies for a DSP result storage space for the second output result, then the DSP generates two data storage requests and sends it to the control end. The control end allocates a DSP working storage space and a DSP result storage space for the DSP according to the two data storage requests. After the DSP completes the work based on the first output result stored in the CPU result storage space, it generates the second output result and stores it in the DSP result storage space, and then can send the DSP work storage space release request and the CPU result storage space release request to the control end, and Notify NN0 to start work. The control end releases the DSP working storage space and the CPU result storage space according to the DSP working storage space release request.

NN0 applies for a piece of NN0 working storage space for the task it is responsible for, and a piece of NN0 result storage space for the third output result, then NN0 generates two data storage requests and sends it to the control end. The control end allocates a NN0 working storage space and a NN0 result storage space for NN0 according to the two data storage requests. After NN0 completes its work based on the second output result stored in the DSP result storage space, it generates a third output result and stores it in the NN0 result storage space. Among them, after NN0 completes the work, the entire work task chain is completed, and then the DSP result storage space release request and NN0 working storage space release request can be sent to the control end, and the CPU data storage work is completed. The control end releases the DSP working storage space and the NN0 working storage space according to the DSP working storage space release request and the NN0 working storage space release request.

In addition, after the CPU knows that the data storage work has been completed, it can send the NN0 result storage space release request to the control end; the control end releases the NN0 result storage space according to the NN0 result storage space release request.

Figure 9 is a schematic diagram of a storage space allocation process provided by an embodiment of this application. See Figure 9. The filled part represents the storage space authorized to be allocated, that is, the occupied storage space, and the unfilled part represents the temporarily unused storage space, that is, The storage space that can be allocated.

The foregoing allocating the corresponding first storage space for the data storage request in the internal storage space may include:

Step A1: Obtain the available continuous storage area in the internal storage space in the order of the storage addresses of the internal storage space, and detect whether the size of the obtained available continuous storage area can meet the size of the storage space required in the data storage request;

Step B1, in the case where the size of the available continuous storage area can meet the size of the storage space required in the data storage request, allocate the first storage space in the available continuous storage area for the data storage request;

Step C1, in the case that the size of the available continuous storage area cannot meet the size of the storage space required in the data storage request, obtain the next available continuous storage area in the internal storage space, and execute the detection in step A1 to obtain The step of whether the size of the available continuous storage area can meet the size of the storage space required in the data storage request;

Wherein, when there is no available continuous storage area in the internal storage space that can allocate the first storage space for the data storage request, wait for the data release request, and after executing a data release request, continue to execute A1 to step C1.

The foregoing allocating the corresponding second storage space for the data storage request in the external storage space may include:

Step A2: Obtain the available continuous storage area in the external storage space in the order of the storage addresses of the external storage space, and detect whether the size of the obtained available continuous storage area can meet the size of the storage space required in the data storage request;

Step B2, when the size of the available continuous storage area can meet the size of the storage space required in the data storage request, allocate a second storage space in the available continuous storage area for the data storage request;

Step C2, in the case that the size of the available continuous storage area cannot meet the size of the storage space required in the data storage request, obtain the next available continuous storage area in the external storage space, and perform the detection in step A2 to obtain The step of whether the size of the available continuous storage area can meet the size of the storage space required in the data storage request;

Wherein, in the case that there is no available continuous storage area in the external storage space that can allocate a second storage space for the data storage request, wait for the data release request, and after executing a data release request, continue to execute A2 to step C2.

Specifically, at the time of initialization, the entire storage space {0,1024} totaling 1024KB is to be allocated; the storage space can be internal storage space or external storage space, which is not limited in the embodiment of this application ；

At time T0, module 1 applies for 100KB of storage space, and the control end allocates 100KB of storage space for the application of module 1, such as {0,100}. In the schematic diagram of the corresponding storage space at time T1, the 100KB of storage space is filled ；

At time T1, module 2 applies for 250KB of storage space. Since the remaining storage space of the storage space is sufficient, 250KB of storage space is allocated for the application of module 2. The storage space of module 2 can be the same as the 100KB storage space of module 1. Next, for example {101,350}; in the schematic diagram of the storage space corresponding to time T2, the 250KB storage space is filled;

At T2, module 3 applies for 195KB of storage space. Since the remaining storage space of the storage space is sufficient, 195KB of storage space is allocated for the application of module 3. The storage space of module 3 can be the same as that of module 2’s 250KB storage space. Next, for example {351,545}; in the schematic diagram of the storage space corresponding to time T3, the 195KB storage space is filled;

At time T3, the 250KB of storage space requested by module 2 is released by module 2, and the 250KB of storage space is recorded as a released state (unfilled state, see the schematic diagram of storage space at T4);

At T4, module 4 applies for 261KB of storage space. Since the 250KB of storage space released at T3 does not meet the 261KB of storage space requested by module 4, module 4 is allocated 261KB of storage space after 195KB of storage space allocated for module 3 Storage space, for example {546,806}; in the schematic diagram of the storage space corresponding to time T2, the 261KB storage space is filled;

At time T5, the 195KB of storage space requested by module 3 is released by module 3, and the 195KB of storage space is recorded as a released state; in the schematic diagram of the corresponding storage space at time T6, the 95KB of storage space is in an unfilled state;

In the schematic diagram of the storage space corresponding to time T6, the storage areas corresponding to 445KB and 218KB can allocate storage space for other data storage requests.

In this embodiment, allocating a continuous storage space for a data storage request is convenient for data storage and reading, and is simple to implement; releasing unused storage space according to the data release request can provide storage space for other data storage requests in time, improving Utilization of storage space.

FIG. 10 is a schematic flowchart of a data storage method provided by an embodiment of the present application. The data storage method may be applied to the requesting end. 10, the details of the data storage method are as follows:

In step 301, a data storage request is generated, and the data storage request includes the required storage space and the required storage speed.

The aforementioned data storage request may be a request generated by a module that needs to apply for storage space, for example, a CPU, DSP, etc. in a terminal device. For example, when the aforementioned module needs to apply for storage space, it may first generate a data storage request including the required storage space and the required storage speed, and send it to the control terminal in the terminal device.

In this step, the aforementioned required storage space is used to characterize the size of the storage space required by the data storage request, and the aforementioned required storage speed is used to characterize the storage speed required to store the data corresponding to the data storage request, where The greater the required storage speed, the higher the storage requirement required for the data storage request, and the lower the required storage speed, the lower the storage requirement required for the data storage request.

Exemplarily, because the memory stores data in the form of cyclic cycles, the required storage speed may include the number of storage cycles. According to the required storage space and the number of storage cycles, the KBPC of the data storage requirement can be determined, and KBPC is the right When the data corresponding to the data storage request is stored, the size of the storage space required for each storage cycle. The larger the KBPC, the higher the storage requirement for storing the data corresponding to the data storage request, and the smaller the KBPC. It indicates that the storage requirement required for storing the data corresponding to the data storage request is lower.

Among them, the storage speed of the internal storage space is faster than that of the external storage space, that is, the storage space that the internal storage space can provide in each storage cycle is greater than the storage space that the external storage space can provide in each storage cycle. It is understandable that the external storage space is generally larger than the internal storage space, but for storing a certain size of data, the number of storage cycles required by the external storage space is more than the number of storage cycles required by the internal storage space.

In addition, the required storage speed may also include the storage space per cycle, or the required storage speed may also include the number of storage cycles and the storage space per cycle, which is not limited in the embodiment of the present application.

In step 302, the data storage request is sent to the control terminal, and the data storage request is used to request the control terminal to allocate a target storage space according to the required storage space and the required storage speed.

Wherein, the control terminal allocates the target storage space according to the required storage space and the required storage speed. This step will not be described in detail. For the specific process, please refer to the relevant content in the aforementioned embodiment of the data storage method applied to the control terminal.

It should be noted that the target storage space in this step can include the aforementioned first storage space, can also include the aforementioned second storage space, or can also include the aforementioned first storage space and second storage space. There is no restriction on this.

In step 303, a data release request is generated, and the data release request includes the target storage space.

Among them, after the control end allocates the target storage space for the data storage request of the requesting end, the requesting end may store the data generated by the task corresponding to the data storage request in the target storage space; after completing the above task, the requesting end may Send a data release request to the control terminal requesting the control terminal to release the target storage space, so as to make storage space for other data storage requests in a timely manner.

In step 304, the data release request is sent to the control terminal, and the data release request is used to request the control terminal to release the target storage space.

Wherein, the control terminal releases the corresponding storage space process according to the foregoing target storage space, which is not described in detail in this step. For the specific process, please refer to the relevant content in the foregoing embodiment of the data storage method applied to the control terminal.

In the above data storage method, when the required storage speed is greater than the threshold and there is a continuous space corresponding to the required storage space in the internal storage space, the corresponding storage space is allocated to the data storage request in the internal storage space; otherwise, the external storage space is allocated. In the storage space, the corresponding storage space is allocated for data storage requests. By allocating a storage space in the internal storage space for data storage for data storage requests that require a higher storage speed, the internal storage space can be fully utilized to reduce the required storage speed. Large data is stored, not just using a fixed storage space in the internal storage space to store data, and the storage speed of the data that requires a larger storage speed in the internal storage space is faster than the storage speed in the external storage space Therefore, it can greatly improve the data storage capacity, so that the system will not be limited by the "memory wall" problem, and can reduce the demand for external storage space.

Fig. 11 is a flow chart of data exchange between the control end and the request end provided by an embodiment of the present application. With reference to Fig. 11, the data exchange process is described in detail as follows:

In step 401, the requesting end generates a data storage request, and the data storage request includes the required storage space and the required storage speed;

In step 402, the requesting end sends the data storage request to the control end; wherein, the requesting end may generate at least one data storage request and send it to the control end, or multiple requesting ends may generate each data storage request and send it all To the control end

In step 403, the control terminal pre-stores each received data storage request into the storage space application queue;

In step 404, the control terminal reads the data storage request from the storage space application queue;

In step 405, when the required storage speed is greater than the threshold and there is a continuous space corresponding to the required storage space in the internal storage space, the control terminal allocates the first storage space corresponding to the data storage request in the internal storage space, And record in the first allocation table information that the first storage space has been occupied;

In step 406, when the required storage speed is less than or equal to the threshold, or the internal storage space does not have a continuous space corresponding to the required storage space, the control terminal allocates a second storage space corresponding to the data storage request in the external storage space. , And record in the second allocation table information that the second storage space has been occupied;

In step 407, the requesting end generates a data release request, and the data release request includes the target storage space;

In step 408, the requesting end sends a data release request to the control end; wherein, the requesting end can generate at least one data release request and send it to the control end, or multiple request ends can generate their own data release request and then send it to the control end. end;

In step 409, the control terminal prestores each of the received data release requests into the storage space release queue;

In step 410, the control terminal reads the data release request from the storage space release queue;

In step 411, the control terminal releases the corresponding first storage space according to the data release request, and records in the first allocation table information that the first storage space is not occupied, or releases the corresponding second storage space, and The second allocation table information records the illegal occupation of the second storage space.

It should be understood that the size of the sequence number of each step in the foregoing embodiment does not mean the order of execution, and the execution sequence of each process should be determined by its function and internal logic, and should not constitute any limitation to the implementation process of the embodiment of the present application.

Corresponding to the data storage method applied to the control terminal described in the above embodiment, FIG. 12 shows a structural block diagram of the data storage device provided in an embodiment of the present application. The data storage device can be used for the control terminal. For ease of description, only The parts related to the embodiments of the present application are shown.

Referring to FIG. 12, the data storage device in the embodiment of the present application may include a receiving module 501 and a first distribution module 502.

Wherein, the receiving module 501 is configured to receive a data storage request, where the data storage request includes a required storage space and a required storage speed;

The first allocation module 502 is configured to: when the required storage speed is greater than a threshold and there is a continuous space corresponding to the required storage space in the internal storage space, the internal storage space is the data storage Request to allocate the corresponding first storage space, and record in the first allocation table information that the first storage space is occupied.

In some embodiments, based on the data storage device shown in FIG. 8, the foregoing device may further include:

The first allocation module 503 is configured to: when the required storage speed is less than or equal to a threshold, or the internal storage space does not have a continuous space corresponding to the required storage space, the external storage space is the data The storage request allocates the corresponding second storage space, and records in the second allocation table information that the second storage space is occupied.

In some embodiments, based on the data storage device shown in FIG. 12, the foregoing device may further include:

The application queue storage module is used to pre-store each of the received data storage requests in a storage space application queue, and read the data from the storage space application queue before allocating storage space to the data storage request Storage request.

In some embodiments, based on the data storage device shown in FIG. 12, the foregoing device may further include:

A first release receiving module, configured to receive a data release request, where the data release request includes the corresponding first storage space;

The first release module is configured to release the corresponding first storage space according to the data release request, and record in the first allocation table information that the first storage space is not occupied.

In some embodiments, based on the data storage device shown in FIG. 12, the foregoing device may further include:

A second release receiving module, configured to receive a data release request, where the data release request includes a corresponding second storage space;

The second release module is configured to release the corresponding second storage space according to the data release request, and record in the second allocation table information that the second storage space is not occupied.

In some embodiments, based on the data storage device shown in FIG. 12, the foregoing device may further include:

The release queue storage module is used to pre-store each of the received data release requests in the storage space release queue;

A release reading module, configured to read the data storage request from the storage space application queue;

After the release reading module reads the verse release request, the first release module executes the release of the corresponding first storage space according to the data release request, and stores the information in the first allocation table. Recording in the first storage space is not occupied.

In some embodiments, the required storage space includes a working storage space and a result storage space, and the data storage request includes at least one prior data storage request and a subsequent data storage request; wherein, the prior data storage request The data stored in the result storage space is the data required for the data storage work corresponding to the subsequent data storage request. Based on the data storage device shown in FIG. 12, the foregoing device may further include:

The third release receiving module is configured to receive the first data release request sent by the requesting end after the data storage work corresponding to the previous data request is completed;

The third release module is configured to release the working storage space corresponding to the previous data storage request according to the first data release request;

A fourth release receiving module, configured to receive a second data release request sent by the requesting end after the data storage work corresponding to the subsequent data request is completed;

The fourth release module is configured to release the result storage space corresponding to the previous data storage request and the working storage space corresponding to the subsequent data storage request according to the second data release request.

Corresponding to the data storage method applied to the requesting side described in the above embodiment, FIG. 13 shows a structural block diagram of the data storage device provided by the embodiment of the present application. The data storage device can be used for the requesting side. For ease of description, only The parts related to the embodiments of the present application are shown.

Referring to FIG. 13, the data storage device in the embodiment of the present application may include a first generating module 601, a first sending module 602, a second generating module 603, and a second sending module 604.

Wherein, the first generation module 601 is configured to generate a data storage request, where the data storage request includes a required storage space and a required storage speed;

The first sending module 602 is configured to send the data storage request to the control terminal, where the data storage request is used to request the control terminal to allocate a target storage space according to the required storage space and the required storage speed;

The second generating module 603 is configured to generate a data release request, where the data release request includes the target storage space;

The second sending module 604 is configured to send the data release request to the control terminal, and the data release request is used to request the control terminal to release the target storage space.

It should be noted that the information interaction and execution process between the above-mentioned devices/units are based on the same concept as the method embodiment of this application, and its specific functions and technical effects can be found in the method embodiment section. I won't repeat it here.

Those skilled in the art can clearly understand that for the convenience and conciseness of description, only the division of the above functional units and modules is used as an example. In practical applications, the above functions can be allocated to different functional units and modules as required. Module completion, that is, the internal structure of the device is divided into different functional units or modules to complete all or part of the functions described above. The functional units and modules in the embodiments can be integrated into one processing unit, or each unit can exist alone physically, or two or more units can be integrated into one unit. The above-mentioned integrated units can be hardware-based Formal realization can also be realized in the form of a software functional unit. In addition, the specific names of the functional units and modules are only for the convenience of distinguishing each other, and are not used to limit the protection scope of the present application. For the specific working process of the units and modules in the foregoing system, reference may be made to the corresponding process in the foregoing method embodiment, which will not be repeated here.

An embodiment of the present application also provides a terminal device. Referring to FIG. 14, the terminal device 700 may include: at least one processor 710, a memory 720, and is stored in the memory 720 and can be stored on the at least one processor 710. A running computer program, when the processor 710 executes the computer program, the steps in any of the foregoing method embodiments are implemented, such as steps 101 to 103 in the embodiment shown in FIG. 2, for example, in the embodiment shown in FIG.的Steps 301 to 304. Alternatively, when the processor 710 executes the computer program, the functions of the modules/units in the foregoing device embodiments are implemented, for example, the functions of the modules 501 to 502 shown in FIG. 12, for example, the functions of the modules 601 to 604 shown in FIG.

Exemplarily, the computer program may be divided into one or more modules/units, and one or more modules/units are stored in the memory 720 and executed by the processor 710 to complete the application. The one or more modules/units may be a series of computer program segments capable of completing specific functions, and the program segments are used to describe the execution process of the computer program in the terminal device 700.

Those skilled in the art can understand that FIG. 14 is only an example of a terminal device, and does not constitute a limitation on the terminal device. It may include more or less components than those shown in the figure, or a combination of certain components, or different components, such as Input and output equipment, network access equipment, bus, etc.

The processor 710 may be a central processing unit (Central Processing Unit, CPU), it can also be other general processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), ready-made programmable gate array (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or the processor may also be any conventional processor or the like.

The memory 720 may be an internal storage unit of the terminal device, or an external storage device of the terminal device, such as a plug-in hard disk, a smart memory card (Smart Media Card, SMC), Secure Digital (Secure Digital, SD) card, flash memory card (Flash Card) and so on. The memory 720 is used to store the computer program and other programs and data required by the terminal device. The memory 720 can also be used to temporarily store data that has been output or will be output.

The bus can be an industry standard architecture (Industry Standard Architecture, ISA) bus, peripheral device interconnection (Peripheral Component, PCI) bus or extended industry standard architecture (Extended Industry Standard Architecture, EISA) bus, etc. The bus can be divided into address bus, data bus, control bus and so on. For ease of representation, the buses in the drawings of this application are not limited to only one bus or one type of bus.

The data storage method provided in the embodiments of this application can be applied to smart phones, computers, tablet computers, notebook computers, netbooks, and personal digital assistants (personal digital assistants). On terminal devices such as digital assistants, PDAs, etc., the embodiments of this application do not impose any restrictions on the specific types of terminal devices.

Take the terminal device as a computer as an example. FIG. 15 shows a block diagram of a part of the structure of a computer provided in an embodiment of the present application. 15, the computer includes: a communication circuit 810, a memory 820, an input unit 830, a display unit 840, an audio circuit 850, wireless fidelity (wireless fidelity) fidelity, WiFi) module 860, processor 870, power supply 880 and other components. Those skilled in the art can understand that the computer structure shown in FIG. 15 does not constitute a limitation on the computer, and may include more or less components than those shown in the figure, or a combination of certain components, or different component arrangements.

The following is a detailed introduction to the various components of the computer in conjunction with Figure 15:

The communication circuit 810 may be used for receiving and sending signals during information transmission and reception or during a call, and processing them to the processor 870; in addition, sending an image acquisition instruction to the image acquisition device. Generally, the communication circuit includes but is not limited to an antenna, at least one amplifier, a transceiver, a coupler, and a low noise amplifier (Low Noise Amplifier). Noise Amplifier, LNA), duplexer, etc. In addition, the communication circuit 810 may also communicate with the network and other devices through wireless communication. The above-mentioned wireless communication can use any communication standard or protocol, including but not limited to the Global System for Mobile Communications (Global System of Mobile communication (GSM), General Packet Radio Service (GPRS), Code Division Multiple Access (Code Division Multiple Access) Multiple Access, CDMA), Wideband Code Division Multiple Access (WCDMA), Long Term Evolution (LTE), E-mail, Short Message Service (Short Messaging Service, SMS) etc.

The memory 820 may be used to store software programs and modules. The processor 870 executes various functional applications and data processing of the computer by running the software programs and modules stored in the memory 820. The memory 820 may mainly include a program storage area and a data storage area. The program storage area may store an operating system, an application program required by at least one function (such as a sound playback function, an image playback function, etc.), etc.; Data created by the use of the computer (such as audio data, phone book, etc.), etc. In addition, the memory 820 may include a high-speed random access memory, and may also include a non-volatile memory, such as at least one magnetic disk storage device, a flash memory device, or other volatile solid-state storage devices.

The input unit 830 can be used to receive inputted number or character information, and generate key signal input related to user settings and function control of the computer. Specifically, the input unit 830 may include a touch panel 831 and other input devices 832. The touch panel 831, also known as the touch screen, can collect the user's touch operations on or near it (for example, the user uses any suitable objects or accessories such as fingers, stylus, etc.) on the touch panel 831 or near the touch panel 831. Operation), and drive the corresponding connection device according to the preset program. Optionally, the touch panel 831 may include two parts: a touch detection device and a touch controller. Among them, the touch detection device detects the user's touch position, detects the signal brought by the touch operation, and transmits the signal to the touch controller; the touch controller receives the touch information from the touch detection device, converts it into contact coordinates, and then sends it To the processor 870, and can receive and execute the commands sent by the processor 870. In addition, the touch panel 831 can be implemented in multiple types such as resistive, capacitive, infrared, and surface acoustic wave. In addition to the touch panel 831, the input unit 830 may also include other input devices 832. Specifically, the other input device 832 may include, but is not limited to, one or more of a physical keyboard, function keys (such as a volume control button, a switch button, etc.), a trackball, a mouse, and a joystick.

The display unit 840 may be used to display information input by the user or information provided to the user and various menus of the computer. The display unit 840 may include a display panel 841. Optionally, a liquid crystal display (Liquid Crystal Display, LCD), Organic Light Emitting Diode (Organic The display panel 841 is configured in the form of Light-Emitting Diode, OLED). Further, the touch panel 831 can cover the display panel 841. When the touch panel 831 detects a touch operation on or near it, it transmits it to the processor 870 to determine the type of the touch event, and then the processor 870 determines the type of the touch event. The type provides corresponding visual output on the display panel 841. Although in FIG. 15, the touch panel 831 and the display panel 841 are used as two independent components to realize the input and input functions of the computer, but in some embodiments, the touch panel 831 and the display panel 841 may be integrated. Realize the computer's input and output functions.

The audio circuit 850 can provide an audio interface between the user and the computer. The audio circuit 850 can transmit the electric signal after the conversion of the received audio data to the speaker, which is converted into a sound signal for output by the speaker; on the other hand, the microphone converts the collected sound signal into an electric signal, which is converted into an electric signal after being received by the audio circuit 850 The audio data is processed by the audio data output processor 870, and then sent to, for example, another computer through the communication circuit 810, or the audio data is output to the memory 820 for further processing.

WiFi is a short-distance wireless transmission technology. The computer can help users send and receive emails, browse web pages, and access streaming media through the WiFi module 860. It provides users with wireless broadband Internet access. Although FIG. 15 shows the WiFi module 860, it is understandable that it is not a necessary component of the computer and can be omitted as needed without changing the essence of the invention.

The processor 870 is the control center of the computer. It uses various interfaces and lines to connect various parts of the entire computer. It executes by running or executing software programs and/or modules stored in the memory 820 and calling data stored in the memory 820. Various functions of the computer and processing data, so as to monitor the computer as a whole. Optionally, the processor 870 may include one or more processing units; preferably, the processor 870 may integrate an application processor and a modem processor, where the application processor mainly processes the operating system, user interface, application programs, etc. , The modem processor mainly deals with wireless communication. It can be understood that the foregoing modem processor may not be integrated into the processor 870.

The computer also includes a power supply 880 (such as a battery) for supplying power to various components. Preferably, the power supply 880 can be logically connected to the processor 870 through a power management system, so that functions such as charging, discharging, and power consumption management can be managed through the power management system.

The embodiments of the present application also provide a computer-readable storage medium that stores a computer program, and when the computer program is executed by a processor, the steps in each embodiment of the foregoing data storage method can be realized.

The embodiments of the present application provide a computer program product. When the computer program product runs on a mobile terminal, the steps in each embodiment of the above data storage method can be realized when the mobile terminal is executed.

If the integrated unit is implemented in the form of a software functional unit and sold or used as an independent product, it can be stored in a computer readable storage medium. Based on this understanding, the implementation of all or part of the processes in the above-mentioned embodiment methods in this application can be accomplished by instructing relevant hardware through a computer program. The computer program can be stored in a computer-readable storage medium. The computer program can be stored in a computer-readable storage medium. When executed by the processor, the steps of the foregoing method embodiments can be implemented. Wherein, the computer program includes computer program code, and the computer program code may be in the form of source code, object code, executable file, or some intermediate forms. The computer-readable medium may at least include: any entity or device capable of carrying the computer program code to the photographing device/terminal device, recording medium, computer memory, read-only memory (ROM, Read-Only Memory), random access memory (RAM, Random Access Memory), electrical carrier signals, telecommunications signals, and software distribution media. Such as U disk, mobile hard disk, floppy disk or CD-ROM, etc. In some jurisdictions, according to legislation and patent practices, computer-readable media cannot be electrical carrier signals and telecommunication signals.

A person of ordinary skill in the art may realize that the units and algorithm steps of the examples described in combination with the embodiments disclosed herein can be implemented by electronic hardware or a combination of computer software and electronic hardware. Whether these functions are executed by hardware or software depends on the specific application and design constraint conditions of the technical solution. Professionals and technicians can use different methods for each specific application to implement the described functions, but such implementation should not be considered beyond the scope of this application.

Claims (10)

1. A data storage method, characterized in that it comprises:

   Receiving a data storage request, the data storage request including the required storage space and the required storage speed;

   In the case where the required storage speed is greater than the threshold, and there is a continuous space corresponding to the required storage space in the internal storage space, allocate the corresponding first storage in the internal storage space for the data storage request And record in the first allocation table information that the first storage space has been occupied.
2. The data storage method according to claim 1, wherein the method further comprises:

   In the case that the required storage speed is less than or equal to the threshold, or there is no continuous space corresponding to the required storage space in the internal storage space, the data storage request is allocated a corresponding first in the external storage space. 2. storage space, and record in the second allocation table information that the second storage space has been occupied.
3. 3. The data storage method according to claim 1 or 2, wherein after said receiving the data storage request, the method further comprises:

   Pre-store each of the received data storage requests in a storage space application queue, and before allocating storage space to the data storage request, read the data storage request from the storage space application queue.
4. The data storage method according to claim 1 or 2, wherein the method further comprises:

   Receiving a data release request, where the data release request includes a corresponding storage space;

   According to the data release request, release the corresponding storage space, and record in the corresponding allocation table information that the storage space is not occupied.
5. The data storage method according to claim 4, wherein after the receiving the data release request, the method further comprises:

   Pre-store each of the received data release requests in a storage space release queue;

   Read the data release request from the storage space application queue, and execute the corresponding storage space according to the data release request, and record that the storage space is not occupied in the corresponding allocation table information A step of.
6. The data storage method according to claim 1, wherein the required storage space includes a working storage space and a result storage space, and the data storage request includes at least one prior data storage request and a subsequent data storage request Wherein, the data stored in the storage space of the result of the previous data storage request is the data required for the data storage work corresponding to the subsequent data storage request;

   The method also includes:

   Receiving the first data release request sent by the requesting end after the data storage work corresponding to the previous data request is completed;

   According to the first data release request, release the working storage space corresponding to the previous data storage request;

   After the data storage work corresponding to the subsequent data request is completed, receiving a second data release request;

   According to the second data release request, the result storage space corresponding to the previous data storage request and the working storage space corresponding to the subsequent data storage request are combined.
7. A data storage method, characterized in that it comprises:

   Generating a data storage request, the data storage request including the required storage space and the required storage speed;

   Sending the data storage request to the control terminal, where the data storage request is used to request the control terminal to allocate a target storage space according to the required storage space and the required storage speed;

   Generating a data release request, where the data release request includes the target storage space;

   The data release request is sent to the control terminal, and the data release request is used to request the control terminal to release the target storage space.
8. A data storage device is characterized in that it comprises:

   The storage receiving module is configured to receive a data storage request, where the data storage request includes the required storage space and the required storage speed;

   The first allocation module is configured to store the data in the internal storage space when the required storage speed is greater than a threshold and there is a continuous space corresponding to the required storage space in the internal storage space Request to allocate the corresponding first storage space, and record in the first allocation table information that the first storage space is occupied.
9. A data storage device is characterized in that it comprises:

   The first generation module is configured to generate a data storage request, where the data storage request includes the required storage space and the required storage speed;

   The first sending module is configured to send the data storage request to the control terminal, and the data storage request is used to request the control terminal to allocate a target storage space according to the required storage space and the required storage speed;

   A second generation module, configured to generate a data release request, where the data release request includes the target storage space;

   The second sending module is configured to send the data release request to the control terminal, and the data release request is used to request the control terminal to release the target storage space.
10. A terminal device, comprising a memory, a processor, and a computer program stored in the memory and capable of running on the processor, wherein the processor executes the computer program as claimed in claims 1 to 7. The method of any one.