Method for improving utilization ratio of Linux idle memory blocks

Abstract

Disclosed is a method for improving the utilization ratio of Linux idle memory blocks. The method is characterized in that in a Linux buddy system, limitations on partnerships are reduced, and two idle blocks, which are not disassembled from the same big block, of the same size and continuous addresses are combined to form a partnership extended block; meanwhile, a two-dimensional array and an integer variable are added to a partnership system structural body free_area_struct, wherein the two-dimensional array is used for recording the serial numbers of two idle blocks having the extended partnership in the next order, and the integer variable is used for recording the number of blocks having the extended partnership in the next order; if requirements for memory allocation of a requester can not be met by a system, idle blocks having the partnership to be extended will be searched by the system and are allocated to the requester, and accordingly the memory utilization ratio is effectively improved.

Description

technical field [0001] The invention belongs to the technical field of memory management, and in particular relates to the allocation and reclaim management of free memory blocks by a buddy algorithm in Linux memory management. Background technique [0002] All pages in Linux memory are divided according to the power of 2, and the exponent of the power is called the order. The order size is generally O-MAX_ORDER-1. When operating memory, these memory blocks are often divided into two blocks of equal size. These two blocks have a partnership relationship. When the system requests (0≤n<MAX_ORDER) page blocks of page size, the partner algorithm first in 2n free blocks Search, if found, it will be allocated, if not found, it will be searched in 2(n+1)~2(MAX_ORDER-1) free blocks at a time for allocation and insert the partner block into the corresponding linked list. When the page block is released, the buddy algorithm first checks whether its buddy block is in the free list...

AI Technical Summary

Problems solved by technology

[0005] The present invention aims to solve the problem of waste of free memory resources existing in the existing buddy algorithm. The free memory blocks in the memory are equal in size and have continuous addresses but do not satisfy the partnership relationship, and are also merged into a large memory block. request

[0007] The above-mentioned technical scheme proposed by the present invention overcomes the defect that the free memory blocks of equal size and continuous addresses but not in partnership cannot be fully utilized in the traditional buddy algorithm

Images