CN101140531A - Quick-speed application EMS memory method - Google Patents
Quick-speed application EMS memory method Download PDFInfo
- Publication number
- CN101140531A CN101140531A CNA2007101631415A CN200710163141A CN101140531A CN 101140531 A CN101140531 A CN 101140531A CN A2007101631415 A CNA2007101631415 A CN A2007101631415A CN 200710163141 A CN200710163141 A CN 200710163141A CN 101140531 A CN101140531 A CN 101140531A
- Authority
- CN
- China
- Prior art keywords
- memory
- memory block
- pointer
- pool
- memory pool
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 230000015654 memory Effects 0.000 title claims abstract description 300
- 238000000034 method Methods 0.000 title claims abstract description 30
- 238000012545 processing Methods 0.000 claims description 6
- 238000006073 displacement reaction Methods 0.000 claims description 5
- 230000006870 function Effects 0.000 claims description 4
- 238000003780 insertion Methods 0.000 claims description 3
- 230000037431 insertion Effects 0.000 claims description 3
- 238000010586 diagram Methods 0.000 description 6
- 230000008569 process Effects 0.000 description 5
- 238000006062 fragmentation reaction Methods 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 238000004891 communication Methods 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 238000013467 fragmentation Methods 0.000 description 2
- 230000007246 mechanism Effects 0.000 description 2
- 125000004122 cyclic group Chemical group 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000012797 qualification Methods 0.000 description 1
Images
Landscapes
- Memory System (AREA)
Abstract
The invention provides a method to quickly apply for memories. The method comprises the following steps: Step S102, when a system is powered on for initialization, divide a memory pool and create corresponding management structure; Step S104, establish a memory pool index list according to the divided memory pool; and Step S106, apply for a memory according to the divided memory pool and the memory pool index list. The invention can fulfill quick location for memory pools for memory blocks that are applied for, in order to effectively avoid time delay due to circulated searching for memory pools.
Description
Technical field
The present invention relates to the memory management field of computer operating system, relate in particular to the memory management of real-time performance requirement than higher embedded OS.
Background technology
In the embedded OS field, memory source all compares valuable usually.Yet, owing to use application and releasing memory continually, make and caused a large amount of memory fragmentations, just must reduce memory fragmentation so will make full use of memory source.
In order to reduce memory fragmentation, commonplace way is Installed System Memory to be carried out memory pool divide at present.This method is at first applied for a big internal memory, and it is divided into several region, again each district is subdivided into some memory blocks of equal size then, and the memory block in each district varies in size.Here said district is exactly a memory pool.
When the application internal memory, search for each memory pool according to using the memory size of being applied for, find contained memory block size to apply for the memory pool of memory size just greater than equaling, therefrom distribute a free memory block to return to the applicant, and be equipped with the zone bit of pass, if no free memory block just returns failure.
When releasing memory, the memory block pointer that provides according to application directly finds memory block and affiliated memory pool thereof, and is equipped with the pass zone bit.
All there is following shortcoming usually in this method: when application need application internal memory, often need to search for each memory pool according to the size of application internal memory, therefrom find sizeable memory block, normally circulation of process of search memory pool, because it is lower that efficiency ratio carried out in loop statement, so this method can have influence on the performance of system to a certain extent,, and realize complicated even used reasonable searching algorithm efficient still not high.Particularly in requiring than higher communication system to real-time, need frequent application memory block to come messaging, the application method of inefficiency is certain to have influence on the handling capacity of traffic.
Therefore, in internal memory pool managing mechanism, need a kind of method that can improve internal memory application efficient.
Summary of the invention
The invention provides a kind of method of quick-speed application EMS memory, this method may further comprise the steps: step S102, power on when carrying out initialization in system, and divide memory pool and also create corresponding management structure; Step S104 creates the memory pool concordance list according to the memory pool of being divided; And step S106, apply for internal memory according to memory pool of being divided and memory pool concordance list.
In addition, step S102 also comprises following processing: power on when carrying out initialization in system, the bulk memory of being applied for is divided into a plurality of memory pools, and each memory pool is divided into a plurality of memory blocks; A control domain is created for each memory pool by system; And with free memory block chained list of the composition of the free memory block in each memory pool.
Wherein, a plurality of memory blocks in each memory pool big or small identical, the varying in size of the memory block in the different memory pools, and the size of the memory block in the different memory pool satisfies k * 2
n, wherein, n and k are natural number.
An information header is created for each memory block by system, information header is positioned at the front of memory block, be used to write down the information of memory block, wherein, information header comprises the control domain pointer of memory block place memory pool and the information header pointer of the next free memory block in the free memory block chained list during as free memory block.
Control domain is used for the memory block in managing internal memory pond, and control domain comprises the information of the tail pointer of free memory block chained list in the head pointer of free memory block chained list in the quantity, place memory pool of the number of the size of the memory block that is comprised about the place memory pool, memory block that the place memory pool is comprised, free memory block that the place memory pool is comprised and the place memory pool.
When using the application internal memory, begin the storage allocation piece from the beginning of free memory block chained list, and the head pointer of the free memory block chained list in the control domain is revised as next free memory block pointer; The memory block pointer that will newly insert during releasing memory is appended to free memory block chained list afterbody, and the tail pointer of the free memory block chained list in the control domain is revised as the memory block pointer of new insertion.
Preferably, the memory pool concordance list is an one-dimension array, and each array element in the array is the control domain pointer.Wherein, in this array, the corresponding relation of array index index and array element element is: element=f ((index+1) * 2
n).Here, function f (x) expression application size is the control domain pointer of the affiliated memory pool of the memory block of x.
In addition, step S106 also comprises following processing: the control domain pointer that obtains the memory pool that will apply for according to predetermined operation; And judge whether to exist assignable memory block according to the information that writes down in the control domain pointer, if have then return the memory block of the head pointer indication of the free memory chained list that writes down in the control domain, and head pointer is revised as next memory block pointer, if not then return failed message.
Wherein, predetermined operation is: the memory size that will need the to apply for n position that moves to right, the array that the displacement back is obtained be as the subscript of the array of memory pool concordance list, obtains the control domain pointer of the memory pool that will apply for then according to subscript.
By of the present invention, can solve the inefficient problem of internal memory application in the internal memory pool managing mechanism.
Other features and advantages of the present invention will be set forth in the following description, and, partly from instructions, become apparent, perhaps understand by implementing the present invention.Purpose of the present invention and other advantages can realize and obtain by specifically noted structure in the instructions of being write, claims and accompanying drawing.
Description of drawings
Accompanying drawing is used to provide further understanding of the present invention, and constitutes the part of instructions, is used from explanation the present invention with embodiments of the invention one, is not construed as limiting the invention.In the accompanying drawings:
Fig. 1 is the process flow diagram that illustrates according to the method for quick-speed application EMS memory of the present invention;
Fig. 2 is the synoptic diagram that illustrates according to the memory pool structure of the embodiment of the invention;
Fig. 3 is the synoptic diagram that illustrates according to the concordance list structure of the embodiment of the invention; And
Fig. 4 is the process flow diagram that illustrates according to the application internal memory of the embodiment of the invention.
Embodiment
Below in conjunction with accompanying drawing the preferred embodiments of the present invention are described, should be appreciated that preferred embodiment described herein only is used for description and interpretation the present invention, and be not used in qualification the present invention.
Below, the present invention will be described in conjunction with the accompanying drawings.
Fig. 1 is the process flow diagram that illustrates according to the method for quick-speed application EMS memory of the present invention.
With reference to Fig. 1, this method may further comprise the steps: step S102, power on when carrying out initialization in system, and divide memory pool and also create corresponding management structure; Step S104 creates the memory pool concordance list according to the memory pool of being divided; And step S106, apply for internal memory according to memory pool of being divided and memory pool concordance list.
In addition, step S102 also comprises following processing: power on when carrying out initialization in system, the bulk memory of being applied for is divided into a plurality of memory pools, and each memory pool is divided into a plurality of memory blocks; A control domain is created for each memory pool by system; And with free memory block chained list of the composition of the free memory block in each memory pool.
Wherein, a plurality of memory blocks in each memory pool big or small identical, the varying in size of the memory block in the different memory pools, and the size of the memory block in the different memory pool satisfies k * 2
n, wherein, n and k are natural number.
An information header is created for each memory block by system, information header is positioned at the front of memory block, be used to write down the information of memory block, wherein, information header comprises the control domain pointer of memory block place memory pool and the information header pointer of the next free memory block in the free memory block chained list during as free memory block.
Control domain is used for the memory block in managing internal memory pond, and control domain comprises the information of the tail pointer of free memory block chained list in the head pointer of free memory block chained list in the quantity, place memory pool of the number of the size of the memory block that is comprised about the place memory pool, memory block that the place memory pool is comprised, free memory block that the place memory pool is comprised and the place memory pool.
When using the application internal memory, begin the storage allocation piece from the beginning of free memory block chained list, and the head pointer of the free memory block chained list in the control domain is revised as next free memory block pointer; The memory block pointer that will newly insert during releasing memory is appended to free memory block chained list afterbody, and the tail pointer of the free memory block chained list in the control domain is revised as the memory block pointer of new insertion.。
Preferably, the memory pool concordance list is an one-dimension array, and each array element in the array is the control domain pointer.Wherein, in this array, the corresponding relation of array index index and array element element is: element=f ((index+1) * 2
n).Here, function f (x) expression application size is the control domain pointer of the affiliated memory pool of the memory block of x.
In addition, step S106 also comprises following processing: the control domain pointer that obtains the memory pool that will apply for according to predetermined operation; And judge whether to exist assignable memory block according to the information that writes down in the control domain pointer, if have then return the memory block of the head pointer indication of the free memory chained list that writes down in the control domain, and head pointer is revised as next memory block pointer, if not then return failed message.
Wherein, predetermined operation is: the memory size that will need the to apply for n position that moves to right, the array that the displacement back is obtained be as the subscript of the array of memory pool concordance list, obtains the control domain pointer of the memory pool that will apply for then according to subscript.
Below, describe embodiments of the invention in detail in conjunction with Fig. 2 to Fig. 4.
Power on when carrying out initialization in system, partly apply for bulk memory in internal memory initialization, and it is divided into several memory pools.Comprise several equal size internal memory pieces in each memory pool again, memory block size (size) difference that is comprised in the different memory pools, but all to meet certain requirement:
size＝k×2
n
Here, variable k and n are natural numbers, and variable k is used for embodying the memory block that different memory pools comprise and varies in size.The value of n is decided according to application demand, in communication system, selects 6 proper (that is: the size of memory block all must be 64 multiple in the different memory pools) usually.
The structure of memory pool as shown in the figure, has been divided 8 memory pools as shown in Figure 2 in the present embodiment, and the byte number of memory block is respectively in each memory pool: 64,128,256,512, and 1K, 2K, 4K, 8K.This shows that in the present embodiment, the n value is 6, the value of k is respectively 1,2, and 4,8,16,32,64,128.
As shown in Figure 2, when dividing memory block, system creates information header (head) for simultaneously each memory block, and the front that it is positioned at memory block is used to write down the information of memory block, comprising in have: the PoolMgt pointer of this memory pool; And during as free memory block in this memory pool the head pointer of the next free memory block in the free memory block chained list.
Then, system creates control domain (PoolMgt) for each memory pool, and it is used for the memory block in managing internal memory pond, comprising information have: the size of the contained memory block of this memory pool; The number of the contained memory block of this memory pool; The quantity of this memory pool free memory block; The head pointer of this memory pool free memory block chained list; And the tail pointer of this memory pool free memory block chained list.
Then, the free memory block in the memory pool is formed a chained list.Just from linked list head storage allocation piece, and the head pointer of the chained list among the modification PoolMgt is next free memory block during internal memory in application; Just be appended to the chained list tail during releasing memory, and the tail pointer of the chained list among the modification PoolMgt is the new memory block pointer that inserts.
Subsequently, create the memory pool concordance list according to the memory pool of being divided.Here, concordance list is an one-dimension array, and what each element was deposited in the array is the PoolMgt pointer.The corresponding relation of array index (Index) and array element (element) is:
element＝f((Index+1)×2
n)；
Wherein, function f (x) expression application size is the PoolMgt pointer of the affiliated memory pool of the memory block of x.
In the present embodiment, the n value is 6, then 2
nBe exactly 64.Because memory block maximum in the present embodiment is 8K (64 * 128), then the length of concordance list is exactly 128.Figure 3 illustrates the concordance list of present embodiment.
Fig. 4 is the process flow diagram that illustrates according to the application internal memory of the embodiment of the invention.When using the application memory block, earlier the memory size of the using application n position that moves to right, again the subscript of the numerical value of displacement back acquisition as the memory pool array of indexes, obtain the numerical value of array of indexes respective element then, this numerical value is exactly the PoolMgt pointer of using the memory pool under the memory block that will apply for.
In the present embodiment, the value of n is 6, if use application in save as 100 bytes, moving to right 100 6 so earlier, to obtain a temp value be 1, and again 1 subscript as array of indexes, the Ptr of acquisition points to PoolMgt2, that is the PoolMgt pointer of second memory pool.
Quantity according to this memory pool free memory block that writes down among the PoolMgt2 judges whether to exist assignable free memory block, if not then return failure, otherwise return the memory block of head pointer indication of the free memory block chained list of this memory pool that writes down among the PoolMgt2, and to upgrade this head pointer be its next memory block in idle chained list.
This shows that the present invention is by dividing the memory pool size dexterously, and in conjunction with index technology and displacement skill efficiently, realize the memory pool under the memory block of quick position application application, thereby effectively avoided the time delay brought because of the cyclic search memory pool.The present invention is simply efficient, in requiring than higher embedded OS to real-time very high using value is arranged.
Be the preferred embodiments of the present invention only below, be not limited to the present invention, for a person skilled in the art, the present invention can have various changes and variation.Within the spirit and principles in the present invention all, any modification of being done, be equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (10)
1. the method for a quick-speed application EMS memory is characterized in that, said method comprising the steps of:
Step S102 powers on when carrying out initialization in system, divides memory pool and also creates corresponding management structure;
Step S104 creates the memory pool concordance list according to the memory pool of being divided; And
Step S106 applies for internal memory according to memory pool of being divided and described memory pool concordance list.
2. method according to claim 1 is characterized in that, described step S102 also comprises following processing:
Power on when carrying out initialization in described system, the bulk memory of being applied for is divided into a plurality of memory pools, and each memory pool is divided into a plurality of memory blocks;
A control domain is created for each memory pool by described system; And
Free memory block in each memory pool is formed a free memory block chained list.
3. method according to claim 2 is characterized in that, a plurality of memory blocks in each memory pool big or small identical, and the varying in size of the memory block in the different memory pools, and the size of the memory block in the different memory pool satisfies k * 2
n, wherein, n and k are natural number.
4. method according to claim 2, it is characterized in that, an information header is created for each memory block by described system, described information header is positioned at the front of described memory block, be used to write down the information of described memory block, wherein, described information header comprises the control domain pointer of described memory block place memory pool and the information header pointer of the next free memory block in described free memory block chained list during as free memory block.
5. method according to claim 2, it is characterized in that, described control domain is used for the memory block in managing internal memory pond, and the information that described control domain comprises has: the tail pointer of free memory block chained list in the head pointer of free memory block chained list and the place memory pool in the quantity of the number of the memory block that the size of the memory block that this memory pool comprised, place memory pool are comprised, the free memory block that the place memory pool is comprised, the place memory pool.
6. method according to claim 5, it is characterized in that, when using the application internal memory, begin the storage allocation piece from the beginning of described free memory block chained list, and the head pointer of the described free memory block chained list in the described control domain is revised as next free memory block pointer; The memory block pointer that will newly insert during releasing memory is appended to the afterbody of described free memory block chained list, and the tail pointer of the described free memory block chained list in the described control domain is revised as the memory block pointer of described new insertion.
7. method according to claim 1 is characterized in that, described memory pool concordance list is an one-dimension array, and each array element in the described array is the control domain pointer.
8. method according to claim 7 is characterized in that, in described array, the corresponding relation of array index index and array element element is:
element＝f((index+1)×2
n)
Function f (x) expression application size is the control domain pointer of the affiliated memory pool of the memory block of x.
9. method according to claim 1 is characterized in that, described step S106 also comprises following processing:
Obtain the control domain pointer of the memory pool that will apply for according to predetermined operation; And
Judge whether to exist assignable memory block according to the information that writes down in the described control domain pointer, if have then return the memory block of the head pointer indication of the free memory chained list that writes down in the described control domain, and described head pointer is revised as next memory block pointer, if not then return failed message.
10. method according to claim 9 is characterized in that, described predetermined operation is:
With the memory size of the needs application n position that moves to right, the array that the displacement back is obtained is as the subscript of the array of described memory pool concordance list, obtains the described control domain pointer of the memory pool that will apply for then according to described subscript.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2007101631415A CN100517242C (en) | 2007-10-10 | 2007-10-10 | Quick memory application method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB2007101631415A CN100517242C (en) | 2007-10-10 | 2007-10-10 | Quick memory application method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101140531A true CN101140531A (en) | 2008-03-12 |
| CN100517242C CN100517242C (en) | 2009-07-22 |
Family
ID=39192491
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB2007101631415A Expired - Fee Related CN100517242C (en) | 2007-10-10 | 2007-10-10 | Quick memory application method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN100517242C (en) |
Cited By (24)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101499034A (en) * | 2009-03-05 | 2009-08-05 | 北京中星微电子有限公司 | Internal memory management method |
| CN102063385A (en) * | 2010-12-23 | 2011-05-18 | 深圳市金宏威实业发展有限公司 | Memory management method and system |
| CN102880507A (en) * | 2012-09-12 | 2013-01-16 | 科立讯通信股份有限公司 | Method for applying and distributing chain structure message |
| CN102981964A (en) * | 2012-11-01 | 2013-03-20 | 华为技术有限公司 | Method and system of data storage space management |
| CN103176911A (en) * | 2011-12-20 | 2013-06-26 | 陕西银河网电科技有限公司 | Embedded type software security memory management method |
| CN103873389A (en) * | 2012-12-12 | 2014-06-18 | 北京百度网讯科技有限公司 | Identity resource allocation method and system thereof |
| CN104965795A (en) * | 2015-06-16 | 2015-10-07 | 重庆邮电大学 | Allocation method for embedded system static memory pool |
| CN105159837A (en) * | 2015-08-20 | 2015-12-16 | 广东睿江科技有限公司 | Memory management method |
| CN103176911B (en) * | 2011-12-20 | 2016-12-14 | 陕西银河网电科技有限公司 | A kind of embedded software secure memory management method |
| CN106991010A (en) * | 2017-03-22 | 2017-07-28 | 武汉虹信通信技术有限责任公司 | A kind of internal memory for streaming media server concentrates dynamic allocation method |
| CN107391253A (en) * | 2017-06-08 | 2017-11-24 | 珠海金山网络游戏科技有限公司 | A kind of method for reducing Installed System Memory distribution release conflict |
| CN109101438A (en) * | 2018-07-25 | 2018-12-28 | 百度在线网络技术（北京）有限公司 | Method and apparatus for storing data |
| CN105718319B (en) * | 2016-02-23 | 2019-03-15 | 中国科学院微电子研究所 | Memory pool layout analysis method and memory pool device |
| CN109508235A (en) * | 2018-09-28 | 2019-03-22 | 深圳市紫光同创电子有限公司 | A kind of internal memory pool managing method, apparatus and computer readable storage medium |
| CN109710408A (en) * | 2018-12-24 | 2019-05-03 | 杭州迪普科技股份有限公司 | EMS memory management process and device |
| CN109815194A (en) * | 2019-02-01 | 2019-05-28 | 北京沃东天骏信息技术有限公司 | Indexing means, indexing unit, computer readable storage medium and electronic equipment |
| CN110209493A (en) * | 2019-04-11 | 2019-09-06 | 腾讯科技（深圳）有限公司 | EMS memory management process, device, electronic equipment and storage medium |
| CN112306695A (en) * | 2020-11-19 | 2021-02-02 | 中国民航信息网络股份有限公司 | Data processing method and device, electronic equipment and computer storage medium |
| CN112506813A (en) * | 2020-12-29 | 2021-03-16 | 郑州信大捷安信息技术股份有限公司 | Memory management method and system |
| CN112685188A (en) * | 2021-03-22 | 2021-04-20 | 四川九洲电器集团有限责任公司 | Embedded memory management method and device based on global byte array |
| CN113391922A (en) * | 2021-06-16 | 2021-09-14 | 天津津航计算技术研究所 | Embedded software memory application and release method |
| CN113419858A (en) * | 2021-06-30 | 2021-09-21 | 明见（厦门）技术有限公司 | Dynamic memory allocation method |
| CN116361234A (en) * | 2023-06-02 | 2023-06-30 | 深圳中安辰鸿技术有限公司 | Memory management method, device and chip |
| WO2023142936A1 (en) * | 2022-01-30 | 2023-08-03 | 华为技术有限公司 | Memory management method and system, and related apparatus |
-
2007
- 2007-10-10 CN CNB2007101631415A patent/CN100517242C/en not_active Expired - Fee Related
Cited By (31)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101499034A (en) * | 2009-03-05 | 2009-08-05 | 北京中星微电子有限公司 | Internal memory management method |
| CN102063385A (en) * | 2010-12-23 | 2011-05-18 | 深圳市金宏威实业发展有限公司 | Memory management method and system |
| CN103176911A (en) * | 2011-12-20 | 2013-06-26 | 陕西银河网电科技有限公司 | Embedded type software security memory management method |
| CN103176911B (en) * | 2011-12-20 | 2016-12-14 | 陕西银河网电科技有限公司 | A kind of embedded software secure memory management method |
| CN102880507A (en) * | 2012-09-12 | 2013-01-16 | 科立讯通信股份有限公司 | Method for applying and distributing chain structure message |
| CN102981964A (en) * | 2012-11-01 | 2013-03-20 | 华为技术有限公司 | Method and system of data storage space management |
| CN103873389A (en) * | 2012-12-12 | 2014-06-18 | 北京百度网讯科技有限公司 | Identity resource allocation method and system thereof |
| CN103873389B (en) * | 2012-12-12 | 2018-05-04 | 北京百度网讯科技有限公司 | One kind mark resource allocation methods and system |
| CN104965795B (en) * | 2015-06-16 | 2018-02-27 | 重庆邮电大学 | The distribution method in embedded system static memory pond |
| CN104965795A (en) * | 2015-06-16 | 2015-10-07 | 重庆邮电大学 | Allocation method for embedded system static memory pool |
| CN105159837A (en) * | 2015-08-20 | 2015-12-16 | 广东睿江科技有限公司 | Memory management method |
| CN105718319B (en) * | 2016-02-23 | 2019-03-15 | 中国科学院微电子研究所 | Memory pool layout analysis method and memory pool device |
| CN106991010B (en) * | 2017-03-22 | 2019-11-08 | 武汉虹信通信技术有限责任公司 | A kind of memory concentration dynamic allocation method for streaming media server |
| CN106991010A (en) * | 2017-03-22 | 2017-07-28 | 武汉虹信通信技术有限责任公司 | A kind of internal memory for streaming media server concentrates dynamic allocation method |
| CN107391253B (en) * | 2017-06-08 | 2020-12-08 | 珠海金山网络游戏科技有限公司 | Method for reducing system memory allocation release conflict |
| CN107391253A (en) * | 2017-06-08 | 2017-11-24 | 珠海金山网络游戏科技有限公司 | A kind of method for reducing Installed System Memory distribution release conflict |
| CN109101438A (en) * | 2018-07-25 | 2018-12-28 | 百度在线网络技术（北京）有限公司 | Method and apparatus for storing data |
| CN109508235A (en) * | 2018-09-28 | 2019-03-22 | 深圳市紫光同创电子有限公司 | A kind of internal memory pool managing method, apparatus and computer readable storage medium |
| CN109710408B (en) * | 2018-12-24 | 2020-08-04 | 杭州迪普科技股份有限公司 | Memory management method and device |
| CN109710408A (en) * | 2018-12-24 | 2019-05-03 | 杭州迪普科技股份有限公司 | EMS memory management process and device |
| CN109815194A (en) * | 2019-02-01 | 2019-05-28 | 北京沃东天骏信息技术有限公司 | Indexing means, indexing unit, computer readable storage medium and electronic equipment |
| CN110209493A (en) * | 2019-04-11 | 2019-09-06 | 腾讯科技（深圳）有限公司 | EMS memory management process, device, electronic equipment and storage medium |
| CN112306695A (en) * | 2020-11-19 | 2021-02-02 | 中国民航信息网络股份有限公司 | Data processing method and device, electronic equipment and computer storage medium |
| CN112506813A (en) * | 2020-12-29 | 2021-03-16 | 郑州信大捷安信息技术股份有限公司 | Memory management method and system |
| CN112685188A (en) * | 2021-03-22 | 2021-04-20 | 四川九洲电器集团有限责任公司 | Embedded memory management method and device based on global byte array |
| CN113391922A (en) * | 2021-06-16 | 2021-09-14 | 天津津航计算技术研究所 | Embedded software memory application and release method |
| CN113419858A (en) * | 2021-06-30 | 2021-09-21 | 明见（厦门）技术有限公司 | Dynamic memory allocation method |
| CN113419858B (en) * | 2021-06-30 | 2024-02-13 | 明见（厦门）技术有限公司 | Dynamic memory allocation method |
| WO2023142936A1 (en) * | 2022-01-30 | 2023-08-03 | 华为技术有限公司 | Memory management method and system, and related apparatus |
| CN116361234A (en) * | 2023-06-02 | 2023-06-30 | 深圳中安辰鸿技术有限公司 | Memory management method, device and chip |
| CN116361234B (en) * | 2023-06-02 | 2023-08-08 | 深圳中安辰鸿技术有限公司 | Memory management method, device and chip |
Also Published As
| Publication number | Publication date |
|---|---|
| CN100517242C (en) | 2009-07-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100517242C (en) | Quick memory application method | |
| CN104731799A (en) | Memory database management device | |
| US7685396B2 (en) | System and method for dynamic memory allocation | |
| US20050213377A1 (en) | Compressed file system for non-volatile RAM | |
| CN100462940C (en) | Method and apparatus for cache data in memory | |
| CN101286157A (en) | File retrieval method and apparatus and time stream file processor | |
| CN103608782A (en) | Selective data storage in LSB and MSB pages | |
| CN101526923A (en) | Data processing method, device thereof and flash-memory storage system | |
| WO2007019174A2 (en) | Data operations in flash memories utilizing direct data file storage | |
| CN106980541A (en) | A kind of big page memory compression recovery system and method | |
| CN107016100A (en) | A kind of metadata management method based on Nonvolatile memory file system | |
| CN104298605A (en) | Method of grouping blocks used for garbage collection action in solid state drive | |
| EP4100846A2 (en) | Data management system and method of controlling | |
| CN103678172A (en) | Local data cache management method and device | |
| WO2017050064A1 (en) | Memory management method and device for shared memory database | |
| CN101777061A (en) | JAVA card object management method and JAVA card | |
| CN101777028A (en) | Realization method and device of mixed secondary storage system | |
| CN105630413B (en) | A kind of synchronization write-back method of data in magnetic disk | |
| CN101840430A (en) | Intelligent card database multi-list operation method and device | |
| CN100361094C (en) | Method for saving global varible internal memory space | |
| CN101783740A (en) | Method and device for managing message file | |
| CN102455976A (en) | Middleware memory management scheme | |
| CN106155917A (en) | EMS memory management process and device | |
| CN101727503A (en) | Method for establishing disk file system | |
| CN103389945A (en) | Memory management method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20151223 Address after: 100031 Beijing Qianmen West Street, Xicheng District, No. 41 Patentee after: State Grid Beijing Electric Power Company Patentee after: State Grid Corporation of China Address before: 518057 Nanshan District science and Technology Industrial Park, Guangdong high tech Industrial Park, ZTE building Patentee before: ZTE Corporation |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090722 Termination date: 20161010 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |