Memory block calling method and memory block releasing method for memory pool and server

Abstract

The embodiment of the invention discloses a memory block calling method and a memory block releasing method for a memory pool and a server. The memory block calling method for the memory pool comprises the following steps: applying memory blocks in the memory pool, wherein the memory pool comprises a plurality of idle memory blocks with the same size and a round-robin queue during initialization, and the round-robin queue is stored with a plurality of memory block addresses corresponding to the memory blocks; taking out the firstly accessed memory block address from the round-robin queue; and calling the corresponding memory block according to the memory block address which is taken out. By adopting the memory block calling method for the memory pool, extra memory consumption can be reduced, and the memory allocation efficiency is improved.

Description

technical field [0001] The embodiments of the present invention relate to the field of computer applications, in particular to a memory block calling method and a memory block releasing method of a memory pool and a server. Background technique [0002] In the process of computer software development and application, it is often used to dynamically apply for memory and release memory. When the software is frequently used, it will cause a large number of memory fragments and reduce the efficiency of memory allocation. At present, the memory pool is a special memory management method. Compared with conventional memory management, its characteristic is that the size of the memory block used for each allocation is the same. This memory management method has high allocation efficiency and does not generate memory. The advantages of fragmentation are often used in occasions that require high memory allocation efficiency and the size of the requested memory is fixed. Its main purp...

AI Technical Summary

Problems solved by technology

This method needs to search the linked list one by one, consumes a lot of extra memory, and there is still room for improvement when dealing with the connection of linked list nodes

[0004] In the process of implementing the present invention, the inventors found that there are at least the following problems in the prior art: in the existing memory pool management method, the application program needs to search the entire linked list every time it applies for memory, the extra memory consumption is high, and the memory allocation efficiency is low

Images