WO2021254330A1

WO2021254330A1 - Memory management method and system, client, server and storage medium

Info

Publication number: WO2021254330A1
Application number: PCT/CN2021/100120
Authority: WO
Inventors: 金浩; 屠要峰; 韩银俊; 郭斌; 高洪
Original assignee: 中兴通讯股份有限公司
Priority date: 2020-06-19
Filing date: 2021-06-15
Publication date: 2021-12-23
Also published as: CN113485822A

Abstract

The present application discloses a memory management method and system, a client, a server and a storage medium, belonging to the field of communication technologies. Said method comprises: acquiring memory information corresponding to a memory allocated to a client by a server; creating, on the basis of the memory information, a queue for recording memory states; and when data exchange between the client and the server is changed, updating the memory state in the queue. Thus, a client is enabled to monitor the memory state of an allocated memory, and update a memory state in a queue in a timely manner when data exchange is changed, so as to effectively monitor the memory state without the need to request for a memory from the server frequently, thereby improving the efficiency of data transmission and the convenience of address management.

Description

Memory management method, system, client, server and storage medium

Cross-references to related applications

This application is based on the Chinese patent application CN202010568853.0 with the title of "Memory Management Method, System, Client, Server, and Storage Medium" filed on June 19, 2020, and claims the priority of the patent application, which is incorporated by reference The contents disclosed are all incorporated into this application.

Technical field

This application relates to the field of communication technology, and specifically relates to a memory management method, system, client, server, and storage medium.

Background technique

Remote Direct Memory Access (RDMA) is a network transmission technology that directly accesses the storage space of a remote node. It quickly transmits data from one end to the storage space of the other end, bypassing the operating system kernel protocol stack. Without occupying the resources of the central processing unit (CPU) of the node, the data transmission performance can be significantly improved. RDMA technology has been applied to various business scenarios, especially distributed storage systems that require very high bandwidth and delay. Using RDMA networks to transmit big data can give full play to the high performance of new hardware.

In the prior art, in the process of RDMA data transmission, first, the client initiates a memory allocation request to the server according to business needs, the server allocates free memory blocks from the memory pool to the client, and then the client writes data to the server memory, and the server After detecting the completion of the data writing, the data in the memory is processed according to the business logic. Before the client writes data to the server memory next time, it re-initiates a memory allocation request, and the server again allocates free memory blocks from the memory pool to the client. Therefore, the client needs to apply for memory space from the server every time before transmitting data. The server allocates free memory according to the memory usage. In this way, the server and the CPU on both sides of the client need to participate in multiple interactions, which reduces the efficiency of data transmission. . In addition, in the existing distributed storage scenario where the client requests memory from multiple servers, it is necessary to initiate memory allocation requests to multiple servers, and the client needs to frequently request memory from multiple servers, and the implementation of distributed synchronization protocols is more complicated.

Summary of the invention

The embodiments of the present application provide a memory management method, system, client, server, and storage medium, which can improve the efficiency of data transmission and the convenience of address management.

In the first aspect, an embodiment of the present application provides a memory management method, the memory management method is applied to a client, and the memory management method includes:

Acquiring memory information corresponding to the memory allocated by the server to the client;

Creating a queue for recording the memory state based on the memory information;

When the data interaction between the client and the server changes, the memory status in the queue is updated.

In the second aspect, an embodiment of the present application also provides a memory management method, the memory management method is applied to a server, and the memory management method includes:

Receive the memory allocation request sent by the client;

Allocate memory for the client based on the memory allocation request, and send memory information of the allocated memory to the client, where the memory information is used to instruct the client to create a queue for recording memory status ；

Receive the to-be-processed data sent by the client, and process the to-be-processed data;

After the data processing is completed, a preset message is returned to the client, and the preset message is used to instruct the client to update the idle state of the memory in the queue.

In a third aspect, an embodiment of the present application also provides a client, including a processor and a memory, where a computer program is stored, and the processor executes the computer program provided in the embodiment of the present application when calling the computer program in the memory. Any memory management method applied to the client.

In a fourth aspect, an embodiment of the present application also provides a server, including a processor and a memory. The memory stores a computer program. When the processor invokes the computer program in the memory, the Any memory management method applied to the server.

In a fifth aspect, an embodiment of the present application also provides a memory management system, including a client and a server. The client is any of the clients provided in the embodiments of the present application, and the server is provided by the embodiments of the present application. Any kind of server.

In a sixth aspect, an embodiment of the present application also provides a storage medium for computer-readable storage, the storage medium is used to store a computer program, and the computer program is loaded by a processor to execute the Any kind of memory management method.

The embodiment of the application can obtain the memory information corresponding to the memory allocated to the client by the server, create a queue for recording the memory state based on the memory information, and update the memory state in the queue when the data interaction between the client and the server changes. Allows the client to monitor the memory status of the allocated memory, and update the memory status in the queue in time when the data interaction changes, so as to effectively monitor the memory status, without frequently requesting memory from the server, which improves data transmission The efficiency and the convenience of address management are improved.

Description of the drawings

FIG. 1 is a schematic diagram of a scene of a memory management method provided by an embodiment of the present application;

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

FIG. 3 is a schematic flowchart of a memory management method provided by another embodiment of the present application;

FIG. 4 is a schematic diagram of updating the memory state in a circular queue according to an embodiment of the present application;

FIG. 5 is a schematic flowchart of a memory management method provided by another embodiment of the present application;

FIG. 6 is a schematic flowchart of a memory management method provided by another embodiment of the present application;

FIG. 7 is a schematic structural diagram of a client provided by an embodiment of the present application;

Fig. 8 is a schematic structural diagram of a server provided by an embodiment of the present application.

detailed description

The technical solutions in the embodiments of the present application will be clearly and completely described below in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only a part of the embodiments of the present application, rather than all the embodiments. Based on the embodiments in this application, all other embodiments obtained by those skilled in the art without creative work shall fall within the protection scope of this application.

The flowchart shown in the drawings is only an example, and does not necessarily include all contents and operations/steps, nor does it have to be executed in the described order. For example, some operations/steps can also be decomposed, combined or partially combined, so the actual execution order may be changed according to actual conditions.

Hereinafter, some embodiments of the present application will be described in detail with reference to the accompanying drawings. In the case of no conflict, the following embodiments and features in the embodiments can be combined with each other.

The embodiments of the present application provide a memory management method, system, client, server, and storage medium. Wherein, the memory management method can be applied to network devices, which can include devices such as hubs, switches, bridges, routers, gateways, and repeaters.

Please refer to Figure 1. Figure 1 is a schematic diagram of a scenario for implementing the memory management method provided by an embodiment of the present application. As shown in Figure 1, the memory management method can be applied to the memory management scenario of RDMA data transmission, and the server can establish a connection with the client. , The server can exchange data with the client. The client can be a client integrated on a terminal such as a desktop computer, a notebook computer, a mobile phone, and a smart TV. The server can be an RDMA server. Specifically, the server can configure a memory pool, the client can send a memory allocation request to the server, and then the server can allocate memory for the client and send the memory information of the allocated memory to the client. At this time, the client can create based on the memory information A circular queue used to record the state of the memory. The client can send the data to be processed to the server and update the memory status in the circular queue, for example, update the occupancy status of the memory in the circular queue occupied by the data to be processed. The server can process the data to be processed. After processing the data, the server sends a preset message to the client. At this time, the client can update the idle state of the memory in the circular queue based on the preset message. Allows the client to monitor the memory status of the allocated memory, and update the memory status in the queue in time when the data interaction changes, so as to effectively monitor the memory status, without frequently requesting memory from the server, which improves data transmission The efficiency and the convenience of address management are improved.

Please refer to FIG. 2. FIG. 2 is a schematic flowchart of a memory management method provided by an embodiment of the present application. The memory management method is applied to the client, and the memory management method may include, but is not limited to, step S101 to step S103, etc., which may be specifically as follows:

S101. Obtain memory information corresponding to the memory allocated by the server to the client.

In an embodiment, the memory information may include a memory address, a memory size, and primary key information (may also be referred to as key information) and so on. The client can passively obtain the memory information corresponding to the memory allocated by the server to the client. For example, the server can send the memory information corresponding to the allocated memory to the client after the memory is allocated regularly or automatically to the client.

In order to improve the flexibility of acquiring memory information, the client can actively acquire the memory information corresponding to the memory allocated by the server to the client. In one embodiment, acquiring the memory information corresponding to the memory allocated by the server to the client may include: sending the memory allocation to the server Request; Receive the memory information returned by the server based on the memory allocation request.

For example, when the server needs to allocate memory, the client can send a memory allocation request to the server. The memory allocation request can carry information such as the required memory size. For example, the client can apply to the server to allocate memory with a memory size of R bytes. . Among them, if the data to be sent by the client is L bytes, the memory size of the actual sending request can be: R=min(ceil(L/m),r), where m means that the size of each memory block is m bytes , R represents the current amount of free memory in the memory allocated to the client, and ceil represents the round-up function. At this point, after the server receives the memory allocation request sent by the client, it can allocate memory to the client based on the memory allocation request, and then send the memory information of the allocated memory to the client, and the client can receive the server based on the memory allocation request The returned memory information.

In an embodiment, sending a memory allocation request to the server may include: sending a memory allocation request to the server when the client is started; or sending a memory allocation request to the server when the client detects that the memory allocated by the server is insufficient.

In order to improve the timeliness of sending memory allocation requests, the client can send a memory allocation request to the server when it finishes starting. Or, in order to improve the flexibility of sending memory allocation requests, the client can determine whether the memory allocated by the server is sufficient based on the data to be sent. For example, the client can determine whether the free memory is sufficient to store the memory to be sent according to the memory status maintained by itself. data. When the client detects that the memory allocated by the server is insufficient, it sends a memory allocation request to the server. When the client detects that the memory allocated by the server is sufficient, even if it currently needs to send data to the server, it does not need to send a memory allocation request to the server at this time. .

It should be noted that the server can pre-configure the memory pool and generate configuration information. The configuration information can include the number of memory blocks in the memory pool (that is, the capacity of the memory pool), the size of the memory block (that is, the unit byte), and the free memory waiting time threshold. (Max Available Time, MAT), and free memory accumulation threshold (Max Available Segments, MAS), etc. The configuration information can be written into the configuration file. The configuration file can specify the RDMA memory pool capacity, memory block size, MAT, MAS, And the synchronization method, etc., the synchronization method can be a method in which the server synchronizes the memory state to the client. For example, when the free memory waiting time of the memory block is greater than MAT, a preset message (such as a syn message) carrying the memory state is sent To the client, so that the client can update the memory state maintained by itself based on the received preset message. For example, the server can be configured with a memory pool with a capacity of N. The memory pool includes multiple memory blocks, each memory block is m bytes, and all memory blocks can be registered to the RNIC network card separately. After the server receives the memory allocation request with the required memory size of R bytes sent by the client, it can allocate the memory in the memory pool to the client based on the memory allocation request. For example, the server can allocate n contiguous memory to the client. Block, meet the condition "m*n>=R", and return memory information such as the address, memory size, and key information of n memory blocks to the client.

S102. Create a queue for recording the memory state based on the memory information.

After receiving the memory information, the client can create a queue for recording the memory status based on the memory information such as the address, memory size, and key information of the memory block. The type and form of the queue can be flexibly set according to actual needs, for example , The queue can be in the form of a list, the queue can be a circular queue, to realize the RDMA memory synchronization based on the circular queue, the queue used to record the memory state can update the memory state in time according to the change of the memory, and realize the memory state mapping of the server Locally, the client can perceive the memory occupancy state or idle state in time, and synchronize the memory for the RDMA transmission process.

For example, when the server allocates n memory blocks to the client, the client can establish a circular queue composed of memory blocks from 0 to n-1. The table length of the circular queue is n, and the memory status of the server is maintained based on the circular queue. When all the memory blocks in the circular queue are in an idle state, you can use the initial position 0 of the head pointer and the tail pointer, that is, the head pointer points to the memory block of 0, and the tail pointer points to the memory block of n-1, [tail]-- The memory status between ->[head] is occupied, and the memory status between [head]--->[tail] is idle. For example, as shown in Figure 4, memory block 0 and memory block 1 are in the occupied state, and when memory block 2 to memory block n-1 are in an idle state, the tail pointer points to memory block 0 and the head pointer points to memory block 2.

S103: When the data interaction between the client and the server changes, update the memory state in the queue.

Among them, changes in the data interaction between the client and the server may include the client sending the data to be processed to the server, and the server completing the processing of the data (the data is the data to be processed sent by the client to the server), etc. The status can include occupied status and idle status. For example, when the client needs to send data to the server, if the client detects that there is enough free memory in the circular queue, it can immediately execute the RDMA command. At this time, the free memory needs to be consumed. Update the occupancy state of the memory in the circular queue. If the client receives the server and returns a syn message after completing the data processing, the client updates the free state of the memory in the circular queue, that is, increases the free memory. It solves the problem of frequently applying for memory in the RDMA data transmission process, and optimizes the speed of high-speed network data transmission.

3, in an embodiment, step S103 may include but is not limited to step S1031 to step S1033, etc., which may be specifically as follows:

Step S1031: Send the to-be-processed data to the server, and update the occupancy status of the memory in the data occupancy queue.

Step S1032: Receive a preset message returned by the server after processing the data.

Step S1033: Update the idle state of the memory in the queue based on the preset message.

In order to improve the accuracy and timeliness of the memory status update, the client can send the data to be processed to the server. After the server receives the data to be processed, it needs to consume memory to cache the data to be processed, so the server allocates the memory to the client. Part or all of it will be occupied. At this time, the client can update the occupancy status of the memory in the data occupancy queue.

In one embodiment, the queue is a circular queue composed of multiple memory blocks. Updating the occupancy status of the memory in the data-occupied queue may include: determining the size of the memory occupied by the data in the circular queue; according to the size and data of each memory block in the circular queue The size of the memory in the cyclic queue is occupied, and the memory block interval in the cyclic queue is determined by the data; the first pointer is set to point to the first memory block of the memory block interval to indicate the occupancy status of the memory in the cyclic queue occupied by the data.

Taking the queue as an example of a circular queue consisting of multiple memory blocks, the client can determine the size of the memory that the data to be processed needs to occupy in the circular queue. For example, as shown in Figure 4, the size of the memory that the data to be processed needs to occupy is 2*m bytes, the size of each memory block in the circular queue is m bytes, at this time, the size of the memory in the circular queue can be occupied according to the size of each memory block in the circular queue m bytes and the data to be processed 2 *m bytes, determine that the data to be processed occupies the memory block range in the circular queue from memory block 0 to memory block 1, set the first pointer (such as the tail pointer) to point to the first memory block of the memory block range, that is, the tail pointer points to the memory block 0, to indicate the occupancy state of the memory in the circular queue that the data occupies, the head pointer points to memory block 3, the memory state of memory block 0 and memory block 1 between [tail]--->[head] is the occupancy state, [head ]--->[tail] The memory status of memory block 3 to memory block n-1 is idle. Later, when the client continues to write x*m bytes of data to the server, it can control the head pointer to slide x memory blocks forward.

After the server receives the to-be-processed data sent by the client, it can process the to-be-processed data one by one, and its processing mode can be flexibly set according to actual application scenarios, and the specific content is not limited here. After the server finishes processing the data, the memory block used to store the data is updated to an idle state, and can return a preset message to the client. The preset message can be flexibly set according to actual needs, for example, the preset message It may be a syn message, and the preset message may carry information such as a message that data processing has been completed, and the size of the released memory (that is, the size of the memory in an idle state). At this time, the client can receive the preset message returned by the server after the data processing is completed, determine the idle state of the memory based on the information carried in the preset message, and update the idle state of the memory in the queue.

It should be noted that, when the server returns the preset message to the client, it may return the preset message to the client immediately after the data processing is completed, that is, synchronize immediately when the memory status changes. Alternatively, the server can determine whether the free memory waiting time is greater than the free memory waiting time threshold. When the free memory waiting time corresponding to the client is greater than the free memory waiting time threshold, it returns a preset message to the client, and when the client corresponds to the free memory When the waiting time is less than or equal to the idle memory waiting time threshold, continue to wait, and there is no need to return a preset message to the client at this time. Alternatively, the server can determine whether the free memory is greater than the free memory accumulation threshold. When the free memory corresponding to the client is greater than the free memory accumulation threshold, it returns a preset message to the client. When the free memory corresponding to the client is less than or equal to the free memory accumulation threshold When the threshold is set, continue to wait, and there is no need to return a preset message to the client at this time.

In one embodiment, the queue is a circular queue composed of multiple memory blocks, and updating the idle state of the memory in the circular queue based on a preset message may include: determining the data processed by the server based on the preset message; The memory block size and the memory size occupied by the processed data determine the memory block interval released in the circular queue; the second pointer is set to point to the first memory block of the released memory block interval to indicate the free state of the memory in the circular queue.

Taking the queue as an example of a circular queue consisting of multiple memory blocks, the client can determine the data processed by the server based on the received preset message. For example, the processed data occupies a memory size of 6*m bytes. The size of each memory block in the circular queue is m bytes. At this time, the circular queue can be determined according to the size of each memory block in the circular queue is m bytes and the memory size occupied by the processed data is 6*m bytes The range of the memory block released in the memory block is from memory block 2 to memory block 7. The second pointer (for example, the head pointer) can be set to point to the first memory block of the released memory block range, that is, the head pointer points to the memory block 3 to indicate the idle state of the memory in the circular queue. If the head pointer points to memory block 0, the memory state of memory block 0 and memory block 1 between [tail]--->[head] is occupied, and the memory block between [head]--->[tail] The memory state from 3 to memory block n-1 is the idle state. Subsequently, after the client receives the syn message carrying the released t*m byte memory block, it can control the tail pointer to slide t memory blocks forward to update the memory state to the idle state, and the pointer will recycle from 0 after reaching the boundary , In order to update the memory state based on the memory synchronization mechanism of the circular queue. The embodiment of this application simplifies the RDMA unilateral data transmission operation, and solves the problem that the existing RDMA unilateral operation requires multiple applications for memory. As long as there is free memory in the circular queue, the client can directly initiate RDMA operations without applying for RDMA memory. ; When the server memory block is free, the memory status can be updated in time according to the configuration batch or delayed sending of syn messages, which greatly reduces the number of interactions of unilateral operations, significantly improves the data transmission efficiency, and realizes a true unilateral operate.

It should be noted that the client can apply for memory from one or more servers. When the client can apply for memory from multiple servers, the client can send memory allocation requests to each server, and each server can allocate memory for the client. And send the memory information of the allocated memory to the client. At this time, the client can create a circular queue based on the memory information corresponding to each server, and each circular queue records the memory state corresponding to each server. The client can send the data to be processed to each server, and update the memory status in the circular queue of the corresponding server, for example, update the occupancy status of the memory in the circular queue occupied by the data to be processed. Each server can process the data to be processed. After processing the data, each server sends a preset message to the client. At this time, the client can be based on the server identification carried in the preset message, and the amount of free memory, etc. Update the free state of the memory in the circular queue. For example, client A can apply to server B, server C, and server D for an RDMA memory pool of length N respectively, and create a circular queue corresponding to server B 1, a circular queue corresponding to server C, and a circular queue corresponding to server D Queue 3 waits for 3 circular queues. Client A needs to synchronize data of length L to server B, server C, and server D. The memory size x occupied by the data is calculated as: x=min(ceil(L/m),min()), where min( ) Is the minimum free window of the circular queue, ceil represents the round-up function, and m represents the size of each memory block. Client A writes x bytes of data to server B, server C, and server D in turn. At this time, the head pointer in the circular queue corresponding to each server slides forward by x/m memory blocks. After each server receives the data writing and processes the data, it returns a syn message to client A according to the configuration, and client A receives the syn message, and the tail pointer in the circular queue corresponding to each server moves forward to update the memory status. Among them, the tail pointers of different servers B, C, and D may not be synchronized. Client A calculates the accumulated value ACKi of syn packets for each server, and judges that the transaction is completed according to the majority principle of the raft protocol. The memory management method of the embodiment of the present application is applied to the raft synchronization scenario, not only can reduce the number of memory synchronizations between the client A and each server, but also the syn message can be used as a raft response message to improve the synchronization efficiency of the raft protocol.

In the embodiment of the application, the client can obtain the memory information corresponding to the memory allocated to the client by the server, create a queue for recording the memory state based on the memory information, and update the memory in the queue when the data interaction between the client and the server changes. state. Allows the client to monitor the memory status of the allocated memory, and update the memory status in the queue in time when the data interaction changes, so as to effectively monitor the memory status, without frequently requesting memory from the server, which improves data transmission The efficiency and the convenience of address management are improved.

Please refer to FIG. 5, which is a schematic flowchart of a memory management method provided by an embodiment of the present application. The memory management method is applied to a server, and the memory management method may include but is not limited to steps S201 to S203, etc., and may be specifically as follows:

S201. Receive a memory allocation request sent by a client.

In an embodiment, before receiving the memory allocation request sent by the client, the memory management method may further include: configuring a memory pool and generating configuration information.

In an embodiment, the configuration information may include the number of memory blocks in the memory pool, the size of the memory blocks, the free memory waiting time threshold, and the free memory accumulation threshold.

In an embodiment, allocating memory for the client based on the memory allocation request and sending memory information of the allocated memory to the client may include: allocating memory in the memory pool for the client based on the memory allocation request; extracting from the configuration information The memory information of the allocated memory is sent to the client.

Among them, the memory information may include memory address, memory size, and primary key information (may also be referred to as key information).

The server can pre-configure the memory pool and generate configuration information. The configuration information can include the number of memory blocks in the memory pool (that is, the capacity of the memory pool), the size of the memory block (that is, unit byte), the free memory waiting time threshold MAT, and the free memory Cumulative threshold MAS, etc. The configuration information can be written into a configuration file. The configuration file can specify RDMA memory pool capacity, memory block size, MAT, MAS, and synchronization mode, etc. The synchronization mode can be that the server synchronizes the memory state to the client For example, when the free memory waiting time of the memory block is greater than MAT, the preset message (for example, syn message) carrying the memory status is sent to the client, so that the client can update itself based on the received preset message Maintained memory status. For example, the server can be configured with a memory pool with a capacity of N. The memory pool includes multiple memory blocks, each memory block is m bytes, and all memory blocks can be registered to the RNIC network card separately. After the server receives the memory allocation request with the required memory size of R bytes sent by the client, it can allocate the memory in the memory pool to the client based on the memory allocation request. For example, the server can allocate n contiguous memory to the client. Block, meet the condition "m*n>=R", and return memory information such as the address, memory size, and key information of n memory blocks to the client.

It should be noted that the client can send a memory allocation request to the server when it finishes starting up. Or, in order to improve the flexibility of sending memory allocation requests, the client can determine whether the memory allocated by the server is sufficient based on the data to be sent. For example, the client can determine whether the free memory is sufficient to store the memory to be sent according to the memory status maintained by itself. data. When the client detects that the memory allocated by the server is insufficient, it sends a memory allocation request to the server. When the client detects that the memory allocated by the server is sufficient, even if it currently needs to send data to the server, it does not need to send a memory allocation request to the server at this time. .

S202: Allocate memory for the client based on the memory allocation request, and send memory information of the allocated memory to the client, where the memory information is used to instruct the client to create a queue for recording the memory state.

S203: Receive the to-be-processed data sent by the client, and process the to-be-processed data.

S204. After processing the data, return a preset message to the client, where the preset message is used to instruct the client to update the idle state of the memory in the queue.

After the server receives the data to be processed, it needs to consume memory to cache the data to be processed, so some or all of the memory allocated by the server to the client will be occupied. At this time, the client can update the occupancy status of the memory in the data occupancy queue.

In an embodiment, returning the preset message to the client may include: when the waiting time of the free memory corresponding to the client is greater than the idle memory waiting time threshold, returning the preset message to the client; or, when the client corresponds to When the free memory is greater than the accumulation threshold of free memory, a preset message is returned to the client.

When the server returns the preset message to the client, it may return the preset message to the client immediately after the data processing is completed, that is, synchronize immediately when the memory status changes. Alternatively, the server can determine whether the free memory waiting time is greater than the free memory waiting time threshold. When the free memory waiting time corresponding to the client is greater than the free memory waiting time threshold, it returns a preset message to the client, and when the client corresponds to the free memory When the waiting time is less than or equal to the idle memory waiting time threshold, continue to wait, and there is no need to return a preset message to the client at this time. Alternatively, the server can determine whether the free memory is greater than the free memory accumulation threshold. When the free memory corresponding to the client is greater than the free memory accumulation threshold, it returns a preset message to the client. When the free memory corresponding to the client is less than or equal to the free memory accumulation threshold When the threshold is set, continue to wait, and there is no need to return a preset message to the client at this time.

In the foregoing embodiments, the description of each embodiment has its own focus. For parts that are not described in detail in an embodiment, please refer to the detailed description of the memory management method above, which will not be repeated here.

In the embodiment of the application, the server may receive the memory allocation request sent by the client, allocate memory for the client based on the memory allocation request, and send the memory information of the allocated memory to the client. The memory information is used to instruct the client to create a memory for recording Status of the queue. Receive the to-be-processed data sent by the client, process the to-be-processed data, and return a preset message to the client after the data processing is completed. The preset message is used to instruct the client to update the idle state of the memory in the queue. This solution can send the memory information to the client, so that the client can create a queue for recording the memory status based on the memory information, effectively monitor the memory status of the allocated memory, and return to the client after the data processing is completed. Set the message so that the client can update the idle state of the memory in the queue based on the preset message, instead of frequently applying for memory, which reduces the number of interactions between the server and the client, improves the efficiency of data transmission, and improves the Convenience of address management.

Please refer to FIG. 6, which is a schematic diagram of the interaction between the client and the server in the memory management system provided by an embodiment of the present application. The details can be as follows:

S10. The server configures a memory pool.

The server can configure the memory pool to generate configuration information.

S11. The client sends a memory allocation request to the server.

When the client starts, it can send a memory allocation request to the server; or, when the client detects that the memory allocated by the server is insufficient, it can send a memory allocation request to the server.

S12. The server allocates memory to the client based on the received memory allocation request, and sends memory information to the client.

The server sends the memory information corresponding to the memory allocated to the client to the client. The memory information may include memory address, memory size, and primary key information. The memory information is used to instruct the client to create a queue for recording the memory status.

S13. The client creates a circular queue based on the received memory information.

The client receives the memory information returned by the server based on the memory allocation request, and creates a queue for recording the memory status based on the memory information. When the data interaction between the client and the server changes, the memory status in the queue can be updated.

S14. The client sends the data to be processed to the server.

S15. The client updates the memory status in the circular queue.

The client can update the data occupancy state of the memory in the circular queue. It should be noted that the order of execution between step S14 and step S15 can be step S14 first, then step S15; or step S15 first, then step S14; or step S14 and step S15 at the same time implement.

S16. The server processes the data.

After the server receives the to-be-processed data sent by the client, it can process the to-be-processed data.

S17. After processing the data, the server sends a preset message to the client.

After processing the data, the server returns a preset message to the client, and the preset message is used to instruct the client to update the idle state of the memory in the queue.

For example, when the free memory waiting time corresponding to the client is greater than the free memory waiting time threshold, the preset message is returned to the client; or, when the free memory corresponding to the client is greater than the free memory accumulation threshold, the preset message is returned to the client Message.

S18. The client updates the memory status in the circular queue. ,

The client receives the preset message returned by the server after completing the data processing, and updates the idle state of the memory in the queue based on the preset message.

In the above-mentioned embodiments, the description of each embodiment has its own emphasis. For parts that are not described in detail in an embodiment, please refer to the detailed description of the memory management method above, which will not be repeated here.

Please refer to FIG. 7, which is a schematic block diagram of the structure of a client according to an embodiment of the present application.

As shown in FIG. 7, the client 300 may include a processor 302, a memory 303, and a communication interface 304 connected through a system bus 301, where the memory 303 may include a non-volatile computer-readable storage medium and internal memory.

The non-volatile computer-readable storage medium can store the computer program. The computer program includes program instructions, and when the program instructions are executed, the processor can execute any memory management method.

The processor 302 is used to provide computing and control capabilities to support the operation of the entire client.

The memory 303 provides an environment for running a computer program in a non-volatile computer-readable storage medium. When the computer program is executed by the processor 302, the processor 302 can execute any memory management method.

The communication interface 304 is used for communication. Those skilled in the art can understand that the structure shown in FIG. 7 is only a block diagram of part of the structure related to the solution of the present application, and does not constitute a limitation on the client 300 to which the solution of the present application is applied. The specific client 300 may include more or fewer components than shown in the figure, or combine certain components, or have a different component arrangement.

It should be understood that the bus 301 is, for example, an I2C (Inter-integrated Circuit) bus, and the memory 303 may be a Flash chip, a read-only memory (ROM, Read-Only Memory) disk, an optical disk, a U disk or a mobile hard disk, etc. The processor 302 may be a central processing unit (Central Processing Unit, CPU), the processor 302 may also be other general-purpose processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), Field-Programmable Gate Array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. Among them, the general-purpose processor may be a microprocessor or the processor may also be any conventional processor or the like.

Wherein, in an embodiment, the processor 302 is configured to run a computer program stored in the memory 303 to perform the following steps:

Obtain the memory information corresponding to the memory allocated by the server to the client, and create a queue for recording the memory state based on the memory information; when the data interaction between the client and the server changes, the memory state in the queue is updated.

In one embodiment, when updating the memory status in the queue, the processor 302 further executes: sending the data to be processed to the server, and updating the memory occupancy status of the data in the queue; receiving the server's return after the data processing is completed. Set message; update the idle state of the memory in the queue based on the preset message.

In one embodiment, the queue is a circular queue composed of multiple memory blocks. When updating the occupancy state of the memory in the data occupancy queue, the processor 302 also executes: determining the size of the memory in the cyclic queue occupied by the data; The size of a memory block and the size of the memory occupied by the data in the circular queue are determined, and the memory block interval in the circular queue occupied by the data is determined; the first pointer is set to point to the first memory block of the memory block interval to indicate the occupancy status of the memory in the circular queue occupied by the data.

In an embodiment, the queue is a circular queue composed of multiple memory blocks. When the idle state of the memory in the circular queue is updated based on a preset message, the processor 302 further executes: determining the data processed by the server based on the preset message ;According to the size of each memory block in the circular queue and the memory size occupied by the processed data, determine the memory block interval released in the circular queue; set the second pointer to point to the first memory block of the released memory block interval to indicate the circular queue The idle state of the memory.

In an embodiment, the memory information includes memory address, memory size, and primary key information.

In an embodiment, when acquiring memory information corresponding to the memory allocated by the server to the client, the processor 302 further executes: sending a memory allocation request to the server; receiving the memory information returned by the server based on the memory allocation request.

In one embodiment, when sending a memory allocation request to the server, the processor 302 further executes: when the client starts, it sends a memory allocation request to the server; or, when the client detects that the memory allocated by the server is insufficient, it sends a memory allocation request to the server Send a memory allocation request.

Please refer to FIG. 8. FIG. 8 is a schematic block diagram of the structure of a server according to an embodiment of the present application.

As shown in FIG. 8, the server 400 may include a processor 402, a memory 403, and a communication interface 404 connected through a system bus 401, where the memory 403 may include a non-volatile computer-readable storage medium and internal memory.

The processor 402 is used to provide computing and control capabilities to support the operation of the entire server.

The memory 403 provides an environment for running a computer program in a non-volatile computer-readable storage medium. When the computer program is executed by the processor 402, the processor 402 can execute any memory management method.

The communication interface 404 is used for communication. Those skilled in the art can understand that the structure shown in FIG. 8 is only a block diagram of part of the structure related to the solution of the present application, and does not constitute a limitation on the server 400 to which the solution of the present application is applied. The specific server 400 may be Including more or fewer parts than shown in the figure, or combining some parts, or having a different arrangement of parts.

It should be understood that the bus 401 is, for example, an I2C (Inter-integrated Circuit) bus, and the memory 403 may be a Flash chip, a read-only memory (ROM, Read-Only Memory) disk, an optical disk, a U disk or a mobile hard disk, etc. The processor 402 may be a central processing unit (Central Processing Unit, CPU), the processor 402 may also be other general-purpose processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), Field-Programmable Gate Array (FPGA) or other programmable logic devices, discrete gates or transistor logic devices, discrete hardware components, etc. Among them, the general-purpose processor may be a microprocessor or the processor may also be any conventional processor or the like.

Wherein, in an embodiment, the processor 402 is configured to run a computer program stored in the memory 403 to perform the following steps:

Receive the memory allocation request sent by the client, allocate memory for the client based on the memory allocation request, and send the memory information of the allocated memory to the client. The memory information is used to instruct the client to create a queue for recording the memory status; receive the client The data to be processed sent by the client is processed, and after the data processing is completed, a preset message is returned to the client, and the preset message is used to instruct the client to update the idle state of the memory in the queue.

In an embodiment, before receiving the memory allocation request sent by the client, the processor 402 further executes: configuring a memory pool, and generating configuration information.

In one embodiment, when allocating memory for the client based on the memory allocation request and sending the memory information of the allocated memory to the client, the processor 402 further executes: allocating memory in the memory pool for the client based on the memory allocation request ; The memory information of the allocated memory is extracted from the configuration information, and the memory information is sent to the client.

In an embodiment, the configuration information includes the number of memory blocks in the memory pool, the size of the memory blocks, the free memory waiting time threshold, and the free memory accumulation threshold.

In one embodiment, when returning a preset message to the client, the processor 402 further executes: when the waiting time of the free memory corresponding to the client is greater than the idle memory waiting time threshold, returning the preset message to the client; or , When the free memory corresponding to the client is greater than the free memory accumulation threshold, the preset message is returned to the client.

The embodiment of the present application also provides a storage medium, the storage medium is a computer-readable storage medium, and the computer-readable storage medium stores a computer program, the computer program includes program instructions, and the processor executes the program instructions to implement the Apply for any of the memory management methods provided in the embodiments. For the specific implementation of the above operations, please refer to the previous embodiments, which will not be repeated here.

The computer-readable storage medium may be the internal storage unit of the mobile terminal of the foregoing embodiment, such as the hard disk or memory of the mobile terminal. The computer-readable storage medium may also be an external storage device of the mobile terminal, such as a plug-in hard disk equipped on the mobile terminal, a smart memory card (Smart Media Card, SMC), a Secure Digital (SD) card, and a flash memory card ( Flash Card) etc.

Since the computer program stored in the computer-readable storage medium can execute any of the memory management methods provided in the embodiments of the present application, it can implement what can be achieved by any of the memory management methods provided in the embodiments of the present application. For the beneficial effects of, refer to the previous embodiment for details, and will not be repeated here.

It should be understood that the terms used in the specification of this application are only for the purpose of describing specific embodiments and are not intended to limit the application. As used in the specification of this application and the appended claims, unless the context clearly indicates other circumstances, the singular forms "a", "an" and "the" are intended to include plural forms.

It should also be understood that the term "and/or" used in the specification and appended claims of this application refers to any combination of one or more of the items listed in the associated and all possible combinations, and includes these combinations. It should be noted that in this article, the terms "include", "include" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or system including a series of elements not only includes those elements, It also includes other elements not explicitly listed, or elements inherent to the process, method, article, or system. If there are no more restrictions, the element defined by the sentence "including a..." does not exclude the existence of other identical elements in the process, method, article, or system that includes the element.

The serial numbers of the foregoing embodiments of the present application are for description only, and do not represent the superiority or inferiority of the embodiments. The above are only specific implementations of this application, but the scope of protection of this application is not limited to this. Anyone familiar with this technical field can easily think of various equivalents within the technical scope disclosed in this application. Modifications or replacements, these modifications or replacements shall be covered within the scope of protection of this application. Therefore, the protection scope of this application shall be subject to the protection scope of the claims.

Claims

A memory management method, the memory management method is applied to a client, and the memory management method includes:

Acquiring memory information corresponding to the memory allocated by the server to the client;

Creating a queue for recording the memory state based on the memory information;

When the data interaction between the client and the server changes, the memory status in the queue is updated.
The memory management method according to claim 1, wherein, when the data interaction between the client and the server changes, updating the memory status in the queue comprises:

Sending the data to be processed to the server, and updating the occupancy state of the memory in the queue occupied by the data;

Receiving a preset message returned by the server after processing the data;

The idle state of the memory in the queue is updated based on the preset message.
The memory management method according to claim 2, wherein the queue is a circular queue formed by a plurality of memory blocks, and the updating the occupancy state of the memory in the queue by the data comprises:

Determining the size of the memory in the circular queue occupied by the data;

Determine the memory block interval occupied by the data in the circular queue according to the size of each memory block in the circular queue and the size of the memory in the circular queue occupied by the data;

The first pointer is set to point to the first memory block of the memory block interval to indicate the occupancy state of the memory in the circular queue occupied by the data.
The memory management method according to claim 2, wherein the queue is a circular queue formed by a plurality of memory blocks, and the updating the idle state of the memory in the circular queue based on the preset message comprises:

Determining the data processed by the server based on the preset message;

Determine the interval of the memory block released in the circular queue according to the size of each memory block in the circular queue and the memory size occupied by the processed data;

A second pointer is set to point to the first memory block of the released memory block interval to indicate the idle state of the memory in the circular queue.
The memory management method according to claim 1, wherein the memory information includes memory address, memory size, and primary key information.
The memory management method according to any one of claims 1 to 5, wherein said acquiring memory information corresponding to the memory allocated by the server to the client comprises:

Sending a memory allocation request to the server;

Receiving the memory information returned by the server based on the memory allocation request.
The memory management method according to claim 6, wherein the sending a memory allocation request to the server comprises:

When the client is started, a memory allocation request is sent to the server; or,

When the client detects that the memory allocated by the server is insufficient, it sends a memory allocation request to the server.
A memory management method, the memory management method is applied to a server, and the memory management method includes:

Receive the memory allocation request sent by the client;

Allocate memory for the client based on the memory allocation request, and send memory information of the allocated memory to the client, where the memory information is used to instruct the client to create a queue for recording memory status ；

Receive the to-be-processed data sent by the client, and process the to-be-processed data;

After the data processing is completed, a preset message is returned to the client, and the preset message is used to instruct the client to update the idle state of the memory in the queue.
8. The memory management method according to claim 8, wherein before the receiving the memory allocation request sent by the client, the memory management method further comprises:

Configure the memory pool and generate configuration information;

The allocating memory for the client based on the memory allocation request, and sending memory information of the allocated memory to the client includes:

Allocating memory in the memory pool for the client based on the memory allocation request;

The memory information of the allocated memory is extracted from the configuration information, and the memory information is sent to the client.
9. The memory management method according to claim 9, wherein the configuration information includes the number of memory blocks in the memory pool, the size of the memory blocks, the free memory waiting time threshold, and the free memory accumulation threshold.
The memory management method according to claim 10, wherein the returning a preset message to the client comprises:

When the idle memory waiting time corresponding to the client is greater than the idle memory waiting time threshold, return a preset message to the client; or,

When the free memory corresponding to the client is greater than the free memory accumulation threshold, return a preset message to the client.
A client includes a processor and a memory, and a computer program is stored in the memory. When the processor calls the computer program in the memory, the memory management method according to any one of claims 1 to 7 is executed.
A server includes a processor and a memory, and a computer program is stored in the memory. When the processor calls the computer program in the memory, the memory management method according to any one of claims 8 to 11 is executed.
A memory management system includes a client and a server, the client is the client according to claim 12, and the server is the server according to claim 13.
A storage medium for computer-readable storage, the storage medium for storing a computer program, the computer program being loaded by a processor to execute the memory management method according to any one of claims 1 to 7, or the The computer program is loaded by the processor to execute the memory management method according to any one of claims 8 to 11.