CN102521139A - Method and device for internal memory management - Google Patents
Method and device for internal memory management Download PDFInfo
- Publication number
- CN102521139A CN102521139A CN2011103848042A CN201110384804A CN102521139A CN 102521139 A CN102521139 A CN 102521139A CN 2011103848042 A CN2011103848042 A CN 2011103848042A CN 201110384804 A CN201110384804 A CN 201110384804A CN 102521139 A CN102521139 A CN 102521139A
- Authority
- CN
- China
- Prior art keywords
- memory
- pointer
- internal memory
- pointed
- space
- 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.)
- Pending
Links
Images
Abstract
An embodiment of the invention provides a method and a device for internal memory management, which relate to the field of internal memory management. A first indicator is acquired by acquiring an initiation indicator which points to a free internal memory closest to the distribution initial point of an internal memory, and the first indicator points to an occupied internal memory closest to the initiation indicator. When the first indicator does not point to the internal memory terminal point, the occupied internal memory is locked, contents in the occupied internal memory are moved to the distribution initial point of the internal memory, the first indicator is updated, the occupied internal memory is unlocked, a second indicator points to the first indicator and is used for accessing the occupied internal memory to resolve the problem in the prior art that errors or boundary crossing problems occur when program accesses the internal memory after the internal memory is cleared up. The method and the device are used for clearing up the internal memory.
Description
Technical field
The present invention relates to the memory management field, relate in particular to a kind of method and apparatus of memory management.
Background technology
System is in operation needs frequent application and releasing memory, and in long-term operational process, system can produce a large amount of memory fragmentations; And when memory fragmentation quantity acquired a certain degree, because scattered memory fragmentation is too many, and the space of memory fragmentation was too little; Can't satisfy the internal memory of application; But because of the existence of a large amount of memory fragmentations, making has enough memory headrooms in the system again, therefore can cause free memory enough but to apply for the problem less than internal memory; Influence the stable operation of system, need carry out the arrangement of memory fragmentation.
Prior art mainly is to move through the internal memory that will take to the arrangement of internal memory; Thereby the internal memory that will take is integrated into together; After but internal memory moves; Read position before program still moves from internal memory, thereby after causing memory scrubbing, the problem that the routine access internal memory is made mistakes or crossed the border.
Summary of the invention
Embodiments of the invention provide a kind of method and apparatus of memory management, behind memory scrubbing in the solution prior art, and the problem that the routine access internal memory is made mistakes or crossed the border.
For achieving the above object, embodiments of the invention adopt following technical scheme:
A kind of method of memory management comprises:
Obtain initial pointer, the free memory that said initial pointed is nearest apart from the distribution starting point of internal memory;
Obtain first pointer, the nearest committed memory of the said first pointed said initial pointer of distance;
When said first pointer does not point to the internal memory terminal point; Pin said committed memory; And move the content in the said committed memory to the distribution starting point of said internal memory, upgrade said first pointer, the said committed memory of release; Through said first pointer of second pointed, said second pointer is used to visit said committed memory.
A kind of method of memory management comprises:
Receive the Memory Allocation request, comprise the memory size that request distributes in the said Memory Allocation request;
When the memory size that exists a continuous free memory to distribute more than or equal to described request in the internal memory, in said internal memory, distribute first internal memory for said Memory Allocation request, the size of said first internal memory equals the memory size of described request distribution;
In the pointer space of said internal memory, preserve first pointer, said first internal memory of said first pointed;
Distribute second pointer, described first pointer of said second pointed is used to visit said first internal memory.
A kind of device of memory management comprises: first acquiring unit, second acquisition unit and arrangement unit;
Said first acquiring unit is used to obtain initial pointer, the distribution starting point of said initial pointed internal memory;
Said second acquisition unit is used to obtain first pointer, the nearest committed memory of the said first pointed said distribution starting point of distance;
Said arrangement unit; Be used for when said first pointer does not point to the internal memory terminal point; Pin said committed memory, and move the content in the said committed memory, upgrade said first pointer to the distribution starting point of said internal memory; The said committed memory of release is through said first pointer of second pointed.
A kind of device of memory management comprises:
Receiving element is used to receive the Memory Allocation request, comprises the memory size that request distributes in the said Memory Allocation request;
First allocation units are used for distributing first internal memory at said internal memory for said Memory Allocation request, and the size of said first internal memory equals the memory size that described request is distributed, and in the pointer space of said internal memory, preserve the pointer that points to said first internal memory;
Second allocation units are used to distribute second pointer, and described first pointer of said second pointed is used to visit said first internal memory.
The embodiment of the invention provides a kind of method and apparatus of memory management, and this method comprises: obtain initial pointer, the free memory that said initial pointed is nearest apart from the distribution starting point of internal memory; Obtain first pointer, the nearest committed memory of the said first pointed said initial pointer of distance is not when said first pointer points to the internal memory terminal point; Pin said committed memory; And move the content in the said committed memory to the distribution starting point of said internal memory, upgrade said first pointer, the said committed memory of release; Through said first pointer of second pointed, said second pointer is used to visit said committed memory.Like this, through second rank pointer is set, with second pointed, first pointer of accessed content in the program; And the internal memory of this content of first pointed storage after carrying out memory scrubbing, changes though store the memory headroom of this content like this; But second pointed remain first pointer; Thereby program still can correctly be visited this content, thereby has solved in the prior art behind the memory scrubbing problem that the routine access internal memory is made mistakes or crossed the border.
Description of drawings
In order to be illustrated more clearly in the embodiment of the invention or technical scheme of the prior art; To do to introduce simply to the accompanying drawing of required use in embodiment or the description of the Prior Art below; Obviously, the accompanying drawing in describing below only is some embodiments of the present invention, for those of ordinary skills; Under the prerequisite of not paying creative work, can also obtain other accompanying drawing according to these accompanying drawings.
The method synoptic diagram of a kind of memory management that Fig. 1 provides for the embodiment of the invention;
The method synoptic diagram of the another kind of memory management that Fig. 2 provides for the embodiment of the invention;
The schematic flow sheet of the method for another memory management that Fig. 3 provides for the embodiment of the invention;
The structural representation of the device of a kind of memory management that Fig. 4 provides for the embodiment of the invention;
The structural representation of the device of the another kind of memory management that Fig. 5 provides for the embodiment of the invention;
The structural representation of the device of the another kind of memory management that Fig. 6 provides for the embodiment of the invention.
The structural representation of the device of the another kind of memory management that Fig. 7 provides for the embodiment of the invention.
The structural representation of the device of another memory management that Fig. 8 provides for the embodiment of the invention.
Embodiment
To combine the accompanying drawing in the embodiment of the invention below, the technical scheme in the embodiment of the invention is carried out clear, intactly description, obviously, described embodiment only is the present invention's part embodiment, rather than whole embodiment.Based on the embodiment among the present invention, those of ordinary skills are not making the every other embodiment that is obtained under the creative work prerequisite, all belong to the scope of the present invention's protection.
For convenient narration, internal memory is defined as a formation, in all embodiment of the present invention, the two ends of memory queue are called head of the queue and tail of the queue respectively; And internal memory is divided into pointer space and memory headroom two parts, and wherein, this memory headroom is used for memory contents, and this pointer space is used for storing the pointer that points to content; Pointer space and memory headroom include a plurality of memory storage units, and the address size of memory storage unit is increased progressively to tail of the queue by head of the queue; The distribution starting point of internal memory is meant first memory storage unit of arbitrary end in the two ends that are in memory headroom.
The embodiment of the invention provides a kind of method of memory management, and the executive agent of the method for this memory management can be the network equipment, subscriber terminal equipment etc.Concrete, this executive agent can be the memory manager in the equipment, this method embodiment has described the memory scrubbing process in a kind of EMS memory management process, and is as shown in Figure 1, comprising:
101, obtain initial pointer.
Wherein, this initial pointed free memory nearest apart from the distribution starting point of internal memory.
Concrete, if the distribution starting point of internal memory is committed memory, the free memory that then initial pointed is nearest apart from the distribution starting point of internal memory; Need to prove; If the distribution starting point of internal memory is a free memory; This initial pointed free memory nearest then apart from the distribution starting point of internal memory; Be specially the distribution starting point of pointing to this internal memory, that is to say, this moment, the free memory nearest apart from the distribution starting point of internal memory was exactly this distribution starting point.
102, obtain first pointer.
Wherein, the nearest committed memory of this first pointed this initial pointer of distance.
Further, this first pointer is stored in the pointer space of said internal memory; This pointer space can be positioned at head of the queue, also can be positioned at tail of the queue, and is corresponding, the distribution starting point of internal memory both can with the pointer space homonymy, also can with the pointer space heteropleural.
In addition, this pointer space can be static, also can be dynamic.When said pointer space is static state, the distribution starting point of said internal memory can with said pointer space homonymy or heteropleural.When this pointer space when being dynamic, said Memory Allocation starting point and said pointer space heteropleural.
103, when this first pointer does not point to the internal memory terminal point; Pin this committed memory, and move this content in committed memory, upgrade this first pointer to the distribution starting point of this internal memory; This committed memory of release is through this first pointer of second pointed;
Particularly, this second pointer is used to visit this committed memory.
Alternatively, before obtaining initial pointer, receive the Memory Allocation request, comprise the memory size that request distributes in this Memory Allocation request, can after receive the Memory Allocation request at every turn, all trigger and carry out above-mentioned 101 to 103 memory scrubbing; Also can work as the memory size that continuous free memory distributes less than this request, and all free memories distribute more than or equal to this request memory size the time, trigger and carry out above-mentioned 101 to 103 memory scrubbing.
Further, before 103, this method also comprises: judge whether this first pointer points to the internal memory terminal point, if judged result then carries out 103 for not; If judged result is for being then end.
Alternatively, judge that whether this first pointer points to the internal memory terminal point, is specially: when the distribution starting point of this internal memory and this pointer space homonymy, if can get access to first pointer, then judged result is not for; If can not get access to first pointer, then judged result is for being.
Alternatively, judge that whether this first pointer points to the internal memory terminal point, is specially: when this pointer space is positioned at head of the queue, and should distribute starting point and this pointer space heteropleural the time, if first pointer that gets access to less than the tail address of this pointer space, then judged result is for being; If first pointer that gets access to is more than or equal to the tail address of this pointer space, then judged result is for denying.
Alternatively; Judge that whether this first pointer points to the internal memory terminal point, is specially: when this pointer space is positioned at tail of the queue, and should distribute starting point and this pointer space heteropleural the time; If first pointer that gets access to is greater than the first address of this pointer space; Then judged result is for being, as if the first address of first pointer that gets access to smaller or equal to this pointer space, then judged result is for denying.
The technical scheme that adopts the embodiment of the invention to provide is through being provided with second rank pointer, with second pointed, first pointer of accessed content in the program; And the internal memory of this content of first pointed storage after carrying out memory scrubbing, changes though store the memory headroom of this content like this; But second pointed remain first pointer; Thereby program still can correctly be visited this content, thereby has solved in the prior art behind the memory scrubbing problem that the routine access internal memory is made mistakes or crossed the border.
The embodiment of the invention provides a kind of method of memory management, and the executive agent of the method for this memory management can be the network equipment, subscriber terminal equipment etc.This method embodiment has described the Memory Allocation process in a kind of EMS memory management process, and is as shown in Figure 2, comprising:
201, receive the Memory Allocation request.
Wherein, comprise the memory size that request distributes in this Memory Allocation request.
202, when existing a continuous free memory to ask the memory size of distribution more than or equal to this in the internal memory, for this Memory Allocation request distributes first internal memory, the size of this first internal memory equals the memory size that this request distributes.
203, in the pointer space of this internal memory, preserve first pointer.
Wherein, this first internal memory of this first pointed.
204, distribute second pointer.
Wherein, this first pointer of this second pointed is used to visit this first internal memory.
The EMS memory management process that adopts the embodiment of the invention to provide; Through distributing second rank pointer; Make second pointer can visit first internal memory (committed memory) all the time, and then after being following memory scrubbing, still can provide the foundation through the committed memory of second pointer after move.
The present invention provides a kind of method of memory management; As shown in Figure 4, for narrating conveniently, below for being positioned at head of the queue in the pointer space that is used to store this first pointer; And should distribute under the situation of starting point and pointer space heteropleural; Describe the technical scheme that the embodiment of the invention provides, as shown in Figure 3, this method comprises:
301, receive the Memory Allocation request.
Wherein, comprise the memory size that request distributes in this Memory Allocation request.
302, judge free memory to be arranged whether more than or equal to the memory size of this request distribution; If judged result is then returned failure for not, finish; If judged result is for being then to carry out 303.
303, judge the memory size whether continuous free memory distributes less than this request; If judged result carries out 304 for not; If judged result is for being execution 305.
304, the memory size that distributes according to this request is given content to be stored with continuous free memory allocation of space, finishes.
305, obtain initial pointer;
Wherein, this initial pointed free memory nearest apart from the distribution starting point of internal memory.
306, obtain first pointer.
Wherein, The nearest committed memory of this first pointed distance this initial pointer, and the pointer space of storing this first pointer is positioned at head of the queue, accordingly; The distribution starting point of internal memory and pointer space heteropleural; Because the distribution starting point of internal memory always is positioned at head of the queue or tail of the queue, therefore, the distribution starting point of the internal memory in the embodiment of the invention and pointer space heteropleural are that the distribution starting point of internal memory is positioned at tail of the queue.
307, judge whether this first pointer points to the internal memory terminal point, if judged result then carries out 308 for not; If judged result is for being then to carry out 309.
Judge whether this first pointer points to the internal memory terminal point, is specially, if first pointer that gets access to less than the tail address of this pointer space, then judged result is for being; If first pointer that gets access to is more than or equal to the tail address of this pointer space, then judged result is for denying.
308, pin this committed memory; And move this content in committed memory to the distribution starting point of this internal memory, upgrade first pointer, this committed memory of release; Visit this committed memory through this first pointer of second pointed, repeat 305-307.
Move and put in order though carried out internal memory, program still can be passed through the correct access memory of second pointer.
Wherein, pin this content in the committed memory be in order to prevent that other programs are to the visit of this committed memory in the process that moves committed memory.
309, receive Memory Allocation request and carry out the Memory Allocation process or directly trigger the Memory Allocation process again.
The Memory Allocation process can just repeat no more at this with reference to the step 202 in the foregoing description to 204 particularly.
The technical scheme that adopts the embodiment of the invention to provide is when the memory size that free memory continuously distributes less than request, through second rank pointer is set; Second pointed, first pointer with accessed content in the program; And the internal memory of this content of first pointed storage after carrying out memory scrubbing, changes though store the memory headroom of this content like this; But second pointed remain first pointer; Thereby program still can correctly be visited this content, thereby has solved in the prior art behind the memory scrubbing problem that the routine access internal memory is made mistakes or crossed the border.
The embodiment of the invention provides a kind of device 40 of memory management, and this memory management device 40 is mainly used in the memory scrubbing process, and is as shown in Figure 4, comprises first acquiring unit 41, second acquisition unit 42 and arrangement unit 43;
This first acquiring unit 41 is used to obtain initial pointer, the distribution starting point of this initial pointed internal memory;
This second acquisition unit 42 is used to obtain first pointer, the nearest committed memory of this first pointed said distribution starting point of distance;
This puts unit 43 in order, is used for when this first pointer does not point to the internal memory terminal point, pinning this committed memory; And move this content in committed memory to the distribution starting point of this internal memory; Upgrade this first pointer, this committed memory of release is through this first pointer of second pointed.
Further, as shown in Figure 5, the device 40 of this memory management also comprises:
Addressed location 44 is used to visit this committed memory.
Further, as shown in Figure 6, the device 40 of this memory management also comprises:
First judging unit 45 is used to judge whether this first pointer points to the internal memory terminal point.
The embodiment of the invention provides a kind of device of memory management; Through second rank pointer is set, with second pointed, first pointer of accessed content in the program, and the internal memory of this content of first pointed storage; Like this after carrying out memory scrubbing; Change though store the memory headroom of this content, second pointed remain first pointer, thereby program still can correctly be visited this content; Thereby solved in the prior art behind the memory scrubbing problem that the routine access internal memory is made mistakes or crossed the border.
The embodiment of the invention provides a kind of device 50 of memory management, and this memory management device 50 is mainly used in the Memory Allocation process, and is as shown in Figure 7, comprising:
Receiving element 51 is used to receive the Memory Allocation request, comprises the memory size that request distributes in this Memory Allocation request;
Further, as shown in Figure 8, also comprise:
Second judging unit 54 is used for the memory size of judging whether this internal memory exists a continuous free memory to distribute more than or equal to this request.
The embodiment of the invention provides a kind of device of memory management; The memory management device that adopts the embodiment of the invention to provide; Through distributing second rank pointer; Make second pointer can visit first internal memory (committed memory) all the time, and then after being following memory scrubbing, still can provide the foundation through the committed memory of second pointer after move.
The above; Be merely embodiment of the present invention, but protection scope of the present invention is not limited thereto, any technician who is familiar with the present technique field is in the technical scope that the present invention discloses; Can expect easily changing or replacement, all should be encompassed within protection scope of the present invention.Therefore, protection scope of the present invention should be as the criterion with the protection domain of said claim.
Claims (12)
1. the method for a memory management is characterized in that, comprising:
Obtain initial pointer, the free memory that said initial pointed is nearest apart from the distribution starting point of internal memory;
Obtain first pointer, the nearest committed memory of the said first pointed said initial pointer of distance;
When said first pointer does not point to the internal memory terminal point; Pin said committed memory; And move the content in the said committed memory to the distribution starting point of said internal memory, upgrade said first pointer, the said committed memory of release; Through said first pointer of second pointed, said second pointer is used to visit said committed memory.
2. method according to claim 1 is characterized in that, before obtaining initial pointer, said method also comprises:
Receive the Memory Allocation request, comprise the memory size that request distributes in the said Memory Allocation request.
3. method according to claim 1 and 2 is characterized in that,
Said first pointer is stored in the pointer space of said internal memory;
Said pointer space is positioned at the head or the afterbody of said memory queue.
4. method according to claim 3 is characterized in that, also comprises: when the distribution starting point of said internal memory and said pointer space homonymy, saidly judge that whether said first pointer points to the internal memory terminal point, is specially:
If can get access to first pointer, then said judged result is for denying;
If can not get access to first pointer, then said judged result is for being.
5. method according to claim 3; It is characterized in that, also comprise: when said pointer space is positioned at the head of said memory queue, and when described distribution starting point and said pointer space heteropleural; Saidly judge that whether said first pointer points to the internal memory terminal point, is specially:
If first pointer that gets access to is less than the tail address of said pointer space, then said judged result is for being;
If first pointer that gets access to is more than or equal to the tail address of said pointer space, then said judged result is for denying.
6. method according to claim 3; It is characterized in that, also comprise: when said pointer space is positioned at the afterbody of said memory queue, and when described distribution starting point and said pointer space heteropleural; Saidly judge that whether said first pointer points to the internal memory terminal point, is specially:
If first pointer that gets access to is greater than the first address of said pointer space, then said judged result is for being;
If first pointer that gets access to is smaller or equal to the first address of said pointer space, then said judged result is for denying.
7. the method for a memory management is characterized in that, comprising:
Receive the Memory Allocation request, comprise the memory size that request distributes in the said Memory Allocation request;
When the memory size that exists a continuous free memory to distribute more than or equal to described request in the internal memory, in said internal memory, distribute first internal memory for said Memory Allocation request, the size of said first internal memory equals the memory size of described request distribution;
In the pointer space of said internal memory, preserve first pointer, said first internal memory of said first pointed;
Distribute second pointer, described first pointer of said second pointed is used to visit said first internal memory.
8. the device of a memory management is characterized in that, comprising: first acquiring unit, second acquisition unit and arrangement unit;
Said first acquiring unit is used to obtain initial pointer, the distribution starting point of said initial pointed internal memory;
Said second acquisition unit is used to obtain first pointer, the nearest committed memory of the said first pointed said distribution starting point of distance;
Said arrangement unit; Be used for when said first pointer does not point to the internal memory terminal point; Pin said committed memory, and move the content in the said committed memory, upgrade said first pointer to the distribution starting point of said internal memory; The said committed memory of release is through said first pointer of second pointed.
9. device according to claim 8 is characterized in that, also comprises:
Addressed location is used for through the said committed memory of second pointer.
10. according to Claim 8 or 9 described devices, it is characterized in that, also comprise:
First judging unit is used to judge whether said first pointer points to the internal memory terminal point.
11. the device of a memory management is characterized in that, comprising:
Receiving element is used to receive the Memory Allocation request, comprises the memory size that request distributes in the said Memory Allocation request;
First allocation units are used for distributing first internal memory at said internal memory for said Memory Allocation request, and the size of said first internal memory equals the memory size that described request is distributed, and in the pointer space of said internal memory, preserve the pointer that points to said first internal memory;
Second allocation units are used to distribute second pointer, and described first pointer of said second pointed is used to visit said first internal memory.
12. device according to claim 11 is characterized in that, said device also comprises:
Second judging unit is used for the memory size of judging whether said internal memory exists a continuous free memory to distribute more than or equal to described request.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011103848042A CN102521139A (en) | 2011-11-28 | 2011-11-28 | Method and device for internal memory management |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2011103848042A CN102521139A (en) | 2011-11-28 | 2011-11-28 | Method and device for internal memory management |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102521139A true CN102521139A (en) | 2012-06-27 |
Family
ID=46292069
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2011103848042A Pending CN102521139A (en) | 2011-11-28 | 2011-11-28 | Method and device for internal memory management |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102521139A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103455433A (en) * | 2013-08-19 | 2013-12-18 | 曙光信息产业股份有限公司 | Memory management method and system |
| CN107506237A (en) * | 2017-07-07 | 2017-12-22 | 杭州联吉技术有限公司 | A kind of web camera and its memory scrubbing method and apparatus |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5555405A (en) * | 1993-07-06 | 1996-09-10 | Digital Equipment Corporation | Method and apparatus for free space management in a forwarding database having forwarding entry sets and multiple free space segment queues |
| CN101320351A (en) * | 2008-06-27 | 2008-12-10 | 华中科技大学 | Internal memory distribution, cleaning and releasing method, and internal memory management apparatus |
-
2011
- 2011-11-28 CN CN2011103848042A patent/CN102521139A/en active Pending
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5555405A (en) * | 1993-07-06 | 1996-09-10 | Digital Equipment Corporation | Method and apparatus for free space management in a forwarding database having forwarding entry sets and multiple free space segment queues |
| CN101320351A (en) * | 2008-06-27 | 2008-12-10 | 华中科技大学 | Internal memory distribution, cleaning and releasing method, and internal memory management apparatus |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103455433A (en) * | 2013-08-19 | 2013-12-18 | 曙光信息产业股份有限公司 | Memory management method and system |
| CN103455433B (en) * | 2013-08-19 | 2016-08-10 | 曙光信息产业股份有限公司 | EMS memory management process and system |
| CN107506237A (en) * | 2017-07-07 | 2017-12-22 | 杭州联吉技术有限公司 | A kind of web camera and its memory scrubbing method and apparatus |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106815251B (en) | Distributed data base system, data bank access method and device | |
| CN102819497B (en) | A kind of memory allocation method, Apparatus and system | |
| CN103049334B (en) | A kind of method of task process and virtual machine | |
| CN101859279B (en) | Memory allocation and release method and device | |
| CN106020967B (en) | A kind of automatic expansion method of hybrid cloud resource | |
| CN106445835B (en) | Memory allocation method and device | |
| CN103425538A (en) | Process communication method and process communication system | |
| CN103383660A (en) | Method and device for realizing functions of cache partition of Android system as well as terminal equipment | |
| CN106527963A (en) | Memory system and host apparatus | |
| DE102018123669A1 (en) | Host computer arrangement, remote server arrangement, storage system and method thereof | |
| CN102279808A (en) | Method and device for managing video memory of embedded equipment | |
| WO2013112124A1 (en) | Managing addressable memory in heterogeneous multicore processors | |
| CN105718319B (en) | A kind of memory pool domain analytic method and memory pool device | |
| CN104199729B (en) | A kind of method for managing resource and system | |
| CN103218305A (en) | Distribution method of memory space | |
| CN102521139A (en) | Method and device for internal memory management | |
| DE112016005868T5 (en) | Start application processors of a virtual machine | |
| CN103365926A (en) | Method and device for storing snapshot in file system | |
| CN101783814A (en) | Metadata storing method for mass storage system | |
| CN105103138B (en) | In-line memory Managed Solution for applying in real time | |
| CN105528304B (en) | Internal memory pool managing method | |
| CN106155910A (en) | A kind of methods, devices and systems realizing internal storage access | |
| CN109800089A (en) | A kind of buffer resource distribution method, module and electronic equipment | |
| CN105512091A (en) | Memory allocation method and device | |
| CN103617125A (en) | Method and device for managing memory space |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20120627 |