Memory allocation method and memory allocation device

Abstract

The invention provides a memory allocation method and a memory allocation device. The memory allocation method includes recording a memory module (RANK) to which each memory block group belongs; arranging the RANKs in a system according to a minimum free time rate priority (Min Free) mode or a least recently used (LRU) mode; determining size of a memory needed to be allocated, aiming at each RANK after arrangement, sequentially executing a step A: A, adopting a buddy system (BUDDY) algorithm to find the memory block groups which can be allocated in the memory block groups belonging to the RANK, if the memory block groups which can be allocated exist, performing allocation, recording an RANK to which new memory block groups generated after allocation belong, and finishing current processes; if the memory block groups which can be allocated do not exist, aiming at a next RANK, repeatedly executing the step A until the memory block groups are allocated successfully. By the memory allocation method and the memory allocation device, allocated memory block groups are enabled to belong to few RANKs as far as possible, so that convenience is brought to power consumption control of a memory system.

Description

technical field [0001] The invention relates to the technical field of computer memory management, in particular to a memory allocation method and device. Background technique [0002] The BUDDY system algorithm has become the classic algorithm of the current Linux memory management system due to its excellent allocation efficiency and anti-fragmentation characteristics. It divides the memory unit into multiple block groups (Page Block), that is, free_area[0...max_oder], and the size of each block group is the 0th power of 2 to the max_order power of 2 in units of pages (Page). For example: if max_order=10, the sizes of each block group are: 1, 2, 4, 8,...,1024. [0003] Each group of blocks of the same size is linked by a linked list for management. When it is necessary to allocate memory, the system will allocate it from the block group that is closest to and not smaller than the memory to be allocated, and split the remaining part into smaller block groups for managemen...

AI Technical Summary

Problems solved by technology

The existing buddy system algorithm does not consider this feature, and does not differentiate memory block groups when allocating memory block groups, so that the memory block groups in each RANK have the same probability of being allocated statistically. This memory allocation method is not convenient for the memory system. power consumption control

Images