Method for distributing large continuous memory of kernel

Abstract

The invention provides a method for distributing a large continuous memory of a kernel. The method comprises the following steps of: acquiring a maximum memory page during distribution of the kernel; calculating a required memory page number N; turning to a step F if determining that the is a negative number; applying the memory according to the if determining that the is not a negative number; reducing the and turning to a step C if the application fails; combining combinable memory blocks to serve as the continuous memory if the application is successful; turning to a step E if determining that a newly combined continuous memory which meets requirement exists; turning to the step C if determining that the newly combined continuous memory which meets requirement does not exist; turning to the step F when determining that the application is successful due to the existence of the memory which meets requirement; jumping to the step C if the memory which meets requirement does not exist; and releasing unused memory. By the method, large continuous memory blocks can be quickly distributed from the kernel; and compared with the conventional distribution method, the distribution time is shortened. The method is mainly guaranteed in two aspects: on one hand, a maximum number of distributable memories is used for applying to the kernel each time; and on the other hand, continuous regions are immediately combined and whether the combined memory meets requirement is immediately determined after the memory is distributed each time, so extra application operation is not required.

Description

technical field [0001] The invention relates to the field of memory management, in particular to a fast method for allocating a large continuous memory of a kernel. Background technique [0002] Due to the limited memory resources of the kernel, the effective use of memory is closely related to the functional performance of the system. Different operating systems provide different memory management methods, and different memory management methods lead to different sizes of memory obtained at one time when applying for memory. If a large piece of contiguous memory needs to be obtained, there are also big differences in the way of memory allocation and organization. At present, most large continuous memory allocation methods are to allocate a large amount of memory first, and then select memory blocks that meet the requirements, please refer to the patent CN101676883. Therefore, when the system memory is relatively large, the memory allocation time is longer, which affects t...

AI Technical Summary

Problems solved by technology

Using the usual method, first apply for all available memory blocks, then sort the memory blocks by address, merge continuous area blocks, and find a memory allocation that meets the requirements, which takes a long time

This solution has several disadvantages: 1. A system with a large memory may have a large memory, and it takes a long time to apply for allocation; 2. The allocated memory needs to be sorted and merged according to the address, and the time complexity is about the sorting time of memory blocks. the complexity

Images