CN105302737A - Memory allocation management method and memory allocation management system - Google Patents

Abstract

The invention discloses a memory allocation management method and system. The method includes: receiving a memory allocation request from an application program carrying a required memory size; searching for the node memory size and the required memory size in the memory block linked list set for the application program A memory block linked list with a suitable size; in the found memory block linked list, when the size of the remaining memory of its node memory compared with the required memory is not lower than the lower limit of the preset node memory, one of the memory block nodes will be The memory equal to the required memory size in the memory is allocated to the application program, and the remaining memory is included in the destination memory block linked list. The present invention realizes reasonable management of memory fragments generated in the memory allocation process by classifying the remaining memory into the target memory block linked list whose size of the node memory is equal to the size of the remaining memory, and effectively improves the utilization rate of the memory.

Description

A memory allocation management method and system

technical field

The invention relates to the technical field of computer memory management, in particular to a memory allocation management method and system.

Background technique

As we all know, during the running process of an application program, it usually needs to allocate memory when it needs memory. Specifically, memory allocation refers to a method of allocating or reclaiming storage space during program execution. Common memory allocation methods include static memory allocation and dynamic memory allocation. The so-called dynamic memory allocation (DynamicMemoryAllocation) refers to the method of dynamically allocating or reclaiming storage space in the process of program execution. Dynamic memory allocation does not need to pre-allocate storage space like static memory allocation methods such as arrays, but is allocated by the system in real time according to the needs of the program, and the allocated size is the size required by the program.

However, in practical applications, for the above two memory allocation methods, when the memory allocation management system frequently applies for and releases memory during the running of the application program, the prior art method of allocating and releasing memory through system calls is prone to memory loss. Fragmentation, which in turn leads to low memory utilization. If it runs for a long time, it will lead to system instability, and the longer the running time, the more prone to problems the system will have, and even slower and slower.

Contents of the invention

In view of this, the present invention provides a memory allocation management method and system to reasonably manage memory fragments generated during the memory allocation process, thereby improving memory utilization.

In order to solve the above technical problems, the present invention provides a memory allocation management method, comprising:

Receive a memory allocation request with the required memory size from the application;

In the memory block linked list set for the application program, search for a memory block linked list whose node memory size is compatible with the required memory size;

Wherein, the node memory size adapted to the required memory size is larger than the required memory size and has the smallest difference with the required memory size; the memory block linked list set includes at least one memory block linked list, the memory block The block linked list includes at least one memory block node and the node memory sizes of each memory block node in the at least one memory block node are equal;

In the found memory block linked list, when the size of the remaining memory of its node memory compared with the required memory is not lower than the preset node memory lower limit value, combine the memory of one of the memory block nodes with the required memory memory of equal size is allocated to the application program, and the remaining memory is classified into the destination memory block linked list;

Wherein, the node memory size of the destination memory block linked list is equal to the size of the remaining memory.

In the above method, preferably, after allocating the memory equal to the required memory size in one of the memory block nodes to the application program, and putting the remaining memory into the destination memory block linked list, Also includes:

When the released memory of the application program is detected, the released memory is put into a linked list of memory blocks whose size is equal to that of the node memory.

In the above method, preferably, after the memory block linked list whose memory size of the search node is adapted to the required memory size, further includes:

In the found memory block linked list, when the size of the remaining memory of its node memory compared with the required memory is lower than the lower limit of the node memory, the memory of one of the memory block nodes is allocated to all described application.

In the above method, preferably, the memory block nodes in the memory block linked list are sorted linearly according to their memory addresses, and the memory addresses among the memory block nodes are discrete;

After the remaining memory is classified into the target memory block linked list, when the memory address of the remaining memory is continuous with the memory address of a certain memory block node in the target memory block linked list, it also includes:

Merge the remaining memory and memory block nodes whose memory addresses are continuous;

Put the merged memory block nodes into the memory block linked list whose memory size is equal to its memory size.

In the above method, preferably, the memory block linked list whose memory size of the search node is adapted to the required memory size includes:

In the header linked list, search for the memory block linked list identifier whose memory size of the node is suitable for the required memory size; wherein, the header linked list includes the memory block linked list identifier and the memory block linked list identifier corresponding to the memory block linked list identifier The node memory size of the corresponding memory block linked list;

Identify the found memory block linked list, and determine the memory block linked list whose size of the node memory is suitable for the required memory size.

The present invention also provides a memory allocation management system, comprising:

a receiving unit, configured to receive a memory allocation request carrying a required memory size from an application;

A search unit, configured to search for a memory block chain list whose node memory size is compatible with the required memory size in the memory block chain list set for the application program;

Wherein, the node memory size adapted to the required memory size is larger than the required memory size and has the smallest difference with the required memory size; the memory block linked list set includes at least one memory block linked list, the memory block The block linked list includes at least one memory block node and the node memory sizes of each memory block node in the at least one memory block node are equal;

The allocation unit is used to combine the memory of one of the memory block nodes with Allocating memory with the same size as the required memory to the application program, and putting the remaining memory into the destination memory block linked list;

Wherein, the node memory size of the destination memory block linked list is equal to the size of the remaining memory.

In the above system, preferably, it also includes:

Incorporating into a unit, after allocating memory equal to the size of the required memory in the memory of one of the memory block nodes to the application program, and classifying the remaining memory into the destination memory block linked list, when When the released memory of the application program is detected, the released memory is put into a linked list of memory blocks whose size is equal to that of the node memory.

In the above system, preferably, the distribution unit is also used for:

After the search for the memory block linked list whose node memory size is suitable for the required memory size, in the found memory block linked list, when its node memory is lower than the size of the remaining memory of the required memory When the lower limit of the node memory is reached, all the memory of one of the memory block nodes is allocated to the application program.

In the above system, preferably, the memory block nodes in the memory block linked list are sorted linearly according to their memory addresses, and the memory addresses among the memory block nodes are discrete;

The system also includes:

A merging unit for merging the remaining memory into the destination memory block linked list, when the memory address of the remaining memory is continuous with the memory address of a certain memory block node in the destination memory block linked list Describe the remaining memory and memory block nodes continuous with its memory address;

And the categorization unit is further used to categorize the merged memory block nodes into the memory block linked list whose memory size is equal to that of the node.

In the above system, preferably, the search unit includes:

The search subunit is used to search for the memory block linked list identifier whose memory size of the node is compatible with the required memory size in the header linked list; wherein, the header linked list includes the memory block linked list identifier and the ID of the memory block linked list The node memory size of the memory block linked list corresponding to the memory block linked list identifier;

The determination subunit is used to identify the found memory block linked list, and determine the memory block linked list whose memory size of the node is suitable for the required memory size.

In the above memory allocation management method and system provided by the present invention, when the application program initially applies for memory, it allocates a large enough memory with a size of N and uses this memory to build a memory block list. The frequent applications to release memory form a linked list composed of many memory blocks with a size smaller than N. All the above linked lists form a memory block linked list set. The memory block linked list set includes at least one memory block linked list, and each memory block linked list includes at least one memory block. node and the node memory size of each memory block node is equal. Based on this, when the memory allocation request of the above-mentioned application program is received, at first, in the memory block linked list set for the application program, the memory block linked list whose size of the node memory is suitable for the required memory size is searched; The case where the memory size of the node that needs to be compatible with the memory size is larger than the required memory size and has the smallest difference with the required memory size (memory fragmentation will occur). Secondly, allocate memory equal to the required memory size in the memory of a memory block node in the found memory block linked list to the application program, and classify the remaining memory into the destination memory block linked list whose size of the node memory is equal to the size of the remaining memory. It can be seen that the present invention realizes reasonable management of memory fragments generated in the memory allocation process by classifying the remaining memory into the target memory block linked list whose size of the node memory is equal to the size of the remaining memory, and effectively improves the memory utilization rate.

At the same time, in the present invention, when the size of the remaining memory of the node memory of the found memory block linked list is not lower than the preset node memory lower limit value compared with the required memory, a memory block in the found memory block linked list is A memory equal to the required memory size in the memory of the node is allocated to the application program. By reasonably defining the lower limit of the node memory of the memory block linked list, it is possible to avoid frequent operations of residing the remaining memory, further reasonably manage memory fragmentation, and improve memory utilization.

Description of drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present invention or the prior art, the following will briefly introduce the drawings that need to be used in the description of the embodiments or the prior art. Obviously, the accompanying drawings in the following description are only It is an embodiment of the present invention, and those skilled in the art can also obtain other drawings according to the provided drawings without creative work.

FIG. 1 is a flowchart of a memory allocation management method provided by an embodiment of the present invention;

Fig. 2 is an overall flowchart of a practical application based on Fig. 1 provided by the embodiment of the present invention;

FIG. 3 is a memory allocation management structure diagram provided by an embodiment of the present invention;

FIG. 4 is a schematic structural block diagram of a memory allocation management system provided by an embodiment of the present invention.

detailed description

The following will clearly and completely describe the technical solutions in the embodiments of the present invention with reference to the accompanying drawings in the embodiments of the present invention. Obviously, the described embodiments are only some of the embodiments of the present invention, not all of them. Based on the embodiments of the present invention, all other embodiments obtained by persons of ordinary skill in the art without making creative efforts belong to the protection scope of the present invention.

The core of the present invention is to provide a memory allocation management method and system to reasonably manage memory fragments generated in the process of memory allocation, thereby improving memory utilization.

In order to enable those skilled in the art to better understand the solution of the present invention, the present invention will be further described in detail below in conjunction with the accompanying drawings and specific embodiments.

Referring to FIG. 1, FIG. 1 shows a flow chart of a memory allocation management method provided by an embodiment of the present invention. The method may specifically include the following steps:

Step S100, receiving a memory allocation request carrying a required memory size from an application program.

When the application program initially applies for memory, according to the actual needs, first allocate a large enough memory for it, the size of the memory block is N (integer power of 2), and then use this memory to build a memory block linked list. The frequent application of the application to release the memory forms a linked list composed of many memory blocks with a size smaller than N. All the above linked lists form a memory block linked list set. It can be understood that the memory block linked list set includes at least one memory block linked list, and in the present invention , each memory block linked list includes at least one memory block node, and the node memory sizes of each memory block node are equal.

In practical applications, if the initial allocation of memory fails, the corresponding prompt information will be fed back to the application. When this memory block is used up, allocate a memory block of the same size, and connect the newly allocated memory blocks in the form of a linked list. When it is detected that the application exits, the allocated memory block is released uniformly.

For each memory block linked list, the memory block nodes are sorted linearly according to their memory addresses, and the memory addresses among the memory block nodes are discrete. When the memory addresses of two adjacent nodes are continuous, the two are merged and put into the linked list of memory blocks of the corresponding size. In the present invention, the size of the memory block linked list represents the memory size corresponding to the memory block nodes.

Step S101 , in the memory block linked list set for the application program, search for a memory block linked list whose size of the node memory is compatible with the required memory size.

It can be understood that when the size of the node memory adapted to the required memory size is equal to the required memory size, the memory of the first node in the found memory block linked list is directly allocated to the application program; in fact, the present invention is mainly aimed at There will be memory fragmentation, that is, the node memory size suitable for the required memory size is larger than the required memory size, and the difference between the required memory size and the required memory size is the smallest among all node memory sizes larger than the required memory size . In addition, if the required memory size is less than an integer multiple of 2, the memory is allocated according to the closest integer multiple of 2.

In order to reduce the search time when traversing to find a suitable memory block linked list, and then improve the search efficiency, the present invention introduces the header linked list here, specifically, the headers of all the linked lists in the memory block linked list are linked in order according to the memory size to obtain the header A linked list, the header linked list includes a memory block linked list identifier and a node memory size of the memory block linked list corresponding to the memory block linked list identifier. Based on this, the above specific process of finding the memory block linked list whose node memory size is compatible with the required memory size is as follows:

Firstly, in the header linked list, find the memory block linked list identification whose node memory size is compatible with the required memory size; secondly, find the memory block linked list identification to determine the memory block whose node memory size is suitable for the required memory size linked list.

Step S102, in the searched memory block linked list, judge whether the size of the remaining memory of the node memory compared with the required memory is lower than the preset lower limit of the node memory, if yes, go to step S103, otherwise, go to step S104 .

Step S103, allocating the memory of a memory block node in the found memory block linked list to the application program.

Specifically, when allocating memory to the user, it is necessary to return the corresponding node in the memory block list to the user, and the memory management system does not need to care about the allocated memory block. When it detects that the application program requires release of memory, it directly operates the node of the memory block list can.

Step S104. Allocate the memory equal to the required memory size in the memory of a memory block node in the found memory block linked list to the application program, and put the remaining memory into the destination memory block linked list.

Wherein, the node memory size of the destination memory block linked list is equal to the size of the remaining memory.

In practical applications, if the corresponding memory block linked list is not found, create a new memory block linked list and add the remaining memory, and then insert the memory block linked list into the header linked list according to the size. After the remaining memory is classified into the destination memory block linked list, when the memory address of the remaining memory is continuous with the memory address of a certain memory block node in the destination memory block linked list, in order to ensure that each memory block node in each memory block linked list (corresponding The memory address of the memory block) is discrete, and it is necessary to merge the remaining memory and the memory block nodes (corresponding memory blocks) that are continuous with its memory address; linked list.

Same as the classification of the remaining memory, if the corresponding memory block linked list is not found, create a new memory block linked list and insert this memory block node, and then insert this memory block linked list into the header linked list according to the size. In fact, as long as a new memory block node is added to the corresponding memory block linked list, if there is a continuous memory address, the above node merging operation needs to be performed; it can be understood from the above that the new memory block node here can be It is the node of the remaining memory or the previously merged memory block. In practical applications, when necessary, the above merging process is iterative until the memory addresses of each memory block node in the memory block linked list are discrete. It can be understood that the above-mentioned sorting of the memory block linked list according to the linear address is beneficial to improve the efficiency when the memory block nodes are merged.

Whether it is step S103 or step S104, first, in order to ensure the order of the memory block list, a memory block node in the memory block linked list found above is preferably the head node; secondly, after the memory is allocated to the application program, due to Memory fragmentation will also occur when the application releases memory. At this time, in order to further reasonably manage memory fragmentation, it is necessary to include the released memory into the corresponding memory block linked list. Specifically: when the release of memory by the application is detected, the memory will be released Include the memory block list whose memory size is equal to that of the node; finally, after allocating the memory to the application program, the memory block node participating in the allocation (that is, the first node) is deleted from the memory block list to which it belongs, and subsequent nodes are added. If the memory block linked list is empty after deletion, the header of the memory block linked list is deleted from the header linked list.

For the overall implementation process of the above technical solution in actual application, reference may be made to the overall flow chart of an actual application shown in FIG. 2 based on FIG. 1 . Among them, the flow chart is conducive to clearly and concisely clarifying the overall implementation process of the above-mentioned technical solution of the present invention in practical applications, and it is precisely because of this that the text description content in the figure is relatively short and general, and specific content can be included in the corresponding position in the text Check out.

In summary, based on the memory block linked list, the present invention realizes reasonable management of memory fragments generated in the process of memory allocation by classifying the remaining memory into the target memory block linked list and the released memory into the memory block linked list, thereby effectively improving the efficiency of memory allocation. Memory utilization, thus effectively avoiding the following problems in the prior art: long-term operation will lead to system instability, and the longer the operation time, the more prone to problems the system will have, and even slower and slower.

At the same time, those skilled in the art can define the lower limit value of the node memory of the memory block linked list according to the actual situation, and the lower limit value of the node memory corresponds to the minimum memory block. This is because if the minimum memory block is too small, frequent insertion and For the merge operation, if the minimum memory block is too large, the memory utilization rate will decrease because the memory allocated to the user is too surplus. It is understandable that by reasonably defining the lower limit of the node memory, frequent allocation operations of remaining memory can be avoided, memory fragmentation can be further reasonably managed, and memory utilization can be improved.

Based on the technical solutions disclosed in the above embodiments of the present invention, in this embodiment, based on practical applications, the following programming codes can be referred to to realize the above technical solutions:

(1) The data structure of the memory block linked list, the header linked list and the initially allocated large memory block is as follows:

①Memory block linked list:

② Header linked list:

③ Initially allocated large memory block:

(2) Based on the data results in point (1), allocate a memory block of size N and initialize the structure Mempool. The initialization code is as follows:

Mempool *mempool;

Headlist*headlist;

Memlist*memlist;

void*memptr=(void*)malloc(N);

If(memptr==NULL)

return0;

//Initialize memlist (memory block linked list)

Memlist->memptr = *memptr;

memlist->next=NULL;

//Initialize headlist (header linked list)

Headlist->size=N;

headlist->num=1;

Headlist->list = memlist;

Headlist->next=NULL;

//Initialize mempool (allocate a memory block of size N)

Mempool->size=N;

Mempool->memptr=memptr;

Mempool->next=NULL;

Mempool->list=headlist;

(3) Find the appropriate table header linked list, find the memory block linked list that is greater than or equal to the memory block to be applied for, the code is as follows:

(4) Merge memory blocks with continuous addresses, the code is as follows:

(5) Release the requested memory

Based on the above function codes, combined with actual application scenarios, give an example:

Referring to the memory allocation management structure diagram shown in Figure 3, specifically, when an application program initially applies for memory, it first allocates a 10M memory block according to actual needs, and when the 10M memory block is used up, it allocates A memory block that is also 10M, these two 10M memory blocks are connected in the form of a linked list.

During the use of the first 10M memory block, due to the frequent application of applications to release memory, a linked list consisting of many memory blocks with a size smaller than 10M is formed, such as 2K, 8K, and 64K, etc., memory block nodes with equal memory sizes Form the corresponding memory block linked list, for example, the same 2K memory block nodes form a memory block linked list with a node memory size of 2K, and the headers of memory block linked lists with different node memory sizes form a header linked list. The node memory size of the linked list is sorted from small to large.

It should be noted that the above specific codes and specific values are all examples for those skilled in the art to understand the technical solution provided by the present invention, and those skilled in the art can make adjustments according to the actual situation, and the present invention is not strictly limited to this.

Based on the above memory allocation management method provided by the embodiment of the present invention, the embodiment of the present invention also provides a memory allocation management system. Referring to FIG. 4, the system 400 may include the following content:

The receiving unit 401 is configured to receive a memory allocation request carrying a required memory size from an application program;

A search unit 402, configured to search for a memory block chain list whose node memory size is compatible with the required memory size in the memory block chain list set for the application;

Among them, the node memory size that is suitable for the required memory size is larger than the required memory size and has the smallest difference with the required memory size; the memory block linked list set includes at least one memory block linked list, and the memory block linked list includes at least one memory block node and at least The node memory size of each memory block node in a memory block node is equal;

The allocating unit 403 is used to, in the found memory block linked list, when the size of the remaining memory of its node memory compared with the required memory is not lower than the preset node memory lower limit value, allocate one of the memory block nodes in the memory The memory equal to the required memory size is allocated to the application program, and the remaining memory is included in the destination memory block linked list;

Wherein, the node memory size of the destination memory block linked list is equal to the size of the remaining memory.

In the present invention, the above-mentioned system 400 may also include a subclassing unit, which is used to allocate the memory equal to the required memory size in the memory of one of the memory block nodes to the application program, and after the remaining memory is classified into the destination memory block linked list , when the released memory of the application is detected, the released memory will be included in the linked list of memory blocks whose size is equal to that of the node memory.

In the present invention, the above-mentioned allocation unit 403 can also be used for: after finding the memory block linked list whose node memory size is suitable for the required memory size, in the found memory block linked list, when the node memory is compared with the required memory size When the size of the remaining memory is lower than the lower limit of the node memory, all the memory of one of the memory block nodes is allocated to the application program.

In the present invention, each memory block node in the memory block linked list is sorted linearly according to its memory address, and the memory addresses between each memory block node are discrete;

The system 400 may also include a merging unit, which is used to merge the remaining memory with the memory address of a memory block node in the destination memory block list when the memory address of the remaining memory is continuous with the memory address of a memory block node in the destination memory block list after the remaining memory is included in the destination memory block linked list. A memory block node whose memory address is continuous;

And the categorization unit is also used for categorizing the merged memory block nodes into the memory block linked list whose memory size is equal to the memory size of the node.

In the present invention, the above-mentioned search unit may include the following content:

The search sub-unit is used to search for the memory block linked list identifier whose node memory size is compatible with the required memory size in the header linked list; wherein, the header linked list includes the memory block linked list identifier and the memory block corresponding to the memory block linked list identifier The node memory size of the linked list;

The determining subunit is used to identify the found memory block linked list, and determine the memory block linked list whose size of the node memory is compatible with the required memory size.

It should be noted that each embodiment in this specification is described in a progressive manner, and each embodiment focuses on the differences from other embodiments. For the same and similar parts in each embodiment, refer to each other, that is, Can. As for the system embodiment, because it is basically similar to the method embodiment, the description is relatively simple, and for related parts, please refer to the part of the description of the method embodiment.

The memory allocation management method and system provided by the present invention have been introduced in detail above. In this paper, specific examples are used to illustrate the principle and implementation of the present invention, and the descriptions of the above embodiments are only used to help understand the method and core idea of the present invention. It should be pointed out that for those skilled in the art, without departing from the principle of the present invention, some improvements and modifications can be made to the present invention, and these improvements and modifications also fall within the protection scope of the claims of the present invention.

Claims (10)

1. a Memory Allocation management method, is characterized in that, comprising:

Receive the Memory Allocation request of carrying required memory size from application program;

Concentrate at the memory block chained list for described application program, search the memory block chained list that node memory size and described required memory size adapt;

Wherein, the node memory size adapted with described required memory size is greater than described required memory size and minimum with described required memory magnitude difference; Described memory block chained list collection comprises at least one memory block chained list, and described memory block chained list comprises at least one memory block node and the node memory equal and opposite in direction of each memory block node at least one memory block node described;

In the memory block chained list found, when the size that its node memory compares the free memory of required memory is not less than default node memory lower limit, give described application program by the internal memory of a wherein memory block node with the equal-sized Memory Allocation of described required memory, and described free memory is included into object memory block chained list;

Wherein, the described node memory size of object memory block chained list and the equal and opposite in direction of described free memory.

2. the method for claim 1, it is characterized in that, give described application program by the internal memory of a wherein memory block node with the equal-sized Memory Allocation of described required memory described, and after described free memory is included into object memory block chained list, also comprise:

When the releasing memory of described application program being detected, described releasing memory is included into the memory block chained list that node memory size is equal with it.

3. the method for claim 1, is characterized in that, described search the memory block chained list that node memory size and described required memory size adapt after, also comprise:

In the described memory block chained list found, when the size that its node memory compares the free memory of described required memory is lower than described node memory lower limit, the internal memory of a wherein memory block node is all distributed to described application program.

4. method as described in claims 1 to 3 any one, is characterized in that, in described memory block chained list, each memory block node linearly sorts by its memory address, and memory address between each described memory block node is discrete;

After described free memory being included into described object memory block chained list, when the memory address consecutive hours of certain memory block node in the memory address and described object memory block chained list of described free memory, also comprise:

Merge described free memory and with its memory address continuous print memory block node;

The node memory size memory block chained list that memory size is equal is with it included into by merging the memory block node obtained.

5. method as claimed in claim 4, is characterized in that, described in search the memory block chained list that node memory size and described required memory size adapt, comprising:

In gauge outfit chained list, search the memory block chained list that described node memory size and described required memory size adapt and identify; Wherein, described gauge outfit chained list comprises described memory block chained list mark and identifies the node memory size of corresponding memory block chained list with described memory block chained list;

By the memory block chained list mark found, determine the memory block chained list that described node memory size and described required memory size adapt.

6. a Memory Allocation management system, is characterized in that, comprising:

Receiving element, for receiving the Memory Allocation request of carrying required memory size from application program;

Searching unit, for concentrating at the memory block chained list for described application program, searching the memory block chained list that node memory size and described required memory size adapt;

Wherein, the node memory size adapted with described required memory size is greater than described required memory size and minimum with described required memory magnitude difference; Described memory block chained list collection comprises at least one memory block chained list, and described memory block chained list comprises at least one memory block node and the node memory equal and opposite in direction of each memory block node at least one memory block node described;

Allocation units, for in the memory block chained list found, when the size that its node memory compares the free memory of required memory is not less than default node memory lower limit, give described application program by the internal memory of a wherein memory block node with the equal-sized Memory Allocation of described required memory, and described free memory is included into object memory block chained list;

Wherein, the described node memory size of object memory block chained list and the equal and opposite in direction of described free memory.

7. system as claimed in claim 6, is characterized in that, also comprise:

Be included into unit, for giving described application program by the internal memory of a wherein memory block node with the equal-sized Memory Allocation of described required memory described, and after described free memory is included into object memory block chained list, when the releasing memory of described application program being detected, described releasing memory is included into the memory block chained list that node memory size is equal with it.

8. system as claimed in claim 6, is characterized in that, described allocation units also for:

Described search the memory block chained list that node memory size and described required memory size adapt after, in the described memory block chained list found, when the size that its node memory compares the free memory of described required memory is lower than described node memory lower limit, the internal memory of a wherein memory block node is all distributed to described application program.

9. system as described in claim 6 to 8 any one, is characterized in that, in described memory block chained list, each memory block node linearly sorts by its memory address, and memory address between each described memory block node is discrete;

This system also comprises:

Merge cells, for after described free memory being included into described object memory block chained list, when the memory address consecutive hours of certain memory block node in the memory address and described object memory block chained list of described free memory, merge described free memory and with its memory address continuous print memory block node;

And described in be included into unit also for being included into the node memory size memory block chained list that memory size is equal with it by merging the memory block node that obtains.

10. system as claimed in claim 9, is characterized in that, described in search unit and comprise:

Search subelement, in gauge outfit chained list, search the memory block chained list that described node memory size and described required memory size adapt and identify; Wherein, described gauge outfit chained list comprises described memory block chained list mark and identifies the node memory size of corresponding memory block chained list with described memory block chained list;

Determine subelement, for the memory block chained list mark that will find, determine the memory block chained list that described node memory size and described required memory size adapt.