A memory allocation method and release method of a linux operating system

Abstract

The invention discloses a memory allocation method of the Linux operation system. The memory allocation method of the Linux operation system comprises the steps that whether memory space meeting a memory allocation request is available or not is judged; if yes, whether a target memory block corresponding to the memory allocation request is included in a first chain table or not is judged; if not, a second target sub-chain table is determined in a second chain table according to the target grade corresponding to the memory allocation request; whether the target memory block is included in the second target sub-chain table or not is judged, and if not, the memory allocated to the Linux operation system is reduced. According to the allocation method, the second chain table and a second bitmap are increased based on the data structure of an existing partner algorithm, further trying can be carried out in the second chain table when the memory space of the memory allocation request is not obtained in the first chain table, the failure probability of the memory allocation request is reduced, the memory allocation efficiency is improved, and the utilization rate of the memory space is further increased. The invention further discloses a memory releasing method of the Linux operation system. The memory releasing method has the advantages of the memory allocation method.

Description

technical field [0001] The invention relates to the technical field of computer storage, in particular to a memory allocation method and release method of a Linux operating system. Background technique [0002] In the Linux operating system, the management and allocation of memory is an important factor affecting the stable operation of the system. The existing allocation method is based on the buddy algorithm. The buddy algorithm minimizes memory fragmentation. Its data structure includes a linked list and a bitmap. The linked list organizes memory blocks of the same level together, and the bitmap indicates each memory block. The state of the corresponding partner block. When memory is allocated, it is necessary to determine how to allocate memory according to this state. Two memory blocks satisfying the following conditions are partner blocks: the size of the two memory blocks is the same, the physical positions of the two memory blocks are adjacent, and only the last bit...

AI Technical Summary

Problems solved by technology

For example, there are two memory blocks, although the size of the two memory blocks is the same, the physical location is adjacent, but because the addresses of the two memory blocks are not continuous, for example, the last two bits are not the same, the two memory blocks do not satisfy the partnership, and therefore also Cannot be merged into a large memory block, resulting in many small memory blocks that cannot be merged into a large memory block, reducing memory allocation and utilization efficiency

Images